Sökning: onr:"swepub:oai:DiVA.org:kth-58946" >
Segmentation and cl...
Segmentation and classification of edges using minimum description length approximation and complementary junction cues
-
- Lindeberg, Tony, 1964- (författare)
- KTH,Beräkningsbiologi, CB
-
- Li, Meng-Xiang (författare)
- KTH,Datorseende och robotik, CVAP
-
(creator_code:org_t)
- World Scientific, 1995
- 1995
- Engelska.
-
Ingår i: Theory and Applications of Image Analysis II. - : World Scientific.
- Relaterad länk:
-
http://www.csc.kth.s...
-
visa fler...
-
https://kth.diva-por... (primary) (Raw object)
-
https://urn.kb.se/re...
-
visa färre...
Abstract
Ämnesord
Stäng
- This article presents a method for segmenting and classifying edges using minimum description length (MDL) approximation with automatically generated break points. A scheme is proposed where junction candidates are first detected in a multi-scale pre-processing step, which generates junction candidates with associated regions of interest. These junction features are matched to edges based on spatial coincidence. For each matched pair, a tentative break point is introduced at the edge point closest to the junction. Finally, these feature combinations serve as input for an MDL approximation method which tests the validity of the break point hypotheses and classifies the resulting edge segments as either ``straight'' or ``curved''. Experiments on real world image data demonstrate the viability of the approach.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datorseende och robotik (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Vision and Robotics (hsv//eng)
Nyckelord
- curve segmentation
- minimum description length
- junction detection
- edge detection
- curvature
- classification
- object recognition
- computer vision
Publikations- och innehållstyp
- ref (ämneskategori)
- kap (ämneskategori)
Hitta via bibliotek
Till lärosätets databas