Open Access Open Access  Restricted Access Subscription or Fee Access

Reassembly and Restoration of Cracks in Fragmented Images

S. Manimurugan, Sherin Soman

Abstract


For the reconstruction of fragmented images and objects a variety of image fragments need to be examined and reassembled. This problem often occurs in several scientific fields, where the manual reassembly of image fragments is very difficult. As the number of image fragments increases and the fragments are irregular in shape, it requires great amount of time and effort for the reassembly. This paper presents an effective reassembly technique for irregular image fragments and the restoration of cracks in the reassembled images. Here the spatial color histogram and the histogram intersection with each fragment is calculated. Then the contour pixel of each fragment is estimated. After the reassembly of image fragments, cracks can be formed. These cracks can be removed using the inpainting technique. The inpainting algorithm, which implements the filling of damaged region with impressive results. The core focus of the reassembly technique is on how to reassemble as many fragments as possible and at the same time to reduce the false matching contour pixels and to remove the cracks formed in the reconstructed image. We have analyzed the performance of the proposed reassembly technique using different number of image fragments and obtained satisfactory results.

Keywords


Crack, Fragment, Inpainting, Restoration

Full Text:

PDF

References


Qi-Xing Huang, Simon, Natasha Gelfand, Michael Hofer, Helmut Pottmann, “Reassembling Fractured Objects by Geometric Matching,”ACM Transactions on Graphics, Vol. 25, Issue 3, July 2006.

Amenta N., And Kil Y. “Defining point-set surfaces”. ACM Trans. Graph. 23, 3, 264–270, 2004.

H. Alt, L. Scharf, and S. Scholz, “Probabilistic matching of sets of polygonal curves,” In Proc. 22nd European Workshop on Computational Geometry (EWCG), pp. 107 110, Mar.2006.

E. Justino, L. S. Oliveira, and C. Freitas, “Reconstructing shredded documents through feature matching,” Fores. Sci. Int., vol. 160, pp. 140–147, 2006.

H. C. G. Leitao and J. Stolfi, “A multiscale method for the reassembly of two dimensional fragmented objects,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 9, pp. 1239–1251, Sep. 2002.

F. Amigo, S. Gazing, and S. Podico, “A method for reassembling fragments in image reconstruction,” In Proc. Int. Conf. Image Processing, pp. 581–584,Sep. 2003.

H. Wolfson, “On curve matching,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 5, pp.483–489, May 1990.

Efthymia Tsamoura and Ioannis Pitas,“Automatic Color Based Reassembly of Fragmented Images and Paintings,” IEEE Transactions on Image Processing, vol. 19, no. 3, pp 680-690,Mar 2010.

G. C. Sharp, S. W. Lee, and D. K. Wehe, “Icp registration using invariant features,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no.1, pp. 90–102, Jan. 2002.

M. A. Gavrielides, E. Sikudova, and I. Pitas, “Color based descriptors for image fingerprinting,” IEEE Trans. Multimedia, vol. 8, no. 4, pp. 740–748, Aug. 2006

A. R. Willis and D. B. Cooper, “Computational reconstruction of ancient artifacts,” IEEE Signal Process. Mag., pp. 165–183, Jul. 2008.

J. Salvi, C. Matabosch, D. Fofi, and J. Forest, “A review of recent range image registration methods with accuracy evaluation,” Image Vis. Comput., vol. 25, no. 5, pp. 578–596, 2007.

D. Chetverikov,D. Svirko, D. Stepanov, and P. Krsek, “The trimmed iterative closest point algorithm,” in Proc. 16th Int. Conf. Pattern Recognition, 2002, vol. 3, pp. 545–548.

W. Kong and B. B. Kimia, “On solving 2D and 3D puzzles using curve matching,” in Proc. IEEE Computer Society Conference on ComputerVision and Pattern Recognition, 2001, vol. 2, pp. 583–590.

S. Rusinkiewicz and M. Levoy, “Efficient variants of the ICP algorithm,”in Proc . 3rd Int. Conf. 3D Digital Imaging and Modeling (3DIM), Jun. 2001, pp. 145–152.

D. Arthur and S. Vassilvitskii, “Worst-case and smoothed analysis of the icp algorithm, with an application to the k-means method,” in Proc. 47th Annu. IEEE Symp. Foundations of Computer Science (FOCS), 2006, pp. 153–164.

L. Zhu, Z. Zhou, and D. Hu, “Globally consistent reconstruction of ripped-up documents,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 30, no. 1, pp. 1–13, Jan. 2008.


Refbacks

  • There are currently no refbacks.


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