Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

1223 · Nov 201619922001200920172026
48 results for painting

This paper makes the first attempt to introduce the tools from computer graphics into the art pricing research. We argue that the creation of a painting calls for a combination of conceptual effort and painting effort from the artist. However, as the important price determinants, both efforts are long missing in the tr…

2019-10-09abs ↗pdf ↗

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…

2017-12-11abs ↗pdf ↗

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.

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.

We examined the use of modern Generative Adversarial Nets to generate novel images of oil paintings using the Painter By Numbers dataset. We implemented Spectral Normalization GAN (SN-GAN) and Spectral Normalization GAN with Gradient Penalty, and compared their outputs to a Deep Convolutional GAN. Visually, and quantit…

2019-03-06abs ↗pdf ↗

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.

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…

2014-01-26abs ↗pdf ↗

We investigate using reinforcement learning agents as generative models of images (extending arXiv:1804.01118). A generative agent controls a simulated painting environment, and is trained with rewards provided by a discriminator network simultaneously trained to assess the realism of the agent's samples, either uncond…

2019-10-02abs ↗pdf ↗

Camera and lidar are important sensor modalities for robotics in general and self-driving cars in particular. The sensors provide complementary information offering an opportunity for tight sensor-fusion. Surprisingly, lidar-only methods outperform fusion methods on the main benchmark datasets, suggesting a gap in the …

2019-11-22abs ↗pdf ↗

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…

2014-04-21abs ↗pdf ↗

Conditional Generative Adversarial Networks~(CGAN) are a recent and popular method for generating samples from a probability distribution conditioned on latent information. The latent information often comes in the form of a discrete label from a small set. We propose a novel method for training CGANs which allows us t…

2019-06-21abs ↗pdf ↗

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.

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.

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…

2017-10-31abs ↗pdf ↗

In this paper we address the problem of artist style transfer where the painting style of a given artist is applied on a real world photograph. We train our neural networks in adversarial setting via recently introduced quadratic potential divergence for stable learning process. To further improve the quality of genera…

2019-02-14abs ↗pdf ↗

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…

2013-11-27abs ↗pdf ↗

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…

2018-05-28abs ↗pdf ↗

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.

It is well known that deep generative models have a rich latent space, and that it is possible to smoothly manipulate their outputs by traversing this latent space. Recently, architectures have emerged that allow for more complex manipulations, such as making an image look as though it were from a different class, or p…

2019-11-29abs ↗pdf ↗

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.

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…

2018-10-11abs ↗pdf ↗

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.

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.

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.

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.