CN101877121A - Intermediate frequency based method for blindly restoring image - Google Patents

Intermediate frequency based method for blindly restoring image Download PDF

Info

Publication number
CN101877121A
CN101877121A CN2009102359465A CN200910235946A CN101877121A CN 101877121 A CN101877121 A CN 101877121A CN 2009102359465 A CN2009102359465 A CN 2009102359465A CN 200910235946 A CN200910235946 A CN 200910235946A CN 101877121 A CN101877121 A CN 101877121A
Authority
CN
China
Prior art keywords
frequency domain
image
psf
value
intermediate frequency
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
CN2009102359465A
Other languages
Chinese (zh)
Other versions
CN101877121B (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.)
Institute of Optics and Electronics of CAS
Original Assignee
Institute of Optics and Electronics of CAS
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 Institute of Optics and Electronics of CAS filed Critical Institute of Optics and Electronics of CAS
Priority to CN2009102359465A priority Critical patent/CN101877121B/en
Publication of CN101877121A publication Critical patent/CN101877121A/en
Application granted granted Critical
Publication of CN101877121B publication Critical patent/CN101877121B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses a intermediate frequency based method for blindly restoring an image, comprising a concept of an intermediate frequency domain of the image and a method for geometrically positioning according to the characteristics. The degraded PSF (Payload-Structure-Fuel) can be quickly and accurately estimated by using the intermediate frequency domain and further the image can be quickly restored by using Wiener filter based on the intermediate frequency domain. Aiming at G type PSF suitable for a large amount of imaging systems, an image blind restoration method based on the intermediate frequency for estimating the G type PSF can be realized by using the technology and a single parameter fitting method. The reliability and the speed can be improved by using a special smooth and quick algorithm. The method has the characteristics of top speed, stability, fewer parameters and wide application, can carrying out blind processings, such as degradation resistance, noise suppression, detail enhancement and the like, on the image in real time and can be widely applied to the fields of astronomy, military affairs, medicines, remote sensing, televisions and the like.

Description

Method for blindly restoring image based on intermediate frequency
Technical field
The invention belongs to the blindly restoring image technical field, be specifically related to a plurality of technology neighborhoods such as the theory of realtime graphic processing, Deconvolution Technique, image detail enhancing, blurred picture sharpening, squelch etc. and algorithm.
Background technology
Image restoration is a hot spot technology in recent years, has been widely used for fields such as astronomy, military affairs, medical science, remote sensing, TV.Its purpose is to recover original clear scene from the observed image that degrades.The model that degrades on the mathematics can be described as original image and point spread function (point spread function, PSF) in the convolution that has under the situation of additive noise, as shown in the formula:
g ( x , y ) = f ( x , y ) ⊗ h ( x , y ) + n ( x , y ) - - - ( 1 )
X wherein, y is the two-dimensional coordinate on plane, g (x y) is the gray scale of degraded image, f (x, the y) gray scale of original picture rich in detail, h (x y) is the gray scale of PSF of degrading, n (x y) is additive noise, Represent convolution algorithm.By Fourier transform, this model can be at frequency domain representation
G(u,v)=F(u,v)·H(u,v)+N(u,v)(2)
U wherein, v represents discrete frequency, G (u, v), F (u, v), H (u, v) and N (u, v) be respectively g (x, y), f (x, y), h (x, y) and n (x, Fourier transform y).Just (x, y) middle (x y) recovers f from g in image restoration.Yet, in actual conditions, h (x, y) and n (x, y) unknown often, so that (this situation promptly is called as blindly restoring image for x, y) unusual difficulty to recover f.
So far, people have proposed many blindly restoring image technology, such as zero page face partition method, the blind deconvolution method of iteration, simulated annealing, constraint recurrence liftering method, ARMA parameter estimation method, total least square method, the overall variational method, anisotropic diffusion equation method, minimum entropy deconvolution method or the like.Yet, use iteration or recursion step in these methods mostly, cause the possibility of result not restrained, speed is very slow, even may make picture quality worse and worse.Therefore, they almost can't be applied to needs to handle in real time in the engineering of image.
In order to realize the blind recovery of realtime graphic, people such as Carasso have proposed that a kind of (fastFourier transform, method FFT) are called the APEX method based on fast fourier transform.The APEX method can be finished the recovery of a width of cloth 512*512 image in tens of seconds, and good effect is arranged.Also occur the improvement and the application of some these methods in recent years, also obtained certain success.The APEX method improves the speed major reason and is that it is set at a kind of function of very extensively seeing with PSF, is called the G class function, and its Fourier transform has following form:
H ( u , v ) = ∫ R 2 h ( x , y ) exp [ - i 2 π ( xu + vy ) ] dxdy - - - ( 3 )
= exp [ - c ( u 2 + v 2 ) &beta; ] , c > 0,0 < &beta; &le; 1
Wherein, β is relevant with imaging circumstances, has determined fuzzy kind, and c is relevant with imaging process, has determined fuzzy degree.Very meaningfully, this function appears in a large amount of physical processes, it has not only comprised common Gaussian process (β=1) and Lorentzian process (β=1/2), can also portray the optical transfer function of many imaging systems, as: the X ray in the also corresponding actinoscopy in β=1/2 is scattering into picture, the long exposure image of the corresponding atmospheric turbulence in β=5/6, the optical transfer function of the approximate corresponding ideal lens limited diffraction in β=3/4, multiple optoelectronic device can be portrayed in 1/2≤β≤1, and nearly all photographic film all has the characteristic of 0<β≤1, or the like.The APEX method is the parameter c by estimating G class PSF and the β purpose that reaches blindly restoring image just.
Yet still there are many problems in the APEX method.At first, the APEX method has too much artificial input parameter, and these important parameters can only be selected by experience, need repeatedly interactively trial just can obtain suitable value (and not necessarily can find) sometimes, even may make problem become difficult further.Secondly, the APEX method when estimated parameter with the ln|F of the unknown (u, v) | directly replace, and (least squaresestimation LSE) asks c and β with nonlinear least square method with a constant.But because ln|F (u, v) | and ln|G (u, v) | generally all is the concave curve that the overall situation singly subtracts, thus the β that obtains always less than 0.5, this often and actual conditions inconsistent.Though also may realize to a certain degree recovery with c that obtains and β, this has greatly limited its range of application.Once more, among the non-linear LSE recursive procedure is arranged, this will reduce the speed of restoring.At last, the APEX method is used the slow evolution of continuum boundary (slow evolution of continuation boundary, SECB) technology is carried out the deconvolution reconstructed image, this technology must be attempted a series of time value and be selected optimum, and each trial all needed about one second, had wasted many times.Though people improved to some extent afterwards, do not tackle the problem at its root, more consuming time on the contrary.Therefore, in the stronger application of real-time, these methods still can not meet the demands.
Blindly restoring image except h (x, y) and n (x y) outside the Wei Zhi difficult point, also has a difficulty to be that it is the inverse problem of a deconvolution, i.e. the slight disturbance of noise all may cause restored image to distort greatly.So also having proposed the technology of many deconvolution, people overcome this point, such as SECB technology above-mentioned.But the SECB technology proposes at the characteristics of G class function limitlessly detachable specially, and therefore certain limitation is arranged.Having a kind of Deconvolution Technique of classics to be called in addition " least mean-square error filtering (Wiener filtering) ", is to derive by the square error that minimizes between original image and the restored image, and its restored image calculates with following formula
F ^ ( u , v ) = H ^ * ( u , v ) G ( u , v ) | H ^ ( u , v ) | 2 + &prod; ( u , v ) - - - ( 4 )
Wherein
Figure B2009102359465D0000024
With
Figure B2009102359465D0000025
Be respectively the Fourier transform estimation of restored image and PSF,
Figure B2009102359465D0000026
Be
Figure B2009102359465D0000027
Complex conjugate, ∏ (u, v)=| N (u, v) | 2/ | F (u, v) | 2Be the ratio of noise and ideal image power spectrum.(u when v) unknown, can replace with a constant Γ, and promptly following formula is approximately as ∏
F ^ ( u , v ) &ap; H ^ * ( u , v ) G ( u , v ) | H ^ ( u , v ) | 2 + &Gamma; - - - ( 5 )
Wherein Γ is the ratio of noise to the spectral density of signal, in the time of statistical property the unknown of noise, and the key of determining just to become decision recovery effect quality of Γ value.People have proposed the optimum value that certain methods is determined Γ to this, also obtain certain achievement.It is exactly that operand is bigger that but existing method all has a common shortcoming, need calculate Γ value with the statistical information or the recursive operation of image, so has reduced the efficient of Wiener filtering on the contrary, and this also is this technology part that haves much room for improvement.Yet, though whether optimum does not still have final conclusion in Wiener filtering, it simply fast advantage make it to come compared with other technologies, still be more suitable in real-time application.
Summary of the invention
Technology of the present invention is dealt with problems: overcome the deficiency that the blind recovery technique speed of conventional images is slow excessively, range of application is narrow, a kind of method for blindly restoring image based on intermediate frequency is provided, this method makes the real-time application of blindly restoring image become possibility, also has the removal of images noise and strengthen in the image function such as point target in quick restored image.
Technical scheme of the present invention: based on the method for blindly restoring image of intermediate frequency, performing step is as follows:
(1) frequency domain that contains PSF information in the image spectrum is positioned, described frequency domain localization method is:
(1.1) FFT and the standardization of calculating blurred picture;
(1.2) some of calculating FFT are crossed the frequency domain separation of former dotted line, thereby determine the scope of frequency domain;
(2) utilize frequency domain to estimate G class PSF, method is:
(2.1) according to the value of model index β in the environmental selection G class function;
(2.2) frequency domain of the identical former dotted line of mistake is carried out smoothly, and estimate the derivative of PSF in the frequency domain with the linear LSE of one-parameter;
(2.3) estimated value of fog-level parameter c in the usefulness derivative calculations G class function of PSF
Figure B2009102359465D0000032
Obtain the estimator of G class PSF;
(3) utilize frequency domain to optimize in the Wiener filtering noise spectral density than the value of Γ, and with Wiener filtering restored image.
Described step (1.2) calculate FFT some cross being achieved as follows of frequency domain separation of former dotted line:
(1.2.1) logarithm of crossing former dotted line is carried out " moving right average " smoothly, promptly the value of each point is replaced with the mean value of its several consecutive point of the right, with the straight line connection end point and calculate the point of this straight line ultimate range, promptly obtain the separation between frequency domain and the high-frequency domain then;
(1.2.2) " mobile left mean " carried out smoothly in the medium and low frequency territory of crossing former dotted line, promptly the value of each point is replaced with the mean value of its several consecutive point of left side, with the straight line connection end point and calculate the point of this straight line ultimate range, promptly obtain the separation between lower frequency region and the frequency domain then;
(1.2.3) zone between two separations calculating of above step is exactly this frequency domain of crossing former dotted line, when the PSF invariable rotary, then with after the frequency domain annulusization of this line as the frequency domain of image, otherwise then determine (when getting two former dotted lines of mistake, frequency domain is an elliptical ring) jointly by many former dotted lines of mistake.
Utilize frequency domain to optimize noise spectral density in the Wiener filtering in the described step (3) to be than the value method of Γ:
(3.1) utilize the middle and high frequency domain separation of the identical former dotted line of mistake to make the adaptive best Wiener filtering of Γ;
(3.2) introduce squelch parameter η, with finely tune Γ to be in harmonious proportion the contradiction of noise and image detail: η is comparatively clear near 1 o'clock noise and details, noise and details weakened simultaneously to some extent when η reduced, and therefrom chose an equilibrium value and restored with the best that realizes image.
The present invention's beneficial effect compared with prior art is:
(1) on the speed, since without any recurrence and iterative process, also without any matrix operation, even has only few power operation, therefore the time of restoring almost only consumes in necessary FFT and Wiener filtering, make recovery speed near the limit, than the blind recovery technique of conventional images more than fast ten times.Restore such as the image to a secondary 512*512, other prior art is the several seconds at least, several at most branches, and the present invention is at common computer (CPU:Intel Pentium 4,2.40GHz; Memory:512MB) 0.5 second time spent only on, and if with equipment such as DSP, recovery time even can reach Millisecond.
(2) on the accuracy, the proposition of " frequency domain " notion and the location of quantification thereof make the accurate estimation of PSF become possibility, here be the picture rich in detail of two width of cloth 512*512 with some examples explanation: Fig. 1 (a) and (d), at first using c=0.075 and β=0.5 that (a) carried out computer simulation degrades and adds to make an uproar and obtain (b), restore with β=0.5 and η=0.8 then and obtain (c), wherein calculate
Figure B2009102359465D0000041
Very near 0.075 of reality, this is the unapproachable accuracy of prior art; (d) carried out computer simulation with c=0.0025 and β=5/6 degrade that adding makes an uproar obtains (e), obtain (f) after restoring with β=5/6 and η=0.8 again, wherein calculate
Figure B2009102359465D0000042
Too very near actual value.Experiment shows that as long as model is suitable, the PSF that estimates will be very accurate, thereby obtains satisfied recovery effect.
Recovery speed and effect that it is good also are confirmed in the photo of actual photographed, as Fig. 2-5.First width of cloth is actual fuzzy photo among each figure, and second width of cloth is the picture after restoring.As seen, photographic quality obviously improves, and details is more clear, and acutance has improved nearly 100%; Recovery speed is also quite fast, and the image of a width of cloth 1280*1024 is consuming time not even above 2.5 seconds on common computer.Listed the detail statistics data of Fig. 2-5 in the table 1, wherein the processing time is added up on the same computer, and acutance uses the sharpness evaluation function based on the Roberts edge detection operator to calculate.
The statistics of table 1 Fig. 2-5
Figure B2009102359465D0000051
(3) on the simplicity because the present invention has only two input parameters, and they change among a small circle result's influence very little, so needn't as existing some method, a large amount of mutual test of needs come various parameter is chosen.Parameter beta among the present invention is used for adaptive to true environment, thereby has widened the range of application (nearly all blurred picture all have a suitable β to can be used to carry out sharpening handle) of algorithm; And even more advantageously, common same environment is fit to same β value, so as long as obtained suitable β value, just need not to adjust again.Another squelch parameter η is used to be in harmonious proportion the contradiction of noise and image detail, and η is comparatively clear near 1 o'clock noise and details, and noise is inhibited when η reduces, but details also has loss slightly.But it is also little to result's influence, is applicable to most applications about η=0.8 substantially, unless noise is too obvious, otherwise also need not to adjust.This also is one of advantage of this invention, can be general, and also fine-tuning.
(4) on the function because the adjustability of parameter beta, the present invention also have that other prior art is difficult to realize specific function, strengthen as squelch and point target.As long as the β that chooses is suitable, just can suppress ground unrest, thus outstanding wherein point target.Fig. 6 (a) is that a width of cloth is taken from the 1024*1024 of astro tracker picture, because The noise almost be can't see any target.But after using β=0.8 to handle, noise weakens significantly, and plural target becomes high-visible, as Fig. 6 (b).Fig. 6 (c) and (d) be respectively (a) and three-dimensional space grid figure (b), target is outstanding more obvious among Fig. 6 (d).
In a word, the characteristics that the present invention has is very fast, stable, parameter is few, purposes is wide can instead degrade to realtime graphic, blind processing such as squelch, details enhancing, can be widely used in every field such as astronomy, military affairs, medical science, remote sensing, TV.
The drawing explanation
Fig. 1 a, Fig. 1 b, Fig. 1 c, Fig. 1 d, Fig. 1 e, Fig. 1 f are the recovery effect figure of computer simulation degraded image;
Fig. 2 is the recovery effect figure of the fuzzy photograph of a width of cloth 440*330;
Fig. 3 is the recovery effect figure of the fuzzy photograph of a width of cloth 640*480;
Fig. 4 is the recovery effect figure of the fuzzy photograph of a width of cloth 1024*768;
Fig. 5 is the recovery effect figure of the fuzzy photograph of a width of cloth 1280*1024;
Fig. 6 a, Fig. 6 b, Fig. 6 c, Fig. 6 d are recovery effect figure and the space networks trrellis diagrams thereof that 1024*1024 contains the point target photograph;
Fig. 7 is the frequency domain curved surface comparison diagram of image spectrum and PSF frequency spectrum;
Fig. 8 is the localization method key diagram in vision intermediate frequency territory;
Fig. 9 is typical T 0(u), T 1(u) and T 2(u) comparison diagram of curve;
Figure 10 the present invention is based on the process flow diagram that intermediate frequency is estimated the method for blindly restoring image of G class PSF.
Embodiment
The present invention comprises three steps, and its specific implementation is as follows:
1. the location of image " frequency domain ".
In general, the most energy of piece image all concentrates near the low frequency region its frequency spectrum initial point, and noise pollution the high-frequency region at its frequency spectrum edge.Therefore, directly utilize the FFT of image, promptly (u estimates that v) (u, (u v) almost is impossible to H thereby v) recover F to G.Yet (u, information v) and not polluted by noise are referred to as " frequency domain " of image here, as shown in Figure 7 to find to have between lower frequency region and high-frequency domain a special region to keep H.The zone of black is exactly the frequency domain R of image among Fig. 7 M, it is rendered as a ring-type; The non-black regional centralized of the ring heart most of energy of image, i.e. the lower frequency region of image; The outer zone of ring is polluted by noise, i.e. the high-frequency domain of image.Image spectrum ln|G from Fig. 7 (u, v) | and PSF frequency spectrum ln|H (u, v) | contrast as seen, the two smooth surface in frequency domain RM is extremely similar, (u, frequency domain has v) kept H (u, raw information v) to G in other words.So,, just can realize the estimation of PSF more easily if can determine the scope of frequency domain quantitatively.The technical matters that first step of the present invention will solve is exactly how to determine the scope of basic, normal, high frequency domain, promptly frequency domain is positioned.The present invention proposes a new method of geometry that does not contain any artificial parameter, and the location that can realize frequency domain effectively is as follows:
If the standardization FFT conversion G of blurred picture (u v) is the complex matrix of a M * N, selects the mould value of its a former dotted line of mistake, such as | G (u, 0) |.Because G (u, 0) is the conjugation symmetry, so only need consider half period u ∈ D T=[0, u T] on value just passable, wherein
Figure B2009102359465D0000061
Figure B2009102359465D0000062
Expression rounds to zero.Lower frequency region is located near the u=0 so, and high-frequency domain is positioned at u=u TNear.At | G (u, 0) | curve in, two tangible overall turning points are arranged usually, they are the frontier point of frequency domain just.On the one hand, because lower frequency region has been assembled most of energy, so | G (u, 0) | 2Or | G (u, 0) | curve in can clearly see an overall turning point, promptly low, frequency domain separation, its coordinate u LMExpression; On the other hand,, and polluted by approximate equally distributed noise because the value of high-frequency domain is very little, so in log|G (u, 0) | curve in can find another overall turning point, promptly middle and high frequency domain separation, its coordinate u MHExpression.So just can calculate u according to the turnover characteristic of curve LMAnd u MHWith the location frequency domain, Fig. 8 has presented basic ideas: at first use straight line (to use L T(u) expression) connect ln|G (u, 0) | at D TIn two end points, ln|G (u, 0) then | with L T(u) form an inverted triangle, so ln|G (u, 0) | to L T(u) point of ultimate range is exactly a vertex of a triangle, promptly overall turning point u MHThen [0, u MH] in to curve | G (u, 0) | carry out identical step, just can obtain u LM
Yet, | G (u, 0) | normally vibration strongly of curve, considerable local turning point is arranged, so that can't correctly find out u LMAnd u MHOne of solution is a smooth curve, such as the method for moving average.But smoothly can redistribute energy, the result who leads to errors.In order to address this problem, the present invention uses a kind of special smoothing method, is called " moving right (left side) on average " method and calculates u LMAnd u MH, as follows:
At first consider u MH, being penetrated into the high-frequency domain on its right for fear of the energy of frequency domain, right average out to is moved in definition:
G r ( u ) = smooth ( right average ) [ ln | G ( u , 0 ) ] , u &Element; D T - - - ( 6 )
Promptly
G r ( u ) = 1 s r &Sigma; i = 0 s r - 1 ln | G ( u + i , 0 ) | , u &Element; D T - - - ( 7 )
S wherein rBe to move right average span, the number of the consecutive point that promptly are averaged can be used D TWidth determine, as
Figure B2009102359465D0000073
So just can use G r(u) find out u MH: at first cross (0, G rAnd (u (0)) T, G r(u T)) 2 make straight line L T(u), G so r(u) last is exactly u from this straight line point farthest MHBut because G r(u T) polluted the most handy G by noise at high-frequency domain r(u) average
Figure B2009102359465D0000074
Replace G r(u T).Therefore, L T(u) satisfy
[ G r ( 0 ) - G &OverBar; r ] u + u T L T ( u ) - u T G r ( 0 ) = 0 - - - ( 8 )
And G r(u) point on is to L T(u) distance is
| [ G r ( 0 ) - G &OverBar; r ] u + u T G r ( u ) - u T G r ( 0 ) | / K T - - - ( 9 )
Wherein
Figure B2009102359465D0000077
Be a constant, judge and to remove when being worth most.Like this, just can obtain
u MH = arg max u &Element; D T | [ G r ( 0 ) - G &OverBar; r ] u + u T G r ( u ) - u T G r ( 0 ) | - - - ( 10 )
Like this, even to G r(u) carry out pointwise and calculate u MHAlso can calculate very soon.
Then, because 0≤u LM≤ u MH, calculate u LMThe time only need consider field of definition u ∈ D LM=[0, u MH].In order to make the energy on the lower frequency region of the left side be independent of frequency domain, define mobile left mean and be:
G l ( u ) = smooth ( left average ) [ | G ( u , 0 ) | ] , u &Element; D LM - - - ( 11 )
Promptly
G l ( u ) = 1 s l &Sigma; i = 0 s l - 1 | G ( u - i , 0 ) | , u &Element; D LM - - - ( 12 )
S wherein 1It is the span of mobile left mean.Equally, G lDistance mistake (u) (0, G lAnd (u (0)) MH, G r(u MH)) straight line point farthest, be exactly low, frequency domain separation u LM, promptly
u LM = arg max u &Element; D LM | [ G l ( 0 ) - G l ( u MH ) ] u + u MH G l ( u ) - u MH G l ( 0 ) | - - - ( 13 )
Like this, the frequency domain that belongs to G (u, 0) is D just M=[u LM, u MH].If | H (u, v) | be (such as the G class function) of invariable rotary, so | G (u, v) | also approximate invariable rotary, at this moment (u, frequency domain v) can be considered annulus to G Otherwise (u, the former dotted line of mistake v) calculates corresponding frequency domain, last common decision G (u, frequency domain v) need to choose many G.Such as get two former dotted line G of mistake (u, 0) and G (0, in the time of v), if calculate separately frequency domain for [u LM, u MH] and [v LM, v MH], (u, frequency domain v) then is an elliptical ring to G so
Figure B2009102359465D0000083
Deng.
Because frequency domain positions according to its specific modality, so said as the front, it not only can ignore The noise, and avoided F (u, thus most energy v) kept H (u, partial contour v) promptly have following characteristic:
|G(u,v)|>>|N(u,v)|,(u,v)∈R M (14)
With
smooth[|G(u,v)|]≈smooth[C?|H(u,v)|],(u,v)∈R M (15)
Wherein C is a constant.Thereby, just can utilize these two character that PSF is estimated.
2. utilize frequency domain to estimate PSF (the present invention uses G class PSF).
Utilize frequency domain, can carry out blind estimation to PSF easily, and then realize the recovery of image.Because it is very extensive that G class PSF uses, and the characteristics of invariable rotary are arranged, be fit to very much estimate with the frequency domain method, so the present invention has proposed an one-parameter derivative fitting process fast to this, as follows:
At first (u v) chooses the former dotted line of identical mistake, is order for simplicity to H
H a(u)=ln|H(u,0)|=-c(u 2) β(16)
Wherein c and β are for treating estimated parameter.Yet parameter beta is relevant with the environment that degrades, and (u, v) the profile of frequency domain is to be difficult to correct estimation only to utilize G.So the present invention is used as β an input parameter without hesitation, directly comes the people for choosing according to environment.The benefit of doing like this is, not only makes c become unique estimated parameter for the treatment of, thereby and can make β break away from restriction to mate truth better, widened range of application.More fortunately, nearly all blurred picture all has a suitable β to can be used to carry out the sharpening processing.According to (15) and (16) formula, after choosing β, can use
G a ( u ) = smooth ( average ) [ ln | G ( u , 0 ) | ] , u &Element; D M - - - ( 17 )
Estimate corresponding c value.Here
Figure B2009102359465D0000085
Represent conventional moving average level and smooth, promptly
Figure B2009102359465D0000091
S wherein aIt is the span (odd number) of moving average.In frequency domain, because noise can ignore, and ln|G (u, 0) |, ln|F (u, 0) | and H a(u) after level and smooth, can be similar to, so have with straight line
k Gu+b G≈smooth[ln|G(u,0)|]
≈smooth[H a(u)]+smooth[ln?|F(u,0)|](19)
≈k Hu+b H+k Fu+b F,u∈D M
K wherein G, k HAnd k FBe the slope of each straight line, b G, b HAnd b FIt is the intercept of each straight line.The both sides differentiate gets
k G≈k H+k F (20)
At first, because energy seldom and successively decrease in the frequency domain, so have
k F=sgn(u LM-u MH)·ε(21)
Wherein sgn () is a sign function, and ε is a very little positive number.Desirable for the sake of simplicity k F=0, and its error can be eliminated when adjusting squelch parameter η.
Secondly, because H a(u) singly subtract, so k HMust equal H a(u) at D MIn the derivative of certain point.If use u MRepresent this point, can determine its position like this: establishing has straight line in addition
Figure B2009102359465D0000092
Simultaneously by (u LM, H a(u LM)) and (u MH, H a(u MH)) 2 points, following relation is then arranged:
H a ( u MH ) = - c ( u MH 2 ) &beta; = L ~ H ( u MH ) = k H u MH + b ~ H - - - ( 22 )
H a ( u LM ) = - c ( u LM 2 ) &beta; = L ~ H ( u LM ) = k H u LM + b ~ H - - - ( 23 )
And
L ~ H &prime; ( u M ) = k H = H a &prime; ( u M ) = - 2 &beta;c &CenterDot; sgn ( u M ) &CenterDot; | u M | 2 &beta; - 1 - - - ( 24 )
Cancellation c, k HWith
Figure B2009102359465D0000096
Can solve
u M = sgn ( u M ) [ sgn ( u M ) 2 &beta; &CenterDot; | u MH | 2 &beta; - | u LM | 2 &beta; u MH - u LM ] 1 2 &beta; - 1 , &beta; &NotEqual; 0.5 - - - ( 25 )
When β=0.5, use u M=(u MH+ u LM)/2 get final product.
In addition, slope k GCan obtain with the linear LSE of one-parameter at an easy rate:
k G = &Sigma; i = u LM u MH [ G a ( i ) - G a ( u M ) ] ( i - u M ) &Sigma; i = u LM u MH ( i - u M ) 2 - - - ( 26 )
At last, with k G, k HAnd k FThe estimated value that just obtains c behind the c is returned and solved to generation
Figure B2009102359465D0000099
For
c ^ = - sgn ( u M ) 2 &beta; &CenterDot; | u M | 1 - 2 &beta; &CenterDot; k G - - - ( 27 )
Thereby produce H (u, being estimated as v)
H ^ ( u , v ) = exp [ - c ^ ( u 2 + v 2 ) &beta; ] - - - ( 28 )
3. based on the Wiener filtering of frequency domain.
After estimating PSF, just can carry out image restoration with Wiener filtering.The parameter Γ of Wiener filtering is the key of recovery effect quality.By the location of frequency domain, the present invention proposes a method of simply and quickly determining the Γ value, and is as follows:
At first choose the former dotted line of identical mistake, and order
T 0 ( u ) = ln [ | H ^ ( u , 0 ) | 2 + &Pi; ( u , 0 ) ] - - - ( 29 )
T 1 ( u ) = ln [ | H ^ ( u , 0 ) | 2 + &Gamma; ] - - - ( 30 )
T 2 ( u ) = ln [ | H ^ ( u , 0 ) | 2 ] - - - ( 31 )
Fig. 9 is typical T 0(u), T 1(u) and T 2(u) comparison diagram of curve, therefrom visible T 0(u) and T 1(u) only at high-frequency domain (with u=u MHBe the boundary) bigger difference arranged.Like this, problem just becomes and how to choose Γ and make T 1(u)) adaptive best T on the basis that suppresses noise 0(u).Because D LMMiddle noise can be ignored, so always have
T 0(u)≈T 1(u)≈T 2(u),u∈D LM(32)
So u=u MHIn time, have
T 0(u MH)≈T 1(u MH)≈T 2(u MH)(33)
Evenly distribute because noise is approximate, so at high-frequency domain D H=(u MH, u T] in T is arranged 0(u) ≈ T 0(u MH).Optimize Wiener filtering, then wish T 1(u) ≈ T 0(u) at D HIn also can set up, but fact proved T 1(u) 〉=T 0(u) more help to suppress noise.What therefore, need is
T 1(u)≥T 0(u)≈T 0(u MH)≈T 2(u MH),u∈D H (34)
Following formula is set up, only needed
Figure B2009102359465D0000106
Or
min u &Element; D T [ T 1 ( u ) ] = T 2 ( u MH ) + &delta; - - - ( 35 )
Get final product, wherein δ is a very little positive number.Simultaneously in order to guarantee
Figure B2009102359465D0000108
Order
&delta; = ( 1 - &eta; ) { max u &Element; D T [ T 2 ( u ) ] - T 2 ( u MH ) } - - - ( 36 )
Wherein η ∈ (0,1] be a squelch parameter.So obtain
min u &Element; D T [ T 1 ( u ) ] = T 2 ( u MH ) + ( 1 - &eta; ) { max u &Element; D T [ T 2 ( u ) ] - T 2 ( u MH ) } - - - ( 37 )
With T 0(u) and T 1(u) expression formula substitution also solves Γ and just obtains
&Gamma; = | H ^ ( u MH , 0 ) | 2 &eta; &CenterDot; [ max u &Element; D T | H ^ ( u , 0 ) | ] 2 ( 1 - &eta; ) - [ min u &Element; D T | H ^ ( u , 0 ) | ] 2 - - - ( 38 )
Like this, just utilize frequency domain to obtain the suitable Γ value of Wiener filtering, its calculating is very succinct, settles at one go.Squelch parameter η wherein is used to be in harmonious proportion the contradiction of noise and image detail, and η is comparatively clear near 1 o'clock noise and details, and noise is inhibited when η reduces, but details also has loss slightly.But it is little to result's also influence, is applicable to most applications about η=0.8 substantially, unless noise is too obvious, otherwise need not to adjust.When using G class PSF, because
Figure B2009102359465D0000112
So following formula can abbreviation be
&Gamma; = | H ^ ( u MH , 0 ) | 2 &eta; - | H ^ ( u T , 0 ) | 2 - - - ( 39 )
Again because
Figure B2009102359465D0000114
Be real function, so Wiener filtering is used
F ^ ( u , v ) &ap; G ( u , v ) H ^ ( u , v ) + &Gamma; / H ^ ( u , v ) - - - ( 40 )
Form will be more quick.
By above three steps, blurred picture just can be restored fast.But notice to have three level and smooth computings in the above process, its speed will have a direct impact the performance of whole algorithm.If carry out smoothly with its definition or wave filter, the number of times of computing will be directly proportional with its span.Such as moving right average computation G r(u) time, then to be s at least if directly calculate r(u T+ 1) sub-addition (is noted factor 1/s rCan not take advantage of, because use G r(u) calculate u MHThe time can look like K TRemove like that), work as s rCalculated amount is with considerable when very big.Therefore, the present invention also proposes an additional quick and smooth method, and is as follows:
Calculate G r(u) time, at first set up a new function I r(u):
I r ( u T + s r ) = 0 I r ( u ) = I r ( u + 1 ) + ln | G ( u , 0 ) | , u &Element; [ 0 , u T + s r - 1 ] - - - ( 41 )
G then r(u) just can calculate with following formula:
G r ( u ) = 1 s r [ I r ( u ) - I r ( u + s r ) ] , u &Element; D T - - - ( 42 )
Factor 1/s wherein rCan save.Like this, to any s rOnly need be (2u T+ s r+ 1) sub-addition (comprises and calculates I r(u)) just can obtain G r(u).While G r(u) average
Figure B2009102359465D0000118
Also can directly calculate:
G &OverBar; r = [ I r ( 0 ) - I r ( u T + 1 ) ] / ( u T + 1 ) - - - ( 43 )
In like manner, calculate G l(u) also set up a new function I time earlier l(u):
I l ( - s l ) = 0 I l ( u ) = I l ( u - 1 ) + | G ( u , 0 ) | , u &Element; [ 1 - s l , u MH ] - - - ( 44 )
Like this to any s lOnly need be (2u MH+ s l+ 1) sub-addition (comprises and calculates I l(u)) just can obtain G l(u) (can omit factor 1/s l):
G l ( u ) = 1 s l [ I l ( u ) - I l ( u - s l ) ] , u &Element; D LM - - - ( 45 )
To G a(u), can be by I r(u) calculate.To any s a, only need be (u with following formula MH-u LM+ 1) sub-addition just can obtain G a(u):
Figure B2009102359465D0000123
Factor 1/s wherein aThough can not save, can be left to and calculate k GDisposable being multiplied by in back.
Note span s r, s lAnd s aAll the most handy level and smooth separately peak width decides.The present invention gets
Figure B2009102359465D0000124
Figure B2009102359465D0000125
With
Figure B2009102359465D0000126
Summary is got up, and the location of frequency domain and be a kind of basic theory based on the Wiener filtering of frequency domain is mainly used in the popularization of method; When it uses G class PSF, just form the blindly restoring image algorithm of estimating G class PSF based on intermediate frequency, can specifically be applied to every field.This algorithm can realize that also but hardware is realized by software, can realize devices realizations such as also available DSP, FPGA on computers.The flow process of this algorithm specifically can be carried out according to following steps as shown in figure 10:
1) according to occasion select β and η value (common same environment is fit to same β value, therefore can be earlier mode by trial obtain the best value, as if uncertain β=0.5 and η=0.8 of then advising);
2) FFT and the standardization of calculating degraded image;
3) use formula (47), (41), (42), (43) and (10) to calculate s respectively r, I r(u), G r(u),
Figure B2009102359465D0000127
And u MH
4) use formula (48), (44), (45) and (13) to calculate s respectively 1, I 1(u), G 1(u) and u LM
5) use formula (49), (46) and (25) to calculate s respectively a, G a(u) and u M
6) use formula (26), (27) and (28) to calculate k respectively G,
Figure B2009102359465D0000128
With
Figure B2009102359465D0000129
7) use respectively formula (39) and (40) calculate Γ and
Figure B2009102359465D00001210
8) calculate
Figure B2009102359465D00001211
Contrary FFT and standardization (can adjust contrast in case of necessity), promptly get restored image.

Claims (3)

1. based on the method for blindly restoring image of intermediate frequency, it is characterized in that performing step is as follows:
(1) frequency domain that contains PSF information in the image spectrum is positioned, described frequency domain localization method is:
(1.1) FFT and the standardization of calculating blurred picture;
(1.2) some of calculating FFT are crossed the frequency domain separation of former dotted line, thereby determine the scope of frequency domain;
(2) utilize frequency domain to estimate G class PSF, method is:
(2.1) according to the value of model index β in the environmental selection G class function;
(2.2) frequency domain of the identical former dotted line of mistake is carried out smoothly, and estimate the derivative of PSF in the frequency domain with the linear LSE of one-parameter;
(2.3) estimated value of fog-level parameter c in the usefulness derivative calculations G class function of PSF
Figure F2009102359465C0000011
Obtain the estimator of G class PSF;
(3) utilize frequency domain to optimize in the Wiener filtering noise spectral density than the value of Γ, and with Wiener filtering restored image.
2. the method for blindly restoring image based on intermediate frequency according to claim 1 is characterized in that: described step (1.2) is calculated being achieved as follows of frequency domain separation of the former dotted line of mistake of FFT:
(1.2.1) logarithm of crossing former dotted line is carried out " moving right average " smoothly, promptly the value of each point is replaced with the mean value of its several consecutive point of the right, with the straight line connection end point and calculate the point of this straight line ultimate range, promptly obtain the separation between frequency domain and the high-frequency domain then; ,
(1.2.2) " mobile left mean " carried out smoothly in the medium and low frequency territory of crossing former dotted line, promptly the value of each point is replaced with the mean value of its several consecutive point of left side, with the straight line connection end point and calculate the point of this straight line ultimate range, promptly obtain the separation between lower frequency region and the frequency domain then;
(1.2.3) zone between two separations calculating of above step is exactly this frequency domain of crossing former dotted line, when the PSF invariable rotary, then with after the frequency domain annulusization of this line as the frequency domain of image, otherwise then determine jointly by many former dotted lines of mistake.
3. the method for blindly restoring image based on intermediate frequency according to claim 1 is characterized in that: utilize frequency domain to optimize noise spectral density in the Wiener filtering in the described step (3) than the value method of Γ to be:
(3.1) utilize the middle and high frequency domain separation of the identical former dotted line of mistake to make the adaptive best Wiener filtering of Γ;
(3.2) introduce squelch parameter η, with finely tune Γ to be in harmonious proportion the contradiction of noise and image detail: η is comparatively clear near 1 o'clock noise and details, noise and details weakened simultaneously to some extent when η reduced, and therefrom chose an equilibrium value and restored with the best that realizes image.
CN2009102359465A 2009-10-30 2009-10-30 Intermediate frequency based method for blindly restoring image Expired - Fee Related CN101877121B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2009102359465A CN101877121B (en) 2009-10-30 2009-10-30 Intermediate frequency based method for blindly restoring image

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2009102359465A CN101877121B (en) 2009-10-30 2009-10-30 Intermediate frequency based method for blindly restoring image

Publications (2)

Publication Number Publication Date
CN101877121A true CN101877121A (en) 2010-11-03
CN101877121B CN101877121B (en) 2012-04-18

Family

ID=43019666

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2009102359465A Expired - Fee Related CN101877121B (en) 2009-10-30 2009-10-30 Intermediate frequency based method for blindly restoring image

Country Status (1)

Country Link
CN (1) CN101877121B (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102289794A (en) * 2011-07-27 2011-12-21 苏州巴米特信息科技有限公司 Method for restoring image
CN102819830A (en) * 2012-08-15 2012-12-12 北京交通大学 New point spread function estimation method based on Kallman filtering
CN104299202A (en) * 2014-10-25 2015-01-21 中国科学院光电技术研究所 Out-of-focus blurred image blind restoration method based on medium frequency
CN104820969A (en) * 2015-04-03 2015-08-05 西安交通大学 Real-time blind image restoration method
CN105894468A (en) * 2016-03-31 2016-08-24 武汉双赢信息技术有限公司 Image restoration method based on marginal sharpness evaluation index
CN106228526A (en) * 2016-08-29 2016-12-14 中国科学院光电技术研究所 A kind of diffraction limit broad image blind restoration method based on intermediate frequency
CN109314773A (en) * 2018-03-06 2019-02-05 香港应用科技研究院有限公司 The generation method of high-quality panorama sketch with color, brightness and resolution balance
CN109697758A (en) * 2019-02-18 2019-04-30 中电科仪器仪表有限公司 A kind of multi-view angle three-dimensional curved surface spectrogram display methods
CN111199520A (en) * 2018-11-19 2020-05-26 北京华航无线电测量研究所 FPGA implementation method for color image scale expansion based on cubic convolution algorithm

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102289794A (en) * 2011-07-27 2011-12-21 苏州巴米特信息科技有限公司 Method for restoring image
CN102819830A (en) * 2012-08-15 2012-12-12 北京交通大学 New point spread function estimation method based on Kallman filtering
CN102819830B (en) * 2012-08-15 2015-04-22 北京交通大学 New point spread function estimation method based on Kallman filtering
CN104299202B (en) * 2014-10-25 2018-04-03 中国科学院光电技术研究所 A kind of defocus blur image blind restoration method based on intermediate frequency
CN104299202A (en) * 2014-10-25 2015-01-21 中国科学院光电技术研究所 Out-of-focus blurred image blind restoration method based on medium frequency
CN104820969A (en) * 2015-04-03 2015-08-05 西安交通大学 Real-time blind image restoration method
CN104820969B (en) * 2015-04-03 2017-06-27 西安交通大学 A kind of realtime graphic blind restoration method
CN105894468A (en) * 2016-03-31 2016-08-24 武汉双赢信息技术有限公司 Image restoration method based on marginal sharpness evaluation index
CN106228526A (en) * 2016-08-29 2016-12-14 中国科学院光电技术研究所 A kind of diffraction limit broad image blind restoration method based on intermediate frequency
CN106228526B (en) * 2016-08-29 2019-01-04 中国科学院光电技术研究所 A kind of diffraction limit blurred picture blind restoration method based on intermediate frequency
CN109314773A (en) * 2018-03-06 2019-02-05 香港应用科技研究院有限公司 The generation method of high-quality panorama sketch with color, brightness and resolution balance
CN111199520A (en) * 2018-11-19 2020-05-26 北京华航无线电测量研究所 FPGA implementation method for color image scale expansion based on cubic convolution algorithm
CN109697758A (en) * 2019-02-18 2019-04-30 中电科仪器仪表有限公司 A kind of multi-view angle three-dimensional curved surface spectrogram display methods

Also Published As

Publication number Publication date
CN101877121B (en) 2012-04-18

Similar Documents

Publication Publication Date Title
CN101877121B (en) Intermediate frequency based method for blindly restoring image
Lev et al. Iterative enhancemnent of noisy images
Dash et al. Motion blur parameters estimation for image restoration
CN103136734B (en) The suppressing method of edge Halo effect during a kind of convex set projection super-resolution image reconstruction
Nair et al. A robust anisotropic diffusion filter with low arithmetic complexity for images
CN101540043B (en) Analysis iteration fast frequency spectrum extrapolation method for single image restoration
CN104820969A (en) Real-time blind image restoration method
Tao et al. Zero-order reverse filtering
Prasad et al. High‐resolution imaging using integrated optical systems
Tao et al. Spectrum-to-kernel translation for accurate blind image super-resolution
Mbarki et al. A rapid hybrid algorithm for image restoration combining parametric Wiener filtering and wave atom transform
Arsigny et al. A log-euclidean polyaffine framework for locally rigid or affine registration
Lu et al. A framelet algorithm for de-blurring images corrupted by multiplicative noise
Li et al. Fractional-order diffusion coupled with integer-order diffusion for multiplicative noise removal
Maji et al. SAR image denoising based on multifractal feature analysis and TV regularisation
Marnissi et al. Fast variational Bayesian signal recovery in the presence of Poisson-Gaussian noise
Gao et al. A novel fractional‐order reaction diffusion system for the multiplicative noise removal
Liu et al. A modified convex variational model for multiplicative noise removal
Chen et al. Inexact alternating direction method based on proximity projection operator for image inpainting in wavelet domain
Hall et al. Nonparametric estimation of a point-spread function in multivariate problems
Zhao et al. Root-transformation based multiplicative denoising model and its statistical analysis
CN103325090A (en) Method and device for restraining speckles
Cui et al. Attention-guided multi-scale feature fusion network for low-light image enhancement
Zhu et al. Image restoration by second-order total generalized variation and wavelet frame regularization
Wali et al. Fast and adaptive boosting techniques for variational based image restoration

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20120418

Termination date: 20151030

EXPY Termination of patent right or utility model