Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

SSIAI
2002
IEEE

favoriteEmaildiscussreport

275views Image Analysis» more SSIAI 2002»

Matching Patterns of Line Segments by Eigenvector Decomposition

13 years 9 months ago

Matching Patterns of Line Segments by Eigenvector Decomposition

Download hub.hku.hk

This paper presents an algorithm for matching line segments in two images which are related by an affine transformation. Images are represented as patterns of line segments. Areas defined between line segments are used to describe a line pattern in the form of a proximity matrix. Matches are determined by comparing the feature vectors obtained from eigenvalue decomposition of the proximity matrices. Reliable matches of line segments are obtained in both synthetic and real images.

H. B. Chan, Y. S. Hung

Real-time Traffic

Affine Transformation | Image Analysis | Line Pattern | Line Segments | SSIAI 2002 |

claim paper

Related Content

» Pattern matching for sets of segments

» Tiling an Interval of the Discrete Line

» Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem

» Polygon decomposition based on the straight line skeleton

» LexiconDriven Segmentation and Recognition of Handwritten Character Strings for Japanese A...

» A general framework for vessel segmentation in retinal images

» Sweepline the Music

» Matching planar maps

» Partial Matching of Planar Polylines Under Similarity Transformations

Post Info
More Details (n/a)

Added	16 Jul 2010
Updated	16 Jul 2010
Type	Conference
Year	2002
Where	SSIAI
Authors	H. B. Chan, Y. S. Hung

Comments (0)