Fast Object Recognition Using Dynamic Programming from a Combination of Salient Line Groups

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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 languageEnglish
Title of host publicationComputer-Aided Intelligent Recognition Techniques and Applications
PublisherJohn Wiley & Sons, Ltd
Pages345-361
Number of pages17
ISBN (Print)0470094141, 9780470094143
DOIs
StatePublished - 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

Fingerprint

Dive into the research topics of 'Fast Object Recognition Using Dynamic Programming from a Combination of Salient Line Groups'. Together they form a unique fingerprint.

Cite this