New algorithm learns convolutional neural networks with overlapping patches.
problem Learning convolutional neural networks with overlapping patches.
method Algorithm draws from isotonic regression and landscape analysis.
result Algorithm works for general class of patches, including common computer vision structures.
PACO uses consensus to improve overlapping patch processing.
problem Improving overlapping patch processing to avoid averaging issues.
method Develops a variational signal processing framework with ADMM-based algorithm for consensus.
result Efficient consensus solving for arbitrary patch decompositions.
We give the first provably efficient algorithm for learning a one hidden layer convolutional network with respect to a general class of (potentially overlapping) patches. Additionally, our algorithm requires only mild conditions on the underlying distribution. We prove that our framework captures commonly used schemes …
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.
New image restoration method using localized patches and external databases.
problem Image restoration challenges.
method Localized structured prediction and non-linear multi-task learning for optimizing a penalized energy function.
result Strong statistical guarantees and practical effectiveness demonstrated on various image restoration problems.
Cluster Quilting clusters fragmented data sets for neuroscience and genomics.
problem Clustering fragmented data sets in neuroscience and genomics.
method Cluster Quilting method using patch ordering, patchwise SVD, sequential linear mapping, and k-means.
result Cluster Quilting discovers more accurate clusters than other methods.
Convolutional operator learning is gaining attention in many signal processing and computer vision applications. Learning kernels has mostly relied on so-called patch-domain approaches that extract and store many overlapping patches across training signals. Due to memory demands, patch-domain methods have limitations w…
Framework detects and classifies multi-label RBC images from microscopic images.
problem Challenges in separating touching or overlapping cells for classification.
method Region proposal model + CNN feature extraction + multi-label prediction networks.
result Framework achieves good performance in automatic cell detection and classification.
The paper addresses rigid alignment of noisy patches, providing a polynomial time algorithm and convergence conditions.
problem Finding a rigid alignment of overlapping local views (patches) that minimizes alignment error in a noisy setting.
method Characterizes non-degeneracy based on kernel and positivity of a matrix, provides polynomial time algorithm for testing non-degeneracy, and uses Riemannian gradient descent for alignment.
result The algorithm converges locally linearly to a non-degenerate perfect alignment under certain conditions.
DeepTD learns CNN weights from non-overlapping patches using tensor decomposition.
problem Learning weights of a deep convolutional neural network (CNN).
method Deep Tensor Decomposition (DeepTD) based on rank-1 tensor decomposition.
result DeepTD is data-efficient and works as soon as sample size exceeds total number of weights.
Paper proposes CNN for diagnosing rare muscular dystrophies from images.
problem Challenges in diagnosing rare diseases due to lack of data.
method Uses a Convolutional Neural Network (CNN) for patch-based classification of confocal microscopy images.
result CNN system identifies problematic areas and provides global patient evaluation.
Study on neural networks' sample complexity with one hidden layer.
problem Understanding how sample complexity is affected by network architecture and norm constraints.
method Norm-based uniform convergence bounds for scalar-valued one-hidden-layer networks, focusing on spectral and Frobenius norms.
result Spectral norm control is insufficient for uniform convergence guarantees, but Frobenius norm control is sufficient, with conditions.
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of l_2- or l_infinity-norms over groups of variables. Whereas much effort has been put in developing fast optimization techniques when the groups are disjoint or embedded in a hierarchy, we address here the ca…
A new method evolves point clouds using B-splines for smooth surfaces.
problem Evolution of smooth surfaces from discrete point clouds.
method Adaptive Lagrangian B-spline framework for geometric evolution.
result Efficient and accurate reproduction of surface evolution phenomena.
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.
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.
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…
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.
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.
Patch priors have become an important component of image restoration. A powerful approach in this category of restoration algorithms is the popular Expected Patch Log-Likelihood (EPLL) algorithm. EPLL uses a Gaussian mixture model (GMM) prior learned on clean image patches as a way to regularize degraded patches. In th…
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.
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…
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.
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.
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.
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.
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. Patch Gaussian augmentation improves model robustness without sacrificing accuracy.
problem Challenges in building robust models without sacrificing accuracy.
method Adds Gaussian noise to randomly selected patches in images.
result Achieves state-of-the-art performance on benchmarks while improving clean data accuracy.
Researchers construct explicit bundles for ALF metrics, revealing rational patching matrices for gravitational instantons.
problem Constructing explicit toric Ricci-flat metrics and their associated bundles.
method Explicit construction of patching matrices for ALF metrics and gravitational instantons.
result Rational form of patching matrices for gravitational instantons in the Chen--Teo family.
Chronic obstructive pulmonary disease (COPD) is a lung disease where early detection benefits the survival rate. COPD can be quantified by classifying patches of computed tomography images, and combining patch labels into an overall diagnosis for the image. As labeled patches are often not available, image labels are p…
Improved CNN model accuracy and generalizability through data pre-processing.
problem Enhancing accuracy and generalizability of CNN-based LULC classification.
method Trials of different data preparation methods, including patch selection, size, and augmentations.
result Combining multiple grids and rotations of patches improved model accuracy and generalizability.
SaliencyMix augments images with salient patches to improve model generalization.
problem Improving deep learning model generalization through better data augmentation.
method Carefully selects salient patches from images and mixes them with the target image.
result Achieves state-of-the-art top-1 error rates and robustness against adversarial attacks.
PatchGT uses non-trainable graph patches to improve graph representation learning.
problem Learning high-level information in graph tasks with direct Transformer models.
method PatchGT segments graphs into non-trainable patches, uses GNN for patch-level learning, and Transformer for graph-level learning.
result PatchGT achieves higher expressiveness and competitive performance on benchmark datasets.
Develops deep neural networks for efficient salient object detection.
problem Efficiency and accuracy in detecting salient objects of various scales and semantic information.
method Hybrid contrast-oriented deep neural networks combining fully convolutional and segment-level spatial pooling streams, with an attentional module for fusion.
result Significantly outperforms state-of-the-art methods on six benchmark datasets.
We introduce an algorithm for the segmentation of a class of regime switching processes. The segmentation algorithm is a non parametric statistical method able to identify the regimes (patches) of the time series. The process is composed of consecutive patches of variable length, each patch being described by a station…
Approach for training deep nets with unlabeled patches.
problem Training deep neural networks with detailed expert annotations.
method Cluster-based learning from weakly labeled bags in latent space.
result Improved performance on Camelyon dataset.