Search results for "SIFT."
showing 10 items of 19 documents
Detecting multiple copies in tampered images
2010
Copy-move forgeries are parts of the image that are duplicated elsewhere into the same image, often after being modified by geometrical transformations. In this paper we present a method to detect these image alterations, using a SIFT-based approach. First we describe a state of the art SIFT-point matching method, which inspired our algorithm, then we compare it with our SIFT-based approach, which consists of three parts: keypoint clustering, cluster matching, and texture analysis. The goal is to find copies of the same object, i.e. clusters of points, rather than points that match. Cluster matching proves to give better results than single point matching, since it returns a complete and co…
Approximated overlap error for the evaluation of feature descriptors on 3D scenes
2013
This paper presents a new framework to evaluate feature descriptors on 3D datasets. The proposed method employs the approximated overlap error in order to conform with the reference planar evaluation case of the Oxford dataset based on the overlap error. The method takes into account not only the keypoint centre but also the feature shape and it does not require complex data setups, depth maps or an accurate camera calibration. Only a ground-truth fundamental matrix should be computed, so that the dataset can be freely extended by adding further images. The proposed approach is robust to false positives occurring in the evaluation process, which do not introduce any relevant changes in the …
Copy–Move Forgery Detection by Matching Triangles of Keypoints
2015
Copy-move forgery is one of the most common types of tampering for digital images. Detection methods generally use block-matching approaches, which first divide the image into overlapping blocks and then extract and compare features to find similar ones, or point-based approaches, in which relevant keypoints are extracted and matched to each other to find similar areas. In this paper, we present a very novel hybrid approach, which compares triangles rather than blocks, or single points. Interest points are extracted from the image, and objects are modeled as a set of connected triangles built onto these points. Triangles are matched according to their shapes (inner angles), their content (c…
Object Recognition and Modeling Using SIFT Features
2013
In this paper we present a technique for object recognition and modelling based on local image features matching. Given a complete set of views of an object the goal of our technique is the recognition of the same object in an image of a cluttered environment containing the object and an estimate of its pose. The method is based on visual modeling of objects from a multi-view representation of the object to recognize. The first step consists of creating object model, selecting a subset of the available views using SIFT descriptors to evaluate image similarity and relevance. The selected views are then assumed as the model of the object and we show that they can effectively be used to visual…
SIFT Matching by Context Exposed
2023
This paper investigates how to step up local image descriptor matching by exploiting matching context information. Two main contexts are identified, originated respectively from the descriptor space and from the keypoint space. The former is generally used to design the actual matching strategy while the latter to filter matches according to the local spatial consistency. On this basis, a new matching strategy and a novel local spatial filter, named respectively blob matching and Delaunay Triangulation Matching (DTM) are devised. Blob matching provides a general matching framework by merging together several strategies, including rank-based pre-filtering as well as many-to-many and symmetri…
Visual saliency by keypoints distribution analysis
2011
In this paper we introduce a new method for Visual Saliency detection. The goal of our method is to emphasize regions that show rare visual aspects in comparison with those showing frequent ones. We propose a bottom up approach that performs a new technique based on low level image features (texture) analysis. More precisely, we use SIFT Density Maps (SDM), to study the distribution of keypoints into the image with different scales of observation, and its relationship with real fixation points. The hypothesis is that the image regions that show a larger distance from the mode (most frequent value) of the keypoints distribution over all the image are the same that better capture our visual a…
RootsGLOH2: embedding RootSIFT 'square rooting' in sGLOH2
2020
This study introduces an extension of the shifting gradient local orientation histogram doubled (sGLOH2) local image descriptor inspired by RootSIFT ‘square rooting’ as a way to indirectly alter the matching distance used to compare the descriptor vectors. The extended descriptor, named RootsGLOH2, achieved the best results in terms of matching accuracy and robustness among the latest state-of-the-art non-deep descriptors in recent evaluation contests dealing with both planar and non-planar scenes. RootsGLOH2 also achieves a matching accuracy very close to that obtained by the best deep descriptors to date. Beside confirming that ‘square rooting’ has beneficial effects on sGLOH2 as it happe…
Keypoint descriptor matching with context-based orientation estimation
2014
Abstract This paper presents a matching strategy to improve the discriminative power of histogram-based keypoint descriptors by constraining the range of allowable dominant orientations according to the context of the scene under observation. This can be done when the descriptor uses a circular grid and quantized orientation steps, by computing or providing a global reference orientation based on the feature matches. The proposed matching strategy is compared with the standard approaches used with the SIFT and GLOH descriptors and the recent rotation invariant MROGH and LIOP descriptors. A new evaluation protocol based on an approximated overlap error is presented to provide an effective an…
Views selection for SIFT based object modeling and recognition
2016
In this paper we focus on automatically learning object models in the framework of keypoint based object recognition. The proposed method uses a collection of views of the objects to build the model. For each object the collection is composed of N×M views obtained rotating the object around its vertical and horizontal axis. As keypoint based object recognition using a complete set of views is computationally expensive, we focused on the definition of a selection method that creates, for each object, a subset of the initial views that visually summarize the characteristics of the object and should be suited for recognition. We select the views by determining maxima and minima of a function, …
Rethinking the sGLOH Descriptor
2018
sGLOH (shifting GLOH) is a histogram-based keypoint descriptor that can be associated to multiple quantized rotations of the keypoint patch without any recomputation. This property can be exploited to define the best distance between two descriptor vectors, thus avoiding computing the dominant orientation. In addition, sGLOH can reject incongruous correspondences by adding a global constraint on the rotations either as an a priori knowledge or based on the data. This paper thoroughly reconsiders sGLOH and improves it in terms of robustness, speed and descriptor dimension. The revised sGLOH embeds more quantized rotations, thus yielding more correct matches. A novel fast matching scheme is a…