Abstract
Block-based random image sampling is coupled with a projection-driven compressed-sensing recovery that encourages sparsity in the domain of directional transforms simultaneously with a smooth reconstructed image. Both contourlets as well as complex-valued dual-tree wavelets are considered for their highly directional representation, while bivariate shrinkage is adapted to their multiscale decomposition structure to provide the requisite sparsity constraint. Smoothing is achieved via a Wiener filter incorporated into iterative projected Landweber compressed-sensing recovery, yielding fast reconstruction. The proposed approach yields images with quality that matches or exceeds that produced by a popular, yet computationally expensive, technique which minimizes total variation. Additionally, reconstruction quality is substantially superior to that from several prominent pursuits-based algorithms that do not include any smoothing. ©2009 IEEE.
Author supplied keywords
Cite
CITATION STYLE
Mun, S., & Fowler, J. E. (2009). Block compressed sensing of images using directional transforms. In Proceedings - International Conference on Image Processing, ICIP (pp. 3021–3024). IEEE Computer Society. https://doi.org/10.1109/ICIP.2009.5414429
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.