File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/IAI.2002.999934
- Scopus: eid_2-s2.0-52049114853
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Matching patterns of line segments by eigenvector decomposition
Title | Matching patterns of line segments by eigenvector decomposition |
---|---|
Authors | |
Keywords | Computer vision Eigenvalues and eigenfunctions Equations Image edge detection Image segmentation Matrix decomposition Pattern matching Testing World Wide Web |
Issue Date | 2002 |
Publisher | IEEE. |
Citation | The 5th IEEE Southwest Symposium on Image Analysis and Interpretation Proceedings, Sante Fe, NM., 7-9 April 2002, p. 286-289 How to Cite? |
Abstract | 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. |
Persistent Identifier | http://hdl.handle.net/10722/46292 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chan, BHB | en_HK |
dc.contributor.author | Hung, YS | en_HK |
dc.date.accessioned | 2007-10-30T06:46:38Z | - |
dc.date.available | 2007-10-30T06:46:38Z | - |
dc.date.issued | 2002 | en_HK |
dc.identifier.citation | The 5th IEEE Southwest Symposium on Image Analysis and Interpretation Proceedings, Sante Fe, NM., 7-9 April 2002, p. 286-289 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/46292 | - |
dc.description.abstract | 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. | en_HK |
dc.format.extent | 482377 bytes | - |
dc.format.extent | 1795 bytes | - |
dc.format.extent | 3891 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.format.mimetype | text/plain | - |
dc.format.mimetype | text/plain | - |
dc.language | eng | en_HK |
dc.publisher | IEEE. | en_HK |
dc.relation.ispartof | IEEE Southwest Symposium on Image Analysis and Interpretation Proceedings | - |
dc.rights | ©2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.subject | Computer vision | - |
dc.subject | Eigenvalues and eigenfunctions | - |
dc.subject | Equations | - |
dc.subject | Image edge detection | - |
dc.subject | Image segmentation | - |
dc.subject | Matrix decomposition | - |
dc.subject | Pattern matching | - |
dc.subject | Testing | - |
dc.subject | World Wide Web | - |
dc.title | Matching patterns of line segments by eigenvector decomposition | en_HK |
dc.type | Conference_Paper | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/IAI.2002.999934 | en_HK |
dc.identifier.scopus | eid_2-s2.0-52049114853 | - |
dc.identifier.hkuros | 70032 | - |