Stable Sparse Model with Non-Tight Frame
Source abstract
Abstract
Overcomplete representation is attracting interest in image restoration due to its potential to generate sparse representations of signals. However, the problem of seeking sparse representation must be unstable in the presence of noise. Restricted Isometry Property (RIP), playing a crucial role in providing stable sparse representation, has been ignored in the existing sparse models as it is hard to integrate into the conventional sparse models as a regularizer. In this paper, we propose a stable sparse model with non-tight frame (SSM-NTF) via applying the corresponding frame condition to approximate RIP. Our SSM-NTF model takes into account the advantage of the traditional sparse model, and meanwhile contains RIP and closed-form expression of sparse coefficients which ensure stable recovery. Moreover, benefitting from the pair-wise of the non-tight frame (the original frame and its dual frame), our SSM-NTF model combines a synthesis sparse system and an analysis sparse system. By enforcing the frame bounds and applying a second-order truncated series to approximate the inverse frame operator, we formulate a dictionary pair (frame pair) learning model along with a two-phase iterative algorithm. Extensive experimental results on image restoration tasks such as denoising, super resolution and inpainting show that our proposed SSM-NTF achieves superior recovery performance in terms of both subjective and objective quality.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Sparse and Compressive Sensing Techniques · Image and Signal Denoising Methods · Photoacoustic and Ultrasonic Imaging
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Beijing Key Laboratory of Multimedia and Intelligent Software Technology, Faculty of Information Technology, Beijing University of Technology, Beijing 100124, China
Computer Science and Technology, Dalian University of Technology, Dalian 116023, China
Funding
National Natural Science Foundation of China
References (37)
Show source-provided references
1. Data-driven tight frame construction and image denoising10.1016/j.acha.2013.10.001 ↗
2. Joint super resolution and denoising from a single depth image10.1109/TMM.2015.2457678 ↗
3. Rubinstein, R., Zibulevsky, M., and Elad, M. (2008). Efficient Implementation of the KSVD Algorithm and the Batch-OMP Method, Department of Computer Science, Technion. Tech. Rep.
4. Inpainting and zooming using sparse representations10.1093/comjnl/bxm055 ↗
5. Reduced-reference image quality assessment in free-energy principle and sparse representation10.1109/TMM.2017.2729020 ↗
6. Image super-resolution via adaptive sparse representation10.1016/j.knosys.2017.02.029 ↗
7. Fast single image super-resolution via self-example learning and sparse representation10.1109/TMM.2014.2364976 ↗
8. A fast iterative shrinkage thresholding algorithm for linear inverse problems10.1137/080716542 ↗
9. Elad, M. (2010). Sparse and Redundant Representations. From Theory to Applications in Signal and Image Processing, Springer.10.1007/978-1-4419-7011-4 ↗
10. Fast hyperspectral image denoising and inpainting based on low-rank and sparse representations10.1109/JSTARS.2018.2796570 ↗
11. Adaptive RD optimal sparse coding with quantization for image compression10.1109/TMM.2018.2847228 ↗
12. Pados, Compressed-sensed-domain l1-pca video surveillance10.1109/TMM.2016.2514848 ↗
13. Corrections to on the stable recovery of the sparsest overcomplete representations in presence of noise [oct 10 5396–5400]
14. Analysis KSVD: A dictionary-learning algorithm for the analysis sparse model10.1109/TSP.2012.2226445 ↗
15. Image denoising via sparse and redundant representations over learned dictionaries10.1109/TIP.2006.881969 ↗
16. Nonlocally centralized sparse representation for image restoration10.1109/TIP.2012.2235847 ↗
17. Distributed compressive sensing for cloud-based wireless image Transmission10.1109/TMM.2017.2654123 ↗
18. Qi, N., Shi, Y., Sun, X., and Yin, B. (2016, January 27–30). Tensr: Multi-dimensional tensor sparse representation. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA.10.1109/CVPR.2016.637 ↗
19. Temlyakov, Stable recovery of sparse overcomplete representations in the presence of noise10.1109/TIT.2005.860430 ↗
20. Bao, C., Cai, J.-F., and Ji, H. (2013, January 1–8). Fast sparsity-based orthogonal dictionary learning for image restoration. Proceedings of the IEEE International Conference on Computer Vision, ICCV 2013, Sydney, Australia.10.1109/ICCV.2013.420 ↗
21. Wang, J., Cai, J.-F., Shi, Y., and Yin, B. (2014, January 27–30). Incoherent dictionary learning for sparse representation based image denoising. Proceedings of the IEEE International Conference on Image Processing, ICIP 2014, Paris, France.10.1109/ICIP.2014.7025929 ↗
22. Decoding by linear programming10.1109/TIT.2005.858979 ↗
23. An rip-based performance guarantee of covariance-assisted matching pursuit10.1109/LSP.2018.2816573 ↗
24. Sparse recovery-based error concealment10.1109/TMM.2017.2662203 ↗
25. A proof of conjecture on restricted isometry property constants δt (0<t<4/3)10.1109/TIT.2017.2705741 ↗
26. New bounds for restricted isometry constants with coherent tight frames10.1109/TSP.2012.2226171 ↗
27. Compressed sensing image restoration based on data-driven multi-scale tight frame10.1016/j.cam.2016.03.011 ↗
28. Li, J., Zhang, W., Zhang, H., Li, L., and Yan, B. (2017, January 29–31). Data driven tight frames regularization for few-view image reconstruction. Proceedings of the 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2017, Guilin, China.10.1109/FSKD.2017.8393380 ↗
29. Projected iterative softthresholding algorithm for tight frames in compressed sensing magnetic resonance imaging10.1109/TMI.2016.2550080 ↗
30. Sensing matrix optimization based on equiangular tight frames with consideration of sparse representation error10.1109/TMM.2016.2595261 ↗
31. Stable signal reconstruction via l1-minimization in redundant, non-tight frames10.1109/TSP.2012.2222396 ↗
32. Expansion of frames to tight frames10.1007/s10114-008-6577-6 ↗
33. Regression Shrinkage and Selection Via the Lasso10.1111/j.2517-6161.1996.tb02080.x ↗
34. The cosparse analysis model and algorithms10.1016/j.acha.2012.03.006 ↗
35. Theory of compressive sensing via l1-minimization: A non-rip analysis and extensions10.1007/s40305-013-0010-2 ↗
36. Finite dimensional approximation of the inverse frame operator and applications to wavelet frames and Gabor frames10.1007/BF02510119 ↗
37. Image Super-Resolution Via Sparse Representation10.1109/TIP.2010.2050625 ↗