Utilize este identificador para referenciar este registo:
|Título:||A Novel Memory-Efficient Fast Algorithm for 2-D|
|Resumo:||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.|
|Aparece nas colecções:||ESTGV - DMAT - Artigos publicados em revista científica (Indexados à ISI)|
Ficheiros deste registo:
|WCICA-2010.pdf||693,44 kB||Adobe PDF||Ver/Abrir Acesso Restrito. Solicitar cópia ao autor!|
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.