I got this question but I didn't got any clue about the answer: What is the problem of matching SIFT descriptor by using Euclidean distance? I have read something about this method doesn't work with transformed images, but I could understand what he means about transformed image and why?
What is the problem of matching SIFT descriptor by using Euclidean distance?
595 Views Asked by Marcone Ferreira Santos At
1
There are 1 best solutions below
Related Questions in COMPUTER-VISION
- Trained ML model with the camera module is not giving predictions
- what's the difference between "nn layout" and "nt layout"
- Sketch Guided Text to Image Generation
- Pneumonia detection, using transfer learning
- Search for an icon on an image OpenCV
- DJI Tello won't follow me
- Unable to open shape_predictor_68_face_landmarks.dat
- Line Segmentation Problem: How to detect lines and draw bounding box of that line on handwritten letters Using CV2
- The regression problem of predicting multiple outputs from two-dimensional inputs
- Detecting Circles and Ellipses from Point Arrays in Java
- How to generate a VPI warpmap for polynomial distortion correction?
- Finding 3D camera location from a known 2D symbol inside an image
- How can I overlay a 3D model onto a detected object in real-time using computer vision?
- CUDA driver initialization failed, you might not have a CUDA gpu
- Implementing Image Processing for Dimension Measurement in Arduino-based Packaging System
Related Questions in MATCHING
- why result of regular expression match in not as expected?
- Importing large contact file error message and failure --why?
- Custom pattern matching between two columns and replacing to keep within-column groups consistent
- Unable to find a match for a substring in column of my dataframe
- numerical/user defined similarity calculation in reclin2
- Combining matchit objects for descriptive analysis (CRAN/R)
- Adding together matrices of two different dimensions with column/row matching
- Copy and paste specific data from an Excel sheet to a web page based on a specific condition, repeating this process more than 1000 times
- R Coarsened Exact Matching, list with matched controls
- record matching/similarity calculation for numbers and characters
- Searchbox on Sheet1 for finding a specific row on a table placed in Sheet2
- I want to highlight cells that are not represented in table
- PowerShell move all files containg exact string in their body
- Matching up values in two separate columns using VBA
- Replacing rows of NA with another row meeting specific column matching
Related Questions in SIFT
- Image preparation before SIFT extracting features, or how to make SIFT work stable
- SIFT feature transform performing poor, Scale Space Extrema refinement
- SIFT feature transform not detecting correct/incomplete Scale Space Extremas
- Matching a pattern between an image and template using Python OpenCV and SIFT
- I am trying to SIFT from this image
- Can I use OpenCV SIFT for 16bit images?
- SIFT KeyPoint input values (scale constants)
- Copy-move forgery detection using sift algorithm and keypoints matching using knn
- MATLAB for object tracking
- Custom dataset is not fit to svm model
- OpenCV Exception: Assertion failed in cv::DescriptorMatcher::checkMasks
- loss of space on C (windows10) and openCV SIFT (detect and compute images)
- How to use SIFT descriptors in knn algorithm to classify images
- find the same object from two images which contain two crowds of such similar objects
- Using SIFT in opencv using c++ without special libraries
Related Questions in EUCLIDEAN-DISTANCE
- Euclidean Distance between two vectors in two columns in spark data frme
- How to exclude double values in sklearn.metrics.pairwise.euclidean_distances results
- Iterate through ID-matched Euclidean distances using dist() in R
- Generate P random N-dimensional points from list of ALL possible pairwise distances
- Fast way to find closest line segment for a large set of planar points [Python]
- How to compute the Euclidean distance between two complex matrix by vectorization?
- Move point B to be between A and C while keeping the distance
- How to produce the indexes from pdist2 function in Octave?
- Pairing Test and Control Plots by Euclidean Distance of a Vector in R
- Finding a point close enough to a point
- finding distance between two object of an image with euclidean distance and opencv
- Computationally efficient way of calculating euclidean distance between points and nearest line on a landscape in R sf
- Minimum and Mean Euclidean distance between two tensors of different shape
- how to calculate a masked distance transform with ndimage.distance_transform_edt?
- Travelling Salesman Problem - Best path to go through all points
Related Questions in FEATURE-DESCRIPTOR
- problem with image registration using BRISK
- I am trying to SIFT from this image
- How to match two different image which has lots of repetitive feature?
- How to include a weighting function for a classificatioon of 1d plot?
- Is there an implementation of SIFT descriptor for Point Cloud?
- OpenCV - Calculating SIFT Descriptors for given Harris Corner Features
- How to compare similarities in point clouds using descriptors?
- How to remove specific data in image processing
- How to implement KAZE and A-KAZE using Python and OpenCV?
- How are the binary descriptors generated in OpenCV?
- Zero keypoints detected with BRIEF, BRISK, AKAZE and FREAK
- Explanation of feature descriptors in computer vision and machine learning
- How to get pixel coordinates from a list of best matches using openCV (java)?
- Why is it faster to recompute ORB descriptor than loading it from disk?
- OpenCV 4.1.0 Java : how to fix "unknown exception" when trying to use BFMatcher with ORB-based keypoints and descriptors?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
I had the same question when I started out in Machine Learning. Normally, SIFT features are matched by knnMatching which in default uses L1 Distance.
Let's begin by defining the equation of L1 and L2. Suppose you have (a, b) and (c, d),
L1 distance (Manhattan Distance) = |a-c| + |b-d|
L2 distance (Euclidean Distance) = Square_root[(a-c)2 + (b-d)2]
Here you can see that error rate in L2 distance increases rapidly as you have more dimensions due to square functions. SIFT feature is a multidimensional vector and Euclidean distance will increase rapidly compared to L1 distance which takes absolute value.
Euclidean distance is a good measure for vectors with lesser dimensions where as L1 distance is a better choice for vectors with larger dimensions.
Hope this clears your doubt.