Compressive sampling of binary images
Stankovic, V. and Stankovic, L. and Cheng, S.; (2008) Compressive sampling of binary images. In: Congress on Image and Signal Processing, 2008. CISP '08. IEEE, Piscataway, N.J., pp. 7-11. ISBN 978-0-7695-3119-9 (https://doi.org/10.1109/CISP.2008.476)
Preview |
Text.
Filename: Stankovic_etal_IEEE_CISP_2008_Compressive_sampling_of_binary.pdf
Accepted Author Manuscript Download (188kB)| Preview |
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.
-
-
Item type: Book Section ID code: 12856 Dates: DateEvent31 May 2008PublishedNotes: © 2008 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting /republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Subjects: Technology > Electrical engineering. Electronics Nuclear engineering Department: Faculty of Engineering > Electronic and Electrical Engineering Depositing user: Strathprints Administrator Date deposited: 23 Aug 2010 15:49 Last modified: 16 May 2024 01:39 URI: https://strathprints.strath.ac.uk/id/eprint/12856