A swarm based heuristic for sparse image recovery

Author Theofanis Apostolopoulos

Thumbnail PDF


  • Filesize: 0.74 MB
  • 8 pages

Document Identifiers

Author Details

Theofanis Apostolopoulos

Cite AsGet BibTex

Theofanis Apostolopoulos. A swarm based heuristic for sparse image recovery. In 2013 Imperial College Computing Student Workshop. Open Access Series in Informatics (OASIcs), Volume 35, pp. 3-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)


This paper discusses the Compressive Sampling framework as an application for sparse representation (factorization) and recovery of images over an over-complete basis (dictionary). Compressive Sampling is a novel new area which asserts that one can recover images of interest, with much fewer measurements than were originally thought necessary, by searching for the sparsest representation of an image over an over-complete dictionary. This task is achieved by optimizing an objective function that includes two terms: one that measures the image reconstruction error and another that measures the sparsity level. We present and discuss a new swarm based heuristic for sparse image approximation using the Discrete Fourier Transform to enhance its level of sparsity. Our experimental results on reference images demonstrate the good performance of the proposed heuristic over other standard sparse recovery methods (L1-Magic and FOCUSS packages), in a noiseless environment using much fewer measurements. Finally, we discuss possible extensions of the heuristic in noisy environments and weakly sparse images as a realistic improvement with much higher applicability.
  • Compressive Sampling
  • sparse image recovery
  • non-linear programming
  • sparse repre sentation
  • linear inverse problems


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail