Baum-Eagon inequality in probabilistic labeling problems
AbstractThis work illustrates an approach to the study of labeling, aka 'object classification'. This kind of parallel computing problem well suites to AI applications (pattern recognition, edge detection, etc.) Our target consists in simplifying an overly computationally costly algorithm proposed by Faugeras and Berthod; using Baum-Eagon theorem, we obtained a reduced algorithm which produces results comparable with other more complex approaches.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by EconWPA in its series Experimental with number 0509003.
Length: 12 pages
Date of creation: 07 Sep 2005
Date of revision:
Note: Type of Document - pdf; pages: 12
Contact details of provider:
Web page: http://18.104.22.168
labeling; artificial intelligence; edge detection; probabilistic algorithms; pixel classification;
Find related papers by JEL classification:
- C9 - Mathematical and Quantitative Methods - - Design of Experiments
This paper has been announced in the following NEP Reports:
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (EconWPA).
If references are entirely missing, you can add them using this form.