Cost-efficient compressive sensing of large-scale images with quickly reconstructed high-quality results is very challenging. In this paper, we present an algorithm to solve convex optimization via the tree structure sparsity pattern, which can be run in the operator to reduce computation cost and maintain good quality, especially for large-scale images. We also provide convergence analysis and convergence rate analysis for the proposed method. The feasibility of our method is verified through simulations and comparison with the state-of-the-art algorithms.
All Science Journal Classification (ASJC) codes