Robust multi-view correspondence of noisy 2D points using relaxation
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Lee, DH | ko |
| dc.contributor.author | Jung, SK | ko |
| dc.contributor.author | Wohn, Kwang-Yun | ko |
| dc.date.accessioned | 2013-03-02T16:58:36Z | - |
| dc.date.available | 2013-03-02T16:58:36Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 2000-04 | - |
| dc.identifier.citation | ELECTRONICS LETTERS, v.36, no.8, pp.719 - 720 | - |
| dc.identifier.issn | 0013-5194 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/74575 | - |
| dc.description.abstract | An efficient ghost removal algorithm for reliably extracting correspondence information for 2D points from several views using epipolar constraints is proposed. The point matching relations are modelled using a weighted k-partite graph and a globally convergent iterative algorithm is used to extract reliable maximum cliques from the graph using probabilistic relaxation labelling. Experimental results show the effectiveness of the proposed method. | - |
| dc.language | English | - |
| dc.publisher | IEE-INST ELEC ENG | - |
| dc.title | Robust multi-view correspondence of noisy 2D points using relaxation | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000086845500017 | - |
| dc.identifier.scopusid | 2-s2.0-0033885671 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 36 | - |
| dc.citation.issue | 8 | - |
| dc.citation.beginningpage | 719 | - |
| dc.citation.endingpage | 720 | - |
| dc.citation.publicationname | ELECTRONICS LETTERS | - |
| dc.contributor.localauthor | Wohn, Kwang-Yun | - |
| dc.contributor.nonIdAuthor | Lee, DH | - |
| dc.contributor.nonIdAuthor | Jung, SK | - |
| dc.type.journalArticle | Article | - |
- Appears in Collection
- GCT-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 1 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.