Abstract
Block compressive sensing (BCS) is a highly promising method for image/video encoding in resource-constrained applications. The computational cost of CS encoder depends on the nature of sensing matrices. Popular random Gaussian and Bernoulli sensing matrices not only demand high encoding complexity but yield poor rate–distortion performance. In contrast, structurally random matrix (SRM) and binary permuted block diagonal matrix (BPBD) help to reduce the encoder complexity drastically. Since transmission cost is much higher than computational cost, it is necessary to evaluate the compression efficiency of these matrices. In this paper, we provide the rate–distortion performance analysis of BCS based imaging system using SRM and BPBD matrices to investigate the choice of sensing matrix for compression and energy efficient CS encoder. Through both theoretical and experimental analysis, it is established in this work that the CS measurements using SRM are Laplacian distributed while that using BPBD matrices retain statistical information of the original images. This finding motivates the use of fixed Huffman coding and fixed length coding with these structured sensing matrices which help to reduce the encoder complexity without causing much deterioration to compression efficiency. Thus our work demonstrates a promising direction towards the realization of an inexpensive encoder.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
