HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Point Coding: Sparse Image Representation with Adaptive Shiftable-Kernel Dictionaries

Abstract : This paper addresses the problem of adaptively deriving optimally sparse image representations, using an dictionary composed of shiftable kernels. Algorithmic advantages of our solution make possible the computation of an approximately shift-invariant adaptive image representation. Learned kernels can have different sizes and adapt to different scales. Coefficient extraction uses a fast implementation of Matching Pursuit with essentially logarithmic cost per iteration. Dictionary update is performed by solving a structured least-squares problem either by algebraic characterization of pseudoinverses of structured matrices, or by superfast interpolation methods. Kernels learned from natural images display expected 2D Gabor aspect (localization in orientation and frequency), as well as other structures commonly occurring in images (e.g., curved edges, or cross patterns), while when applied to newspaper text images, kernels tend to reproduce printed symbols or groups thereof.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download

Contributor : Ist Rennes Connect in order to contact the contributor
Submitted on : Friday, March 20, 2009 - 10:24:51 AM
Last modification on : Thursday, August 22, 2019 - 12:10:38 PM
Long-term archiving on: : Friday, October 12, 2012 - 1:55:38 PM


Files produced by the author(s)


  • HAL Id : inria-00369502, version 1



Doru C. Balcan, Michael S. Lewicki. Point Coding: Sparse Image Representation with Adaptive Shiftable-Kernel Dictionaries. SPARS'09 - Signal Processing with Adaptive Sparse Structured Representations, Inria Rennes - Bretagne Atlantique, Apr 2009, Saint Malo, France. ⟨inria-00369502⟩



Record views


Files downloads