Dynamic Feature Ordering for Efficient Registration
Abstract
Existing sequential feature based registration algorithms involving search typically either select features randomly (e.g. the RANSAC approach (M. Fischler and R. Bolles, 1981)) or assume a predefined, intuitive ordering for the features (e.g. based on size or resolution). The paper presents a formal framework for computing an ordering for features which maximizes search efficiency. Features are ranked according to matching ambiguity measure, and an algorithm is proposed which couples the feature selection with the parameter estimation, resulting in a dynamic feature ordering. The analysis is extended to template features where the matching is non discrete and a sample refinement process is proposed. The framework is demonstrated effectively on the localization of a person in an image, using a kinematic model with template features. Different priors are used on the model parameters and the results demonstrate nontrivial variations in the optimal feature hierarchy.
Cite
Text
Cham and Rehg. "Dynamic Feature Ordering for Efficient Registration." IEEE/CVF International Conference on Computer Vision, 1999. doi:10.1109/ICCV.1999.790395Markdown
[Cham and Rehg. "Dynamic Feature Ordering for Efficient Registration." IEEE/CVF International Conference on Computer Vision, 1999.](https://mlanthology.org/iccv/1999/cham1999iccv-dynamic/) doi:10.1109/ICCV.1999.790395BibTeX
@inproceedings{cham1999iccv-dynamic,
title = {{Dynamic Feature Ordering for Efficient Registration}},
author = {Cham, Tat-Jen and Rehg, James M.},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {1999},
pages = {1084-1091},
doi = {10.1109/ICCV.1999.790395},
url = {https://mlanthology.org/iccv/1999/cham1999iccv-dynamic/}
}