Convolutional Sparse Coding: Boundary Handling Revisited
Two different approaches have recently been proposed for boundary handling in convolutional sparse representations, avoiding potential boundary artifacts arising from the circular boundary conditions implied by the use of frequency domain solution methods by introducing a spatial mask into the convolutional sparse coding problem. In the present paper we show that, under certain circumstances, these methods fail in their design goal of avoiding boundary artifacts. The reasons for this failure are discussed, a solution is proposed, and the practical implications are illustrated in an image deblurring problem.
Code (0)
등록된 구현이 없습니다.
Tasks
DeblurringImage DeblurringSimilar Papers 제목 키워드 기반
Optimization Methods for Convolutional Sparse Coding
Sparse and convolutional constraints form a natural prior for many optimization problems that arise from physical processes. Detecting motifs in speech and musical passages, super-resolving images, compressing videos, an…
Fast and Flexible Convolutional Sparse Coding
Convolutional sparse coding (CSC) has become an increasingly important tool in machine learning and computer vision. Image features can be learned and subsequently used for classification and reconstruction tasks. As opp…
General ClassificationEffects of boundary conditions in fully convolutional networks for learning spatio-temporal dynamics
Accurate modeling of boundary conditions is crucial in computational physics. The ever increasing use of neural networks as surrogates for physics-related problems calls for an improved understanding of boundary conditio…
Learning on the Edge: Explicit Boundary Handling in CNNs
Convolutional neural networks (CNNs) handle the case where filters extend beyond the image boundary using several heuristics, such as zero, repeat or mean padding. These schemes are applied in an ad-hoc fashion and, bein…
ColorizationDisparity EstimationOptical Flow EstimationStochastic Convolutional Sparse Coding
State-of-the-art methods for Convolutional Sparse Coding usually employ Fourier-domain solvers in order to speed up the convolution operators. However, this approach is not without shortcomings. For example, Fourier-doma…