DMCA
Segmentation and Classification of Edges Using Minimum Description Length Approximation and Complementary Junction Cues (1996)
Cached
Download Links
- [ftp.nada.kth.se]
- [ftp.nada.kth.se]
- [ftp.nada.kth.se]
- DBLP
Other Repositories/Bibliography
| Citations: | 17 - 1 self |
BibTeX
@MISC{Lindeberg96segmentationand,
author = {Tony Lindeberg and Meng-xiang Li},
title = {Segmentation and Classification of Edges Using Minimum Description Length Approximation and Complementary Junction Cues},
year = {1996}
}
Share
 |
 |
 |
 |
||
OpenURL
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 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.
Keyphrases
complementary junction cue junction candidate real world image data break point multi-scale preprocessing step break point hypothesis edge point closest spatial coincidence straight quot feature combination minimum description length tentative break point mdl approximation method edge segment junction feature associated region
