Graph-Cut Compression Algorithm for Compressed-Sensed Image Acquisition

Abstract

The purpose of the paper is to find the best quantizer allocation for compressed-sensed acquired images, by using a graph-cut quantizer allocation method. The compressed sensed acquisition is realized in a block-based manner, using a random projection matrix, and on the obtained block measurements a graph-cut-based quantizer allocation method is applied, in order to further reduce the bitrate associated to the measurements. Finally, the quantized measurements are reconstructed using a Smooth Projected Landweber recovery method. The proposed compression method for compressed sensed acquisition shows better results when compared to JPEG2000.