A branch-and-bound technique for nano-structure image segmentation

IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops

Volumn 2, Issue , 2003, Pages 19-24

  Gat, Yoram ^a  

^a INTEL RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; COMPUTER VISION; NANOSTRUCTURES; PROBABILITY DISTRIBUTIONS;

BRANCH AND BOUND TECHNIQUES; BRANCH-AND-BOUND ALGORITHMS; GEOMETRIC MODELING; INTENSITY VARIATIONS; LINE SEGMENTATION; MAXIMUM A POSTERIORI PROBABILITIES; OBJECTIVE FUNCTIONS; PRIORI DISTRIBUTION;

IMAGE SEGMENTATION;

EID: 84954459029     PISSN: 21607508     EISSN: 21607516     Source Type: Conference Proceeding    
DOI: 10.1109/CVPRW.2003.10017     Document Type: Conference Paper

References (5)

1. Davies, E.R. (1997). Machine vision, Academic Press.
2. Huttenlocher, D.P., Klanderman, G.A. and Rucklidge W.J. (1993). Comparing Images Using the Hausdorff Distance, IEEE transactions on pattern analysis and machine intelligence 15 (9).
3. Mount D.M., Netanyahu N.S. and Le Moigne J. (1998). Efficient Algorithms for Robust Feature Matching, Pattern recognition 32 (13).
4. Russel, S. J. and Norvig, P. (1995). Artificial intelligence, Prentice Hall.
5. Shi, J. and Malik, J. (2000). Normalized cuts and image segmentation, IEEE transactions on pattern analysis and machine intelligence 22 (8).