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

63126189252 · Jun 202019922001200920172026
48 results for image colorization

The ability to characterize the color content of natural imagery is an important application of image processing. The pixel by pixel coloring of images may be viewed naturally as points in color space, and the inherent structure and distribution of these points affords a quantization, through clustering, of the color i…

2012-02-20abs ↗pdf ↗

Develops new methods to create imperceptible image changes that fool classifiers.

problem Improving the robustness of image classifiers by creating subtle changes undetectable to humans.
method Two methods: Edge-Aware and Color-Aware, designed to reduce detectability of image perturbations.
result Demonstrated that the new methods effectively cause misclassification and are computationally efficient.

Recent progress on many imaging and vision tasks has been driven by the use of deep feed-forward neural networks, which are trained by propagating gradients of a loss defined on the final output, back through the network up to the first layer that operates directly on the image. We propose back-propagating one step fur…

2016-05-23abs ↗pdf ↗

Spectral images captured by satellites and radio-telescopes are analyzed to obtain information about geological compositions distributions, distant asters as well as undersea terrain. Spectral images usually contain tens to hundreds of continuous narrow spectral bands and are widely used in various fields. But the vast…

2018-02-07abs ↗pdf ↗

The main idea of this paper is to explore the possibilities of generating samples from the neural networks, mostly focusing on the colorization of the grey-scale images. I will compare the existing methods for colorization and explore the possibilities of using new generative modeling to the task of colorization. The c…

2018-12-27abs ↗pdf ↗

Adversarial perturbations are more effective in Y-channel of YCbCr color space.

problem Vulnerability of deep models to adversarial perturbations in images.
method Proposed ResUpNet defense that removes perturbations only from the Y-channel of YCbCr color space.
result ResUpNet achieves the best balance between defense and maintaining original image accuracy.

Aicardi's invariant F(L)F(L) is extended to colored singular links using graphical calculus.

problem Constructing an invariant for colored classical and singular links.
method State-sum model using graphical calculus for oriented, colored, 4-valent planar graphs.
result Extends F(L)F(L) to colored singular links, showing it's stronger than HOMFLY-PT polynomial.

Explains a 2D color exchange invariant correspondence to 3D linking numbers.

problem Understanding color exchange invariants in 2D dynamics and their 3D geometric interpretation.
method Visualizes invariants as linking of lines on a special surface with Arf-Kervaire invariant one, and interprets it as an obstruction to continuous transformation.
result Interprets a 2D color exchange invariant as a 3D linking number, providing a topological explanation.

We present a set of 26 finite quandles that distinguish (up to reversal and mirror image) by number of colorings, all of the 2977 prime oriented knots with up to 12 crossings. We also show that 1058 of these knots can be distinguished from their mirror images by the number of colorings by quandles from a certain set of…

2013-12-11abs ↗pdf ↗

Paper proposes a new Wasserstein distance for mixtures of radially contoured distributions.

problem Generalization of Wasserstein distance to non-elliptically contoured distributions.
method Relaxed formulation for mixtures of radially contoured distributions without marginal consistency.
result The new distance yields more stable error and better color distribution in image transfer tasks.

(ABRIDGED) In previous work, two platforms have been developed for testing computer-vision algorithms for robotic planetary exploration (McGuire et al. 2004b,2005; Bartolo et al. 2007). The wearable-computer platform has been tested at geological and astrobiological field sites in Spain (Rivas Vaciamadrid and Riba de S…

2009-10-28abs ↗pdf ↗

In this paper, we consider biquandle colorings for knotoids in R2\mathbb{R}^2 or S2S^2 and we construct several coloring invariants for knotoids derived as enhancements of the biquandle counting invariant. We first enhance the biquandle counting invariant by using a matrix constructed by utilizing the orientation a kno…

2018-03-30abs ↗pdf ↗

We extend the notion of link colorings with values in an Alexander quandle to link colorings with values in a module MM over the Laurent polynomial ring Λμ=Z[t1±1,,tμ±1]Λ_μ=\mathbb{Z}[t_1^{\pm1},\dots,t_μ^{\pm1}]. If DD is a diagram of a link LL with μμ components, then the colorings of DD with values in MM form a ΛμΛ_μ-module…

2018-05-06abs ↗pdf ↗

Improved image recovery with minimal data using untrained neural networks.

problem Solving inverse problems with limited data.
method Pre-training neural networks with a small number of examples to improve performance.
result Performance increases as data increases, matching generative models with less than 1% of training data.

New techniques save bits in image compression with upsampling.

problem Lack of context dependence in current image compression methods with upsampling.
method Simple, inexpensive techniques exploiting context to predict Laplace distribution parameters.
result Average savings of 0.645 bits per difference, up to 1.489 bits.

Efficiently clusters data with weak assumptions, robust to contamination.

problem General-shaped clustering under weak parametric assumptions with data contamination.
method Two-step hybrid robust clustering algorithm combining trimmed k-means and hierarchical agglomeration.
result Outperforms state-of-the-art methods in various applications.

A novel approach for augmenting histopathological images by blending Gaussian-Laplacian pyramids.

problem Data imbalance and inter-patient variability in histopathological images.
method Image blending using Gaussian-Laplacian pyramids to distribute inter-patient variability.
result Promising gains in performance compared to existing data augmentation techniques.

Congealing is a flexible nonparametric data-driven framework for the joint alignment of data. It has been successfully applied to the joint alignment of binary images of digits, binary images of object silhouettes, grayscale MRI images, color images of cars and faces, and 3D brain volumes. This research enhances congea…

2019-02-02abs ↗pdf ↗

In this paper we introduce a new invariant of virtual knots and links that is non-trivial for infinitely many virtuals, but is trivial on classical knots and links. The invariant is initially be expressed in terms of a relative of the bracket polynomial and then extracted from this polynomial in terms of its exponents,…

2004-05-04abs ↗pdf ↗

Motivated by the human way of memorizing images we introduce their functional representation, where an image is represented by a neural network. For this purpose, we construct a hypernetwork which takes an image and returns weights to the target network, which maps point from the plane (representing positions of the pi…

2019-02-27abs ↗pdf ↗

Adversarial learning improves image augmentation for neural networks.

problem Improving data augmentation for neural networks with limited data.
method Adversarial learning using an encoder-decoder architecture with a spatial transformer network.
result Our approach outperforms previous generative data augmentation methods.

V1 cortex reconstructs images as Poisson equation solutions with varying weights.

problem Reconstructing images from V1 cortical cell receptive profiles.
method Solves a heterogeneous Poisson equation with varying weights representing neural connectivity.
result Reconstructions converge to homogeneous solutions using homogenization techniques.

We focus on two supervised visual reasoning tasks whose labels encode a semantic relational rule between two or more objects in an image: the MNIST Parity task and the colorized Pentomino task. The objects in the images undergo random translation, scaling, rotation and coloring transformations. Thus these tasks involve…

2018-06-18abs ↗pdf ↗

A geometric account explains why 'The Dress' is ambiguous, predicting observable signatures in image processing.

problem Understanding and predicting ambiguity in image processing, particularly in intrinsic image decomposition.
method Geometric analysis of intrinsic image decomposition, focusing on the discontinuous switch in prior-mode sections.
result Predicted signatures in albedo Jacobian and Fernet curvature can be observed in various models and datasets.

We build a collaborative filtering recommender system to restore images with impulse noise for which the noisy pixels have been previously identified. We define this recommender system in terms of a new color image representation using three matrices that depend on the noise-free pixels of the image to restore, and two…

2017-02-24abs ↗pdf ↗

When training a deep neural network for image classification, one can broadly distinguish between two types of latent features of images that will drive the classification. We can divide latent features into (i) "core" or "conditionally invariant" features XcoreX^\text{core} whose distribution XcoreYX^\text{core}\vert Y, cond…

2017-10-31abs ↗pdf ↗