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

Trend · papers per month

4895143190 · Jun 202019922001200920172026
48 results for pixel maps

PixL2R maps natural language to pixel-based rewards for RL, improving sample efficiency.

problem Sparse reward settings in RL limit applicability to complex problems.
method Directly maps natural language descriptions to pixel-based rewards for guiding RL.
result Language-based rewards significantly improve sample efficiency in policy learning.

Interactive framework identifies insights in power grid maps.

problem Manual identification of insights in power grid maps is laborious and expertise-dependent.
method Proposes an interactive framework using DenseU-Hierarchical VAE to learn and modulate representations.
result Framework outperforms baseline models in identifying and annotating insights.

The study evaluates saliency metrics for image classifier outputs, finding inconsistencies and unreliability.

problem Inconsistencies and unreliability in saliency metrics for evaluating pixel relevance.
method Investigated existing saliency metrics, calculated and compared their consistency, and applied psychometric testing methods.
result Saliency metrics can be statistically unreliable and inconsistent, affecting comparative rankings.

Deconvolutional layers have been widely used in a variety of deep models for up-sampling, including encoder-decoder networks for semantic segmentation and deep generative models for unsupervised learning. One of the key limitations of deconvolutional operations is that they result in the so-called checkerboard problem.…

2017-05-18abs ↗pdf ↗

SaR-SVM-STV improves hyperspectral image classification with shape-adaptive reconstruction and denoising.

problem Classifying hyperspectral images with limited labeled data.
method Shape-adaptive Reconstruction (SaR) for pixel preprocessing, SVM for probability estimation, and Smoothed Total Variation (STV) for denoising.
result SaR-SVM-STV outperforms SVM-STV with fewer labeled data.

The Jacobian-based Saliency Map Attack is a family of adversarial attack methods for fooling classification models, such as deep neural networks for image classification tasks. By saturating a few pixels in a given image to their maximum or minimum values, JSMA can cause the model to misclassify the resulting adversari…

2018-08-23abs ↗pdf ↗

New MRI method maps tissue parameters more accurately by ignoring voxel independence.

problem Voxel independence assumption limits model fitting reliability and repeatability.
method Self-supervised deep variational approach with Gaussian mixture prior.
result Our method outperforms current techniques in dMRI simulations and real data.

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 ↗

Pixel-wise relevance method shows how CNNs classify faces, varying across datasets and tasks.

problem Interpreting black-box CNN face recognition models.
method Layer-wise relevance propagation (LRP) applied to VGG-16 models trained for face recognition.
result Relevance maps are generally stable across random initializations and tasks, but less so across pretraining datasets.

Neural network classifies breast cancer lesions using global and local image features.

problem Classifying breast cancer lesions in medical images with high resolution and small regions of interest.
method Proposes a neural network that combines global saliency maps and local patches for pixel-level saliency maps.
result Achieves radiologist-level performance in screening mammography interpretation.

New method reduces false positives in weakly supervised pixel-level localization.

problem Reduces false positives in weakly supervised pixel-level localization.
method Proposes a deep learning method using conditional entropy to constrain the localizer.
result Significant improvements in image-level classification and pixel-level localization.

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 ↗

A 3-stage method enhances hyperspectral image classification accuracy.

problem Classifying detailed classes in hyperspectral images with limited labeled data.
method Uses Nested Sliding Window and PCA for spatial consistency, SVM for spectral estimation, and TV model for spatial smoothing.
result Our method outperforms state-of-the-art algorithms, especially in scenarios with small training sets.

New method evaluates visual explanations of deep models using adversarial perturbations.

problem Lack of objective evaluation of visual explanations of deep models.
method Proposes an adversarial perturbation approach to evaluate visual explanations of deep models.
result Demonstrates the effectiveness of the proposed approach through comparisons with existing methods.

Study identifies and mitigates causes of image misclassifications in CNN models.

problem Improving model interpretability and accuracy in image classification.
method Trained six CNN architectures on CIFAR-10, used conditional confusion matrices and misclassification networks to identify morphological similarity and non-essential information interference as causes of misclassification. Developed a method to reduce misclassifications by erasing pixels within top 5% saliency map bounding boxes.
result Identified two causes of misclassification: morphological similarity and non-essential information interference, and developed a method to reduce misclassifications caused by the latter.

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 ↗

This paper presents a novel adaptively connected neural network (ACNet) to improve the traditional convolutional neural networks (CNNs) {in} two aspects. First, ACNet employs a flexible way to switch global and local inference in processing the internal feature representations by adaptively determining the connection s…

2019-04-07abs ↗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 ↗

Deep learning improves PS pixel selection in SAR interferometry.

problem Selecting persistent scatterer pixels for geophysical parameter estimation in multi-temporal SAR interferometry.
method Proposed two deep learning architectures: CNN-ISS and CLSTM-ISS trained on phase history to classify PS and non-PS pixels.
result CLSTM-ISS outperforms conventional methods in PS pixel selection and classification accuracy.

Explaining the output of a deep network remains a challenge. In the case of an image classifier, one type of explanation is to identify pixels that strongly influence the final decision. A starting point for this strategy is the gradient of the class score function with respect to the input image. This gradient can be …

2017-06-12abs ↗pdf ↗

New method uses image-level and pixel-level annotations for brain tumor segmentation.

problem Challenges in obtaining pixel-level annotations for brain tumor segmentation.
method Proposes a learning-based framework that combines both pixel- and image-level annotations.
result Method's performance in segmentation quality is competitive with traditional fully-supervised approach.

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.

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 ↗

New saliency evaluations focus on completeness and soundness, improving explanations.

problem Current saliency evaluations focus on completeness but ignore soundness.
method Introduces new intrinsic evaluation metrics based on completeness and soundness.
result Simple saliency method matches or outperforms prior methods in new evaluations.

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 ↗

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 ↗

The paper introduces a statistical distance matrix for better feature representation and clustering.

problem Lack of detailed distance representation between feature elements.
method Extended traditional statistical distance to a matrix form (statistical distance matrix) and applied hierarchical clustering.
result The statistical distance matrix with clustering (Information Mandala) provides clearer and geometrically arranged feature representations.

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.

Study shows various pixel p-norm measures do not match human perception of adversarial attacks.

problem Understanding human perception of adversarial attacks on image classification systems.
method Performed a behavioral study comparing different p-norm measures and alternative metrics.
result Human perception of adversarial attacks does not align with pixel p-norm measures and other metrics.

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.

Per-pixel ground-truth depth data is challenging to acquire at scale. To overcome this limitation, self-supervised learning has emerged as a promising alternative for training models to perform monocular depth estimation. In this paper, we propose a set of improvements, which together result in both quantitatively and …

2018-06-04abs ↗pdf ↗

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.