CN100446034C - Image elastic registrating method based on limited sampling global optimisation - Google Patents

Image elastic registrating method based on limited sampling global optimisation Download PDF

Info

Publication number
CN100446034C
CN100446034C CNB2006101237965A CN200610123796A CN100446034C CN 100446034 C CN100446034 C CN 100446034C CN B2006101237965 A CNB2006101237965 A CN B2006101237965A CN 200610123796 A CN200610123796 A CN 200610123796A CN 100446034 C CN100446034 C CN 100446034C
Authority
CN
China
Prior art keywords
function
deformation
deformation pattern
registration
image
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.)
Expired - Fee Related
Application number
CNB2006101237965A
Other languages
Chinese (zh)
Other versions
CN1975781A (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.)
Southern Medical University
Original Assignee
Southern Medical 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 Southern Medical University filed Critical Southern Medical University
Priority to CNB2006101237965A priority Critical patent/CN100446034C/en
Publication of CN1975781A publication Critical patent/CN1975781A/en
Application granted granted Critical
Publication of CN100446034C publication Critical patent/CN100446034C/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Image Analysis (AREA)

Abstract

The invention opens an elastic image registration method based on limited sampling and global optimization. The steps of the registration are: First read the deformation image; compute the maximum frequency of defined target function, perform the average sampling calculation on the deformation coefficients with two times of the maximum frequency of target function; get the sequence of deformation images; then read into the reference images; deform the deformation images to finish the image registration with the deformation function that corresponds to minimum target function value. Furthermore, start from the coefficient value of deformation function in the rough registration; search the global minimum point in target function with the gradient descent algorithm.

Description

Image elastic registrating method based on limited sampling global optimisation
Technical field
The present invention relates to the graph image conversion in the plane of delineation, be specifically related to a kind of image elastic registrating method of global optimization, be applicable to fields such as image comparison, data fusion, mutation analysis and Target Recognition.
Background technology
Image registration is meant for piece image seeks a kind of spatial alternation, makes corresponding point on it and another width of cloth image reach coupling on the space.This coupling be meant content identical o'clock on two matching images, identical locus is arranged.
Method for registering images commonly used has a variety of, but their step of registration is identical substantially, mainly may further comprise the steps:
(1) constructs the warping function that image is out of shape.Existing method for registering can be divided into two kinds of Rigid Registration method and elastic registrating methods.The warping function that uses in the Rigid Registration method is a kind of rigid deformation function, and it can only carry out simple relatively conversion such as translation, rotation to figure.If pattern distortion is serious, just need to introduce the elastic deformation function during registration, corresponding method for registering is elastic registrating method just.The elastic deformation function has enough versatilities, can approach nonlinear transformation arbitrarily.The elastic deformation function can be divided into two classes substantially: a class is a non-parametric model.In this model, image is regarded as the resilient film of a slice, is out of shape under the effect of external force and internal force, and finally reaches balance.External force is determined that by the difference of reference picture and deformation pattern internal force is determined by the intensity peace slippage degree of film.The most famous in this model is fluid model, also has diffusion model, light stream model etc. in addition.Another kind of is parameterized model, and model need use some parameters and basis function to represent, the computation process of warping function is the CALCULATION OF PARAMETERS process just.The kind of basis function is a lot, and common basis function comprises that polynomial expression, harmonic function, classification basis function, small echo are with B batten etc.
(2) structure needs the similarity criterion of the reference picture and the deformation pattern of registration.The similarity criterion is also referred to as objective function sometimes, and it is to weigh similarity between reference picture and the deformation pattern.Objective function commonly used has mutual information, mean square deviation etc.
(3) objective function is optimized calculating, reaches its extreme value up to objective function.This process constantly is out of shape with warping function deformation pattern exactly, and when objective function reached extreme value, when promptly the similarity between the deformation pattern after reference picture and the distortion was maximum, registration process had also just been finished.Mostly optimization method commonly used in the above-mentioned registration process is some local optimization methods, as Newton method, half Newton method, conjugate vector method etc.The shortcoming of this method is the global extremum that can not guarantee to find objective function, thereby can not guarantee the correctness of registration results.Also can use global optimization approach for elastic registrating method, corresponding global optimization method has simulated annealing, genetic method, tunneling method, method of exhaustion, method such as a lot of somes methods at random at random.Wherein, simulated annealing and genetic method are oversize computing time, and can not guarantee to obtain at last the overall situation and separate; The shortcoming of tunneling method is exactly that its optimization objects has certain limitation, and versatility is bad; And various methods based on limit at random do not have definite calculation methods yet on the quantity Calculation of random point, obtaining the accurate overall situation separates, have only the quantity that strengthens random point, this just causes computing time long, can not guarantee the correctness of last registration results simultaneously.
Summary of the invention
Technical matters to be solved by this invention is the calculated amount that reduces the global extremum point of calculating target function, shortens the time of the elastic registrating of image, improves the robustness of image registration.
It is as described below that the present invention solves the technical solution of above-mentioned technical matters.
A kind of image elastic registrating method based on limited sampling global optimisation, this method is made up of following steps:
(1) reads in deformation pattern, calculate its frequency spectrum, calculate its highest frequency ω by this frequency spectrum with fast fourier transform m
(2), calculate the highest frequency of objective function again by this frequency spectrum with the frequency spectrum of fourier transform method calculating target function E (C) with respect to deformation coefficient C.This highest frequency is ω Max=2 ω mMax (g ' (x, a)), wherein ω mBe the highest frequency of deformation pattern in the step (1), (x a) is the derivative of warping function to g '.When batten frequency n=1, (x is 1 C) to g '.
(3) the highest frequency ω of 2 objective functions that obtain set by step Max2 times of spaces to deformation coefficient C correspondence carry out uniform sampling and calculate, obtain the value c of a series of different deformation coefficient C iPairing warping function g (x, c i), respectively deformation pattern is out of shape with resulting these warping functions again, obtain deformation pattern series;
(4) read in reference picture, calculate the mean square deviation of the deformation pattern series that reference picture and step (3) obtain respectively, obtain target function value data set E (c i), relatively the size of these target function values finds wherein minimum target function value E (c *), with this minimum target functional value pairing warping function g (x, c *) deformation pattern is out of shape, obtain the deformation pattern of thick registration.
(5) the target function value E (c of the minimum that is found with step (4) *) pairing deformation coefficient value c *Be starting point, with the minimum value of gradient descent method ferret out function E (C)
Figure C20061012379600041
Use the pairing warping function of this minimum value again Deformation pattern is out of shape, just obtains the deformation pattern of smart registration.
According to prior art as can be known, in fact just two width of cloth images subject to registration, wherein a width of cloth is as the reference image in image registration, and another width of cloth is out of shape deformation pattern as benchmark with reference picture as deformation pattern, makes the two coupling.In view of the above, the deformation pattern behind the registration can be regarded as by the reference picture distortion and obtains.Therefore, the present invention is the same with prior art, will define the warping function and the objective function of contact reference picture and deformation pattern before registration earlier.The define method of warping function and objective function has a variety of, and the present invention's B batten of sampling defines warping function and objective function, is defined as follows:
(1) warping function with B batten structure is:
g ( x , C ) = x + Σ i ∈ I c C i β n ( x / 2 w - i )
Wherein, C is a deformation coefficient, β nBe the vector product of n B batten, promptly β n ( x ) = Π k = 1 m β n ( x k ) , X is the m dimensional vector, 2 wBe the nodal pitch of B batten, the w representational level, the flexible yardstick between promptly adjacent level is 2, I cBe the node space set of B batten, i is that node is at node space I cIn displacement.X is the coordinate of original image, and g (x) is a corresponding coordinate figure after conversion.
(2) establish reference picture and deformation pattern is respectively f r(x) and f t(x), (it can be expressed as f with reference picture with the deformation pattern after the warping function distortion tThe mean square deviation of (g (x, C))) is as objective function, and then objective function can be defined as:
E ( C ) = 1 | | I | | Σ x ∈ I e i 2 = 1 | | I | | Σ x ∈ I ( f t ( g ( x , C ) ) - f r ( x ) ) 2
Wherein, I is the pairing space of image coordinate, and (x C) is warping function to g.
According to sampling thheorem, when sample frequency during more than or equal to the twice of a function highest frequency, this function can come out with the complete recovery of these sampled points.The method of the invention, read in deformation pattern earlier, calculate the highest frequency of the objective function of definition, with 2 times of the highest frequency of objective function deformation coefficient being carried out uniform sampling again calculates, obtain warping function series, respectively deformation pattern is out of shape with the warping function series that obtains again, obtain deformation pattern series, read in reference picture then, with the pairing warping function of minimum target functional value deformation pattern is out of shape, finishes thick registration, and then be starting point with the pairing deformation coefficient value of the target function value of minimum, with the point of the global minimum of gradient descent method ferret out function, finish the registration of image.This shows that the present invention adopts limited sampled point just can obtain the point of the global minimum of objective function according to sampling thheorem, can realize the elastic registrating of image, so it is little to have amount of calculation, the remarkable technique effect that the registration time is short.In addition, the present invention has also overcome stochastic sampling needs the operator rule of thumb to carry out manual intervention, is difficult to guarantee the deficiency of registration same effect.
Description of drawings
Fig. 1 is the process flow diagram of the method for the invention;
Fig. 2 is that the sequence number picked out from the MRI figure of one group of heart perfusion is 5 and 3 adjacent two width of cloth image graph, and respectively named as Fig. 2 a and Fig. 2 b, wherein Fig. 2 a is as the reference image, and Fig. 2 b is as deformation pattern; Fig. 2 c is the image after image shown in Fig. 2 b adopts method for registering distortion of the present invention; Fig. 2 d is the error image of image shown in image shown in Fig. 2 b and Fig. 2 c.
Fig. 3 is the influence curve figure of noise to the registration accuracy rate.
Fig. 4 is for when noise variance is 0.1, method for registering of the present invention and with reference to the registration results comparison diagram of method for registering to same deformation pattern, wherein, Fig. 4 a is a reference picture; Fig. 4 b is the deformation pattern of Fig. 4 a at the noise that adds variance 0.1; Fig. 4 c is for being reference picture with Fig. 4 a, when Fig. 4 b is deformation pattern, and the image that adopts the inventive method registration to obtain; Fig. 4 d is for being reference picture with Fig. 4 a, when Fig. 4 b is deformation pattern, and the image that adopts the reference method registration to obtain.
Embodiment
Below by four non-limiting examples invention is elaborated.
Example 1 (registration of two dimensional image):
Needs for medical research, estimate the kinematic parameter of human heart, the inventor has gathered the MRI image of one group of heart perfusion from General Hospital of Tianjin Medical Univ., totally 20 width of cloth, size is 256 * 256 pixels, and therefrom the image of Xuan Zeing is that sequence number is that 5 and 3 adjacent two width of cloth images are reference picture and deformation pattern (referring to Fig. 2 a and Fig. 2 b).The test platform of registration is a PC, is operating system with WindowXP, and Matlab6.5 is a programming language.Concrete registration process is as described below:
Define warping function and objective function before the registration earlier, concrete steps are as follows:
(1) establishes reference picture and deformation pattern and be defined as f respectively r(x) and f t(x), wherein variable x is a bivector, then with the contact reference picture of B batten structure and the warping function of deformation pattern is:
( x , C ) = x + Σ i ∈ I c C i β n ( x / 2 w - i )
Wherein C is a deformation coefficient, β nBe the vector product of n B batten, promptly β n ( x ) = Π k = 1 m β n ( x k ) . Here the B batten is taken as batten one time.
(2) establish reference picture and deformation pattern equally and be defined as f respectively r(x) and f t(x), (it can be expressed as f with reference picture with the deformation pattern after the warping function distortion tThe mean square deviation of (g (x, C))) is as objective function, and then objective function is defined as:
E ( C ) = 1 | | I | | Σ x ∈ I e i 2 = 1 | | I | | Σ x ∈ I ( f t ( g ( x , C ) ) - f r ( x ) ) 2
Wherein x is a bivector.Make objective function E (C) obtain the just corresponding best distortion of warping function g of extreme value, promptly ask g=argmin G ∈ GE (g (x, C)), wherein G is the pairing space of warping function g;
After performing the preceding preparation of registration, can carry out registration, concrete steps are as follows:
(1) read in deformation pattern shown in Fig. 2 b, this image can be expressed as f t(x), wherein x is a bivector, calculates f with the fast Flourier deformation gauge t(x) frequency spectrum is:
F t ( ω ) = ∫ - ∞ + ∞ f t ( x ) · e - jωC dC
Calculate f by this frequency spectrum t(x) highest frequency ω m
ω m = max F ( ω ) ≠ 0 ( ω )
For the medical image of reality, ω mCan be very not big, through counting statistics ω mBe generally between 3~10.For Fig. 2 b, ω as calculated m Be 5.
(2) with the frequency spectrum of fourier transform method calculating target function E (C) with respect to deformation coefficient C, the highest frequency that is calculated objective function by this frequency spectrum is:
ω max=2ω m·max(g′(x,C))
ω in this formula mBe the highest frequency of deformation pattern in the step (1), (x C) is the derivative of warping function to g '.The frequency n of B batten is taken as at 1 o'clock among the present invention, at this moment the maximum frequency ω of objective function E (C) MaxBe 2 ω m
The highest frequency ω of objective function Max=2 ω mMax (the concrete derivation of g ' (x, C)) is as described below:
Objective function E (C) makes Fourier transform for deformation coefficient C:
E ( ω ) = ∫ - ∞ + ∞ Σ x ∈ I ( f r ( x ) - f t ( g ( x , C ) ) ) 2 · e - jωC dC
= ∫ - ∞ + ∞ Σ x ∈ I ( f r 2 ( x ) - 2 f r ( x ) f t ( g ( x , C ) ) + f t 2 ( g ( x , C ) ) ) · e - jωC dC
= Σ x ∈ I ∫ - ∞ + ∞ ( f r 2 ( x ) - 2 f r ( x ) f t ( g ( x , C ) ) + f t 2 ( g ( x , C ) ) ) · e - jωC dC
= Σ x ∈ I ( ∫ - ∞ + ∞ f r 2 ( x ) e - jωC dC - 2 ∫ - ∞ + ∞ f r ( x ) f t ( g ( x , C ) ) e - jωC dC + ∫ - ∞ + ∞ f t 2 ( g ( x , C ) ) e - jωC dC )
Following formula has three, wherein first
Σ x ∈ I ∫ - ∞ + ∞ f r 2 ( x ) e - jωC dC = 2 π · δ ( ω ) · Σ x ∈ I f r 2 ( x )
Second is
Σ x ∈ I ∫ - ∞ + ∞ f r ( x ) f t ( g ( x , C ) ) e - jωC dC = Σ x ∈ I f r ( x ) · ∫ - ∞ + ∞ f t ( g ( x , C ) ) e - jωC dC
The highest frequency of following formula is ∫ just -∞ + ∞f t(g (x, C)) e -j ω CThe highest frequency of dC.Calculate ∫ now -∞ + ∞f t(g (x, C)) e -j ω CThe highest frequency of dC.
(x C) in arbitrfary point C=a place Taylor expansion, gets g
g ( x , C ) = g ( x , a ) + g ′ ( x , a ) · ( C - a ) + g ′ ′ ( x , a ) 2 ! ( C - a ) 2 + · · · · · ·
Use first approximation,
g(x,C)=g(x,a)+g′(x,a)·(C-a)=(g(x,C)-g′(x,a)·a)+g′(x,a)·C
In step (1), f t(x) frequency spectrum is F (ω), and its highest frequency is ω m, f then t(absolute value of the frequency spectrum of g ' (x, a) C+b) is
Figure C20061012379600073
Its highest frequency is ω mG ' (x, a).Because a is the arbitrfary point, so ∫ -∞ + ∞f t(g (x, C)) e -j ω CThe highest frequency of dC is ω mMax (g ' (x, C)).
The 3rd is ∫ -∞ + ∞f t 2(g (x, C)) e -j ω CDC.Because do not need to ask the frequency spectrum of following formula, just need ask its highest frequency, and f t(highest frequency of g (x, C)) is ω m(g ' (x, C)) is so f for max t 2(highest frequency of g (x, C)) is 2 ω mMax (g ' (x, C)).
Above three maximum frequency, we as can be seen the highest frequency of objective function E (C) be 2 ω mMax (g ' (x, C)).
By g (x, definition C) can know, g (x, C) deformation coefficient in is C, so g ' (x, C)=β n(x/2 w-i) β n(y/2 w-j), β n(x/2 w-maximal value i) is relevant with the size of n.When n=1, β n(x/2 w-i) maximal value is 1, so the maximum frequency ω of objective function E (C) MaxBe 2 ω m
(3) highest frequency of objective function E (C) is ω Max=2 ω m, ω wherein mHighest frequency for image 2b.So with 2 ω MaxSample is exactly with 4 ω mDeformation coefficient C is carried out uniform sampling, and at this moment sampling interval is T = π 2 ω m , For image 2, T is 0.314..In the field of definition of C (size of field of definition is with relevant to the estimation of anamorphose size, and generally in 10, this example gets 10), adopt a point every 0.314, obtain a series of concrete value c after the sampling i(i ∈ M, M is the point set of sampling), corresponding also just have a series of concrete warping function g (x, a c i), with these warping functions image shown in Fig. 2 b is out of shape, obtain deformation pattern series.
(4) read in reference picture shown in Fig. 2 a, calculate the mean square deviation of the deformation pattern series that it and step (3) obtain respectively, just obtain a series of E (c i) value, relatively these E (c i) size, therefrom find out their minimum value E (c *), Dui Ying warping function g (x, c at this moment *) just be a reasonable distortion to image shown in Fig. 2 b (behind the thick registration).
(target function value E (the c of 5 minimums that found with step (4) *) corresponding deformation coefficient value c *As starting point, with the global minimum point of gradient descent method ferret out function E (C) Detailed process is described below:
With warping function g (x, the C that obtains in step (4) lining *) in deformation coefficient C *Be initial value.In the i step of iterative process, we are according to existing deformation coefficient c iCalculate the step-length of upgrading Δ c i = - μ i ▿ c E ( c i ) , If at deformation coefficient is c=c i+ Δ c iSituation under, the value of E is littler, this step upgrades successfully so, the parameter value before replacing with new parameter value, i.e. c I+1=c iTen Δ c i, μ I+1iIf the value of E has increased on the contrary, just get μ I+1i/ 2, compute gradient value once more Δ c i = - μ i + 1 ▿ c E ( c i ) ; This iterative process continues always, until a certain threshold value of Δ c less than prior setting.At c iAfter determining, warping function has also just been determined.The deformation pattern of the thick registration that step (4) is obtained with this warping function is out of shape, and just obtains the deformation pattern of smart registration.
In above-mentioned optimizing process, need to calculate the partial derivative vector of E (C)
Figure C20061012379600083
The single order partial derivative of E (C) is
∂ E ∂ c j , m = 1 | | I | | Σ i ∈ I ∂ e i ∂ f w ( i ) ∂ f t c ( x ) ∂ x m | x = g ( i ) ∂ g m ( i ) ∂ c j . m
Wherein
∂ e i ∂ f w ( i ) = 2 ( f w ( i ) - f r ( i ) ) 2
∂ g m ∂ c j , m = β n m ( x / h - j )
∂ f t c ∂ x m ( x ) = Σ k ∈ I b k β n ′ ( x m - k m ) Π l = 1 , l ≠ m N β n ( x l - k l )
Obtain the global minimum point with objective function E (C) The time pairing warping function
Figure C20061012379600089
Deformation pattern is out of shape, obtains the deformation pattern of smart registration, image is as seeing shown in Fig. 2 c shown in Fig. 2 b behind the registration.The error image of image shown in image shown in Fig. 2 b and Fig. 2 c shown in Fig. 2 d, the sports ground of the estimated heart of its expression, the dirty sports ground of picture centre is very clear as can be seen.
Example 2 (3-D view registration):
The used 3-D view of present embodiment is the MRI image of choosing from Institute of Medical Information of biomedical engineering institute of Nanfang Medical Univ image data base, and the image size is 128 * 128 * 128 pixels.The test platform of registration is a PC, is operating system with windowXP, and Matlab6.5 is a programming language.Concrete registration process is as described below:
In the present embodiment, the define method of warping function and objective function is identical with example 1, is specially:
(1) establishes reference picture and deformation pattern and divide other f rBe defined as f r(x) and f t(x), wherein x is a tri-vector.Construct the warping function of getting in touch reference picture and deformation pattern with the B batten, obtain the parametrization elastic model:
g ( x , C ) = x + Σ i ∈ I c C i β n ( x / 2 w - i )
Wherein C is a deformation coefficient, β nBe the vector product of n B batten, promptly β n ( x ) = Π k = 1 m β n ( x k ) . Here the B batten is taken as batten one time.
(2) establish reference picture and deformation pattern equally and be defined as f respectively r(x) and f t(x), (it can be expressed as f with reference picture with the deformation pattern after the warping function distortion tThe mean square deviation of (g (x, C))) is as objective function, and then objective function is defined as:
E ( C ) = 1 | | I | | Σ x ∈ I e i 2 = 1 | | I | | Σ x ∈ I ( f t ( g ( x , C ) ) f r ( x ) ) 2
After performing the preceding preparation of registration, can carry out registration, concrete steps are as follows:
(1) read in the 3 D deformation image, this image can be expressed as f t(x), wherein x is a tri-vector, calculates its frequency spectrum with fast fourier transform F t ( ω ) = ∫ - ∞ + ∞ f t ( x ) · e - jωC dC , Calculate its highest frequency by this frequency spectrum ω m = max F ( ω ) ≠ 0 ( ω ) .
(2), calculate the highest frequency ω of objective function by this frequency spectrum with the frequency spectrum of fourier transform method calculating target function E (C) with respect to deformation coefficient C Max=2 ω mMax (g ' (x, a)).ω in this formula mBe the highest frequency of deformation pattern in the step (1), (x a) is the derivative of warping function to g '.Concrete derivation is identical with example 1.
By g (x, definition C) can know, g (x, C) deformation coefficient in is C, so g ' in the present embodiment (x, C)=β n(x/2 w-i) β n(y/2 w-j) β n(z/2 w-k).When n=1, β n(x/2 w-i) maximal value is 1, so the maximum frequency ω of objective function E (C) MaxBe 2 ω m
(3) highest frequency of objective function E (C) is ω Max=2 ω m, ω wherein mHighest frequency for deformation pattern.So with 2 ω MaxSample is exactly with 4 ω mDeformation coefficient C is carried out uniform sampling (with respect to two dimensional image, the difference of 3-D view is that sampling is to carry out) in three-dimensional, obtain a series of concrete value c after the sampling i(i ∈ M, M is the point set of sampling), corresponding also just have a series of concrete warping function g (x, a c i), be out of shape with these warping function deformation patterns, obtain deformation pattern series.
(4) read in reference picture, calculate the mean square deviation of the deformation pattern series that it and step (3) obtain respectively, just obtain a series of E (c i) value, relatively these E (c i) size of value, therefrom find out their minimum value E (c *), finish thick registration.
(5) the target function value E (c of the minimum that is found with step (4) *) corresponding deformation coefficient value c *As starting point, with the global minimum point of gradient descent method ferret out function E (C)
Figure C20061012379600094
Finish smart registration.Detailed process is with example 1.
Example 3 (registration accuracy rate contrast experiment):
Owing to,, from this laboratory picture library, chosen 16 width of cloth images at random as the reference image so the inventor adopts artificial deformation's method to produce deformation pattern being out of shape the test effect that better to check the method for the invention under the known condition.Selected reference picture wherein, CT image 8 width of cloth, MR image 8 width of cloth, and respectively they are carried out identical deformation process.The size of original image is 256 * 256 pixels.The content of distortion comprise along X and Y-axis respectively translation 10 each pixel, 10 degree and with the distortion elastic deformation of software photoshop realization turn clockwise.With the reference method of the present invention contrast be that Kybic J and Unser M were in the elastic registrating method based on the B batten in the article " Fast Parametric Elastic Image Registration " that " IEEE Trans.Image Processing " the 12nd volume 11 phase 1427-1442 pages or leaves are delivered in 2003.Comparative result is as shown in table 1.By table 1 as seen, algorithm of the present invention has been realized overall 93.75% accuracy rate, and relatively poor with reference to algorithm registration effect, accuracy rate has only 31.25%.The registration effect of algorithm of the present invention is significantly better than the reference algorithm.
Result's contrast of table 116 group test
The CT image The MR image Summation
Test sample quantity 8 8 16
Registration correct number (the inventive method) 8 7 15
Accuracy rate (the inventive method) 100% 87.5% 93.75%
Registration correct number (reference method) 3 2 5
Accuracy rate (reference method) 37.7% 25% 31.25%
Example 4 (antinoise test):
1, robustness comparison test
This people has selected 5 groups from 16 groups of images of example 3, adopt the inventive method and example 3 described reference methods to carry out the registration experiment respectively.In 5 groups of images of experiment, the noise that adds varying strength is checked the robustness of two kinds of methods to noise.The noise that adds is a Gaussian noise, and noise variance is respectively 0.1 and 0.5.The relation of registration accuracy rate and noise variance as shown in Figure 3.As can be seen from Figure 3, the registration accuracy rate of the inventive method on different noise levels all will be higher than with reference to algorithm, and the inventive method is stronger to the robustness of noise.
2, accuracy comparative experiments
For the actual effect of clearer demonstration registration, the inventor has chosen a CT image (shown in Fig. 4 a) again, and to have added variance be 0.1 noise (seeing Fig. 4 b), carries out the registration experiment with the inventive method and example 3 described reference methods respectively then.The registration results of the inventive method is shown in Fig. 4 c, and the registration results of reference method is shown in Fig. 4 d.Can be clear that from test findings algorithm of the present invention has been realized correct registration, and be wrong to the distortion of image in the lower left corner with reference to algorithm.

Claims (1)

1, a kind of image elastic registrating method based on limited sampling global optimisation, this method is made up of following steps:
(1) reads in deformation pattern, calculate its frequency spectrum, calculate its highest frequency again by this frequency spectrum with fast fourier transform;
(2), calculate the highest frequency of objective function again by this frequency spectrum with the frequency spectrum of fourier transform method calculating target function with respect to the deformation coefficient in the warping function;
(3) elder generation carries out uniform sampling calculating in 2 times of spaces to the deformation coefficient correspondence of the highest frequency of 2 objective functions that obtain set by step, obtains warping function series, respectively deformation pattern is out of shape with the warping function series that obtains again, obtains deformation pattern series;
(4) read in reference picture, calculate the mean square deviation of the deformation pattern series that reference picture and step (3) obtain respectively, obtain the target function value data set, the size that compares these target function values, find wherein minimum target functional value, with the pairing warping function of this minimum target functional value deformation pattern is out of shape, obtains the deformation pattern of thick registration;
(5) the pairing deformation coefficient value of target function value of the minimum that is found with step (4) is a starting point, global minimum with gradient descent method ferret out function, with the pairing warping function of this minimum value deformation pattern is out of shape again, just obtains the deformation pattern of smart registration;
Wherein, described warping function and objective function are defined as follows described:
A. use B batten structural deformation function:
g ( x , C ) = x + Σ i ∈ I c C i β n ( x / 2 w - i )
Wherein, C is a deformation coefficient, β nBe the vector product of n B batten, promptly β n ( x ) = Π k = 1 m β n ( x k ) , X is the m dimensional vector, and w representational level, Ic are the node space set of B batten, and i is the displacement of node in node space Ic;
B. establish reference picture and deformation pattern and be defined as f respectively r(x) and f t(x), with reference picture and with the mean square deviation of the deformation pattern after the warping function distortion as objective function:
E ( C ) = 1 | | I | | Σ x ∈ I e i 2 = 1 | | I | | Σ x ∈ I ( f t ( g ( x , C ) ) - f r ( x ) ) 2
Wherein, I is the pairing space of image coordinate, and (x C) is warping function to g.
CNB2006101237965A 2006-11-29 2006-11-29 Image elastic registrating method based on limited sampling global optimisation Expired - Fee Related CN100446034C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2006101237965A CN100446034C (en) 2006-11-29 2006-11-29 Image elastic registrating method based on limited sampling global optimisation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2006101237965A CN100446034C (en) 2006-11-29 2006-11-29 Image elastic registrating method based on limited sampling global optimisation

Publications (2)

Publication Number Publication Date
CN1975781A CN1975781A (en) 2007-06-06
CN100446034C true CN100446034C (en) 2008-12-24

Family

ID=38125827

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2006101237965A Expired - Fee Related CN100446034C (en) 2006-11-29 2006-11-29 Image elastic registrating method based on limited sampling global optimisation

Country Status (1)

Country Link
CN (1) CN100446034C (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102024256B (en) * 2010-10-27 2012-07-25 李宝生 Variable-constraint image deformation registration method based on gradient field
DE102011080905B4 (en) * 2011-08-12 2014-03-27 Siemens Aktiengesellschaft Method for visualizing the registration quality of medical image data sets
CN102592137B (en) * 2011-12-27 2014-07-02 中国科学院深圳先进技术研究院 Multi-modality image registration method and operation navigation method based on multi-modality image registration
CN103279946A (en) * 2013-04-28 2013-09-04 深圳市海博科技有限公司 Globally optimized image registration method and system

Non-Patent Citations (8)

* Cited by examiner, † Cited by third party
Title
Elastic registration of fMRI data using Bezier-splinetransformations. Otte, M.Medical Imaging, IEEE Transactions on,Vol.20 No.3. 2001
Elastic registration of fMRI data using Bezier-splinetransformations. Otte, M.Medical Imaging, IEEE Transactions on,Vol.20 No.3. 2001 *
Fast parametric elastic image registration. Kybic, J. Unser, M.Image Processing, IEEE Transactions on,Vol.12 No.11. 2003
Fast parametric elastic image registration. Kybic, J. Unser, M.Image Processing, IEEE Transactions on,Vol.12 No.11. 2003 *
Multidimensional elastic registration of images using splines. Kybic, J. Unser, M.Image Processing, 2000. Proceedings. 2000 International Conference on,Vol.2 . 2000
Multidimensional elastic registration of images using splines. Kybic, J. Unser, M.Image Processing, 2000. Proceedings. 2000 International Conference on,Vol.2 . 2000 *
基于先验知识和MRF随机场模型的医学图像弹性配准方法. 刘新刚,陈武凡,陈光杰.中国生物医学工程学报,第25卷第2期. 2006
基于先验知识和MRF随机场模型的医学图像弹性配准方法. 刘新刚,陈武凡,陈光杰.中国生物医学工程学报,第25卷第2期. 2006 *

Also Published As

Publication number Publication date
CN1975781A (en) 2007-06-06

Similar Documents

Publication Publication Date Title
CN107204009B (en) Three-dimensional point cloud registration method based on affine transformation model CPD algorithm
CN108416802B (en) Multimode medical image non-rigid registration method and system based on deep learning
CN104091337B (en) A kind of deformation medical image registration method based on PCA and differomorphism Demons
CN110473196B (en) Abdomen CT image target organ registration method based on deep learning
CN102169578B (en) Non-rigid medical image registration method based on finite element model
CN108734723A (en) A kind of correlation filtering method for tracking target based on adaptive weighting combination learning
CN107481273B (en) Rapid image matching method for autonomous navigation of spacecraft
JP2002539870A (en) Image processing method and apparatus
US8965077B2 (en) Methods and systems for fast automatic brain matching via spectral correspondence
CN100446034C (en) Image elastic registrating method based on limited sampling global optimisation
Urschler et al. SIFT and shape context for feature-based nonlinear registration of thoracic CT images
Wang et al. FIRE: unsupervised bi-directional inter-modality registration using deep networks
CN113379788B (en) Target tracking stability method based on triplet network
CN109559296B (en) Medical image registration method and system based on full convolution neural network and mutual information
Kang et al. Image registration based on harris corner and mutual information
CN115909016B (en) GCN-based fMRI image analysis system, method, electronic equipment and medium
Aranda et al. A flocking based method for brain tractography
Fourcade et al. Deformable image registration with deep network priors: a study on longitudinal PET images
CN106971389A (en) A kind of cortex renis localization method based on statistical shape model
CN108596900B (en) Thyroid-associated ophthalmopathy medical image data processing device and method, computer-readable storage medium and terminal equipment
CN110517300A (en) Elastic image registration algorithm based on partial structurtes operator
Zhang et al. Survey of EIT image reconstruction algorithms
Barmpoutis et al. Groupwise registration and atlas construction of 4th-order tensor fields using the ℝ+ Riemannian metric
Sheng Medical image registration method based on tensor voting and Harris corner point detection
Watanabe et al. Spatial confidence regions for quantifying and visualizing registration uncertainty

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20081224

Termination date: 20121129