The Community for Technology Leaders
Image Analysis and Interpretation, IEEE Southwest Symposium on (2000)
Austin, Texas
Apr. 2, 2000 to Apr. 4, 2000
ISBN: 0-7695-0595-3
pp: 78
Linda S. DeBrunner , University of Oklahoma
Victor DeBrunner , University of Oklahoma
Minghua Yao , C-Cube Microsystems Milpitas
ABSTRACT
We propose the concept of asymptotic projections onto convex sets (APOCS) in general and a wavelet-based, edge-retaining asymptotic POCS (ERAPOCS) algorithm for image interpolation in particular. APOCS differs from POCS in that the projections sequence in one (or more) of the convex sets can enter a desired region rapidly. Like POCS, our proposed algorithm is guaranteed to converge. Our new algorithm alleviates edge blurring by properly amplifying the WT of the image. The amplification in the WT domain biases the projection sequence to the subset of interpolated images that has less edge-blurring. Simulations show that our proposed algorithm performs better in the sense of PSNR and preserves the sharpness of the edges better than do the cubic interpolation and the POCS algorithms. In addition, our algorithm is more computationally efficient than the POCS algorithm since it converges in fewer iterations and has the same computational complexity.
INDEX TERMS
Image Interpolation, POCS, Edges
CITATION

V. DeBrunner, L. S. DeBrunner and M. Yao, "Edge-Retaining Asymptotic Projections onto Convex Sets for Image Interpolation," Image Analysis and Interpretation, IEEE Southwest Symposium on(SSIAI), Austin, Texas, 2000, pp. 78.
doi:10.1109/IAI.2000.839575
84 ms
(Ver 3.3 (11022016))