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.
Original language | English |
---|---|
Pages (from-to) | 719-720 |
Number of pages | 2 |
Journal | Electronics Letters |
Volume | 36 |
Issue number | 8 |
DOIs | |
State | Published - 13 Apr 2000 |