Analysis of Feature Point Distributions for Fast Image Mosaicking Algorithms

Authors

  • A. Behrens
  • H. Röllinger

DOI:

https://doi.org/10.14311/1219

Keywords:

feature detection, point distribution, image registration, image mosaicking

Abstract

In many algorithms the registration of image pairs is done by feature point matching. After the feature detection is performed, all extracted interest points are usually used for the registration process without further feature point distribution analysis. However, in the case of small and sparse sets of feature points of fixed size, suitable for real-time image mosaicking algorithms, a uniform spatial feature distribution across the image becomes relevant. Thus, in this paper we discuss and analyze algorithms which provide different spatial point distributions from a given set of SURF features. The evaluations show that a more uniform spatial distribution of the point matches results in lower image registration errors, and is thus more beneficial for fast image mosaicking algorithms.

Downloads

Download data is not yet available.

Author Biographies

A. Behrens

H. Röllinger

Downloads

Published

2010-01-04

How to Cite

Behrens, A., & Röllinger, H. (2010). Analysis of Feature Point Distributions for Fast Image Mosaicking Algorithms. Acta Polytechnica, 50(4). https://doi.org/10.14311/1219

Issue

Section

Articles