CN110705568B - Optimization method for image feature point extraction - Google Patents
Optimization method for image feature point extraction Download PDFInfo
- Publication number
- CN110705568B CN110705568B CN201910882008.8A CN201910882008A CN110705568B CN 110705568 B CN110705568 B CN 110705568B CN 201910882008 A CN201910882008 A CN 201910882008A CN 110705568 B CN110705568 B CN 110705568B
- Authority
- CN
- China
- Prior art keywords
- image
- gradient
- value
- calculating
- gaussian
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V10/00—Arrangements for image or video recognition or understanding
- G06V10/40—Extraction of image or video features
- G06V10/44—Local feature extraction by analysis of parts of the pattern, e.g. by detecting edges, contours, loops, corners, strokes or intersections; Connectivity analysis, e.g. of connected components
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V10/00—Arrangements for image or video recognition or understanding
- G06V10/40—Extraction of image or video features
- G06V10/46—Descriptors for shape, contour or point-related descriptors, e.g. scale invariant feature transform [SIFT] or bags of words [BoW]; Salient regional features
- G06V10/469—Contour-based spatial representations, e.g. vector-coding
- G06V10/473—Contour-based spatial representations, e.g. vector-coding using gradient analysis
Landscapes
- Engineering & Computer Science (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Multimedia (AREA)
- Theoretical Computer Science (AREA)
- Image Analysis (AREA)
Abstract
The invention discloses an optimization method for extracting image characteristic points, which comprises the steps of inputting an image; calculating image gradient and second-order gradient; calculating an image gradient factor P (m, n) and obtaining a P (T) area; establishing a Gaussian scale space and a Gaussian difference space according to the P (T) region; carrying out extreme point detection according to P (m, n); and generating a characteristic point descriptor. Gradient image from imageAnd second order gradient imageCalculating factor P according to certain rule along longitudinal and transverse directions i.j (m, n) and obtaining a P (T) area, judging whether to participate in Gaussian scale space construction and feature point extraction according to the P (T) area, omitting a large amount of calculation amount during Gaussian scale space construction and feature point extraction, and optimizing the algorithm in the feature point extraction stage and improving the algorithm efficiency due to small extra added calculation amount.
Description
Technical Field
The invention relates to the technical field of image processing, in particular to an optimization method for extracting image feature points.
Background
SIFT, Scale-invariant feature transform (Scale-invariant feature transform), is a description used in the field of image processing. The description has scale invariance, can detect key points in the image and is a local feature descriptor.
The image registration technology based on the image characteristics is widely applied to the fields of image processing, computer vision, pattern recognition and the like. The SIFT algorithm has strong robustness in various scenes, so that the SIFT algorithm becomes a research hotspot of an image registration technology based on image features and is widely applied.
However, the applicant has found that the conventional image feature point extraction has at least the following problems:
the SIFT algorithm takes the largest time when the feature points are extracted and are constructed in a gaussian scale space through a statistical algorithm, in the process, the algorithm constructs O × L images, for example, for an image of 1920 × 1080, the constructed images are about 20, and the larger the pixel size of the image, the more the images are. In the process, Gaussian operation is performed on all points in the image scale space, the distribution of the image feature points is not uniformly distributed in the image, and no feature point exists in a flat area or a pixel decreasing area in the image. Therefore, the SIFT algorithm has the defects of high complexity, large calculation amount and poor real-time property when the feature points are extracted.
Disclosure of Invention
In view of this, the invention aims to provide an optimization method for extracting image feature points, which solves the defects of high complexity, large calculation amount and poor real-time performance of an SIFT algorithm in feature point extraction.
Based on the above purpose, the present invention provides an optimization method for image feature point extraction, which includes:
inputting an image;
calculating image gradient and second-order gradient;
calculating an image gradient factor P (m, n) and obtaining a P (T) area;
establishing a Gaussian scale space and a Gaussian difference space according to the P (T) region;
carrying out extreme point detection according to the P (T) area;
and generating a characteristic point descriptor.
The input image comprises a Gaussian operation of a first image in a scale space on an initial image, a Gaussian scale space structure of an optimization method is carried out on the basis of the image, and the image after the Gaussian operation is preprocessed.
The performing image gradient and second order gradient calculations comprises:
calculating the gradient values of the image in the longitudinal and transverse directions, wherein the calculation result of each pixel point is Wherein j is the row of the image, and i is the pixel coordinate position of the j row of the image;
calculating a second-order gradient value of the image in the longitudinal direction and the transverse direction, wherein the result of calculation of each pixel point is
The calculating the image gradient factor P (m, n) and obtaining the P (T) region comprises:
initial value P of gradient factor i,j (m,n)=P 0,0 (0,0), where K is i (for the starting position of j row, K is 0, and for the pixel points at other positions, K is i);
judging whether P is present i,j (dx,) and P i-1,j (dx,) symbols are coincident and | P i,j (d' x,) | or | P i-1,j (d' x,) | is less than S;
if so, then P i,j The gradient factor value m +1, and judging the calculation condition of j rows of pixels of the image;
otherwise, it is determined that K is 0.
The determination that K is 0 includes:
if K is equal to 0, then P i,j Gradient factor value is denoted m, inverse direction P i,j To P 0,j Sequentially subtracting 1 from the m value of the image, and judging the calculation condition of j rows of pixels of the image;
if K is not equal to 0, then P i-m/2,j Gradient factor values are denoted m, P i-m/2,j To P i,j Sequentially subtracting 1 from the m value of (b), and judging the calculation condition of the pixels of j rows of the image.
The judgment of the j line calculation condition of the image comprises the following steps:
judging whether the calculation of the j line of the image is finished, if so, continuing to calculate the j ═ j +1 of the next line;
otherwise, calculate P i+1,j I +1, and determines whether P is present i,j (dx,) and P i-1,j (dx,) symbols are coincident and | P i,j (d' x,) | or | P i-1,j (d' x,) | is less than S.
Judging whether the calculation of the j line of the image is finished, if so, continuing to calculate the j ═ j +1 of the next line comprises the following steps:
calculating P i,j A gradient factor value n;
outputting an image gradient factor P i.j (m,n)。
The calculating of the image gradient factor P (m, n) and obtaining the P (t) region comprises:
according to P of the obtained image of the order i.j (m, n) value, each pixel point is processed in the construction of scale spaceJudging m and n values before performing Gaussian operation, and performing Gaussian operation to participate in the construction of a scale space after the m and n values are smaller than the T value;
wherein, the T value is larger than half of the field size required by the calculation of the characteristic point descriptor; only one P per image level is required i.j The value of (m, n) is sufficient.
The extreme point detection according to the P (T) area comprises the following steps: when extreme point extraction is carried out on the Gaussian difference space images, the extreme value extraction area of each image is as follows: the P (T) region of the level image. And sequentially obtaining extreme points.
From the above, the optimization method for extracting the image feature points provided by the invention comprises the steps of inputting an image; calculating image gradient and second-order gradient; calculating an image gradient factor P (m, n) and obtaining a P (T) area; establishing a Gaussian scale space and a Gaussian difference space according to the P (T) region; carrying out extreme point detection according to the P (T) area; and generating a characteristic point descriptor. Gradient image from image And second order gradient imageCalculating factor P according to certain rule along longitudinal and transverse directions i.j (m, n), and further obtaining a P (T) region according to a certain rule to judge whether to participate in Gaussian scale space construction and feature point extraction, so that a large amount of calculation amount in Gaussian scale space construction and feature point extraction is omitted, the extra calculation amount added by the method is small, the algorithm is optimized in the feature point extraction stage, and the algorithm efficiency is improved.
Drawings
FIG. 1 is a schematic block diagram of a flow chart of an optimization method for extracting image feature points according to an embodiment of the present invention;
fig. 2 is a block diagram illustrating an exemplary flow of image gradient factor calculation in an optimization method for extracting image feature points according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments and the accompanying drawings.
As one embodiment of the present invention, as shown in fig. 1, a method for optimizing image feature point extraction includes:
the step may further include: and Gaussian filtering preprocessing, specifically, performing Gaussian operation on the first image in the scale space on the initial image, and performing operation of an optimization algorithm on the basis of the image.
102, calculating image gradient and second-order gradient;
the step may further include:
step 201, calculating gradient values of the image in two directions of vertical and horizontal directions, wherein the calculation result of each pixel point is
The pixel points of the i, j coordinates in the vertical and horizontal directions on the image are P (i, j), P i,j (dx, dy) is the differential of P (i, j) in the longitudinal and lateral directions, dx is the differential of P (i, j) in the x directiondy is the differential of P (i, j) in the y direction
Calculating a second-order gradient value of the image in the longitudinal direction and the transverse direction, wherein the result of calculation of each pixel point is
P i,j (d ' x, d ' y) is the second order differential of P (i, j) in the longitudinal and lateral directions, and d ' x is the second order differential of P (i, j) in the x directiond' y is the second differential of P (i, j) in the y direction
the steps may also include:
step 301, based on the operation in step 201, calculating a gradient factor P according to a predetermined rule along the vertical and horizontal directions from the operation result in step 201 i.j (m, n), starting from a certain vertex of the image, processing the image pixel by pixel to obtain P i.j (m, n), the initial values of m and n are marked as 0, and the calculation methods of m and n are the same.
Step 301 includes:
step 3011, start line by line scanning from the first line of the image, P i,j (m,) value calculation method: if P i,j (dx,) and P i-1,j (dx) there is no change in sign (sign is also considered unchanged when a gradient value of 0 is encountered), and P i,j (d' x,) or P i-1,j If (d' x,) are all less than S value, then P i,j (m+1,)。
If the sign of the gradient value changes or the second-order gradient value is larger than S, P is i,j The m value of (m,) is marked as 0, then the m value of the previous m/2 pixel point changes, P i-m/2,j The value of (m,) is marked m, P i-m/2,j To P i,j The m value of (a) is sequentially decreased by 1.
The step may further include: if it is the value of m calculated from the beginning of each line, P i,j Gradient factor value is denoted m, inverse direction P i,j To P 0,j Sequentially subtracting 1 from the m value of the image, and judging the calculation condition of j rows of pixels of the image; a new m is calculated.
Step 3012, go back to P i+1.j And (m,) marking the value m as 0, continuing the calculation in the step 3011 until the pixels in the row are finished.
Step 3013, scanning the next row of pixel points of the image, and repeating the operation methods of step 3011 and step 3012;
step 3014, according to P in step 3011 i,j (m,) value calculation method, calculating P i,j (, n) obtaining P for the order image i.j (m, n) values.
Wherein, according to P of the obtained image of the order i.j When the values of m and n are both smaller than the value of T, the part of the region is marked as P (T), and the P (T) region is subjected to Gaussian operation to participate in the construction of a scale space;
wherein, the value of T is more than half of the domain size required by the feature descriptor calculation; only one P per image level is required i.j The value of (m, n) is sufficient.
the step may further include: when extreme point extraction is carried out on the Gaussian difference space image, the extreme extraction area of each image is a P (T) area. And sequentially obtaining extreme points.
And 106, generating a characteristic point descriptor.
Embedding the optimization method in a characteristic point extraction stage of an SIFT original algorithm, preprocessing an initial image before constructing a scale space, identifying a pixel part which does not participate in the construction of the scale space, not performing Gaussian operation processing during subsequent construction of the scale space, and skipping the areas during a characteristic point detection stage of the algorithm so as to improve the algorithm efficiency;
FIG. 2 is an exemplary flow diagram of image gradient factor calculation;
the method comprises the following steps: step 10, inputting an image;
The method has small added algorithm operation amount, and improves the SIFT feature point extraction speed.
Gradient image from imageAnd second order gradient imagesCalculating factor P according to certain rule along longitudinal and transverse directions i.j (m, n) and obtaining a P (T) area, judging whether the pixel point area participates in the Gaussian scale space structure and the feature point extraction according to the P (T) area, omitting a large amount of computation load during the Gaussian scale space structure and the feature point extraction, and the method has small extra added computation load, optimizes the algorithm in the feature point extraction stage and improves the algorithm efficiency.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims), is limited to these examples; within the idea of the invention, also features in the above embodiments or in different embodiments may be combined, steps may be implemented in any order, and there are many other variations of the different aspects of the invention as described above, which are not provided in detail for the sake of brevity.
While the present invention has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of these embodiments will be apparent to those skilled in the art in light of the foregoing description. E.g., dynamic RAMDRAM)) may use the discussed embodiments.
The embodiments of the invention are intended to embrace all such alternatives, modifications and variances that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalents, improvements, and the like that may be made without departing from the spirit or scope of the present invention are intended to be included within the scope of the present invention.
Claims (8)
1. An optimization method for extracting image feature points is characterized by comprising the following steps:
inputting an image;
calculating image gradient and second-order gradient;
calculating an image gradient factor P (m, n) and obtaining a P (T) area;
establishing a Gaussian scale space and a Gaussian difference space according to the P (T) region;
carrying out extreme point detection according to the P (T) area;
generating a characteristic point descriptor;
the calculating of the image gradient factor P (m, n) and obtaining the P (t) region comprises:
initial value P of gradient factor i,j (m,n)=P 0,0 (0,0),K=i;
Wherein j is a row of the image, and i is a pixel coordinate position of the j row of the image;
judging whether P is present i,j (dx,) and P i-1,j (dx,) symbols are coincident and | P i,j (d' x,) | or | P i-1,j (d' x,) | is less than S;
if so, then P i,j The gradient factor value m +1, and the calculation condition of j rows of the image is judged;
otherwise, the case where K is 0 is determined.
2. The method as claimed in claim 1, wherein the input image comprises a gaussian operation of a first image in a scale space on an initial image, and the optimization algorithm is performed based on the first image to preprocess the gaussian filtering.
3. The method of claim 1, wherein the performing image gradient and second order gradient calculations comprises:
calculating the gradient values of the image in the longitudinal and transverse directions, wherein the calculation result of each pixel point isWherein j is the row of the image, and i is the pixel coordinate position of the j row of the image;
calculating a second-order gradient value of the image in the longitudinal direction and the transverse direction, wherein the result of calculation of each pixel point is
4. The method according to claim 1, wherein the determining that K-0 holds true comprises:
if K is equal to 0, then P i,j Gradient factor value is denoted m, inverse direction P i,j To P 0,j Sequentially subtracting 1 from the m value of the image, and judging the calculation condition of j rows of pixels of the image;
if K is not equal to 0, then P i-m/2,j Gradient factor values are denoted m, P i-m/2,j To P i,j Sequentially subtracting 1 from the m value of the image, and judging the calculation condition of j lines of the image.
5. The method according to claim 1 or 4, wherein the determining j rows of pixel calculation conditions of the image comprises:
judging whether the calculation of the pixels in the j line of the image is finished, if so, continuing to calculate the j line as j + 1;
otherwise, calculate P i+1,j I +1, and determines whether P is present i,j (dx,) and P i-1,j (dx,) symbols are coincident and | P i,j (d' x,) | or | P i-1,j (d' x,) | is less than S.
6. The method as claimed in claim 5, wherein the determining whether the calculation of j rows of the image is finished, and if yes, continuing to calculate j ═ j +1 in the next row comprises:
calculating P i,j A gradient factor value n;
output image gradient factor P i.j (m,n)。
7. The method of claim 1, wherein the calculating an image gradient factor P (m, n) and obtaining a region P (t) comprises:
according to P of the obtained image i.j The (m, n) values are judged before Gaussian operation is carried out on each pixel point during construction of the scale space, and the Gaussian operation is carried out to participate in construction of the scale space after the m and n values are smaller than the T value;
wherein, the value of T is more than half of the domain size required by the feature descriptor calculation; only one P per image level is required i.j The value of (m, n) is sufficient.
8. The method of claim 1, wherein the performing extreme point detection according to the p (t) region comprises: when extreme point extraction is carried out on the Gaussian difference space image, the extreme extraction area of each image is as follows: and obtaining extreme points in the P (T) area of the image in sequence.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910882008.8A CN110705568B (en) | 2019-09-18 | 2019-09-18 | Optimization method for image feature point extraction |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910882008.8A CN110705568B (en) | 2019-09-18 | 2019-09-18 | Optimization method for image feature point extraction |
Publications (2)
Publication Number | Publication Date |
---|---|
CN110705568A CN110705568A (en) | 2020-01-17 |
CN110705568B true CN110705568B (en) | 2022-07-26 |
Family
ID=69196265
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910882008.8A Active CN110705568B (en) | 2019-09-18 | 2019-09-18 | Optimization method for image feature point extraction |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN110705568B (en) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112734290B (en) * | 2021-01-25 | 2022-02-11 | 腾讯科技(深圳)有限公司 | Vehicle motion state evaluation method, device, equipment and medium |
CN113298097B (en) * | 2021-07-27 | 2021-10-26 | 电子科技大学 | Feature point extraction method and device based on convolutional neural network and storage medium |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107609562A (en) * | 2017-09-14 | 2018-01-19 | 电子科技大学 | A kind of metric space characteristic detection method based on SIFT algorithms |
CN109447091A (en) * | 2018-10-19 | 2019-03-08 | 福建师范大学 | A kind of characteristics of image point extracting method with accurate coordinate |
CN109816674A (en) * | 2018-12-27 | 2019-05-28 | 北京航天福道高技术股份有限公司 | Registration figure edge extracting method based on Canny operator |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8441489B2 (en) * | 2008-12-31 | 2013-05-14 | Intel Corporation | System and method for SIFT implementation and optimization |
-
2019
- 2019-09-18 CN CN201910882008.8A patent/CN110705568B/en active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107609562A (en) * | 2017-09-14 | 2018-01-19 | 电子科技大学 | A kind of metric space characteristic detection method based on SIFT algorithms |
CN109447091A (en) * | 2018-10-19 | 2019-03-08 | 福建师范大学 | A kind of characteristics of image point extracting method with accurate coordinate |
CN109816674A (en) * | 2018-12-27 | 2019-05-28 | 北京航天福道高技术股份有限公司 | Registration figure edge extracting method based on Canny operator |
Non-Patent Citations (1)
Title |
---|
基于SIFT算法的图像特征点提取和匹配研究;王心醉 ; 董宁宁 ; 李欢利;《南京医科大学学报》;20130215(第02期);144-148 * |
Also Published As
Publication number | Publication date |
---|---|
CN110705568A (en) | 2020-01-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN108108746B (en) | License plate character recognition method based on Caffe deep learning framework | |
CN109035276B (en) | Image edge extraction method and device and automatic driving system | |
US8401333B2 (en) | Image processing method and apparatus for multi-resolution feature based image registration | |
CN110647795B (en) | Form identification method | |
CN104751142B (en) | A kind of natural scene Method for text detection based on stroke feature | |
CN107067389B (en) | A kind of blind evidence collecting method of distorted image | |
CN107330885B (en) | Multi-operator image redirection method for keeping aspect ratio of important content area | |
CN110599486A (en) | Method and system for detecting video plagiarism | |
US8983199B2 (en) | Apparatus and method for generating image feature data | |
CN102289668A (en) | Binaryzation processing method of self-adaption word image based on pixel neighborhood feature | |
CN113744142B (en) | Image restoration method, electronic device and storage medium | |
CN114863492B (en) | Method and device for repairing low-quality fingerprint image | |
CN110705568B (en) | Optimization method for image feature point extraction | |
CN113657528B (en) | Image feature point extraction method and device, computer terminal and storage medium | |
CN111429372A (en) | Method for enhancing edge detection effect of low-contrast image | |
CN111414938B (en) | Target detection method for bubbles in plate heat exchanger | |
CN110163894B (en) | Sub-pixel level target tracking method based on feature matching | |
CN108710881B (en) | Neural network model, candidate target area generation method and model training method | |
CN104268845A (en) | Self-adaptive double local reinforcement method of extreme-value temperature difference short wave infrared image | |
CN112069924A (en) | Lane line detection method, lane line detection device and computer-readable storage medium | |
CN114998186B (en) | Method and system for detecting surface scab defect of copper starting sheet based on image processing | |
CN112837329B (en) | Tibetan ancient book document image binarization method and system | |
CN115330637A (en) | Image sharpening method and device, computing device and storage medium | |
CN112085683B (en) | Depth map credibility detection method in saliency detection | |
CN114067122A (en) | Two-stage binarization image processing method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |