English

Optimization over Random and Gradient Probabilistic Pixel Sampling for Fast, Robust Multi-Resolution Image Registration

Computer Vision and Pattern Recognition 2020-10-07 v1

Abstract

This paper presents an approach to fast image registration through probabilistic pixel sampling. We propose a practical scheme to leverage the benefits of two state-of-the-art pixel sampling approaches: gradient magnitude based pixel sampling and uniformly random sampling. Our framework involves learning the optimal balance between the two sampling schemes off-line during training, based on a small training dataset, using particle swarm optimization. We then test the proposed sampling approach on 3D rigid registration against two state-of-the-art approaches based on the popular, publicly available, Vanderbilt RIRE dataset. Our results indicate that the proposed sampling approach yields much faster, accurate and robust registration results when compared against the state-of-the-art.

Keywords

Cite

@article{arxiv.2010.02505,
  title  = {Optimization over Random and Gradient Probabilistic Pixel Sampling for Fast, Robust Multi-Resolution Image Registration},
  author = {Boris N. Oreshkin and Tal Arbel},
  journal= {arXiv preprint arXiv:2010.02505},
  year   = {2020}
}

Comments

arXiv admin note: substantial text overlap with arXiv:2010.00988

R2 v1 2026-06-23T19:04:31.239Z