Show simple item record

dc.contributor.author Liu, Yonghuai
dc.date.accessioned 2011-11-08T13:46:10Z
dc.date.available 2011-11-08T13:46:10Z
dc.date.issued 2009-06-01
dc.identifier.citation Liu , Y 2009 , ' Replicator Dynamics in the Iterative Process for Accurate Range Image Matching ' International Journal of Computer Vision , vol 83 , no. 1 , pp. 30-56 . , 10.1007/s11263-009-0210-8 en
dc.identifier.issn 0920-5691
dc.identifier.other PURE: 173252
dc.identifier.other dspace: 2160/7679
dc.identifier.uri http://hdl.handle.net/2160/7679
dc.description Liu, Y. (2009). Replicator Dynamics in the Iterative Process for Accurate Range Image Matching. International Journal of Computer Vision, 83 (1), 30-56 en
dc.description.abstract Iterative algorithms are often used for range image matching. In this paper, we treat the iterative process of range image matching as a live biological system: evolving from one generation to another. Whilst different generations of the population are regarded as range images captured at different viewpoints, the iterative process is simulated using time. The well-known replicator equations in theoretical biology are then adapted to estimate the probabilities of possible correspondences established using the traditional closest point criterion. To reduce the effect of image resolutions on the final results for efficient and robust overlapping range image matching, the relative fitness difference (rather than the absolute fitness difference) is employed in the replicator equations in order to model the probability change of possible correspondences being real over successive iterations. The fitness of a possible correspondence is defined as the negative of a power of its squared Euclidean distance. While the replicator dynamics penalize those individuals with low fitness, they are further penalised with a parameter, since distant points are often unlikely to represent their real replicators. While the replicator equations assume that all individuals are equally likely to meet each other and thus treat them equally, we penalise those individuals competing for the same points as their possible replicators. The estimated probabilities of possible correspondences being real are finally embedded into the powerful deterministic annealing scheme for global optimization, resulting in the camera motion parameters being estimated in the weighted least squares sense. A comparative study based on real range images with partial overlap has shown that the proposed algorithm is promising for automatic matching of overlapping range images. en
dc.format.extent 27 en
dc.language.iso eng
dc.relation.ispartof International Journal of Computer Vision en
dc.subject Replicator dynamics en
dc.subject Iterative process en
dc.subject Accurate matching en
dc.subject Overlapping range images en
dc.subject Fitness en
dc.subject Probability of a possible correspondence being real en
dc.title Replicator Dynamics in the Iterative Process for Accurate Range Image Matching en
dc.type Text en
dc.type.publicationtype Article (Journal) en
dc.identifier.doi http://dx.doi.org/10.1007/s11263-009-0210-8
dc.contributor.institution Department of Computer Science en
dc.contributor.institution Vision, Graphics and Visualisation Group en
dc.description.status Peer reviewed en


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Cadair


Advanced Search

Browse

Statistics