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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Compressive Sampling of Binary Images


    Contributors:


    Publication date :

    2008-05-01


    Size :

    239833 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Binary Compressive Tracking

    Jiang Lu / Ting Zhang / Qingquan Sun et al. | IEEE | 2017



    Wideband Photonic Compressive Sampling System

    McKenna, T. P. / Kalkavage, J. H. / Sharp, M. D. et al. | British Library Online Contents | 2016


    Compressive quantization of images

    Poberezhskiy, Y S | IEEE | 2011


    Pulse-doppler signal processing with quadrature compressive sampling

    Chao Liu / Feng Xi / Shengyao Chen et al. | IEEE | 2015