Efficient algorithms for robust feature matching
نویسندگان
چکیده
منابع مشابه
Efficient algorithms for robust feature matching
One of the basic building blocks in any point-based registration scheme involves matching feature points that are extracted from a sensed image to their counterparts in a reference image. This leads to the fundamental problem of point matching: Given two sets of points, find the (affine) transformation that transforms one point set so that its distance from the other point set is minimized. Bec...
متن کاملEfficient algorithms for robust feature matching1
One of the basic building blocks in any point-based registration scheme involves matching feature points that are extracted from a sensed image to their counterparts in a reference image. This leads to the fundamental problem of point matching: Given two sets of points, find the (affine) transformation that transforms one point set so that its distance from the other point set is minimized. Bec...
متن کاملEfficient and Robust Parameter Tuning for Heuristic Algorithms
The main advantage of heuristic or metaheuristic algorithms compared to exact optimization methods is their ability in handling large-scale instances within a reasonable time, albeit at the expense of losing a guarantee for achieving the optimal solution. Therefore, metaheuristic techniques are appropriate choices for solving NP-hard problems to near optimality. Since the parameters of heuristi...
متن کاملAccurate and Robust Stereoscopic Matching in Efficient Algorithms
The thesis studies dense stereoscopic techniques which are usable for accurate, robust and fast matching of high-resolution images of complex 3D scenes. The main contributions are: (1) Image sampling invariant and affine insensitive complex correlation statistic (CCS) which is based on representing the image point neighbourhood as a response to complex Gabor filters. The CCS is a complex number...
متن کاملRobust feature matching in 2.3µs
In this paper we present a robust feature matching scheme in which features can be matched in 2.3μs. For a typical task involving 150 features per image, this results in a processing time of 500μs for feature extraction and matching. In order to achieve very fast matching we use simple features based on histograms of pixel intensities and an indexing scheme based on their joint distribution. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 1999
ISSN: 0031-3203
DOI: 10.1016/s0031-3203(98)00086-7