ML Anthology

A Polynomial-Time Bound for Matching and Registration with Outliers

Carl Olsson, Olof Enqvist, Fredrik Kahl
CVPR 2008
doi:10.1109/CVPR.2008.4587757 /cvpr/2008/olsson2008cvpr-polynomial/
CVPR Semantic Scholar

Cite

Text

Olsson et al. "A Polynomial-Time Bound for Matching and Registration with Outliers." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2008. doi:10.1109/CVPR.2008.4587757

Markdown

[Olsson et al. "A Polynomial-Time Bound for Matching and Registration with Outliers." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2008.](https://mlanthology.org/cvpr/2008/olsson2008cvpr-polynomial/) doi:10.1109/CVPR.2008.4587757

BibTeX

@inproceedings{olsson2008cvpr-polynomial,
  title     = {{A Polynomial-Time Bound for Matching and Registration with Outliers}},
  author    = {Olsson, Carl and Enqvist, Olof and Kahl, Fredrik},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2008},
  doi       = {10.1109/CVPR.2008.4587757},
  url       = {https://mlanthology.org/cvpr/2008/olsson2008cvpr-polynomial/}
}