Sift algorithm feature key point match based on mixing behavior ant colony algorithm
An ant colony algorithm and key point technology, applied in calculation, calculation model, image data processing, etc., can solve the problems of inability to realize large image real-time matching and slow matching speed, and achieve obvious real-time speed advantages, fast matching speed, good robustness
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0024] The present invention will further introduce the embodiments of the present invention in conjunction with the accompanying drawings.
[0025] 1. Image preprocessing, pre-filtering the image to be matched to eliminate noise. If the image quality is good, you can choose not to do it. Use the median filter to preprocess the image. The median filter is a nonlinear filter that not only eliminates noise but also maintains details. A 3×3 filter window is used. In order to reduce the amount of calculation, each time the median is calculated, only the leftmost side is considered. For the pixels of , the rightmost pixel is added, and the rest of the pixels remain unchanged.
[0026] 2. Implementation steps of sift algorithm:
[0027] (1) Use different scales of Gaussian difference kernels to convolve with the original image to generate a Gaussian difference scale-space (DOG scale-space). The Gaussian difference function formula is: D(x, y, σ) = (G(x, y, kσ )-G(x, y, σ))*I(x, y...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 