Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Unsupervised Segmentation Using Map-ML Estimation


Affiliations
1 Department of Computer Science and Engineering, Manonmaniam Sundaranar University, Tirunelveli, India
     

   Subscribe/Renew Journal


Segmentation is an important problem of Image processing. It has attracted much attention due to its potential value for applications and its theoretical challenges. In this proposed System MAP-ML estimation is used to segment the objects in the images, The Proposed Method contains a Graph cut Algorithm to overcome computation complexity and over segmentation. This is an unsupervised algorithm which automatically segments the given input image into regions according to relevant texture and colors.

Keywords

Graph Cuts, Markov Random Fields, Maximum a Posteriori, Maximum Likelihood.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 206

PDF Views: 3




  • Unsupervised Segmentation Using Map-ML Estimation

Abstract Views: 206  |  PDF Views: 3

Authors

M. Sorna Selvi
Department of Computer Science and Engineering, Manonmaniam Sundaranar University, Tirunelveli, India
S. Antelin Vijila
Department of Computer Science and Engineering, Manonmaniam Sundaranar University, Tirunelveli, India
M. Mohammed Ashiqa
Department of Computer Science and Engineering, Manonmaniam Sundaranar University, Tirunelveli, India

Abstract


Segmentation is an important problem of Image processing. It has attracted much attention due to its potential value for applications and its theoretical challenges. In this proposed System MAP-ML estimation is used to segment the objects in the images, The Proposed Method contains a Graph cut Algorithm to overcome computation complexity and over segmentation. This is an unsupervised algorithm which automatically segments the given input image into regions according to relevant texture and colors.

Keywords


Graph Cuts, Markov Random Fields, Maximum a Posteriori, Maximum Likelihood.