Search results for "SIFT"

showing 10 items of 20 documents

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…

Cascade matching0209 industrial biotechnologyHistogram binarizationRFDComputer scienceGLOHComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION02 engineering and technologyCNN descriptorLIOP020901 industrial engineering & automationMROGHArtificial IntelligenceRobustness (computer science)Keypoint matchingSIFTHistogram0202 electrical engineering electronic engineering information engineeringSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniSettore INF/01 - Informaticabusiness.industryApplied MathematicsCognitive neuroscience of visual object recognitionPattern recognitionRotation invariant descriptorsGLOHMIOPComputational Theory and MathematicsKeypoint matching SIFT sGLOH RFDs LIOP MIOP MROGH CNN descriptors rotation invariant descriptors histogram binarization cascade matchingPrincipal component analysis020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionArtificial intelligencebusinessSoftware
researchProduct

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 …

Complex data typeSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniSettore INF/01 - Informaticabusiness.industryComputer scienceGLOHEpipolar geometryComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONScale-invariant feature transformPattern recognitionLIOPMROGHkeypoint descriptorSIFTepipolar geometryFalse positive paradoxComputer visionArtificial intelligencebusinessFundamental matrix (computer vision)descriptor evaluationCamera resectioning
researchProduct

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…

FEATURE EXTRACTIONLOCAL FEATUREComputer scienceFeature extractionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONScale-invariant feature transformFEATURE MATCHING02 engineering and technologyRobustness (computer science)Euclidean geometryComputer Science::Multimedia0202 electrical engineering electronic engineering information engineeringBeneficial effectsSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniSettore INF/01 - Informaticabusiness.industryImage matching020206 networking & telecommunicationsPattern recognitionCOMPUTER VISIONImage Matching Local Image Descriptors RootSIFT sGLOH2Computer Science::Computer Vision and Pattern RecognitionEmbedding020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionArtificial intelligencebusinessSoftwareSquare rootingIMAGE MATCHING
researchProduct

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…

FOS: Computer and information sciencesArtificial neural networkSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniBenchmark testingRANSAClocal image descriptorSettore INF/01 - InformaticaApplied MathematicsComputer Vision and Pattern Recognition (cs.CV)Computer Science - Computer Vision and Pattern RecognitionTransformDetectorDelaunay triangulationMerginglocal spatial filterimage contextComputational Theory and MathematicsArtificial IntelligenceKeypoint matchingSIFTPipelineTrainingComputer Vision and Pattern RecognitionSoftware
researchProduct

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…

GLOHComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONScale-invariant feature transformContext basedReference orientationImage descriptorLIOPDiscriminative modelMROGHHistogramKeypoint matchingSIFTComputer Science::MultimediaComputer visionInvariant (mathematics)MathematicsDominant orientationSettore INF/01 - Informaticabusiness.industryPattern recognitionGridLocal featureRotation invarianceComputer Science::Computer Vision and Pattern RecognitionSignal ProcessingImage descriptors; Local features; Dominant orientation; Rotation invariance; Keypoint matching; SIFT; LIOP; MROGHComputer Vision and Pattern RecognitionArtificial intelligencebusiness
researchProduct

Extending the sGLOH descriptor

2015

This paper proposes an extension of the sGLOH keypoint descriptor [3] which improves its robustness and discriminability. The sGLOH descriptor can handle discrete rotations by a cyclic shift of its elements thanks to its circular structure, but its performance can decrease when the keypoint relative rotation is in between two sGLOH discrete rotations. The proposed extension couples together two sGLOH descriptors for the same patch with different rotations in order to cope with this issue and it can be also applied straightly to the sCOr and sGOr matching strategies of sGLOH. Experimental results show a consistent improvement of the descriptor discriminability, while different setups can be …

Keypoint descriptorMatching (graph theory)Settore INF/01 - InformaticaComputer scienceGLOHStructure (category theory)Scale-invariant feature transformSGLOHExtension (predicate logic)Keypoint descriptor image matching rotation invarianceRunning timeTask (project management)Robustness (computer science)SIFTMatchingAlgorithm
researchProduct

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…

Matching (statistics)business.industryImage forensicTemplate matchingComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONScale-invariant feature transformPattern recognitionObject (computer science)ClusteringImage (mathematics)Image textureSIFTFalse positive paradoxComputer visionArtificial intelligencebusinessCluster analysisMathematics2010 IEEE International Conference on Image Processing
researchProduct

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…

Object RecognitionSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniSIFT.business.industryComputer science3D single-object recognitionObject Recognition; Pose Estimation; Object Model; SIFT.ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONPattern recognition3D pose estimationObject (computer science)Object-oriented designPose EstimationHaar-like featuresObject modelViola–Jones object detection frameworkComputer visionArtificial intelligencebusinessPoseObject Model
researchProduct

Improving SIFT-based descriptors stability to rotations

2010

Image descriptors are widely adopted structures to match image features. SIFT-based descriptors are collections of gradient orientation histograms computed on different feature regions, commonly divided by using a regular Cartesian grid or a log-polar grid. In order to achieve rotation invariance, feature patches have to be generally rotated in the direction of the dominant gradient orientation. In this paper we present a modification of the GLOH descriptor, a SIFT-based descriptor based on a log-polar grid, which avoids to rotate the feature patch before computing the descriptor since predefined discrete orientations can be easily derived by shifting the descriptor vector. The proposed des…

PixelSettore INF/01 - Informaticabusiness.industryOrientation (computer vision)GLOHInformationSystems_INFORMATIONSTORAGEANDRETRIEVALFeature extractionComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONScale-invariant feature transformPattern recognitionComputingMethodologies_PATTERNRECOGNITIONdescriptors SIFT sGLOH sGLOH+ computer vision.Robustness (computer science)Feature (computer vision)Computer Science::Computer Vision and Pattern RecognitionHistogramComputer Science::MultimediaComputer visionArtificial intelligencebusinessMathematics
researchProduct

Scale detection via keypoint density maps in regular or near-regular textures

2013

In this paper we propose a new method to detect the global scale of images with regular, near regular, or homogenous textures. We define texture ''scale'' as the size of the basic elements (texels or textons) that most frequently occur into the image. We study the distribution of the interest points into the image, at different scale, by using our Keypoint Density Maps (KDMs) tool. A ''mode'' vector is built computing the most frequent values (modes) of the KDMs, at different scales. We observed that the mode vector is quasi linear with the scale. The mode vector is properly subsampled, depending on the scale of observation, and compared with a linear model. Texture scale is estimated as th…

Scale (ratio)Computer sciencebusiness.industryTextonScale-invariant feature transformPattern recognitionSIFT SURF Harris corner Texture Scale Texel TextonTexture (geology)Artificial IntelligenceComputer Science::Computer Vision and Pattern RecognitionSignal ProcessingComputer visionComputer Vision and Pattern RecognitionArtificial intelligencebusinessTexelSoftware
researchProduct