Pearlsy P. V.; Deepa Sankar

Image Block Mapping Lemma and Residual Refinement-Enhanced AutoBCS Framework for Block-based Compressive Sensing

PDF (1920KB), PP.204-222

Views: 0 Downloads: 0

Author(s)

Pearlsy P. V. ^1,* Deepa Sankar ¹

1. Division of Electronics Engineering, Cochin University of Science and Technology, Kochi, 682022, India

* Corresponding author.

DOI: https://doi.org/10.5815/ijigsp.2026.05.10

Received: 14 May 2026 / Revised: 2 Jun. 2026 / Accepted: 17 Jul. 2026 / Published: 8 Oct. 2026

Index Terms

Block-based compressive sensing, Johnson-Lindenstrauss Lemma, Image Block Mapping Lemma, Smoothed Projected Landweber, Initial Reconstruction Refinement Network, Octave Convolution.

Abstract

This paper presents Block-Based Compressive Sensing (BCS) of images using both traditional and learning-based approaches. An Image Block Mapping Lemma, formulated as a modified version of the Johnson-Lindenstrauss Lemma for image data, is proposed in this work, which justifies distance preservation between image blocks during mapping from the original domain to the compressed domain in block-based compressive sensing. The paper provides both theoretical proof and experimental validation of the proposed lemma. To quantitatively analyse distance preservation between image blocks in the original and compressed domains during block-based compressive sensing using traditional approaches, a new metric termed Distance Ratio (DR) is introduced. The difficulty of obtaining accurate real-time reconstruction using conventional block-based compressive sensing methods has encouraged the transition toward adaptive deep learning approaches. For learning-based sensing and reconstruction, the existing AutoBCS framework is enhanced by introducing an Initial Reconstruction Refinement Network (IRR-Net) between the initial and final reconstruction stages. Using the proposed model, improved reconstruction quality is achieved, with average PSNR gains of 0.69-1.62 dB and SSIM improvements of 0.01-0.02 for sampling rates of 0.30, 0.25, 0.10, and 0.04 across multiple benchmark datasets compared with the baseline architecture. The proposed model introduces an additional 0.05 million parameters and increases the computational cost by 3.64 GFLOPs due to the residual refinement module, while reducing the reconstruction time compared with the baseline AutoBCS framework. Experimental results demonstrate that the proposed model exhibits improved preservation of complex structures, edges, and fine details, particularly for images containing rich textures, dense structures, and high-frequency content.

Cite This Paper

Pearlsy P. V., Deepa Sankar, "Image Block Mapping Lemma and Residual Refinement-Enhanced AutoBCS Framework for Block-based Compressive Sensing", International Journal of Image, Graphics and Signal Processing(IJIGSP), Vol.18, No.5, pp. 204-222, 2026. DOI:10.5815/ijigsp.2026.05.10

Reference

[1]D. L. Donoho, “Compressed sensing,” IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289–1306, Apr. 2006, doi: 10.1109/TIT.2006.871582.
[2]E. J. Candes and T. Tao, “Decoding by Linear Programming,” IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203–4215, Dec. 2005, doi: 10.1109/TIT.2005.858979.
[3]E. J. Candès, J. K. Romberg, and T. Tao, “Stable Signal Recovery from Incomplete and Inaccurate Measurements,” Commun. Pure Appl. Math., vol. 59, no. 8, pp. 1207–1223, Aug. 2006, doi: 10.1002/cpa.20124.
[4]Lu Gan, “Block Compressed Sensing of Natural Images,” in 2007 15th International Conference on Digital Signal Processing, Cardiff, UK: IEEE, Jul. 2007, pp. 403–406. doi: 10.1109/ICDSP.2007.4288604.
[5]J. Zhang, C. Zhao, D. Zhao, and W. Gao, “Image Compressive Sensing Recovery using Adaptively Learned Sparsifying Basis via L0 minimization,” Signal Process., vol. 103, pp. 114–126, Oct. 2014, doi: 10.1016/j.sigpro.2013.09.025.
[6]W. B. Johnson and J. Lindenstrauss, “Extensions of Lipschitz Mappings into a Hilbert space,” in Contemporary Mathematics, vol. 26, R. Beals, A. Beck, A. Bellow, and A. Hajian, Eds., Providence, Rhode Island: American Mathematical Society, 1984, pp. 189–206. doi: 10.1090/conm/026/737400.
[7]R. Vershynin, High-Dimensional Probability: An Introduction with Applications in Data Science, 1st ed. Cambridge University Press, 2018. doi: 10.1017/9781108231596.
[8]J. Matoušek, “On variants of the Johnson–Lindenstrauss lemma,” Random Struct. Algorithms, vol. 33, no. 2, pp. 142–156, Sep. 2008, doi: 10.1002/rsa.20218.
[9]M. B. Cohen, T. S. Jayram, and J. Nelson, “Simple Analyses of the Sparse Johnson-Lindenstrauss Transform,” OASIcs Vol. 61 SOSA 2018, vol. 61, p. 15:1-15:9, 2018, doi: 10.4230/OASICS.SOSA.2018.15.
[10]H. Gan, Y. Gao, C. Liu, H. Chen, T. Zhang, and F. Liu, “AutoBCS: Block-Based Image Compressive Sensing With Data-Driven Acquisition and Noniterative Reconstruction,” IEEE Trans. Cybern., vol. 53, no. 4, pp. 2558–2571, Apr. 2023, doi: 10.1109/TCYB.2021.3127657.
[11]S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic Decomposition by Basis Pursuit,” SIAM Rev., vol. 43, no. 1, pp. 129–159, Jan. 2001, doi: 10.1137/S003614450037906X.
[12]J. A. Tropp and A. C. Gilbert, “Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit,” IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4655–4666, Dec. 2007, doi: 10.1109/TIT.2007.909108.
[13]D. L. Donoho, Y. Tsaig, I. Drori, and J.-L. Starck, “Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit,” IEEE Trans. Inf. Theory, vol. 58, no. 2, pp. 1094–1121, Feb. 2012, doi: 10.1109/TIT.2011.2173241.
[14]D. Needell and J. A. Tropp, “CoSaMP: Iterative Signal Recovery from Incomplete and Inaccurate Samples,” Appl. Comput. Harmon. Anal., vol. 26, no. 3, pp. 301–321, May 2009, doi: 10.1016/j.acha.2008.07.002.
[15]D. Needell and R. Vershynin, “Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit,” Found. Comput. Math., vol. 9, no. 3, pp. 317–334, Jun. 2009, doi: 10.1007/s10208-008-9031-3.
[16]T. Blumensath and M. E. Davies, “Iterative Hard Thresholding for Compressed Sensing,” Appl. Comput. Harmon. Anal., vol. 27, no. 3, pp. 265–274, Nov. 2009, doi: 10.1016/j.acha.2009.04.002.
[17]K. Wei, “Fast Iterative Hard Thresholding for Compressed Sensing,” IEEE Signal Process. Lett., vol. 22, no. 5, pp. 593–597, May 2015, doi: 10.1109/LSP.2014.2364851.
[18]J. E. Fowler, S. Mun, and E. W. Tramel, “Multiscale Block Compressed Sensing With Smoothed Projected Landweber Reconstruction,” In 2011 19th European signal processing conference, p. 564-568. IEEE, 2011.
[19]C. Chen, E. W. Tramel, and J. E. Fowler, “Compressed-Sensing Recovery of Images and Video using Multihypothesis Predictions,” in 2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR), Pacific Grove, CA, USA: IEEE, Nov. 2011, pp. 1193–1198. doi: 10.1109/ACSSC.2011.6190204.
[20]S. Mun and J. E. Fowler, “Block Compressed Sensing of Images Using Directional Transforms,” in 2010 Data Compression Conference, Snowbird, UT, USA: IEEE, 2010, pp. 547–547. doi: 10.1109/DCC.2010.90.
[21]K. Kulkarni, S. Lohit, P. Turaga, R. Kerviche, and A. Ashok, “ReconNet: Non-Iterative Reconstruction of Images from Compressively Sensed Measurements,” in 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Las Vegas, NV, USA: IEEE, Jun. 2016, pp. 449–458. doi: 10.1109/CVPR.2016.55.
[22]W. Shi, F. Jiang, S. Zhang, and D. Zhao, “Deep networks for Compressed Image Sensing,” in 2017 IEEE International Conference on Multimedia and Expo (ICME), Hong Kong, Hong Kong: IEEE, Jul. 2017, pp. 877–882. doi: 10.1109/ICME.2017.8019428.
[23]W. Cui, S. Liu, F. Jiang, and D. Zhao, “Image Compressed Sensing Using Non-Local Neural Network,” IEEE Trans. Multimed., vol. 25, pp. 816–830, 2023, doi: 10.1109/TMM.2021.3132489.
[24]S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, “Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers,” Found. Trends® Mach. Learn., vol. 3, no. 1, pp. 1–122, Jul. 2011, doi: 10.1561/2200000016.
[25]A. Maleki, “Approximate Message Passing Algorithms for Compressed Sensing,” Stanford University, 2010.
[26]J. Zhang and B. Ghanem, “ISTA-Net: Interpretable Optimization-Inspired Deep Network for Image Compressive Sensing,” in 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, Salt Lake City, UT: IEEE, Jun. 2018, pp. 1828–1837. doi: 10.1109/CVPR.2018.00196.
[27]Y. Yang, J. Sun, H. Li, and Z. Xu, “ADMM-CSNet: A Deep Learning Approach for Image Compressive Sensing,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 42, no. 3, pp. 521–538, Mar. 2020, doi: 10.1109/TPAMI.2018.2883941.
[28]Z. Zhang, Y. Liu, J. Liu, F. Wen, and C. Zhu, “AMP-Net: Denoising-Based Deep Unfolding for Compressive Image Sensing,” IEEE Trans. Image Process., vol. 30, pp. 1487–1500, 2021, doi: 10.1109/TIP.2020.3044472.
[29]J. Song, B. Chen, and J. Zhang, “Memory-Augmented Deep Unfolding Network for Compressive Sensing,” in Proceedings of the 29th ACM International Conference on Multimedia, Virtual Event China: ACM, Oct. 2021, pp. 4249–4258. doi: 10.1145/3474085.3475562.
[30]J. Zhang, C. Zhao, and W. Gao, “Optimization-Inspired Compact Deep Compressive Sensing,” IEEE J. Sel. Top. Signal Process., vol. 14, no. 4, pp. 765–774, May 2020, doi: 10.1109/JSTSP.2020.2977507.
[31]B. Chen and J. Zhang, “Content-Aware Scalable Deep Compressed Sensing,” IEEE Trans. Image Process., vol. 31, pp. 5412–5426, 2022, doi: 10.1109/TIP.2022.3195319.
[32]W. Shi, F. Jiang, S. Liu, and D. Zhao, “Scalable Convolutional Neural Network for Image Compressed Sensing,” in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Long Beach, CA, USA: IEEE, Jun. 2019, pp. 12282–12291. doi: 10.1109/CVPR.2019.01257.
[33]M. Shen, H. Gan, C. Ning, Y. Hua, and T. Zhang, “TransCS: A Transformer-Based Hybrid Architecture for Image Compressed Sensing,” IEEE Trans. Image Process., vol. 31, pp. 6991–7005, 2022, doi: 10.1109/TIP.2022.3217365.
[34]D. Ye, Z. Ni, H. Wang, J. Zhang, S. Wang, and S. Kwong, “CSformer: Bridging Convolution and Transformer for Compressive Sensing,” IEEE Trans. Image Process., vol. 32, pp. 2827–2842, 2023, doi: 10.1109/TIP.2023.3274988.
[35]C. Guo, Z. Zhang, Z. Yang, Y. Yin, and Z. Huo, “Deep Learning-Based Compressed Sensing for Image and UWB Signal Reconstruction,” IEEE Sens. J., vol. 25, no. 12, pp. 22228–22238, Jun. 2025, doi: 10.1109/JSEN.2025.3565292.
[36]B. Chen, X. Zhang, S. Liu, Y. Zhang, and J. Zhang, “Self-supervised Scalable Deep Compressed Sensing,” Int. J. Comput. Vis., vol. 133, no. 2, pp. 688–723, Feb. 2025, doi: 10.1007/s11263-024-02209-1.
[37]B. Chen et al., “Invertible Diffusion Models for Compressed Sensing,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 47, no. 5, pp. 3992–4006, May 2025, doi: 10.1109/TPAMI.2025.3538896.
[38]B. Zheng, G. Sun, H. Zhang, and P. Zhang, “Deep Unfolding Architecture Based on Generative Prior Diffusion for Image Compressive Sensing,” IEEE Signal Process. Lett., vol. 32, pp. 2878–2882, 2025, doi: 10.1109/LSP.2025.3586178.
[39]M. Jurka et al., “Deep-Learning-based Reconstruction of T2-weighted Magnetic Resonance Imaging of the Prostate Accelerated by Compressed Sensing Provides Improved Image Quality at Half the Acquisition Time,” Quant. Imaging Med. Surg., vol. 14, no. 5, pp. 3534–3543, May 2024, doi: 10.21037/qims-23-1488.
[40]O. N. Jaspan, R. Fleysher, and M. L. Lipton, “Compressed Sensing MRI: A Review of the Clinical Literature,” Br. J. Radiol., vol. 88, no. 1056, p. 20150487, Dec. 2015, doi: 10.1259/bjr.20150487.
[41]S. Yang, M. Wang, P. Li, L. Jin, B. Wu, and L. Jiao, “Compressive Hyperspectral Imaging via Sparse Tensor and Nonlinear Compressed Sensing,” IEEE Trans. Geosci. Remote Sens., vol. 53, no. 11, pp. 5943–5957, Nov. 2015, doi: 10.1109/TGRS.2015.2429146.
[42]Y. Sun, C. Cui, J. Lu, and Q. Wang, “Data compression and Reconstruction of Smart Grid Customers based on Compressed Sensing Theory,” Int. J. Electr. Power Energy Syst., vol. 83, pp. 21–25, Dec. 2016, doi: 10.1016/j.ijepes.2016.03.051.
[43]H.-J. Jo, H. Lee, J. Choi, and W. Lee, “Hybrid Deterministic Sensing Matrix for Compressed Drone SAR Imaging and Efficient Reconstruction of Subsurface Targets,” Remote Sens., vol. 17, no. 4, p. 595, Feb. 2025, doi: 10.3390/rs17040595.
[44]J. Choi and W. Lee, “Drone SAR Image Compression Based on Block Adaptive Compressive Sensing,” Remote Sens., vol. 13, no. 19, p. 3947, Oct. 2021, doi: 10.3390/rs13193947.
[45]K. G. Larsen and J. Nelson, “The Johnson-Lindenstrauss Lemma is Optimal for Linear Dimensionality Reduction,” Nov. 10, 2014, arXiv: arXiv:1411.2404. doi: 10.48550/arXiv.1411.2404.
[46]S. Dasgupta and A. Gupta, “An elementary proof of a theorem of Johnson and Lindenstrauss,” Random Struct. Algorithms, vol. 22, no. 1, pp. 60–65, Jan. 2003, doi: 10.1002/rsa.10073.
[47]D. Achlioptas, “Database-friendly random projections,” in Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, Santa Barbara California USA: ACM, May 2001, pp. 274–281. doi: 10.1145/375551.375608.
[48]N. Linial, E. London, and Y. Rabinovich, “The Geometry of Graphs and Some of its Algorithmic Applications,” Combinatorica, vol. 15, no. 2, pp. 215–245, Jun. 1995, doi: 10.1007/BF01200757.
[49]Y. Chen et al., “Drop an Octave: Reducing Spatial Redundancy in Convolutional Neural Networks With Octave Convolution,” in 2019 IEEE/CVF International Conference on Computer Vision (ICCV), Seoul, Korea (South): IEEE, Oct. 2019, pp. 3434–3443. doi: 10.1109/ICCV.2019.00353.
[50]Zhou Wang, A. C. Bovik, H. R. Sheikh, and E. P. Simoncelli, “Image Quality Assessment: from Error Visibility to Structural Similarity,” IEEE Trans. Image Process., vol. 13, no. 4, pp. 600–612, Apr. 2004, doi: 10.1109/TIP.2003.819861.
[51]J.-B. Huang, A. Singh, and N. Ahuja, “Single Image Super-Resolution from Transformed Self-Exemplars,” in 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Boston, MA, USA: IEEE, Jun. 2015, pp. 5197–5206. doi: 10.1109/CVPR.2015.7299156.
[52]Signal and Image Processing Institute, University of Southern California, “USC-SIPI Image Dataset.” [Online]. Available: https://sipi.usc.edu/database/ accessed on 08/08/2026.
[53]P. P V and D. Sankar, “Handwriting-Based Text Line Segmentation from Malayalam Documents,” Appl. Sci., vol. 13, no. 17, p. 9712, Aug. 2023, doi: 10.3390/app13179712.
[54]P. Zhu et al., “Detection and Tracking Meet Drones Challenge,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 44, no. 11, pp. 7380–7399, Nov. 2022, doi: 10.1109/TPAMI.2021.3119563.
[55]B. Lim, S. Son, H. Kim, S. Nah, and K. M. Lee, “Enhanced Deep Residual Networks for Single Image Super-Resolution,” in 2017 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), Honolulu, HI, USA: IEEE, Jul. 2017, pp. 1132–1140. doi: 10.1109/CVPRW.2017.151.
[56]P. Arbeláez, M. Maire, C. Fowlkes, and J. Malik, “Contour Detection and Hierarchical Image Segmentation,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 5, pp. 898–916, May 2011, doi: 10.1109/TPAMI.2010.161.

International Journal of Image, Graphics and Signal Processing (IJIGSP)