paper-with-me

Papers

A Local Block Coordinate Descent Algorithm for the CSC Model

2019-06-01 · CVPR 2019 6 · Ev Zisselman, Jeremias Sulam, Michael Elad

The Convolutional Sparse Coding (CSC) model has recently gained considerable traction in the signal and image processing communities. By providing a global, yet tractable, model that operates on the whole image, the CSC was shown to overcome several limitations of the patch-based sparse model while achieving superior performance in various applications. Contemporary methods for pursuit and learning the CSC dictionary often rely on the Alternating Direction Method of Multipliers (ADMM) in the Fourier domain for the computational convenience of convolutions, while ignoring the local characterizations of the image. In this work we propose a new and simple approach that adopts a localized strategy, based on the Block Coordinate Descent algorithm. The proposed method, termed Local Block Coordinate Descent (LoBCoD), operates locally on image patches. Furthermore, we introduce a novel stochastic gradient descent version of LoBCoD for training the convolutional filters. This Stochastic-LoBCoD leverages the benefits of online learning, while being applicable even to a single training image. We demonstrate the advantages of the proposed algorithms for image inpainting and multi-focus image fusion, achieving state-of-the-art results.

📄 PDF Abstract BibTeX

Code (1)

EvZissel/LoBCoD 공식 구현

Tasks

Image InpaintingMulti Focus Image Fusion

Similar Papers 제목 키워드 기반

Relative Interior Rule in Block-Coordinate Descent

2020-06-01 · CVPR 2020 6 · Tomas Werner, Daniel Prusa, Tomas Dlask

It is well-known that for general convex optimization problems, block-coordinate descent can get stuck in poor local optima. Despite that, versions of this method known as convergent message passing are very successful t…

A Local Analysis of Block Coordinate Descent for Gaussian Phase Retrieval

2017-12-06 · David Barmherzig, Ju Sun

While convergence of the Alternating Direction Method of Multipliers (ADMM) on convex problems is well studied, convergence on nonconvex problems is only partially understood. In this paper, we consider the Gaussian phas…

Retrieval

A Local Block Coordinate Descent Algorithm for the Convolutional Sparse Coding Model

2018-11-01 · Ev Zisselman, Jeremias Sulam, Michael Elad

The Convolutional Sparse Coding (CSC) model has recently gained considerable traction in the signal and image processing communities. By providing a global, yet tractable, model that operates on the whole image, the CSC …

Image InpaintingMulti Focus Image Fusion

DID: Distributed Incremental Block Coordinate Descent for Nonnegative Matrix Factorization

2018-02-25 · Tianxiang Gao, Chris Chu

Nonnegative matrix factorization (NMF) has attracted much attention in the last decade as a dimension reduction method in many applications. Due to the explosion in the size of data, naturally the samples are collected a…

Dimensionality Reduction

A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis

2024-04-04 · Benjamin Doerr, Joshua Knowles, Aneta Neumann, Frank Neumann

We consider whether conditions exist under which block-coordinate descent is asymptotically efficient in evolutionary multi-objective optimization, addressing an open problem. Block-coordinate descent, where an optimizat…

Scheduling