A Novel Memory-Efficient Fast Algorithm for 2-D

• Autor(a) principal: Wang, Huiyuan
• Data de Publicação: 2010
• Outros Autores: Vieira, José, Jesus, Bruno, Duarte, Isabel, Ferreira, Paulo
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10400.19/2502
• topic: Compressed sensing; 2-D transform; Image reconstruction; Imaging sampling

The basic theories of compressed sensing (CS) turn around the sampling and reconstruction of 1-D signals. To deal with 2-D signals (images), the conventional treatment is to convert them into1-D vectors. This has drawbacks, including huge memory demands and difficulties in the design and calibration of the optical imaging systems. As a result, in 2009 some researchers proposed the concept of compressed imaging (CI) with separable sensing operators. However, their work is only focused on the sampling phase. In this paper, we propose a scheme for 2-D CS that is memory- and computation-efficient in both sampling and reconstruction. This is achieved by decomposing the 2-D CS problem into two stages with the help of an intermediate image. The intermediate image is then solved by direct orthogonal linear transform and the original image is reconstructed by solving a set of 1-D l1-norm minimization sub-problems. The experimental results confirm the feasibility of the proposed scheme.