A shortest path algorithm for optimal boundary extraction in image processing
Author & Affiliation:
R. Sophia Porchelvi (sophiaporcheivi@gmail.com
Department of mathematics A.D.M. College for women, (Autonomous) Nagappattinam - 611 001 Tamil Nadu (INDIA)
R. Judith kiruba (judith.kirubal@gmail.com)
Department of Computer Science T.B. M.L. College, Porayar - 609307, Tamil Nadu (INDIA)
R. Irene Hepzibah (irnehepzibah@gmail.com)
Department of mathematics A.V.C., College of Engineering, Mayiladuthurai - 609 305 Tamil Nadu (INDIA)
Keyword:
Optimal Boundary Extraction, Edge Detection, Dynamic Programming, Search Algorithms, Shortest Path
Issue Date:
December 2010
Abstract:
This paper introduces an algorithm for optimal boundary extraction based on representing edge segments in the form of a graph. This algorithm proposes a method for finding the shortest path, based on Critical path method, which is nothing but the optimal boundary. A program has been developed for finding the shortest path. The effectiveness of the algorithm is illustrated by means of an example and some concluding remarks are provided at the last.
Pages:
741-746
ISSN:
2319-8044 (Online) - 2231-346X (Print)
Source:
PDF:
DOI:
jusps-A
Share This:
Copy the following to cite this article:
R. S. Porchelvi; R. J. Kiruba; R. I. Hepzibah, "A shortest path algorithm for optimal boundary extraction in image processing", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 3, Page Number 741-746, 2018Copy the following to cite this URL:
R. S. Porchelvi; R. J. Kiruba; R. I. Hepzibah, "A shortest path algorithm for optimal boundary extraction in image processing", Journal of Ultra Scientist of Physical Sciences, Volume 22, Issue 3, Page Number 741-746, 2018Available from: https://www.ultrascientist.org/paper/952/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
