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

123246369492 · Jun 202019922001200920172026
48 results for pixel space

Pixel-space diffusion models outperform latent models on high-resolution image synthesis.

problem Efficiency and quality trade-off in high-resolution image synthesis.
method Sigmoid loss-weighting, simplified architecture, and resolution scaling.
result Achieved 1.5 FID on ImageNet512, new SOTA results on other datasets.

Data-efficient learning in continuous state-action spaces using very high-dimensional observations remains a key challenge in developing fully autonomous systems. In this paper, we consider one instance of this challenge, the pixels to torques problem, where an agent must learn a closed-loop control policy from pixel i…

2015-02-08abs ↗pdf ↗

Adversarial attacks aim to confound machine learning systems, while remaining virtually imperceptible to humans. Attacks on image classification systems are typically gauged in terms of pp-norm distortions in the pixel feature space. We perform a behavioral study, demonstrating that the pixel pp-norm for any $0\le p …

2019-06-06abs ↗pdf ↗

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 ↗

A new method generates natural-looking adversarial examples by bounding internal activation values.

problem Creating natural-looking adversarial examples that closely mimic the original input.
method Bounding internal activation values through a distribution quantile bound and polynomial barrier loss function.
result Our attack achieves similar success and confidence levels as state-of-the-art methods but with more natural-looking perturbations.

Any subset of the plane can be approximated by a set of square pixels. This transition from a shape to its pixelation is rather brutal since it destroys geometric and topological information about the shape. Using a technique inspired by Morse Theory, we algorithmically produce a PL approximation of the original shape …

2011-05-13abs ↗pdf ↗

We develop a method for user-controllable semantic image inpainting: Given an arbitrary set of observed pixels, the unobserved pixels can be imputed in a user-controllable range of possibilities, each of which is semantically coherent and locally consistent with the observed pixels. We achieve this using a deep generat…

2018-06-15abs ↗pdf ↗

Method generates joint posterior samples of source and foreground mass distributions for gravitational lensing.

problem Challenging inference problem for high-resolution, high signal-to-noise ratio gravitational lensing.
method Combines diffusion-based generative modeling and recurrent inference machines.
result Can model realistic gravitational lensing simulations down to the noise level.

Herein, we present a system for hyperspectral image segmentation that utilizes multiple class--based denoising autoencoders which are efficiently trained. Moreover, we present a novel hyperspectral data augmentation method for labelled HSI data using linear mixtures of pixels from each class, which helps the system wit…

2018-07-11abs ↗pdf ↗

Semantic inpainting is the task of inferring missing pixels in an image given surrounding pixels and high level image semantics. Most semantic inpainting algorithms are deterministic: given an image with missing regions, a single inpainted image is generated. However, there are often several plausible inpaintings for a…

2018-10-08abs ↗pdf ↗

Evolutionary algorithm finds optimal pixel perturbations to improve neural network generalization.

problem Minimal data corruption by pixel modifications causes overfitting in neural networks.
method Evolutionary algorithm with a novel cost function to maximize generalization gap and domain divergence.
result Method outperforms previous pixel-based data distribution shift methods on CNNs.

DEceit constructs effective universal pixel-restricted perturbations for deep image classifiers.

problem Creating effective universal pixel-restricted perturbations for deep neural networks.
method DEceit algorithm for black-box feedback, targeting 10% of pixels in images.
result Perturbing only 10% of pixels achieves high Fooling Rate and visual similarity.

SRTC model for background/foreground separation with missing pixels.

problem Background/foreground separation with missing pixels in videos.
method Smooth robust tensor completion (SRTC) model with tensor proximal alternating minimization (tenPAM).
result Global convergence guarantee for the proposed algorithm.

Generative Adversarial Networks (GANs) have obtained extraordinary success in the generation of realistic images, a domain where a lower pixel-level accuracy is acceptable. We study the problem, not yet tackled in the literature, of generating semantic images starting from a prior distribution. Intuitively this problem…

2019-06-27abs ↗pdf ↗

Learning-based methods for visual segmentation have made progress on particular types of segmentation tasks, but are limited by the necessary supervision, the narrow definitions of fixed tasks, and the lack of control during inference for correcting errors. To remedy the rigidity and annotation burden of standard appro…

2018-05-25abs ↗pdf ↗

With the aim of creating virtual cloth deformations more similar to real world clothing, we propose a new computational framework that recasts three dimensional cloth deformation as an RGB image in a two dimensional pattern space. Then a three dimensional animation of cloth is equivalent to a sequence of two dimensiona…

2018-12-03abs ↗pdf ↗

We describe an algorithm that associates to each positive real number rr and each finite collection CrC_r of planar pixels of size rr a planar piecewise linear set SrS_r with the following additional property: if CrC_r is the collection of pixels of size rr that touch a given compact semialgebraic set SS, then the …

2011-09-12abs ↗pdf ↗

One pixel modification can make deep models unlearnable.

problem Protecting data from unauthorized training of deep neural networks.
method Perturbing only one pixel in each image to degrade model accuracy.
result Generated One-Pixel Shortcut (OPS) cannot be erased by adversarial training and strong augmentations.

Semantic boundary and edge detection aims at simultaneously detecting object edge pixels in images and assigning class labels to them. Systematic training of predictors for this task requires the labeling of edges in images which is a particularly tedious task. We propose a novel strategy for solving this task, when pi…

2016-06-29abs ↗pdf ↗

The paper classifies U.S. crop types using hyperspectral satellite imagery.

problem Classifying crop types from hyperspectral satellite imagery.
method Gaussian Bayesian models and neural networks applied to NASA data.
result Bayesian methods outperform standard LDA and QDA.

Modeling dynamical systems is important in many disciplines, e.g., control, robotics, or neurotechnology. Commonly the state of these systems is not directly observed, but only available through noisy and potentially high-dimensional observations. In these cases, system identification, i.e., finding the measurement map…

2014-10-28abs ↗pdf ↗