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

Trend · papers per month

122243365486 · Jun 202019922001200920172026
48 results for art reconstruction

DEER network improves few-view breast CT image reconstruction efficiency and quality.

problem Efficient and high-quality few-view breast CT image reconstruction.
method Deep Efficient End-to-end Reconstruction (DEER) network with low model complexity.
result DEER network achieves competitive image quality with significantly fewer parameters compared to state-of-the-art methods.

State of the art methods in astronomical image reconstruction rely on the resolution of a regularized or constrained optimization problem. Solving this problem can be computationally intensive and usually leads to a quadratic or at least superlinear complexity w.r.t. the number of pixels in the image. We investigate in…

2016-12-14abs ↗pdf ↗

GCVAE improves disentanglement in VAEs while balancing reconstruction error.

problem Improving disentanglement in VAEs while maintaining low reconstruction error.
method Introduces three controllable Lagrangian hyperparameters to optimize reconstruction and KL divergence loss.
result GCVAE outperforms state-of-the-art models in disentanglement while balancing reconstruction.

Deep learning scheme identifies and reconstructs chaotic and stochastic systems from noisy data.

problem Challenging identification of governing equations from noisy and partial observations.
method Jointly learns inference model and governing laws using variational deep learning.
result Framework generalizes state-of-the-art methods and accounts for stochastic variabilities.

Reconstruction based subspace clustering methods compute a self reconstruction matrix over the samples and use it for spectral clustering to obtain the final clustering result. Their success largely relies on the assumption that the underlying subspaces are independent, which, however, does not always hold in the appli…

2012-06-18abs ↗pdf ↗

We propose a novel autoencoding model called Pairwise Augmented GANs. We train a generator and an encoder jointly and in an adversarial manner. The generator network learns to sample realistic objects. In turn, the encoder network at the same time is trained to map the true data distribution to the prior in latent spac…

2018-10-11abs ↗pdf ↗

Compressive Sensing (CS) theory asserts that sparse signal reconstruction is possible from a small number of linear measurements. Although CS enables low-cost linear sampling, it requires non-linear and costly reconstruction. Recent literature works show that compressive image classification is possible in CS domain wi…

2018-10-15abs ↗pdf ↗

We propose an efficient algorithm for sparse signal reconstruction problems. The proposed algorithm is an augmented Lagrangian method based on the dual sparse reconstruction problem. It is efficient when the number of unknown variables is much larger than the number of observations because of the dual formulation. More…

2009-04-03abs ↗pdf ↗

Proposes TCWAE to learn disentangled representations using the Wasserstein Autoencoder.

problem Balancing reconstruction fidelity and disentanglement in learning representations.
method TCWAE (Total Correlation Wasserstein Autoencoder) using different KL estimators.
result Competitive results on data sets with known generative factors, and improved reconstructions on unknown factors.

Improved computed tomography reconstruction with deep learning and deep image prior.

problem Low data efficiency in computed tomography reconstruction.
method Combining learned primal-dual methods with deep image prior for improved quality and generalization.
result Proposed methods outperform state-of-the-art in low data regime.

DCAE learns compact latent representations for one-class novelty detection.

problem Learning compact latent representations for one-class novelty detection.
method DCAE learns compact and collapse-free latent representations through internal discriminative layers of GANs, reconstructing in-class data finely and exclusively.
result DCAE achieves state-of-the-art performance on novelty and adversarial example detection.

A new method learns high-frequency components for better image reconstruction.

problem Efficiently reconstructing feature details in under-sampled imaging.
method Proposes HF-DAEP, a denoising autoencoder using multi-profile high-frequency components.
result Demonstrates improved reconstruction of feature details in MRI and CT.

New framework UIFV reconstructs private features in VFL without model details.

problem Privacy risks in VFL where adversaries can reconstruct sensitive features.
method Unified InverNet Framework (UIFV) that uses intermediate feature data.
result Significantly outperforms state-of-the-art techniques in attack precision.

Magnetic resonance imaging (MRI) is known to be a slow imaging modality and undersampling in k-space has been used to increase the imaging speed. However, image reconstruction from undersampled k-space data is an ill-posed inverse problem. Iterative algorithms based on compressed sensing have been used to address the i…

2019-08-07abs ↗pdf ↗

We propose a new method to evaluate GANs, namely EvalGAN. EvalGAN relies on a test set to directly measure the reconstruction quality in the original sample space (no auxiliary networks are necessary), and it also computes the (log)likelihood for the reconstructed samples in the test set. Further, EvalGAN is agnostic t…

2019-01-28abs ↗pdf ↗

This paper presents a novel method for the reconstruction of a neural network connectivity using calcium fluorescence data. We introduce a fast unsupervised method to integrate different networks that reconstructs structural connectivity from neuron activity. Our method improves the state-of-the-art reconstruction meth…

2015-05-30abs ↗pdf ↗

In compressed sensing, we wish to reconstruct a sparse signal xx from observed data yy. In sparse coding, on the other hand, we wish to find a representation of an observed signal yy as a sparse linear combination, with coefficients xx, of elements from an overcomplete dictionary. While many algorithms are competit…

2013-10-31abs ↗pdf ↗

iTimER learns from reconstruction errors to represent irregularly sampled time series.

problem Learning from irregularly sampled time series with missing data.
method iTimER models reconstruction errors as a proxy for unobserved values, using a mixup strategy and a Wasserstein metric.
result iTimER outperforms state-of-the-art methods in classification, interpolation, and forecasting tasks.

This work combines deep learning and sparse coding for CT image reconstruction.

problem Improving image quality in low-dose CT scans.
method Sparse signal representation using learned dictionaries, inspired by variational autoencoders and deep learning techniques.
result Regularization with learned dictionaries achieves competitive performance in CT reconstruction.

Paper improves MRI reconstruction by separating target labels and prediction error.

problem Improving MRI reconstruction accuracy by estimating prediction error.
method Proposes a novel method to estimate target labels and prediction error separately.
result Significantly better MRI reconstruction results achieved compared to state-of-the-art methods.

Here, we present a novel approach to solve the problem of reconstructing perceived stimuli from brain responses by combining probabilistic inference with deep learning. Our approach first inverts the linear transformation from latent features to brain responses with maximum a posteriori estimation and then inverts the …

2017-05-19abs ↗pdf ↗

Paper uses CNNs for eye tracking data segmentation, generation, and reconstruction.

problem Semantic segmentation and reconstruction of raw eye tracking data.
method Fully convolutional neural networks (FCNNs) for data segmentation and generation, variational auto-encoder for data generation.
result FCNNs can process any input size directly without preprocessing, generating raw eye tracking data.

We introduce a novel generative autoencoder network model that learns to encode and reconstruct images with high quality and resolution, and supports smooth random sampling from the latent space of the encoder. Generative adversarial networks (GANs) are known for their ability to simulate random high-quality images, bu…

2018-07-09abs ↗pdf ↗

Node embeddings have become an ubiquitous technique for representing graph data in a low dimensional space. Graph autoencoders, as one of the widely adapted deep models, have been proposed to learn graph embeddings in an unsupervised way by minimizing the reconstruction error for the graph data. However, its reconstruc…

2019-08-12abs ↗pdf ↗

RADAR uses diffusion models to detect anomalies without reconstruction, improving accuracy and efficiency.

problem Challenges in anomaly detection and segmentation, especially in real-time applications.
method RADAR uses attention-based diffusion models to directly produce anomaly maps from the diffusion process, bypassing reconstruction.
result RADAR improves F1 score by 7% on MVTec-AD and 13% on 3D-printed material compared to state-of-the-art methods.

Fine-tuning normalization layers can reconstruct smaller networks.

problem Understanding the expressive power of fine-tuning normalization layers.
method Random ReLU networks and sparsified networks were fine-tuned to reconstruct target networks.
result Fine-tuning normalization layers can reconstruct networks that are O(extwidth)O(\sqrt{ ext{width}}) times smaller.

LVTINO improves high-definition video restoration with consistent temporal details.

problem Restoring high-definition video with fine spatial detail and temporal consistency.
method LVTINO uses Video Consistency Models to bypass frame-by-frame image-based LDMs, achieving perceptual quality and computational efficiency.
result Significant perceptual improvements over current methods, achieving state-of-the-art quality with minimal evaluations.

This paper aims to develop a new and robust approach to feature representation. Motivated by the success of Auto-Encoders, we first theoretical summarize the general properties of all algorithms that are based on traditional Auto-Encoders: 1) The reconstruction error of the input can not be lower than a lower bound, wh…

2017-10-08abs ↗pdf ↗