Reconstruction Torn Image Pieces

Abstract

In this work apply a polygonal approximation to in order to reduce the complexity of the boundaries and then extracts relevant features of the polygon to carry out the local reconstruct Thereafter, these features are used to feed the LCS dynamic programming algorithm, In this way, the overall complexity can be dramatically reduced because few features are used to perform the matching. The preliminary result is resolved and the pieces are match together as search for a global solution. The results, which take into account a limited amount of torn pieces, demonstrate through comprehensive experiments that this feature-matching based procedure produces interesting results for the problem of image reconstruction. longest common string dynamic programming algorithm and Douglas–Peucker algorithm the scores is a valid technique for solving this problem