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,742 papers · 148 categories

Trend · papers per month

15304459 · Jun 202019922001200920172026
48 results for painting effort

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.

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 ↗

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 ↗

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.

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.

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 ↗

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.

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 ↗

The paper proposes a method to measure fairness through equality of effort using algorithmic recourse.

problem Measuring fairness through equality of effort in automated systems.
method Applying algorithmic recourse to quantify equality of effort, overcoming previous limitations.
result An algorithm for assessing equality of effort has been developed and validated.

Accurate annotation of medical image is the crucial step for image AI clinical application. However, annotating medical image will incur a great deal of annotation effort and expense due to its high complexity and needing experienced doctors. To alleviate annotation cost, some active learning methods are proposed. But …

2019-01-06abs ↗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 ↗

Replication study shows Deep-SE still not as effective as previously thought for agile effort estimation.

problem Improving accuracy in estimating agile software development effort.
method Close replication of Deep-SE using additional data and comparison with multiple baselines.
result Deep-SE outperforms only a few cases, suggesting more work is needed.

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.

Adaptive Bernstein copulas improve risk management by preventing overfitting and reducing simulation effort.

problem Overfitting and high simulation effort in estimating dependence models.
method Constructive approach to Bernstein copulas with an admissible discrete skeleton.
result Comparison of different copula approaches in risk management shows improved accuracy and efficiency.

Algorithms are often used to produce decision-making rules that classify or evaluate individuals. When these individuals have incentives to be classified a certain way, they may behave strategically to influence their outcomes. We develop a model for how strategic agents can invest effort in order to change the outcome…

2018-07-13abs ↗pdf ↗

Optimal contracts are found for agents with quadratic effort costs.

problem Finding optimal contracts in principal-agent problems with quadratic effort costs.
method Modeling the problem using Hamilton-Jacobi-Bellman (HJB) equations and proving the existence of classical solutions.
result Existence of optimal contracts for agents with quadratic effort costs is proven.

Software development effort estimation is considered a fundamental task for software development life cycle as well as for managing project cost, time and quality. Therefore, accurate estimation is a substantial factor in projects success and reducing the risks. In recent years, software effort estimation has received …

2019-01-08abs ↗pdf ↗

We put together some of the efforts by several people of making aspects of fibre bundle theory into algebra. The initiator of these efforts was Charles Ehresmann, who put the notion of groupoid and groupoid action in the focus of fibre bundle theory in general, and in connection theory in particular.

2000-05-12abs ↗pdf ↗

We study investment strategy in different models of financial markets, where the investors cannot reach a perfect knowledge about available assets. The investor spends a certain effort to get information; this allows him to better choose the investment strategy, and puts a selective pressure upon assets. The best strat…

1999-12-17abs ↗pdf ↗