| 1. |
- Lindeberg, Tony, 1964-, et al.
(författare)
-
Automatic generation of break points for MDL based curve classification
- 1995
-
Ingår i: Scandinavian Conference on Image Analysis. ; , s. 767-776
-
Konferensbidrag (refereegranskat)abstract
- 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.
|
|
| 2. |
- Lindeberg, Tony, 1964-, et al.
(författare)
-
Segmentation and classification of edges using minimum description length approximation and complementary junction cues
- 1995
-
Ingår i: Theory and Applications of Image Analysis II. - : World Scientific.
-
Bokkapitel (refereegranskat)abstract
- 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.
|
|
| 3. |
- Lindeberg, Tony, 1964-, et al.
(författare)
-
Segmentation and classification of edges using minimum description length approximation and complementary junction cues
- 1997
-
Ingår i: Computer Vision and Image Understanding. - : Elsevier. - 1077-3142 .- 1090-235X. ; 67:1, s. 88-98
-
Tidskriftsartikel (refereegranskat)abstract
- 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 multiscale preprocessing 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.
|
|
