Sparse-RS framework efficiently attacks models with sparse perturbations.
problem Efficiently attacking models with sparse perturbations in the black-box setting.
method Random search-based Sparse-RS framework for score-based attacks.
result Sparse-RS achieves state-of-the-art success rate and query efficiency.
Sparse connectivity improves generalization in neural networks below the Edge of Stability.
problem Generalization guarantees for fully-connected networks fail at the Edge of Stability.
method Analyzed sparse connectivity's impact on generalization in two-layer ReLU networks.
result Sparse connectivity changes the effective constraint, leading to non-vacuous generalization bounds.
Paper presents certified defenses against adversarial patch attacks.
problem Certified defenses against adversarial patch attacks are needed.
method Proposes the first certified defense and faster training methods.
result Demonstrates robustness transfer across different patch shapes.
Sparse neural networks visualize paired transcriptomic and electrophysiological data.
problem Efficiently analyzing and visualizing paired multivariate neuroscientific data.
method Sparse deep neural networks with a two-dimensional bottleneck and group lasso penalty.
result Biologically interpretable two-dimensional visualizations of paired data.
New method defends against patch attacks with high-certainty guarantees.
problem Patch attacks on images, especially physical adversarial attacks.
method Randomized smoothing, exploiting patch constraints.
result Meaningfully large robustness certificates against patch attacks.
A new image interpolation model using sparse representation and nonlocal linear regression.
problem Image interpolation without blurring and noise.
method Sparse representation, nonlocal self-similarity, nonlocal linear regression, adaptive sub-dictionary learning, weighted encoding.
result Our method outperforms state-of-the-art methods in quantitative measures and visual quality.
A new travel time tomography method uses adaptive dictionaries to model slowness variations.
problem Modeling and reconstructing slowness maps with varying scales and discontinuities.
method Local model (sparse patches) and global model (smooth constraints) integrated into a maximum a posteriori formulation.
result The LST approach effectively models both smooth and discontinuous slowness features.
New filter bank sparsifying transforms outperform patch-based methods for image denoising.
problem Improving image denoising performance using data-adaptive sparsifying transforms.
method Proposes a new transform learning framework using undecimated perfect reconstruction filter banks, allowing independent filter length choice.
result Filter bank sparsifying transforms outperform existing patch-based methods for image denoising.
Stochastic partition models tailor a product space into a number of rectangular regions such that the data within each region exhibit certain types of homogeneity. Due to constraints of partition strategy, existing models may cause unnecessary dissections in sparse regions when fitting data in dense regions. To allevia…
DRFormer uses dynamic tokenization and multi-scale transformer to forecast long time series.
problem Forecasting long-term time series data across diverse scales.
method Dynamic tokenizer, multi-scale transformer, dynamic sparse learning, rotary position encoding.
result DRFormer outperforms existing methods in forecasting accuracy.
New CAOL framework learns diverse convolutional filters for improved signal recovery.
problem Memory limitations in patch-domain approaches for learning kernels from large datasets.
method Convolutional Analysis Operator Learning (CAOL) framework with BPEG-M method.
result CAOL significantly accelerates convergence and improves reconstruction quality.
ALONE uses neural networks to accelerate cine MRI without needing ground truth.
problem Accelerated MRI reconstruction without using ground truth.
method Unsupervised learning of shallow CNNs to approximate MRI patches.
result ALONE outperforms TV and DIC methods in cine MRI reconstruction.
Sparsity-based approaches have been popular in many applications in image processing and imaging. Compressed sensing exploits the sparsity of images in a transform domain or dictionary to improve image recovery from undersampled measurements. In the context of inverse problems in dynamic imaging, recent research has de…
Defense against small image patches using occlusions.
problem Vulnerability of deep learning to small adversarial patches.
method Partially occlude image around each patch location.
result Certified security against patch attacks of a certain size.
Proposes a new approach to time series representation learning by embedding patches independently.
problem Capturing dependencies between time series patches is not optimal for representation learning.
method 1) Patch reconstruction task, 2) Patch-wise MLP, 3) Complementary contrastive learning.
result Improves time series forecasting and classification performance compared to state-of-the-art models.
The study evaluates neural network patching techniques to adapt models to concept drift.
problem Adapting neural network models to handle concept drift in nonstationary environments.
method Investigated different engagement layers and patch architectures to enhance neural network patching.
result Identified generally applicable heuristics for parametrizing the patching procedure.
New method makes neural networks more resilient to location-optimized adversarial patches.
problem Neural networks' vulnerability to adversarial patches that are visible but still effective.
method Developed a practical approach to optimize patch locations and applied adversarial training.
result Significantly improved robustness against adversarial patches on CIFAR10 and GTSRB.
Compressed sensing is a powerful tool in applications such as magnetic resonance imaging (MRI). It enables accurate recovery of images from highly undersampled measurements by exploiting the sparsity of the images or image patches in a transform domain or dictionary. In this work, we focus on blind compressed sensing (…
Reinforcement Patching optimizes dynamic sequence patching for efficient time series forecasting.
problem Efficiently learning data-adaptive representations for long-horizon sequence data, especially continuous sequences.
method Reinforcement Patching (ReinPatch) uses reinforcement learning to optimize dynamic patching policies and sequence backbones.
result ReinPatch achieves compelling performance in time-series forecasting compared to state-of-the-art methods.
Analytic patch trees reveal new geometric structures and dimension fields.
problem Understanding the geometric and analytical properties of surface patch trees.
method Developed analytic surface patch trees and introduced interface curves to transmit state.
result Surface patch trees have natural foliations with one-dimensional curve trees and dimension fields.
Improved image denoising with GGMM over EPLL.
problem Image denoising with improved patch priors.
method Generalized Gaussian mixture model (GGMM) for better patch distribution modeling.
result GGMM outperforms GMM in image denoising.
Sparse coding, which is the decomposition of a vector using only a few basis elements, is widely used in machine learning and image processing. The basis set, also called dictionary, is learned to adapt to specific data. This approach has proven to be very effective in many image processing tasks. Traditionally, the di…
Physical patches can fool object detectors anywhere in an image.
problem Physical adversarial attacks on object detection systems.
method Demonstrated a patch that suppresses all detected objects regardless of its position.
result A patch can be placed anywhere in an image to suppress all detected objects, including those far away.
MAT combines meta-learning and adversarial training to defend against universal patches.
problem Defending against universal patches that fool models in various contexts.
method Meta adversarial training (MAT) integrates meta-learning with adversarial training.
result MAT increases robustness against universal patch attacks on image classification and traffic-light detection.
In this paper, we study the missing sample recovery problem using methods based on sparse approximation. In this regard, we investigate the algorithms used for solving the inverse problem associated with the restoration of missed samples of image signal. This problem is also known as inpainting in the context of image …
Patch learning improves machine learning models by localizing key features.
problem Improving machine learning model performance.
method Patch learning involves training a global model and then identifying and training local models for key patches identified by the global model.
result Patch learning can improve model performance across various regression and identification tasks.
BagCert efficiently certifies robustness against adversarial patches on image classifiers.
problem Adversarial patches pose a threat to autonomous systems' perception component.
method BagCert combines model architecture and certification procedure for efficient inference.
result BagCert certifies 10,000 examples in 43 seconds on a single GPU, achieving 86% clean and 60% certified accuracy against 5x5 patches.
In this paper we address the problem of understanding the success of algorithms that organize patches according to graph-based metrics. Algorithms that analyze patches extracted from images or time series have led to state-of-the art techniques for classification, denoising, and the study of nonlinear dynamics. The mai…
DECT-MULTRA improves material decomposition in CT images.
problem Noise and artifacts degrade material images in DECT imaging.
method Combines PWLS estimation with MULTRA model for efficient clustering and sparse coding.
result Superior material image quality and decomposition accuracy compared to other methods.
Predict and classify brain image evolution trajectories from a single MRI timepoint.
problem Diagnosing early mild cognitive impairment (eMCI) from a single MRI scan.
method Supervised and unsupervised learning frameworks that predict and label intensity patch evolution trajectories from a baseline MRI.
result Classification accuracy increased by up to 10% points compared to single timepoint-based methods.
The main ob jective of this research is to find the different types of elliptic triangulations for planar discs and spheres. We begin in Chapter 1 with the mandatory introduction. In the second chapter we define and study the notion of a patch, that is, a triangulation of a planar disc. By introducing a suitable notion…
Ano-SuPs detects anomalies in images of manufactured products by identifying suspected patches.
problem Challenges in detecting anomalies in image-based manufacturing systems, including complexity of background and various anomaly patterns.
method Two-stage strategy anomaly detection method: first, remove suspected patches; second, refine anomaly identification using normal patches.
result Demonstrated effectiveness through simulation and case studies, identifying key parameters and steps impacting model performance and efficiency.
Mixture models and topic models generate each observation from a single cluster, but standard variational posteriors for each observation assign positive probability to all possible clusters. This requires dense storage and runtime costs that scale with the total number of clusters, even though typically only a few clu…
We propose a new algorithm to learn a dictionary for reconstructing and sparsely encoding signals from measurements without phase. Specifically, we consider the task of estimating a two-dimensional image from squared-magnitude measurements of a complex-valued linear transformation of the original image. Several recent …
Universal adversarial patches prevent face detection in various frameworks.
problem Preventing face detection in state-of-the-art face detection systems.
method Investigated the phenomenon of patches that suppress face detection and proposed optimization-based approaches for automatic design.
result Universal adversarial patches can prevent face detection without introducing false positives.
The problem of Poisson denoising appears in various imaging applications, such as low-light photography, medical imaging and microscopy. In cases of high SNR, several transformations exist so as to convert the Poisson noise into an additive i.i.d. Gaussian noise, for which many effective algorithms are available. Howev…
Efficiently processes high res images by selecting relevant patches.
problem High memory and compute requirements for processing large images.
method Differentiable Top-K operator to select relevant patches.
result End-to-end trainable model using backpropagation.
The traditional sparse modeling approach, when applied to inverse problems with large data such as images, essentially assumes a sparse model for small overlapping data patches. While producing state-of-the-art results, this methodology is suboptimal, as it does not attempt to model the entire global signal in any mean…
OnAIR reconstructs dynamic images from sparse measurements online.
problem Reconstructing dynamic images from limited or corrupted measurements.
method Online adaptive reconstruction using sparsity and low-rank models with dictionary learning.
result Memory-efficient online algorithms for sequential estimation of dictionary and images.
PatchGuard defends against localized adversarial patches with provable robustness.
problem Localized adversarial patches induce misclassification in machine learning models.
method PatchGuard uses CNNs with small receptive fields and robust masking to detect and mask corrupted features.
result PatchGuard achieves state-of-the-art provable robust accuracy and clean accuracy.
Patch augmentation boosts neural network accuracy and robustness.
problem Improving neural network accuracy and robustness to adversarial attacks.
method Data augmentation technique creating new images by superimposing patches from image pairs.
result Significant accuracy improvements on CIFAR-10 and CIFAR-100 datasets.
Paper presents unsupervised learning for visual representations using patches from unlabelled videos.
problem Learning visual representations without labeled data.
method Trains a model for foreground and background classification using patches extracted from unlabelled videos.
result Model achieves 45.3 mAP, close to best unsupervised learning techniques.
Algorithm learns one convolutional layer with overlapping patches efficiently.
problem Learning one convolutional layer with overlapping patches efficiently.
method Isotonic regression applied to stochastic iterative updates.
result Convotron efficiently learns one hidden convolutional layer with mild conditions.
Mobile V-MoEs scale down ViTs for resource-constrained vision tasks.
problem Scaling down Vision Transformers for resource-constrained applications.
method Sparse Mixture-of-Experts (MoEs) applied to entire images, with a stable training procedure.
result Mobile V-MoEs achieve better performance-efficiency trade-offs than dense ViTs.
The original contributions of this paper are twofold: a new understanding of the influence of noise on the eigenvectors of the graph Laplacian of a set of image patches, and an algorithm to estimate a denoised set of patches from a noisy image. The algorithm relies on the following two observations: (1) the low-index e…
Model patching closes subgroup performance gaps in skin cancer classification.
problem Inconsistent model performance on specific subgroups of a class.
method Two-stage framework that models subgroup features and learns semantic transformations, followed by data augmentation.
result Reductions in robust error of up to 33% relative to best baseline on benchmark datasets.
New projection operators for multipatch spaces with stable properties.
problem Problems with non-matching interfaces in multipatch spaces.
method Construction of commuting projection operators on de Rham sequences of multipatch spaces with local tensor-product parametrization.
result Local and stable projection operators in any Lp norm for shape-regular spline patches with different mappings and local refinements. Since learning is typically very slow in Boltzmann machines, there is a need to restrict connections within hidden layers. However, the resulting states of hidden units exhibit statistical dependencies. Based on this observation, we propose using l1/l2 regularization upon the activation possibilities of hidden unit…