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
PublisherIEEE
Pages7-11
Number of pages4
ISBN (Print)978-0-7695-3119-9
DOIs
Publication statusPublished - 31 May 2008

Fingerprint

Binary images
Sampling

Keywords

  • compression
  • compressive sampling
  • image processing

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
Stankovic, V. ; Stankovic, L. ; Cheng, S. / Compressive sampling of binary images. Congress on Image and Signal Processing, 2008. CISP '08. IEEE, 2008. pp. 7-11
@inproceedings{28b31cd01aa44693af455684c7bc9b32,
title = "Compressive sampling of binary images",
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.",
keywords = "compression, compressive sampling, image processing",
author = "V. Stankovic and L. Stankovic and S. Cheng",
year = "2008",
month = "5",
day = "31",
doi = "10.1109/CISP.2008.476",
language = "English",
isbn = "978-0-7695-3119-9",
pages = "7--11",
booktitle = "Congress on Image and Signal Processing, 2008. CISP '08",
publisher = "IEEE",

}

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

Compressive sampling of binary images. / Stankovic, V.; Stankovic, L.; Cheng, S.

Congress on Image and Signal Processing, 2008. CISP '08. IEEE, 2008. p. 7-11.

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

TY - GEN

T1 - Compressive sampling of binary images

AU - Stankovic, V.

AU - Stankovic, L.

AU - Cheng, S.

PY - 2008/5/31

Y1 - 2008/5/31

N2 - 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.

AB - 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.

KW - compression

KW - compressive sampling

KW - image processing

U2 - 10.1109/CISP.2008.476

DO - 10.1109/CISP.2008.476

M3 - Conference contribution book

SN - 978-0-7695-3119-9

SP - 7

EP - 11

BT - Congress on Image and Signal Processing, 2008. CISP '08

PB - IEEE

ER -

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