Image Segmentation using Euler Graphs

Simple item page
dc.contributor.authorJanakiraman, T.N.
dc.contributor.authorChandra Mouli, P.V.S.S.R.
dc.date.accessioned2026-10-06T04:42:29Z
dc.date.available2026-10-06T04:42:29Z
dc.date.issued2010-09-01
dc.description.abstractThis paper presents a new algorithm for image segmentation problem using the concepts of Euler graphs in graph theory. By treating image as an undirected weighted non-planar finite graph (G), image segmentation is handled as graph partitioning problem. The proposed method locates region boundaries or clusters and runs in polynomial time. Subjective comparison and objective evaluation shows the efficacy of the proposed approach in different image domains. © 2006-2010 by CCC Publications.
dc.identifier.issn18419836
dc.identifier.urihttps://doi.org/10.15837/ijccc.2010.3.2484
dc.identifier.urihttp://nitt.ndl.gov.in/handle/123456789/304
dc.language.isoen
dc.publisherCCC Publications
dc.relation.ispartofseriesInternational Journal of Computers, Communications and Control; Vol. 5/ No. 3
dc.titleImage Segmentation using Euler Graphs
dc.typeArticle
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Image segmentation using Euler graphs.pdf
Size:
398.17 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
licence.pdf
Size:
86.57 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Journal Articles