CN104200463A - Fourier-Merlin transform and maximum mutual information theory based image registration method - Google Patents

Fourier-Merlin transform and maximum mutual information theory based image registration method Download PDF

Info

Publication number
CN104200463A
CN104200463A CN201410383871.6A CN201410383871A CN104200463A CN 104200463 A CN104200463 A CN 104200463A CN 201410383871 A CN201410383871 A CN 201410383871A CN 104200463 A CN104200463 A CN 104200463A
Authority
CN
China
Prior art keywords
fourier
mutual information
image
registration
transform
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.)
Granted
Application number
CN201410383871.6A
Other languages
Chinese (zh)
Other versions
CN104200463B (en
Inventor
马文萍
马晶晶
黄晓丹
焦李成
公茂果
范霞妃
陈凯
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN201410383871.6A priority Critical patent/CN104200463B/en
Publication of CN104200463A publication Critical patent/CN104200463A/en
Application granted granted Critical
Publication of CN104200463B publication Critical patent/CN104200463B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Image Analysis (AREA)

Abstract

The invention discloses a Fourier transform and powell algorithm based image registration method which mainly solves the problems that the Fourier-Merlin transform based registration accuracy is not high and the powell algorithm based registration is sensitive to an original value. The Fourier transform and powell algorithm based image registration method comprises (1) inputting a float image and a reference image; (2) performing low-pass filtering processing; (3) obtaining a transformation parameter through Fourier-Merlin transform; (4) calculating a mutual information value; (5) judging whether the mutual information value is the belt or not according to the mutual information and the powell; (6) continuing the search if not and repeating processes of space geometric transformation, statistics of area-color histogram, calculation of mutual information and optimized judgment; (7) searching a parameter satisfying the accuracy requirement; (8) performing geometric transformation; (9) performing image fusion. The Fourier transform and powell algorithm based image registration method overcomes the disadvantage that a Powell optimization algorithm is sensitive to the original value and obtains a good registration accuracy.

Description

Method for registering images based on Fourier-mellin transform and maximum mutual information theory
Technical field
Invention belongs to technical field of image processing, and what further relate to image registration field a kind ofly first carries out a kind of high-precision method for registering that thick coupling obtains initial parameter.This method can be for the registration of the synthetic SAR image of the medical image through affined transformation and radar aperture.
Background technology
In recent years, image registration is applied to all types of target identification and image co-registration field, and be applied to image registration field with evolution algorithm, is a hot issue.From registration process, most important part is exactly to find accurately suitable registration parameter, utilizes registration parameter to carry out suitable spatial alternation to image, thereby obtains correct registration results.
At present, according to registration process, can be divided into image registration and the image registration based on gray scale based on feature, their key distinction is whether comprise segmentation step.The cutting procedure that method based on feature comprises image, for extracting the characteristic information of image, then carry out the registration of notable feature, method for registering based on gray scale, without carrying out cutting apart and feature extraction of image, directly uses the statistical information of image as the similarity measurement of registration.
The people such as Chen in 1994 have proposed a kind of method for registering images based on Fourier plum forests (Fourier-Mellin) conversion.The method hypothesis be two width images through the image after the flexible and translation transformation of rotation yardstick.The method converts by calculating the anti-Fourier of two width image power spectrums the relative displacement that corresponding peak is asked for them, by picture amplitude spectrum is carried out to logarithm-utmost point (Log-Polar) conversion, in logarithm-utmost point space, by the method that is similar to calculating relative translation, try to achieve the anglec of rotation.Abundant experimental results finds, in the less demanding situation of registration accuracy, the method has very strong robustness, but in situation for the precision of the further registration of needs, the result that the method obtains can only be as the initial estimate of registration.
Conventionally, floating image is a kind of affined transformation with respect to reference picture.After having determined the registration parameter of floating image and reference picture, spatial alternation model has just been set up.Floating image is carried out to spatial inverse transform, just can obtain registering images.By calculating the joint histogram of registering images and reference picture, obtain mutual information value.Mutual information value can be obtained by the joint histogram of two width images, and joint histogram adopts partial volume method of interpolation
(PV) try to achieve, then utilize Powell search registration parameter, because Powell algorithm has the defect that relies on initial point, can cause search to be absorbed in local extremum, or cause registration failure.
Summary of the invention:
The invention is intended to overcome the shortcoming of said method, propose a kind of the method for registering images of Fourier plum forests (Fourier-Mellin) conversion and the theoretical combination of maximum mutual information.
For achieving the above object, specific implementation step of the present invention is:
(1) two image one width reference picture one width floating images subject to registration of input
(2) by Fourier transform displacement theory, obtain the relative translation amount of floating image and reference picture
3a) calculate the discrete Fourier transform (DFT) of two width images;
3b) again by the cross-power spectrum calculating phase differential of two width images;
3c) ask the inverse transformation of cross-power spectrum, obtain an impulse function, peak value of pulse position is relative translation amount Xtran and Ytran.
(3) by Fourier-mellin transform, estimate that floating image is with respect to the anglec of rotation of reference picture
2a) by two dimension discrete fourier transform, obtaining picture amplitude composes;
2b) in logarithm-utmost point (Log-Polar) space application Fourier-mellin transform, obtain anglec of rotation theta and zoom factor delta.
(4) two width original images are carried out to pre-service by low-pass filter
(5) initial point and initial search direction are set, initial point is set to relative translation amount and the anglec of rotation that (2) (3) step is estimated, the direction of search is unit direction
(6) according to above-mentioned parameter, floating image is carried out to space geometry conversion (affine)
(7) calculate former reference picture and the mutual information value that converts rear image
7a) use the joint histogram of PV (Partial Volume) interpolation calculation two width images;
7b) obtain joint probability distribution function and the marginal distribution function of two width images;
7c) utilize probability distribution function and marginal distribution function to try to achieve entropy, thereby obtain normalized mutual information value.
(8) because mutual information does not have concrete expression formula about these three parameters, so cannot utilize traditional optimized algorithm, use Directional acceleration (Powell) to move three transformation parameter values at iteration point maximizing place by direct relatively normalized mutual information numerical values recited here
(9) if reach maximal value, export registration parameter, if do not return to step (6)
(10) image and former reference picture after optimum registration parameter conversion are carried out to image co-registration, obtain registration fused images
First the present invention utilizes the anti-Fourier of two width image power spectrums to convert the relative displacement that corresponding peak is asked for two width images, by picture amplitude spectrum is carried out to logarithm-utmost point (Log-Polar) coordinate transform, in logarithm-utmost point space, by the method that is similar to calculating relative translation, ask and obtain the anglec of rotation, then utilize the anglec of rotation and the translational shifting in-migration of trying to achieve to set up spatial alternation model, using maximum mutual information as similarity measurement, by Powell algorithm, carry out optimizing, obtain optimal registration parameter, floating image is carried out to spatial inverse transform, finally floating image and former reference picture after conversion are carried out to image co-registration, just can obtain registration fused images.Compared with prior art, the present invention has the following advantages:
First: the Powell optimized algorithm that the present invention applies based on maximum mutual information theory after image registration is carried out in application Fourier plum forests (Fourier-Mellin) conversion again carries out Accuracy Matching, registration accuracy is improved greatly, overcome Fourier-mellin transform and for the registration of high-precision requirement, do not there is the shortcoming of robustness.
Second: the present invention is when application Powell algorithm, due to each in the Powell algorithm basic, all can the new direction of search of unconditional use replace the original old direction of search, and the present invention can consider the problem of linear independence when replacing the direction of search, when direction of search linear independence, can guarantee every take turns in iteration, take the direction of search as the row formula of row non-vanishing, therefore these directions are linear independences, and along with the conjugated degree of the increase direction of search of iteration strengthens gradually.
The the 3rd: the present invention has applied the result parameter of Fourier plum forests (Fourier-Mellin) conversion registration as the initial value of Powell search, overcome the shortcoming of Powell algorithm to initial value sensitivity, the shortcoming of registration poor effect, improves registration accuracy greatly.
Accompanying drawing explanation:
Fig. 1 is the process flow diagram of invention
Fig. 2 is the registration results that the present invention is applied to synthetic-aperture radar SAR image.
Fig. 3 is the registration results that the present invention is applied to synthetic-aperture radar SAR image.
Fig. 4 is the registration results that the present invention is applied to medical image.
Embodiment:
Below in conjunction with 1 pair of step of the present invention of accompanying drawing, be described further.
Step 1, input two width images, a width reference picture and a width floating image, this two width image is the two width images with affine transformation relationship.
Step 2, carries out respectively low-pass filtering pre-service to this two width image.
Low-pass filtering treatment is intended to image to carry out simple denoising.
Step 3, obtains the relative translation amount of floating image and reference picture with Fourier transform displacement.
If f 2(x, y), f 1(x, y) is two width images, f 2(x, y) is f 1(x, y) is at x and y direction difference translation x 0and y 0after image,
f 2(x,y)=f 1(x-x 0,y-y 0) (1)
If f 1and f 2corresponding Fourier transform is respectively F 1(u, v) and F 2(u, v), has following relation between them: F 2 ( u , v ) = F 1 ( u , v ) e - j ( ux 0 + vy 0 ) - - - ( 2 )
F 1(x, y) and f 2the cross-power spectrum of (x, y) is made as G (u, v),
G ( u , v ) = F 1 ( u , v ) F 2 * ( u , v ) | F 1 ( u , v ) F 2 * ( u , v ) | = e j ( ux 0 + vy 0 ) - - - ( 3 )
F wherein 2 *represent F 2complex conjugate.
Can find out, the phase place of cross-power spectrum is equivalent to the phase differential between image, by formula (3) is carried out to inverse fourier transform, at (x, y) space will form an impulse function, this impulse function is zero at other functional values everywhere, and only non-vanishing at the functional value at peak value of pulse place, peak value of pulse position is the translational movement x between reference picture and floating image 0and y 0.
Therefore, the present invention can will form an impulse function in (x, y) space by formula (3) is carried out to inverse fourier transform, find peak value of pulse position, and this peak value of pulse position is the relative translation amount x of floating image and reference picture 0and y 0.
Step 4, with the anglec of rotation and the zoom factor of Fourier-mellin transform estimation floating image.
Consider the two width image s (x, y) and the r (x, y) that are registered, wherein r (x, y) represent floating image, s (x, y) represents reference picture, wherein s (x, y) be the image of r (x, y) after translation, rotation and yardstick scale transformation, that is:
s(x,y)=r[(σ(xcosα+ysinα)-x 0,σ(-xsinα+ycosα)-y0)] (4)
In formula, x 0and y 0for the translational movement of floating image relative reference image, α is the anglec of rotation of floating image relative reference image, and σ is zoom factor.
Between the Fourier Fourier conversion S (u, v) that s (x, y) and r (x, y) are corresponding so and R (u, v), meet:
|S(u,v)|=σ -2R[σ -1(ucosα+vsinα),σ -1(ucosα+vsinα)]| (5)
Wherein || represent to ask amplitude spectrum, as can be seen from the above equation, anglec of rotation α and zoom factor σ can carry out decouples computation with translational movement, spectrum amplitude is only relevant with the anglec of rotation and zoom factor, and irrelevant with translational movement, therefore, can compose and obtain the anglec of rotation and zoom factor by picture amplitude.
Definition: r p1(θ, log ρ)=r p(θ, ρ) (6)
s p1(θ,logρ)=s p(θ,ρ) (7)
R wherein pand s pbeing respectively r (x, y) and the amplitude spectrum of s (x, y) in polar coordinate system (θ, ρ), is r p=| R (u, v) |, s p=| S (u, v) |, wherein θ=arctan (v/u), α is the anglec of rotation, σ is zoom factor, draws so easily
s p1(θ,logρ)=r p1(θ-α,logρ-logσ) (8)
Or s p1(θ, λ)=r p1(θ-α, λ-κ) (9)
λ=log ρ wherein, κ=log σ
Can find out, by above-mentioned conversion, formula (9) is transformed to the form identical with formula (1), so just, in logarithm-utmost point (Log-Polar) space application Fourier conversion displacement, according to formula (2) and formula (3), tries to achieve α and κ.If the end of logarithm, is taken as e, so
σ=e κ (10)
So just obtained anglec of rotation α and scale factor σ, according to the α obtaining and σ, image s (x, y) has been carried out to inverse transformation and obtain image s 1(x, y), then through type (2) and formula (3) calculate s at image space 1translational movement x between (x, y) and r (x, y) 0and y 0.Formula (9) is called as Fourier plum forests (Fourier-Mellin) conversion.
Step 5, arranges initial point and inceptive direction, and inceptive direction is the relative translation amount x obtaining by Fourier transform in above-mentioned steps 0and y 0with anglec of rotation α.These three parameters are initial registration parameter.
Step 6, carries out space geometry conversion to floating image.
In process of image registration, spatial alternation model adopts affined transformation to describe.For two width images, the coordinate system that model is unified, the center of definition image is true origin, this is that true origin is different from the upper left corner of the image conventionally defining, so need to carry out coordinate translation to floating image, floating image will go to mate with reference picture through the conversion that moves horizontally, vertically moves and rotate around initial point, so the arbitrfary point O of floating image fcoordinate points O to reference picture raffined transformation can be described as:
O R=t 1(c,d)×t 2(θ)×t 3(a,b)×t 4(tx,ty)×O F (11)
Wherein, O ffor any point coordinate in floating image, O rit is any point coordinate in reference picture.O fprocess affined transformation is in R coordinate system.T 1(c, d), t 2(θ), t 3(a, b), t 4(tx, ty) is all 3 * 3 matrix.T 1(c, d) moves to picture centre by floating image initial point from the image upper left corner, and moving displacement is (c, d); t 2(θ) floating image is rotated around new initial point (picture centre), the anglec of rotation is θ; t 3(a, b) goes back to postrotational image to the upper left corner by true origin translation again, and moving displacement is (a, b); t 4(tx, ty) is that floating image is made respectively tx along level, vertical direction, ty translation.Because floating image is identical with reference picture resolution, so t 1(c, d) and t 3true origin translation parameters in (a, b) is identical, once and picture size determine, the value of translation parameters is also determined.
Tx, ty, θ tri-parameters, that is: f when therefore just remaining searching makes normalization information reach maximal value max=maxf (tx, ty, θ), belongs to multi-parameters optimization problem.
According to the initial parameter arranging, floating image is done to space geometry variation and obtain converting rear image.
Step 7, is used PV (Partial Volume) interpolation calculation joint histogram, thus the mutual information value of image after calculating former reference picture and converting.
The probability distribution function of reference image R and floating image F is to add up the frequency that gray-scale value separately occurs in entire image, and joint probability distribution function is the statistics two width images frequencies that a pair of gray-scale value occurs in same position.Adopt PV (Partial Volume) method of interpolation to ask normalized joint histogram herein, then obtain joint probability distribution function.
If the coordinate b (i, j) of the upper any point of floating image F in the coordinate system of reference picture, obtains newly putting T through reciprocal transformation r(b), its vicinity points is respectively n 1, n 2, n 3, n 4.For fear of reference picture, introduce non-existent gray-scale value originally, so adopt PV interpolation to utilize T r(b) four contiguous points calculate associating grey level histogram, revise four gray-scale values pair in joint histogram:
h(F(b),R(n 1))、h(F(b),R(n 2))、h(F(b),R(n 3))、h(F(b),R(n 4))。Each correction ω in Fig. 1 1to ω 4shown area definition, and 4 increment sums are that 1, PV method of interpolation more important point is, the value that in joint histogram, each gray scale is right be many decimals that change by a small margin and, no longer with 1 increase, thereby obtain smooth objective function, be conducive to Optimizing Search.
When floating image and the complete registration of reference picture, without any translation or rotation, the point of the joint histogram of image concentrates on diagonal line, and now normalized mutual information value is maximum; Mobile successively along vertical direction when floating image, the point of its joint histogram more and more departs from diagonal line, being distributed in around diagonal line of dispersion.
The maximum mutual information computing formula of two width images is: I (R, F)=H (R)+H (F)-H (R, F), the people's such as Studholme research shows that maximum mutual information is more responsive to the overlap ratio between two width images subject to registration, therefore maximum mutual information formula is carried out to simple extension, obtains normalized mutual information computing formula:
( R , F ) = H ( R ) + H ( F ) H ( R , F ) - - - ( 12 )
Normalized mutual information can better reflect the variation of registration as the similarity measure of two width images, reduces the susceptibility to doubling of the image region, improves registration accuracy.H in above formula (R) is the entropy of reference picture, and H (F) is the entropy of floating image; H (R, F) be reference picture and floating image combination entropy, need to first obtain joint probability distribution function, and then obtain respectively about R the marginal distribution function of F, finally obtain again entropy separately, bring into and in normalized mutual information formula, try to achieve normalized mutual information value.
Step 8, utilizes the optimizing of Powell algorithm according to maximum mutual information theory.
(1) given permissible error ε > 0 initial point X 0direction with n linear independence
D (1,1), d (1,2)d (1, n)put k=1.
(2) put x (k, 0)=x (k-1), from x (k, 0)set out, successively along direction d (k, 1), d (k, 2)d (k, n) carry out linear search, obtain an x (k, 1), x (k, 2)..., x (k, n), ask m, make f (x (k, m-1))-f (x (k, m))=max{f (x (k, j-1))-f (x (k, j)) make d (k, n+1)=x (k, n)-x (k, 0)if || x (k, n)-x (k, 0)||≤ε stops calculating; Otherwise, carry out (3) step.
(3) ask λ n+1make f (x (k, 0))+λ n+1d (k, n+1)=minf (x (k, 0)+ λ d (k, n+1)) make x (k+1,0)=x (k)=x (k, 0)+ λ n+1d (k, n+1if) || x (k)-x (k-1)||≤ε stops calculating, and obtains x (k)otherwise carry out step (4)
(4) if | λ n + 1 | > [ f ( x ( k , 0 ) - f ( x ( k + 1,0 ) ) ) f ( x ( k , m - 1 ) ) - f ( x ( k , m ) ) ] 1 2 Order
d (k+1,j)=d (k,j),j=1,…,m-1
d (k+1,j)=d (k,j+1),j=m,…,n
k=k+1
Otherwise, order d ( k + 1 , j ) = d ( k , j ) , j = 1 , . . . , n k = k + 1 Forward step (2) to
Because mutual information does not have concrete function expression about these three parameters, so cannot utilize traditional optimized algorithm, therefore, adopt Directional acceleration (Powell) by the direct relatively mobile iteration point of size of normalized mutual information numerical value, to obtain three parameter values at maximal value place herein.Utilize above-mentioned Powell optimization method to carry out iteration optimizing to registration parameter, wherein Fibonacci method is used in linear search.
Step 9, if reach maximal value, exports registration parameter, if do not return to step 6.
Step 10, carries out image co-registration to floating image and the former reference picture applied after optimum registration parameter conversion, obtains registration fused images.
In image co-registration process, in order to see clearly result and the error of registration.We adopt and the gray scale in registration results figure to be re-started to assignment process, and it is original 30 percent that the overall assignment of gray-scale value of reference picture becomes, and the gray-scale value assignment of the floating image after conversion becomes original 70 percent.If gray-scale value is 255 or 0, indirect assignment is former gray-scale value.So, can so that the result of registration obviously show clearly, registration error also can intuitively be found out.
Effect of the present invention can illustrate by following further emulation:
Method for registering images of the present invention is combined into aperture radar SAR image to two and one group of medical image carries out registration emulation, can intuitively find out raising and and the good effect of registration accuracy from registration results.
The simulation result of Technologies Against Synthetic Aperture Radar SAR image as shown in Figures 2 and 3, can intuitively find out that the floating image that affined transformation is crossed has passed through after rotation and translation and reference picture registration accurately, and complete fusion.
To one group of medical image simulation result as shown in Figure 4, can intuitively find out, the perfect registration of its registering images and reference picture has also merged.
By above-mentioned experimental result emulation, feasibility of the present invention and accuracy have been verified.

Claims (6)

1. the method for registering images based on Fourier-mellin transform and maximum mutual information theory, comprises the steps:
(1) two images subject to registration of input, a width reference picture, another width floating image;
(2) by Fourier transform displacement theory, obtain the relative translation amount of floating image and reference picture;
3a) calculate the discrete Fourier transform (DFT) of two width images;
3b) again by the cross-power spectrum calculating phase differential of two width images;
3c) ask the inverse transformation of cross-power spectrum, obtain an impulse function, peak value of pulse position is relative translation amount Xtran and Ytran;
(3) by Fourier-mellin transform, estimate that floating image is with respect to the anglec of rotation of reference picture;
2a) by two dimension discrete fourier transform, obtaining picture amplitude composes;
2b) in logarithm-utmost point (Log-Polar) space application Fourier-mellin transform, obtain anglec of rotation theta and zoom factor delta;
(4) two width original images are carried out to pre-service by low-pass filter;
(5) initial point and initial search direction are set, initial point is set to the relative translation amount of step (2) estimation and the anglec of rotation that step (3) is estimated, the direction of search is unit direction;
(6) according to above-mentioned relative translation amount and the anglec of rotation, floating image is carried out to space geometry conversion (affine);
(7) calculate former reference picture and the mutual information value that converts rear image;
7a) use the joint histogram of PV (Partial Volume) interpolation calculation two width images;
7b) obtain joint probability distribution function and the marginal distribution function of two width images;
7c) utilize probability distribution function and marginal distribution function to try to achieve entropy, thereby obtain normalized mutual information value;
(8) with Directional acceleration (Powell), by direct relatively normalized mutual information numerical values recited, move three transformation parameter values at iteration point maximizing place;
(9) if reach maximal value, export registration parameter, if do not return to step (6);
(10) image and former reference picture after optimum registration parameter conversion are carried out to image co-registration, obtain registration fused images.
2. the method for registering images based on Fourier-mellin transform and maximum mutual information theory according to claim 1, it is characterized in that, step 2) described low-pass filtering treatment is, by second order Gauss low-pass filtering, former reference picture and floating image are carried out to pre-service, and the frequency transfer function of selection is:
H ( u , v ) = e - D 2 ( u , v ) / 2 D 0 2
D ( u , v ) = u 2 + v 2
Wherein D (u, v) is apart from the distance of Fourier transform initial point, D 0it is cutoff frequency.
3. the method for registering images based on Fourier-mellin transform and maximum mutual information theory according to claim 1, it is characterized in that, step 3) and step 4) in the initial parameter value that obtains of the Fourier transform that uses be xtran (displacement of x direction), ytran (displacement of y direction) and theta (floating image is with respect to the anglec of rotation of reference picture), preserve the registration parameter of these three rough estimates.
4. the method for registering images based on Fourier-mellin transform and maximum mutual information theory according to claim 1, it is characterized in that, step 5) and 6) initial parameter is set in, use the estimated parameter of Fourier-mellin transform gained as initial transformation parameter, floating image after low-pass filtering is carried out to space geometry conversion, geometric transformation model adopts affine Transform Model, and affine Transform Model is:
x , y , = a 11 a 12 a 21 a 22 x y + tx ty
Wherein (x, y) represents for the coordinate of former floating image, and the coordinate of (x', y') floating image after for conversion represents, tx, and ty is that two width images are in the relative displacement of x and y direction.
5. the method for registering images based on Fourier-mellin transform and maximum mutual information theory according to claim 1, is characterized in that step 7c) the middle normalized mutual information value of calculating between reference picture and registering images, computing formula is: Y ( R , F ) = H ( R ) + H ( F ) H ( R , F )
H in above formula (R) is the entropy of reference picture, and H (F) is the entropy of floating image; H (R, F) be reference picture and floating image combination entropy, need to first obtain joint probability distribution function, and then obtain respectively about R the marginal distribution function of F, finally obtain again entropy separately, bring into and in normalized mutual information formula, try to achieve normalized mutual information value.
6. the method for registering images based on Fourier-mellin transform and maximum mutual information theory according to claim 1, it is characterized in that, step 10) in, reference picture and registering images are merged to demonstration: adopt the gray scale in registration results figure is re-started to assignment processing, the overall assignment of gray-scale value of the first width figure becomes original 30 percent, the gray-scale value assignment of the second width figure becomes original 70 percent, if gray-scale value is 255 or 0, indirect assignment is former gray-scale value.
CN201410383871.6A 2014-08-06 2014-08-06 Based on the method for registering images that Fourier-mellin transform and maximum mutual information are theoretical Active CN104200463B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410383871.6A CN104200463B (en) 2014-08-06 2014-08-06 Based on the method for registering images that Fourier-mellin transform and maximum mutual information are theoretical

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410383871.6A CN104200463B (en) 2014-08-06 2014-08-06 Based on the method for registering images that Fourier-mellin transform and maximum mutual information are theoretical

Publications (2)

Publication Number Publication Date
CN104200463A true CN104200463A (en) 2014-12-10
CN104200463B CN104200463B (en) 2018-04-10

Family

ID=52085749

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410383871.6A Active CN104200463B (en) 2014-08-06 2014-08-06 Based on the method for registering images that Fourier-mellin transform and maximum mutual information are theoretical

Country Status (1)

Country Link
CN (1) CN104200463B (en)

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106323242A (en) * 2016-08-03 2017-01-11 北京奇虎科技有限公司 Space structure detection method and device for unmanned aerial vehicle
CN106600634A (en) * 2016-12-12 2017-04-26 哈尔滨工业大学 Maximum mutual information image registration method based on improved volume interpolation method
CN106682689A (en) * 2016-12-16 2017-05-17 西安汇明光电技术有限公司 Image matching method based on multiscale Fourier-Mellin transform
CN107924557A (en) * 2015-07-16 2018-04-17 数字标记公司 Signal processor and method for the geometric transformation of the estimation image of digital data extraction
CN108510533A (en) * 2018-04-02 2018-09-07 北京理工大学 Fourier plum forests registration based on FPGA and Laplce's blending image acceleration system
CN108921777A (en) * 2018-06-11 2018-11-30 昆明理工大学 A kind of respiratory movement gated image method for registering based on the PET-CT detection true number of photons of ring
CN109298314A (en) * 2018-09-21 2019-02-01 福建工程学院 Circuit board port connect-disconnect life test macro and method based on image procossing
CN110473233A (en) * 2019-07-26 2019-11-19 上海联影智能医疗科技有限公司 Method for registering, computer equipment and storage medium
CN112184764A (en) * 2020-09-10 2021-01-05 太原理工大学 Target tracking method based on Fourier-Mellin transform
CN112614170A (en) * 2021-01-08 2021-04-06 上海交通大学 Fourier power spectrum-based single particle image registration method for cryoelectron microscope
CN112669360A (en) * 2020-11-30 2021-04-16 西安电子科技大学 Multi-source image registration method based on non-closed multi-dimensional contour feature sequence
CN112686933A (en) * 2020-12-29 2021-04-20 中国科学院长春光学精密机械与物理研究所 On-satellite image registration superposition enhancement method and system based on improved cross-power spectrum
CN112862866A (en) * 2021-04-13 2021-05-28 湖北工业大学 Image registration method and system based on sparrow search algorithm and computing equipment
CN114529590A (en) * 2022-01-26 2022-05-24 中国铁道科学研究院集团有限公司电子计算技术研究所 Image registration method and system for motor train unit vehicle bottom fault detection

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110966955A (en) * 2019-11-15 2020-04-07 南京理工大学 Spherical subaperture splicing method based on plane registration

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080063298A1 (en) * 2006-09-13 2008-03-13 Liming Zhou Automatic alignment of video frames for image processing
CN103839265A (en) * 2014-02-26 2014-06-04 西安电子科技大学 SAR image registration method based on SIFT and normalized mutual information

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080063298A1 (en) * 2006-09-13 2008-03-13 Liming Zhou Automatic alignment of video frames for image processing
CN103839265A (en) * 2014-02-26 2014-06-04 西安电子科技大学 SAR image registration method based on SIFT and normalized mutual information

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
常伯乐: "医学图像配准和融合的研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 *
范瑾瑾等: "改进的基于小波变化的图像配准方法", 《计算机工程》 *

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107924557A (en) * 2015-07-16 2018-04-17 数字标记公司 Signal processor and method for the geometric transformation of the estimation image of digital data extraction
CN106323242A (en) * 2016-08-03 2017-01-11 北京奇虎科技有限公司 Space structure detection method and device for unmanned aerial vehicle
CN106600634A (en) * 2016-12-12 2017-04-26 哈尔滨工业大学 Maximum mutual information image registration method based on improved volume interpolation method
CN106682689A (en) * 2016-12-16 2017-05-17 西安汇明光电技术有限公司 Image matching method based on multiscale Fourier-Mellin transform
CN108510533B (en) * 2018-04-02 2021-08-17 北京理工大学 Fourier mellin registration and Laplace fusion image acceleration system based on FPGA
CN108510533A (en) * 2018-04-02 2018-09-07 北京理工大学 Fourier plum forests registration based on FPGA and Laplce's blending image acceleration system
CN108921777A (en) * 2018-06-11 2018-11-30 昆明理工大学 A kind of respiratory movement gated image method for registering based on the PET-CT detection true number of photons of ring
CN109298314A (en) * 2018-09-21 2019-02-01 福建工程学院 Circuit board port connect-disconnect life test macro and method based on image procossing
CN109298314B (en) * 2018-09-21 2020-08-28 福建工程学院 Circuit board port plugging life test system and method based on image processing
CN110473233B (en) * 2019-07-26 2022-03-01 上海联影智能医疗科技有限公司 Registration method, computer device, and storage medium
CN110473233A (en) * 2019-07-26 2019-11-19 上海联影智能医疗科技有限公司 Method for registering, computer equipment and storage medium
CN112184764A (en) * 2020-09-10 2021-01-05 太原理工大学 Target tracking method based on Fourier-Mellin transform
CN112669360A (en) * 2020-11-30 2021-04-16 西安电子科技大学 Multi-source image registration method based on non-closed multi-dimensional contour feature sequence
CN112669360B (en) * 2020-11-30 2023-03-10 西安电子科技大学 Multi-source image registration method based on non-closed multi-dimensional contour feature sequence
CN112686933A (en) * 2020-12-29 2021-04-20 中国科学院长春光学精密机械与物理研究所 On-satellite image registration superposition enhancement method and system based on improved cross-power spectrum
CN112686933B (en) * 2020-12-29 2024-03-08 中国科学院长春光学精密机械与物理研究所 Method and system for enhancing registration and superposition of on-board images based on improved cross power spectrum
CN112614170A (en) * 2021-01-08 2021-04-06 上海交通大学 Fourier power spectrum-based single particle image registration method for cryoelectron microscope
CN112614170B (en) * 2021-01-08 2022-08-05 上海交通大学 Fourier power spectrum-based single particle image registration method for cryoelectron microscope
CN112862866A (en) * 2021-04-13 2021-05-28 湖北工业大学 Image registration method and system based on sparrow search algorithm and computing equipment
CN114529590A (en) * 2022-01-26 2022-05-24 中国铁道科学研究院集团有限公司电子计算技术研究所 Image registration method and system for motor train unit vehicle bottom fault detection

Also Published As

Publication number Publication date
CN104200463B (en) 2018-04-10

Similar Documents

Publication Publication Date Title
CN104200463A (en) Fourier-Merlin transform and maximum mutual information theory based image registration method
CN103310453B (en) A kind of fast image registration method based on subimage Corner Feature
CN103727930B (en) A kind of laser range finder based on edge matching and camera relative pose scaling method
Park et al. Multi-scale tensor voting for feature extraction from unstructured point clouds
CN103679714B (en) A kind of optics and SAR automatic image registration method based on gradient cross-correlation
WO2019042232A1 (en) Fast and robust multimodal remote sensing image matching method and system
CN102800097B (en) The visible ray of multi-feature multi-level and infrared image high registration accuracy method
CN104200461B (en) The remote sensing image registration method of block and sift features is selected based on mutual information image
CN105354841B (en) A kind of rapid remote sensing image matching method and system
CN104732546B (en) The non-rigid SAR image registration method of region similitude and local space constraint
CN102800098B (en) Multi-characteristic multi-level visible light full-color and multi-spectrum high-precision registering method
CN102819839B (en) High-precision registration method for multi-characteristic and multilevel infrared and hyperspectral images
CN106529591A (en) Improved MSER image matching algorithm
CN103456022A (en) High-resolution remote sensing image feature matching method
CN101916445A (en) Affine parameter estimation-based image registration method
CN103714547B (en) Image registration method combined with edge regions and cross-correlation
CN102800099B (en) Multi-feature multi-level visible light and high-spectrum image high-precision registering method
CN104036480A (en) Surf algorithm based quick mismatching point eliminating method
CN111462198B (en) Multi-mode image registration method with scale, rotation and radiation invariance
CN103136525A (en) High-precision positioning method for special-shaped extended target by utilizing generalized Hough transformation
CN103679720A (en) Fast image registration method based on wavelet decomposition and Harris corner detection
CN102542296A (en) Method for extracting image characteristics by multivariate gray model-based bi-dimensional empirical mode decomposition
CN102324045A (en) Invariant-moment target recognition method based on Radon transformation and polar harmonic transformation
CN105279522A (en) Scene object real-time registering method based on SIFT
CN103325104B (en) Based on the face image super-resolution reconstruction method of iteration sparse expression

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant