Open Access Open Access  Restricted Access Subscription or Fee Access

Image Recovery Using APOCS

A. D. C. Navin Dhinnesh, K. G Srinivasagan, R. Rajakumari

Abstract


The proposed algorithm is a technique for recovering block based images of size 4 x 4. The algorithm is based on orthogonal projections onto constraint sets in a Hilbert space. For recovering the lost blocks, a total of 8N vectors are extracted from the surrounding area of an N X N missing blocks. From these vectors the best matching spatial information for the missing block is extracted. The vectors are used to find the highly correlated information relating to the lost pixels. To assure continuity with the surrounding undamaged area, convex constraints are formulated. Adherance to these sets is imposed using alternating projections.Characteristics of the results are those of the “LENA” image. The image quality is measured with the peak signal to noise ratio (PSNR)and it is 39.5952db for the recovered image with the proposed technique.


Keywords


Alternating Projections, Discrete Cosine Transform (DCT), Hilbert Space, Projection onto Convex Sets (POCS), Spatial Domain

Full Text:

PDF

References


Jiho Park, Dong-Chul Park, Robert J. Marks, and Mohamed A. El-Sharkawi, “Recovery of Image Blocks Using the Method of Alternating Projections,” IEEE Trans. Image Processing, vol.14, no.4, April 2005.

Yao Wang, Qin-Fan Zhu, and Leonard Shaw, “Maximally Smooth Image Recovery in Transform Coding”, IEEE Transactions On Communications, vol. 41, no. 10, Oct. 1993.

H. Sun and W.Kwok, “Concealment of damaged blocks transform coded images using projections onto convex sets,” IEEE Trans. Image Process., vol. 4, no. 4, pp. 470–477, Apr. 1995.

R. J. Marks II, “Alternating projections onto convex sets,” in Deconvolution of Images and Spectra, P. A. Jansson, Ed. San Diego,CA: Academic, 1997, pp. 476–501.

H. Stark and Y. Yang, Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics. New York:Wiley, 1998.

D. C. Youla and H. Webb, “Image restoration by the method of convex projections: Part I-theory,” IEEE Trans. Med. Imag., vol. MI-1, no. 1,pp. 81–94, Jan. 1982.

M. H. Goldburg and R. J. Marks II, “Signal synthesis in the presence of an inconsistent set of constraints,” IEEE Trans. Circuits Syst., vol. CAS-32, no. 4, pp. 647–663, Apr. 1985.

D. C. Youla and V. Velasco, “Extensions of a result on the synthesis of signals in the presence of inconsistent constraints,” IEEE Trans. Circuits Syst., vol. CAS-33, no. 4, pp. 465–468, Apr. 1986.

S. Oh, R. J. Marks, and L. E. Atlas, “Kernel synthesis for generalized time-frequency distributions using he method of alternating projections onto convex sets,” IEEE Trans. Signal Process., vol. 42, no. 7, pp. 1653–1661, Jul. 1994.

X. Lee, Y.-Q. Zhang, and A. Leon-Garcia, “Information loss recovery for block-based image coding techniques-a fuzzy logic approach,” IEEE Trans. Image Process., vol. 4, no. 3, pp. 259–273, Mar. 1995.

S. Tsekeridou and I. Pitas, “MPEG-2 error concealment based on blockmatching principles,” IEEE Trans. Circuits Syst. Video Technol.,vol. 10, no. 4, pp. 646–658, Jun. 2000.

Y.Yang, N. P. Galatsanos, and A. K. Katsaggelos, “Projection-based spatially adaptive reconstruction of block transform compressed images,” IEEE Trans. Image Process., vol. 4, no. 7, pp. 896–908, Jul.1995.

Y. Yang and N. P. Galatsanos, “Removal of compression artifacts using projections onto convex sets and line process modeling,” IEEE Trans.Image Process., vol. 10, no. 10, pp. 1345–1357, Oct. 1997.

A. Gersho and R. Gray, Vector Quantization and Signal Compression.Norwell, MA: Kluwer, 1992.

S. Shirani, F. Kossentini, and R. Ward, “Reconstruction of baseline JPEG coded images in error prone environments,” IEEE Trans.ImageProcess., vol. 9, no. 7, pp. 1292–1299, Jul. 2000.

Z. Alkachouh and M. G. Bellanger, “Fast DCT-based spatial domain interpolation of blocks in images,” IEEE Trans. Image Process., vol. 9,no. 4, pp. 729–732, Apr. 2000.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.