Image Segmentation using Euler Graphs | Zendy

T. N. Janakiraman | Zendy; Chandra Mouli | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Image Segmentation using Euler Graphs

Author(s) -

T. N. Janakiraman,

Chandra Mouli

Publication year - 2010

Publication title -

international journal of computers communications and control

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.422

H-Index - 33

eISSN - 1841-9844

pISSN - 1841-9836

DOI - 10.15837/ijccc.2010.3.2484

Subject(s) - image segmentation , image (mathematics) , computer science , segmentation , undirected graph , graph , euler's formula , segmentation based object categorization , artificial intelligence , mathematics , scale space segmentation , pattern recognition (psychology) , theoretical computer science , mathematical analysis

This paper presents a new algorithm for image segmentation problem us- ing 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 par- titioning 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research