Image Reconstruction Algorithm Using R-Tree Approach and Delaunay Triangulation

Rohit Sharma, Sanjiv Kumar Shriwastava, Amit Kumar Shrivastava

Abstract


To perform image reconstruction, the significant pixels need to be found. For this image segmentation is performed. Image segmentation can be considered as a cluster procedure in feature space. Each cluster can be encapsulated in a bounding box which contains the connected parts of the edges found using edge-detection techniques like canny, sobel or a combination of both. The boxes can further be stored in R-trees using suitable child – parent relationship. In this paper, we will explore to use a combination of canny and sobel edge detection techniques and then store the edges in R-tree to perform image segmentation. Then Delaunay triangulation is performed to produce the reconstructed image.


Keywords: Image Reconstruction, Edge Detection, R-Tree, Delaunay Triangulation


Full Text:

PDF


DOI: https://doi.org/10.26483/ijarcs.v3i3.1150

Refbacks

  • There are currently no refbacks.




Copyright (c) 2016 International Journal of Advanced Research in Computer Science