In this paper, we present a new approach for matching local descriptors such as Scale Invariant Feature Transform (SIFT)ones in order to recognize image objects quickly and reliably. The proposed method first computes the Hausdorff distance combined with the City-Block distance to match the two sets of the extracted keypoints from the goal and data images, respectively. Then, the matched points are involved into an embedded pairing process, leading to a double matching which is more discriminant for the object recognition purpose as demonstrated on real-world standard databases
There is a great deal of systems dealing with image processing that are being used and developed on ...
ii Contemporary Computer Vision applications, such as visual search or 3D re-construction, need to h...
A very simple but efficient feature descriptor is proposed for image matching/registration applicati...
We proposes a method for fast matching SIFT feature points based on SIFT feature descriptor vector e...
In this paper, we address the problem of pair-wise image matching which determines whether two image...
Local image features are used in many computer vision applications. Many point detectors and descrip...
SIFT-like local feature descriptors are ubiquitously employed in computer vision applications such a...
<p> Feature description and matching are at the base of many computer vision applications. However,...
International audienceWe are addressing the problem of matching images of scene or of objects when a...
International audienceWe are addressing the problem of matching images of scene or of objects when a...
SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications a...
In this paper we propose a novel feature based on SIFT (Scale Invariant Feature Transform) algorithm...
This paper investigates how to step up local image descriptor matching by exploiting matching contex...
This paper presents an algorithm that extracts robust feature descriptors from 2.5D range images, in...
In this paper we propose a novel feature based on SIFT (Scale Invariant Feature Transform) algorithm...
There is a great deal of systems dealing with image processing that are being used and developed on ...
ii Contemporary Computer Vision applications, such as visual search or 3D re-construction, need to h...
A very simple but efficient feature descriptor is proposed for image matching/registration applicati...
We proposes a method for fast matching SIFT feature points based on SIFT feature descriptor vector e...
In this paper, we address the problem of pair-wise image matching which determines whether two image...
Local image features are used in many computer vision applications. Many point detectors and descrip...
SIFT-like local feature descriptors are ubiquitously employed in computer vision applications such a...
<p> Feature description and matching are at the base of many computer vision applications. However,...
International audienceWe are addressing the problem of matching images of scene or of objects when a...
International audienceWe are addressing the problem of matching images of scene or of objects when a...
SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications a...
In this paper we propose a novel feature based on SIFT (Scale Invariant Feature Transform) algorithm...
This paper investigates how to step up local image descriptor matching by exploiting matching contex...
This paper presents an algorithm that extracts robust feature descriptors from 2.5D range images, in...
In this paper we propose a novel feature based on SIFT (Scale Invariant Feature Transform) algorithm...
There is a great deal of systems dealing with image processing that are being used and developed on ...
ii Contemporary Computer Vision applications, such as visual search or 3D re-construction, need to h...
A very simple but efficient feature descriptor is proposed for image matching/registration applicati...