Intelli-Paint improves painting efficiency and naturalness.
problem Artwork generation is time-consuming and requires high proficiency.
method Intelli-Paint uses a progressive layering and sequential brushstroke guidance strategy.
result The approach reduces brushstrokes by ~60-80% without compromising quality.
Generative models create paintings that match training data.
problem Creating realistic paintings using machine learning.
method Used Spectral Normalization GAN (SN-GAN) and SN-GAN with Gradient Penalty to generate paintings.
result SN-GAN produced paintings most comparable to the training dataset.
Computer graphics techniques improve art pricing by measuring painting effort.
problem Traditional art pricing models lack measures for conceptual and painting efforts.
method Applied image recognition to measure line and color variances as proxies for effort.
result Painting effort (line and color variances) significantly positively correlates with sales price.
Generates garden paintings from text descriptions using deep learning.
problem Lack of firsthand material for traditional Chinese garden reconstruction.
method Deep learning model trained on text and paintings of Ming Dynasty gardens.
result Model generates garden paintings in Ming Dynasty style based on textual descriptions.
This paper introduces a novel approach to in-painting where the identity of the object to remove or change is preserved and accounted for at inference time: Exemplar GANs (ExGANs). ExGANs are a type of conditional GAN that utilize exemplar information to produce high-quality, personalized in painting results. We propos…
This paper creates a tagging system for paintings using historical descriptions.
problem Tagging accuracy for paintings over time with varying expert descriptions.
method A neural network with frequent itemsets as tags, followed by clustering.
result Improved tagging accuracy for paintings over time.
Neural painters learn to generate brushstrokes from a non-deterministic painting program.
problem Training an agent to generate realistic brushstrokes from a non-differentiable painting program.
method A differentiable neural painter model trained on brushstrokes, optimizing for human-like strokes and intrinsic style transfer.
result Direct optimization of brushstrokes can visualize ImageNet categories and generate ideal paintings.
This paper measures the information quantity in paintings using entropy.
problem Traditional art pricing models lack variables capturing painting content.
method Extends Shannon entropy to measure painting information using pixel-level variances of line, color, value, shape/form, and space.
result Variance measurements significantly explain sales prices, improving traditional models.
CGANs forecast art movements by generating sequences of paintings.
problem Predicting the evolution of art movements over time.
method Trained CGANs on sequences of paintings, using VAR models for forecasting.
result CGANs accurately predict future art movements and generate plausible paintings.
Agents learn to draw with human-like abstraction and realism.
problem Training generative models to produce realistic images without supervision.
method Reinforcement learning agents in a simulated painting environment, trained with a discriminator network.
result Generative agents can produce images with visual abstraction and realism.
Oriental ink painting, called Sumi-e, is one of the most appealing painting styles that has attracted artists around the world. Major challenges in computer-based Sumi-e simulation are to abstract complex scene information and draw smooth and natural brush strokes. To automatically find such strokes, we propose to mode…
In this paper, computer-based techniques for stylistic analysis of paintings are applied to the five panels of the 14th century Peruzzi Altarpiece by Giotto di Bondone. Features are extracted by combining a dual-tree complex wavelet transform with a hidden Markov tree (HMT) model. Hierarchical clustering is used to ide…
Kähler complexity one Hamiltonian T-manifolds have trivial paintings.
problem Understanding the structure of Kähler complexity one Hamiltonian T-manifolds.
method Proving the existence of a trivial painting for compact, connected Kähler complexity one Hamiltonian T-manifolds.
result Every compact, connected Kähler complexity one Hamiltonian T-manifold has a trivial painting.
New method uses SVD entropy to price artworks.
problem Lack of fine measurements in traditional art pricing models.
method SVD entropy of painting images for content measurement.
result SVD entropy positively affects sales price at 1% significance level.
The artistic style of a painting is a subtle aesthetic judgment used by art historians for grouping and classifying artwork. The recently introduced `neural-style' algorithm substantially succeeds in merging the perceived artistic style of one image or set of images with the perceived content of another. In light of th…
PointPainting fuses lidar and image data for better 3D object detection.
problem Lidar-only methods outperform fusion methods on 3D object detection benchmarks.
method Sequential fusion by projecting lidar points into image segmentation output and appending class scores.
result Significant improvements on state-of-the-art 3D object detection methods on KITTI and nuScenes datasets.
Notwithstanding almost forty years of efforts, the market for paintings still lacks a widely accepted price index. In this paper, we introduce a simple and intuitive metric to construct such index. Our metric is based on the price of a painting divided by its area. This formulation rests on a solid mathematical foundat…
New method for conditional sampling using M-GANs, likely-free inference.
problem Conditional sampling of probability measures.
method Developed a novel computational approach called M-GANs based on block triangular transport.
result Accurate sampling of conditional measures in various applications.
In this paper we describe the problem of painter classification, and propose a novel approach based on deep convolutional autoencoder neural networks. While previous approaches relied on image processing and manual feature extraction from paintings, our approach operates on the raw pixel level, without any preprocessin…
This paper introduces a new financial metric for the art market. The metric is based on the price per unit of area and is applicable to two-dimensional art objects such as paintings.
Unified mathematical framework for non-compact symmetric spaces with negative curvature.
problem Understanding and organizing non-compact symmetric spaces with negative curvature.
method Unified mathematical framework, including explicit distance functions and universality classes.
result Unified classification of non-compact symmetric spaces with non-compact rank r<5.
We consider triangulations of surfaces with edges painted three colors so that edges of each triangle have different colors. Such structures arise as Belyi data (or Grothendieck dessins d'enfant), on the other hand they enumerate pairs of permutations determined up to a common conjugation. The topic of these notes is l…
Improved image synthesis with user scribbles and text prompts.
problem Inadequate details in generated images due to domain shift.
method Optimization problem formulation and cross-attention for control.
result Significant improvement in user satisfaction (85.32% higher).
This paper introduces a new approach for the automated reconstruction - reassembly of fragmented objects having one surface near to plane, on the basis of the 3D representation of their constituent fragments. The whole process starts by 3D scanning of the available fragments. The obtained representations are properly p…
Study CR manifolds focusing on Levi and contact-nondegeneracy.
problem Investigate CR algebras and their properties.
method Locally homogeneous case analysis, cross-marked painted root diagrams.
result Establish correspondences with CR-algebra properties and combinatorics.
Bayesian image reconstruction using pre-trained generative models.
problem Distribution shifts and latent variable changes in image data.
method Combining SOTA generative models with Bayes' theorem for image restoration tasks.
result Competitive performance on super-resolution and in-painting tasks without training.
In this work, we present an application of Locally Interpretable Machine-Agnostic Explanations to 2-D chemical structures. Using this framework we are able to provide a structural interpretation for an existing black-box model for classifying biologically produced fuel compounds with regard to Research Octane Number. T…
End-to-end autonomous driving models are vulnerable to simple physical manipulations of images.
problem Vulnerability of end-to-end autonomous driving models to subtle adversarial manipulations of images.
method Developed novel end-to-end attacks using simple physical manipulations (painting black lines on the road) and used Bayesian Optimization to efficiently search for successful attacks.
result Simple physical manipulations can cause autonomous driving models to follow unintended paths, highlighting the vulnerability of these models.
Paper tackles artist style transfer using quadratic potential.
problem Applying a specific artist's style to real-world photographs.
method Adversarial training with quadratic potential divergence and integration of deep learning techniques.
result Demonstrates improved quality of artist stylized images.
AugurOne trains single image generators without GANs using image warps.
problem Training end-to-end single image generators without GANs.
method Non-affine augmentations of single input images for training an upscaling neural network.
result End-to-end training yields state-of-the-art performance on conditional generation tasks.
Study improves posterior inference in neural processes with limited data.
problem Improving posterior predictive inference in probabilistic models with scarce conditioning data.
method Examined effects of pooling operators and variational families on posterior quality in neural processes.
result Novel neural process architectures lead to superior posterior predictive samples in image completion/in-painting tasks.
Transflow Learning transforms pre-trained models without retraining.
problem Transforming pre-trained models without retraining.
method Bayesian inference to warp latent vector probability distribution.
result Transforms model outputs to resemble new data without training.
Survey of ART neural networks for engineering applications.
problem Understanding and utilizing ART neural networks for various machine learning tasks.
method Comprehensive review of classic and modern ART models, describing learning dynamics and engineering properties.
result Compilation of ART models and their properties for engineering applications.
Parametric generative deep models are state-of-the-art for photo and non-photo realistic image stylization. However, learning complicated image representations requires compute-intense models parametrized by a huge number of weights, which in turn requires large datasets to make learning successful. Non-parametric exem…
This work introduces a new method for coupling base and target densities in generative models.
problem Generating samples from complex target distributions using simple base distributions.
method Developed a framework of stochastic interpolants with data-dependent couplings.
result Constructing dynamical transport maps that serve as conditional generative models.
Highly expressive models such as deep neural networks (DNNs) have been widely applied to various applications. However, recent studies show that DNNs are vulnerable to adversarial examples, which are carefully crafted inputs aiming to mislead the predictions. Currently, the majority of these studies have focused on per…
Sparse coding has shown its power as an effective data representation method. However, up to now, all the sparse coding approaches are limited within the single domain learning problem. In this paper, we extend the sparse coding to cross domain learning problem, which tries to learn from a source domain to a target dom…
Advances in Deep Reinforcement Learning have led to agents that perform well across a variety of sensory-motor domains. In this work, we study the setting in which an agent must learn to generate programs for diverse scenes conditioned on a given symbolic instruction. Final goals are specified to our agent via images o…
Geometrically connects Laplace eigenfunctions to Borel-Weil theory on symmetric spaces.
problem Understanding the spectral properties of Laplace-Beltrami operators on Riemannian symmetric spaces.
method Using symplectic geometry and geometric quantization, associating flag manifolds to symmetric spaces and relating their Satake diagrams.
result Harmonic polynomials on flag manifolds induce all eigenfunctions on symmetric spaces.
DPI quantifies phase differences in 1D and multidimensional signals using Riesz transform.
problem Quantifying phase differences in signals of varying dimensions.
method Riesz transform framework for harmonic analysis.
result DPI detects hypersynchronization and subtle changes in images and artworks.
In this paper, we introduce an unsupervised learning approach to automatically discover, summarize, and manipulate artistic styles from large collections of paintings. Our method is based on archetypal analysis, which is an unsupervised learning technique akin to sparse coding with a geometric interpretation. When appl…
Deep models predict gas properties from dark matter to aid cosmological simulations.
problem Computational challenges in running hydrodynamical simulations for large-scale structure and baryonic probes.
method Trained variational auto-encoders and generative adversarial networks on BAHAMAS hydrodynamical simulation data to map matter density to gas pressure.
result Generated tSZ maps are statistically consistent with those from BAHAMAS, enabling SLICS for tSZ covariance estimation.
Generative diffusion models improve financial LOB simulation and forecasting.
problem High noise and complexity in financial LOB data makes deep generative models ineffective.
method Convert LOB data to images, apply diffusion models with inpainting for long-term sequence generation.
result Our method achieves state-of-the-art performance on LOB-Bench, improving coherence over local details.
We explore the problem of learning to decompose spatial tasks into segments, as exemplified by the problem of a painting robot covering a large object. Inspired by the ability of classical decision tree algorithms to construct structured partitions of their input spaces, we formulate the problem of decomposing objects …
Generative adversarial networks transform streetscape images to improve health and wellbeing.
problem Improving health and wellbeing outcomes through better streetscape design.
method Generative adversarial networks were used to translate Google Street View images, preserving structure while changing the style from bad health to good health areas.
result Translated images show that good health areas have more green space and compact urban design, while good social capital areas have more footpaths and less fencing.
This paper refines understanding of decentralized learning by considering graph topology.
problem Current theory fails to predict performance in decentralized learning settings.
method Quantifies how graph topology influences convergence in decentralized learning.
result Graph topology significantly impacts convergence in decentralized learning, contrary to spectral gap theory.
NeuroPaint infers missing brain area dynamics from multi-animal datasets.
problem Leveraging multi-animal datasets to understand interactions between brain areas.
method Masked autoencoding approach trained across animals with partial observations.
result Models can successfully reconstruct dynamics of unrecorded brain areas.
Let M be a cohomogeneity one manifold of a compact semisimple Lie group G with one singular orbit S0=G/H. Then M is G- diffeomorphic to the total space G×HV of the homogeneous vector bundle over S0 defined by a sphere transitive representation of G in a vector space V. We describe all such…