Compressive sampling of binary images

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

9 Citations (Scopus)

Abstract

Compressive sampling is a novel framework that exploits sparsity of a signal in a transform domain to perform sampling below the Nyquist rate. In this paper, we apply compressive sampling to reduce the sampling rate of binary images. A system is proposed whereby the image is split into non-overlapping blocks of equal size and compressive sampling is performed on selected blocks only using the orthogonal matching pursuit technique. The remaining blocks are sampled fully. This way, the complexity and the required sampling time is reduced since the orthogonal matching pursuit operates on a smaller number of samples, and at the same time local sparsity within an image is exploited. Our simulation results show more than 20% saving in acquisition for several binary images.
Original languageEnglish
Title of host publicationCongress on Image and Signal Processing, 2008. CISP '08
Place of PublicationPiscataway, N.J.
PublisherIEEE
Pages7-11
Number of pages4
ISBN (Print)978-0-7695-3119-9
DOIs
Publication statusPublished - 31 May 2008

Keywords

  • compression
  • compressive sampling
  • image processing

Fingerprint Dive into the research topics of 'Compressive sampling of binary images'. Together they form a unique fingerprint.

  • Cite this

    Stankovic, V., Stankovic, L., & Cheng, S. (2008). Compressive sampling of binary images. In Congress on Image and Signal Processing, 2008. CISP '08 (pp. 7-11). IEEE. https://doi.org/10.1109/CISP.2008.476