Abstract
This chapter presents a new method of grouping and matching line segments to recognize objects. Weproposeadynamicprogramming-basedformulationextracting salient line patternsbydefiningarobustand stable geometric representation that is based on perceptual organizations. As the end point proximity, we detect several junctions from image lines. We then search for junction groups by using the collinear constraint between the junctions. Junction groups similar to the model are searched in the scene, based on a local comparison. A DP-based search algorithm reduces the time complexity for the search of the model lines in the scene. The system is able to find reasonable line groups in a short time.
| Original language | English |
|---|---|
| Title of host publication | Computer-Aided Intelligent Recognition Techniques and Applications |
| Publisher | John Wiley & Sons, Ltd |
| Pages | 345-361 |
| Number of pages | 17 |
| ISBN (Print) | 0470094141, 9780470094143 |
| DOIs | |
| State | Published - 20 Dec 2005 |
Keywords
- Collinear constraint
- DP-based algorithm
- DP-based search algorithm
- Dynamic programming (DP)
- Extracting salient line segments
- Junction detection
- Junction detection algorithm
- Matching and grouping method
- Optimal matching application