CN102930565A - Construction method for discrete degradation image of turn-back motion target in static background - Google Patents

Construction method for discrete degradation image of turn-back motion target in static background Download PDF

Info

Publication number
CN102930565A
CN102930565A CN2012103591019A CN201210359101A CN102930565A CN 102930565 A CN102930565 A CN 102930565A CN 2012103591019 A CN2012103591019 A CN 2012103591019A CN 201210359101 A CN201210359101 A CN 201210359101A CN 102930565 A CN102930565 A CN 102930565A
Authority
CN
China
Prior art keywords
yij
xij
image
background
row
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
CN2012103591019A
Other languages
Chinese (zh)
Other versions
CN102930565B (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.)
Harbin University of technology high tech Development Corporation
Original Assignee
Harbin Institute of Technology
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 Harbin Institute of Technology filed Critical Harbin Institute of Technology
Priority to CN201210359101.9A priority Critical patent/CN102930565B/en
Publication of CN102930565A publication Critical patent/CN102930565A/en
Application granted granted Critical
Publication of CN102930565B publication Critical patent/CN102930565B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Image Processing (AREA)
  • Processing Or Creating Images (AREA)

Abstract

The invention relates to a construction method for a discrete degradation image of a turn-back motion target in a static background, belonging to one part using more than one image in the field of image data processing or generation, in particular to a construction method for a discrete motion blur image. The method comprises the following steps of dividing a turn-back motion process of a target image into m sections of one-way motion processes; constructing ni sub-images figi j (j is equal to 1, 2,..., ni) according to the distances among ni pixels of the target image motion in the ith section of one-way motion process in the premise that the edge of the target image does not exceed the edge of a static background image all the time; and performing weighted linear superposition according to the following formula: in the formula, wi and j are weighting coefficients, and fig is the constructed discrete degradation image. The construction method for the discrete degradation image has the advantages that the operation time is short; a degradation process is intuitive and convenient to understand; the image is not required to be readjusted; the motion blur image which is formed by motion targets occupying partial view fields can be simulated, and the phenomenon that information on both sides of the image is superposed is prevented.

Description

The discrete degraded image building method of fold return motion target in a kind of static background
Technical field
In a kind of static background the discrete degraded image building method of fold return motion target belong to that general view data is processed or the generation field in by using the part more than piece image, relate in particular to a kind of discrete motion blurred picture building method.
Background technology
If have relative motion between imageing sensor and the target in imaging process, the gained image will produce the motion blur phenomenon.At daily life, commercial production, aerospace field, this phenomenon is very general.Although motion blur image can present the aesthetic feeling of art in some special dimension, but in most fields such as communications and transportation, commercial production, motion blur image but can only make troubles to the identification of target in the image and to obtaining of target detail information to us.Such as the electronic eyes in the traffic and transport field, bring difficulty to the identification of license plate number if photograph the fog-level of image, so just be difficult to vehicles peccancy is pressed chapter punishment, be unfavorable for the conventional maintenance of traffic order, cause potential safety hazard for people's life.
Avoid the generation of motion blur phenomenon in the image, generally adopt anti-shake technology, anti-shake technology comprises the anti-shake and electronic flutter-proof of optics, optics is anti-shake to be divided into again that camera lens is anti-shake and imaging is anti-shake, anti-shake the referring to of camera lens arranges special anti-shake compensating glass group in camera lens, according to jitter direction and the degree of camera, and compensating glass group corresponding adjustment position and angle, make light path keep stable, such as the EF IS of Canon series camera lens, Nikon VR series camera lens, suitable horse OS series camera lens; The anti-shake image device that refers to of imaging is behind the perception camera shake, and the position or the angle that change image device are held in the stable of picture, and this technology was widely used in the digital camera epoch.Electronic flutter-proof refers to by one-tenth's image is analyzed, and the anti-shake technology of then utilizing algorithm that image is compensated, this technology are actually by reducing image quality comes compensate for jitter, attempts to obtain between image quality and float an equilibrium point.Electronic flutter-proof is compared with optics is anti-shake, has a cost low, the characteristics of weak effect, so electronic flutter-proof only is used in the low side camera.But, but more be subjected to the concern of academia than the anti-shake technology of optics about the algorithm of electronic flutter-proof.
Algorithm for electronic flutter-proof, it is exactly the restoration algorithm of corresponding academia motion blur image, present stage, restoration algorithm was very many, traditional liftering algorithm, Wiener filtering algorithm are arranged, also have numerous blind restoration algorithms such as Kalman filtering algorithm and convex set projection method, up to now, still there is improved new algorithm to continue to bring out out.In order to verify the adaptability of these new restoration algorithms, need to restore the only different degraded image of degradation parameter, and compare with original image.In each collection image, although we can artificially set the degradation parameter of image as required, but can't avoid the impact of random noise, so that the image sequence that actual acquisition arrives is except the degradation parameter difference, will inevitably be subject to the impact of random noise, therefore can't actual acquisition arrive the only different degraded image of degradation parameter.
The way that overcomes this problem is very simple, with the mode of software simulation the different degenrate functions of original non degenerate imagery exploitation is manually degenerated exactly.By people's works such as Gonzalez, the people such as Ruan Qiuqi translation, and summed up the method for two kinds of artificial degraded images that prior art adopts in " Digital Image Processing " book of being published by China Machine Press:
The first is spatial domain convolution degeneration method, if original image is f (x, y), degenrate function is h (x, y), and then degraded image g (x, y) is expressed as:
g(x,y)=f(x,y)*h(x,y)
In the formula, " * " represents convolution algorithm; For the discrete picture of M * N, the first spatial domain convolution way of degeneration obtains the process of degraded image and can further be write as:
g ( x , y ) = Σ m = 1 M Σ n = 1 N f ( m , n ) h ( x - m , y - n )
In the formula, x=1,2 ..., M; Y=1,2 ..., N.Can know according to top formula, calculate discrete degraded image g (x, y), need to be to x, y, m, n finish the quadruple loop computation and could realize, the quadruple loop computation is so that the computation process of discrete degraded image g (x, y) is very consuming time, and this is the shortcoming of spatial domain convolution way of degeneration.
The second is the frequency domain Fourier method of degenerating, if the frequency spectrum of original image f (x, y) is F (u, v), the frequency spectrum of degenrate function h (x, y) is H (u, v), and then the frequency spectrum designation of degraded image g (x, y) is:
G(u,v)=F(u,v)H(u,v)
In the formula, u=1,2 ..., M; V=1,2 ..., N.Because the existence of Fast Fourier Transform (FFT) method, so that frequency domain Fourier degeneration method is compared spatial domain convolution degeneration method significantly lifting was arranged in operation time, yet, this method also has the shortcoming of himself: at first, whole degenerative process is finished in frequency domain, degenerative process is neither directly perceived, is difficult for again understanding; Secondly, carry out inverse Fourier transform by the frequency spectrum G (u, v) of degraded image g (x, y) and obtain in the process of degraded image g (x, y), also need the image border is moved to the center, otherwise do not go up with real image is corresponding.
In addition, can know according to the basic theories of Fourier transform, for the finite image of a width of cloth length and width, in the edge of its image, owing to have very abundant high-frequency information, so that the frequency spectrum of this image is without several.Yet, before carrying out Fourier transform, capital image that length and width are finite is respectively take its row and column as the cycle, carry out periodic extension, continuation becomes the infinite image with cyclophysis of length and width, image after the continuation just has finite frequency spectrum, and the quantity of frequency spectrum is identical with the element number that original image ranks direction has.This method can realize description to original image so that adopt with the frequency spectrum sequence that the ranks element number is identical in the original image.
Yet this method has the shortcoming of himself, after image carried out periodic extension, one side of image will be bordered with opposite side, for the motion blur image degenerate problem, on direction of motion, the information of image one side will add in the opposite side information of bordering on it, two superimposed phenomenons of marginal information of image appear, this phenomenon is that the algorithm principle of discrete Fourier transformation causes, and is inevitable, is not inconsistent with real motion blur image.
And, because frequency domain Fourier degeneration method is to utilize Fourier transform formula directly to obtain on the basis of spatial domain convolution degeneration method, therefore two kinds of methods is essential identical, that is to say that two marginal informations of image also can appear in spatial domain convolution degeneration method superimposed, with the phenomenon that real motion blur image is not inconsistent, this is spatial domain convolution degeneration method and the frequency domain Fourier common shortcoming of method of degenerating.
In addition, spatial domain convolution degeneration method and the frequency domain Fourier method of degenerating all is that image is carried out integral operation, and integral image is degenerated.Yet in actual application problem, more common but is that the target that occupies imaging system part visual field is kept in motion, and the situation that the part except target remains static, for this situation, spatial domain convolution degeneration method no matter, or the frequency domain Fourier method of degenerating all is to simulate the effect identical with true degraded image, and this also is spatial domain convolution degeneration method and the frequency domain Fourier common shortcoming of method of degenerating.
Summary of the invention
There is following shortcoming in art methods: 1) spatial domain convolution degeneration method is long operation time; 2) frequency domain Fourier transform degeneration method is directly perceived, difficult understands, and also needs image is carried out move operation after inverse Fourier transform; 3) the superimposed phenomenon of image both sides information that is not inconsistent with truth all appears in spatial domain method and frequency domain method; 4) spatial domain method and frequency domain method all can only be degenerated for entire image.For above-mentioned shortcoming, the present invention proposes the discrete degraded image building method of fold return motion target in a kind of static background; The method not only operation time short, and degenerative process is directly perceived, is convenient to understand, and need not image is adjusted again; Corresponding real scene can be simulated the motion blur image of the moving target formation that occupies the part visual field, and the superimposed phenomenon of image both sides information can not occurred simultaneously.
The object of the present invention is achieved like this:
The discrete degraded image building method of fold return motion target may further comprise the steps in a kind of static background:
A. be M in resolution 1* N 1The static background image in, having resolution is M 2* N 2(M 2<M 1, N 2<N 1) target image, and the row of described target image and row respectively row and the row of parallel static background image; All the time be no more than static background image edge take the target image edge as prerequisite, target image fold return motion process is divided into m section one-way movement process, i (i=1,2 ..., in the section one-way movement process, be M according to resolution m) 2* N 2Target image along its row or column direction n that moves iThe distance of individual pixel constructs n iNumber of sub images fig I, j(j=1,2 ..., n i);
B. the n that step a is obtained 1+ n 2+ ... + n mNumber of sub images is weighted linear superposition according to following formula:
fig = Σ i = 1 m Σ j = 1 n i w i , j · fig i , j
In the formula, w I, jBe weighting coefficient, fig is the discrete degraded image that constructs.
The discrete degraded image building method of fold return motion target in above-mentioned a kind of static background, among the described step a, the static background image is fig Background, target image is fig ObjectWherein, fig BackgroundBe M 1* N 1Matrix, fig ObjectBe M 2* N 2Matrix; The 1st number of sub images fig of corresponding i one-way movement process I, 1, target image fig ObjectThe 1st row the 1st row pixel b 1,1Be positioned at static background image fig BackgroundThe capable yi1 row of xi1 pixel a Xi1, yi1Position, then the 1st number of sub images fig of corresponding i one-way movement process I, 1Be M1 * N 1Matrix, and fig I, 1(xi1:xi1+M 2-1, yi1:yi1+N 2-1)=fig Object, fig I, 1All the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xi1:xi1+M 2-1 expression xi1 walks to xi1+M 2-1 row, yi1:yi1+N 2-1 expression yi1 is listed as to yi1+N 2-1 row.
The discrete degraded image building method of fold return motion target in above-mentioned a kind of static background, among the described step a, the static background image is fig Background, target image is fig ObjectWherein, fig BackgroundBe M 1* N 1Matrix, fig ObjectBe M 2* N 2Matrix; The j of corresponding i one-way movement process (the number of sub images fig of 1≤j≤ni-1) I, j, fig is arranged I, j(xij:xij+M 2-1, yij:yij+N 2-1)=fig Object, fig I, jAll the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij:xij+M 2-1 expression xij walks to xij+M 2-1 row, yij:yij+N 2-1 expression yij is listed as to yij+N 2-1 row; If target image fig ObjectMove upward, then the j+1 number of sub images fig of corresponding i one-way movement process I, j+1Be M 1* N 1Matrix, and fig I, j+1(xij-1:xij+M 2-2, yij:yij+N 2-1)=fig Object, fig I, j+1All the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij-1:xij+M 2-2 expression xij-1 walk to xij+M 2-2 row, yij:yij+N 2-1 expression yij is listed as to yij+N 2-1 row.
The discrete degraded image building method of fold return motion target in above-mentioned a kind of static background, among the described step a, the static background image is fig Background, target image is fig ObjectWherein, fig BackgroundBe M 1* N 1Matrix, fig ObjectBe M 2* N 2Matrix; J (1≤the j≤n of corresponding i one-way movement process i-1) number of sub images fig I, j, fig is arranged I, j(xij:xij+M 2-1, yij:yij+N 2-1)=fig Object, fig I, jAll the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij:xij+M 2-1 expression xij walks to xij+M 2-1 row, yij:yij+N 2-1 expression yij is listed as to yij+N 2-1 row; If target image fig ObjectMove downward, then the j+1 number of sub images fig of corresponding i one-way movement process I, j+1Be M 1* N 1Matrix, and fig I, j+1(xij+1:xij+M 2, yij:yij+N 2-1)=fig Object, fig I, j+1All the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij+1:xij+M 2Represent that xij+1 walks to xij+M 2OK, yij:yij+N 2-1 expression yij is listed as to yij+N 2-1 row.
The discrete degraded image building method of fold return motion target in above-mentioned a kind of static background, among the described step a, the static background image is fig Background, target image is fig ObjectWherein, fig BackgroundBe M 1* N 1Matrix, fig ObjectBe M 2* N 2Matrix; J (1≤the j≤n of corresponding i one-way movement process i-1) number of sub images fig I, j, fig is arranged I, j(xij:xij+M 2-1, yij:yij+N 2-1)=fig Object, fig I, jAll the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij:xij+M 2-1 expression xij walks to xij+M 2-1 row, yij:yij+N 2-1 expression yij is listed as to yij+N 2-1 row; If target image fig ObjectTo left movement, the j+1 number of sub images fig of corresponding i one-way movement process then I, j+1Be M 1* N 1Matrix, and fig I, j+1(xij:xij+M 2-1, yij-1:yij+N 2-2)=fig Object, fig I, j+1All the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij:xij+M 2-1 expression xij walks to xij+M 2-1 row, yij-1:yij+N 2-2 expression yij-1 are listed as to yij+N 2-2 row.
The discrete degraded image building method of fold return motion target in above-mentioned a kind of static background, among the described step a, the static background image is fig Background, target image is fig ObjectWherein, fig BackgroundBe M 1* N 1Matrix, fig ObjectBe M 2* N 2Matrix; J (1≤the j≤n of corresponding i one-way movement process i-1) number of sub images fig I, j, fig is arranged I, j(xij:xij+M 2-1, yij:yij+N 2-1)=fig Object, fig I, jAll the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij:xij+M 2-1 expression xij walks to xij+M 2-1 row, yij:yij+N 2-1 expression yij is listed as to yij+N 2-1 row; If target image fig ObjectMove right, then the j+1 number of sub images fig of corresponding i one-way movement process I, j+1Be M 1* N 1Matrix, and fig I, j+1(xij:xij+M 2-1, yij+1:yij+N 2)=fig Object, fig I, j+1All the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij:xij+M 2-1 expression xij walks to xij+M 2-1 row, yij+1:yij+N 2Represent that yij+1 is listed as to yij+N 2Row.
The discrete degraded image building method of fold return motion target in above-mentioned a kind of static background, when i 〉=2, the 1st number of sub images fig of described corresponding i section one-way movement process I, 1N with corresponding i-1 section one-way movement process I-1Number of sub images Equate.
The discrete degraded image building method of fold return motion target in above-mentioned a kind of static background, among the described step b, weighting coefficient w I, jRatio be expressed as:
w 1,1 : w 1,2 : · · · : w i , j : · · · w m , n m - 1 : w m , n m = 1 v 1,1 : 1 v 1,2 : · · · : 1 v i , j : · · · : 1 v m , n m - 1 : 1 v m , n m
In the formula, v I, jThe j number of sub images fig of corresponding i section one-way movement process I, jCorresponding target image movement velocity.
The discrete degraded image building method of fold return motion target in above-mentioned a kind of static background, carry out the gray-scale value adjustment with the resulting discrete degraded image fig of step b according to following formula:
fig_improve=k·fig
In the formula, k is for adjusting coefficient, and fig_improve is the discrete degraded image after adjusting.
The discrete degraded image building method of fold return motion target in above-mentioned a kind of static background, described adjustment coefficient
k = 1 / Σ i = 1 m Σ j = 1 n i w i , j .
The invention has the beneficial effects as follows:
1) discrete degraded image building method of the present invention is according to the n that moves altogether in the one-way movement of m section of the target image in the static background image 1+ n 2+ ... + n mThe distance of individual pixel constructs n 1+ n 2+ ... + n mNumber of sub images, and these subimages are weighted the linear, additive computing.Be comprised of four parts the operation time of the method, and first is n 1+ n 2+ ... + n mThe structure time of number of sub images, second portion is n 1+ n 2+ ... + n mThe computing time of individual weight, third part is n 1+ n 2+ ... + n mThe numeral that individual respective weights and image multiply each other and the computing time of matrix multiple, the 4th part is to represent n 1+ n 2+ ... + n mThe n of number of sub images 1+ n 2+ ... + n mThe computing time of individual matrix addition.Because method of the present invention is avoided the quadruple circulation of spatial domain convolution degeneration method, and each step computing all is the simplest arithmetic, so the method has short beneficial effect operation time;
2) because the n that the present invention constructs 1+ n 2+ ... + n mIn the number of sub images, every number of sub images all represents the actual position corresponding relation of corresponding constantly target image and static background image, with this n 1+ n 2+ ... + n mIt is exactly instantaneous picture accumulative process in time in the true imaging process that number of sub images is weighted the linear, additive computing, therefore this method has the motion blur image that can simulate the moving target formation that occupies the part visual field, and the beneficial effect of the superimposed phenomenon of image both sides information can not occur.
3) since the whole degenerative process of discrete degraded image building method of the present invention in the spatial domain, finish, the direct corresponding imaging process of calculating process, thus the method to have degenerative process directly perceived, be convenient to understand, and need not beneficial effect that image is adjusted again.
Description of drawings
Fig. 1 is the static background image.
Fig. 2 is target image.
Fig. 3 is the 1st number of sub images of corresponding the 1st section one-way movement process.
Fig. 4 is discrete degraded image.
Embodiment
Below in conjunction with accompanying drawing the specific embodiment of the invention is done and to be described in further detail.
The resolution of static background image is 256 * 256, as shown in Figure 1; The resolution of target image is 64 * 64, as shown in Figure 2, in the present embodiment, the 1st row the 1st row pixel of target image is from the 150th row the 100th row location of pixels of static background image, with speed v along static background image line direction to the right uniform motion 10 pixels, again with speed 2v along static background image line direction left uniform motion 5 pixels.
The discrete degraded image building method of fold return motion target may further comprise the steps in a kind of static background:
A. in resolution is 256 * 256 static background image, having resolution is 64 * 64 target image, and the row of described target image and row respectively row and the row of parallel static background image; All the time be no more than static background image edge take the target image edge as prerequisite, target image fold return motion process is divided into 2 sections one-way movement processes, in the 1st section one-way movement process, be 64 * 64 target image according to resolution along the move distance of 10 pixels of its line direction, construct 10 number of sub images fig 1, j(j=1,2 ..., 10); In the 2nd section one-way movement process, be 64 * 64 target image according to resolution along the move distance of 5 pixels of its line direction, construct 5 number of sub images fig 2, j(j=1,2 ..., 5);
The 1st number of sub images fig of corresponding the 1st one-way movement process 1,1, target image fig ObjectThe 1st row the 1st row pixel be positioned at static background image fig BackgroundThe 150th row the 100th row location of pixels, the 1st number of sub images fig of corresponding the 1st one-way movement process then 1,1Be 256 * 256 matrix, and fig 1,1(150:213,100:163)=fig Object, fig 1,1All the other elements and fig BackgroundThe correspondence position element is identical; Wherein, 150:213 represents that the 150th walks to the 213rd row, and 100:163 represents that the 100th row are to the 163rd row;
The 1st number of sub images fig from the 1st one-way movement process 1,1Beginning, j (1≤j≤9) the number of sub images fig of corresponding the 1st one-way movement process 1, j, fig is arranged 1, j(x1j:x1j+63, y1j:y1j+63)=fig Object, fig 1, jAll the other elements and fig BackgroundThe correspondence position element is identical; Wherein, it is capable that x1j:x1j+63 represents that x1j walks to x1j+63, and y1j:y1j+63 represents that y1j is listed as to y1j+63 and is listed as; The j+1 number of sub images fig of corresponding the 1st one-way movement process then 1, j+1Be 256 * 256 matrix, and fig 1, j+1(x1j:x1j+63, y1j+1:yij+64)=fig Object, fig I, j+1All the other elements and fig BackgroundThe correspondence position element is identical; Wherein, it is capable that x1j:x1j+63 represents that x1j walks to x1j+63, and y1j+1:y1j+64 represents that y1j+1 is listed as to y1j+64 and is listed as;
The 1st number of sub images fig from the 2nd one-way movement process 2,1Beginning, j (1≤j≤4) the number of sub images fig of corresponding the 2nd one-way movement process 2, j, fig is arranged 2, j(x2j:x2j+63, y2j:y2j+63)=fig Object, fig 2, jAll the other elements and fig BackgroundThe correspondence position element is identical; Wherein, it is capable that x2j:x2j+63 represents that x2j walks to x2j+63, and y2j:y2j+63 represents that y2j is listed as to y2j+63 and is listed as; The j+1 number of sub images fig of corresponding the 2nd one-way movement process then 2, j+1Be 256 * 256 matrix, and fig 2, j+1(x2j:x2j+63, y2j-1:y2j+62)=fig Object, fig 2, j+1All the other elements and fig BackgroundThe correspondence position element is identical; Wherein, it is capable that x2j:x2j+63 represents that x2j walks to x2j+63, and y2j-1:y2j+62 represents that y2j-1 is listed as to y2j+62 and is listed as;
And, the 1st number of sub images fig of described corresponding the 2nd section one-way movement process 2,1The 10th number of sub images fig with corresponding the 1st section one-way movement process 1,10Equate.
B. the 10+5=15 number of sub images that step a is obtained is weighted linear superposition according to following formula:
fig = Σ i = 1 2 Σ j = 1 n i w i , j · fig i , j
In the formula, w I, jBe weighting coefficient, fig is the discrete degraded image that constructs, and has: n 1=10, n 2=5.
According to: v 1,1=v 1,2=...=v 1,10=v, and v 2,1=v 2,2=...=v 2,5=2v can obtain weighting coefficient w I, jRatio be expressed as:
w 1,1 : · · · : w 1,10 : w 2,1 : · · · : w 2,5 = 1 v 1,1 : · · · : 1 v 1,10 : 1 v 2,1 : · · · : 1 v 2,5 = 1 : · · · : 1 : 1 2 : · · · : 1 2
In the formula, v I, jThe j number of sub images fig of corresponding i section one-way movement process I, jCorresponding target image movement velocity, and have: v I, j≠ 0.
The discrete degraded image building method of fold return motion target in above-mentioned a kind of static background, carry out the gray-scale value adjustment with the resulting discrete degraded image fig of step b according to following formula:
fig_improve=k·fig
In the formula, k is for adjusting coefficient, and fig_improve is the discrete degraded image after adjusting.Described adjustment coefficient
k = 1 / Σ i = 1 m Σ j = 1 n i w i , j
The discrete degraded image that obtains after the adjustment as shown in Figure 4.

Claims (10)

1. the discrete degraded image building method of fold return motion target in the static background is characterized in that said method comprising the steps of:
A. be M in resolution 1* N 1The static background image in, having resolution is M 2* N 2(M 2<M 1, N 2<N 1) target image, and the row of described target image and row respectively row and the row of parallel static background image; All the time be no more than static background image edge take the target image edge as prerequisite, target image fold return motion process is divided into m section one-way movement process, i (i=1,2 ..., in the section one-way movement process, be M according to resolution m) 2* N 2Target image along its row or column direction n that moves iThe distance of individual pixel constructs n iNumber of sub images fig I, j(j=1,2 ..., n i);
B. the n that step a is obtained 1+ n 2+ ... + n mNumber of sub images is weighted linear superposition according to following formula:
fig = Σ i = 1 2 Σ j = 1 n i w i , j · fig i , j
In the formula, w I, jBe weighting coefficient, fig is the discrete degraded image that constructs.
2. according to the discrete degraded image building method of fold return motion target in claim 1 described a kind of static background, it is characterized in that among the described step a, the static background image is fig Background, target image is fig ObjectWherein, fig BackgroundBe M 1* N 1Matrix, fig ObjectBe M 2* N 2Matrix; The 1st number of sub images fig of corresponding i one-way movement process I, 1, target image fig ObjectThe 1st row the 1st row pixel b 1,1Be positioned at static background image fig BackgroundThe capable yi1 row of xi1 pixel a Xi1, yi1Position, then the 1st number of sub images fig of corresponding i one-way movement process I, 1Be M 1* N 1Matrix, and fig I, 1(xi1:xi1+M 2-1, yi1:yi1+N 2-1)=fig Object, fig I, 1All the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xi1:xi1+M 2-1 expression xi1 walks to xi1+M 2-1 row, yi1:yi1+N 2-1 expression yi1 is listed as to yi1+N 2-1 row.
3. according to the discrete degraded image building method of fold return motion target in claim 1 described a kind of static background, it is characterized in that among the described step a, the static background image is fig Background, target image is fig ObjectWherein, fig BackgroundBe M 1* N 1Matrix, fig ObjectBe M 2* N 2Matrix; J (1≤the j≤n of corresponding i one-way movement process i-1) number of sub images fig I, j, fig is arranged I, j(xij:xij+M 2-1, yij:yij+N 2-1)=fig Object, fig I, jAll the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij:xij+M 2-1 expression xij walks to xij+M 2-1 row, yij:yij+N 2-1 expression yij is listed as to yij+N 2-1 row; If target image fig ObjectMove upward, then the j+1 number of sub images fig of corresponding i one-way movement process I, j+1Be M 1* N 1Matrix, and fig I, j+1(xij-1:xij+M 2-2, yij:yij+N 2-1)=fig Object, fig I, j+1All the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij-1:xij+M 2-2 expression xij-1 walk to xij+M 2-2 row, yij:yij+N 2-1 expression yij is listed as to yij+N 2-1 row.
4. according to the discrete degraded image building method of fold return motion target in claim 1 described a kind of static background, it is characterized in that among the described step a, the static background image is fig Background, target image is fig ObjectWherein, fig BackgroundBe M 1* N 1Matrix, fig ObjectBe M 2* N 2Matrix; J (1≤the j≤n of corresponding i one-way movement process i-1) number of sub images fig I, j, fig is arranged I, j(xij:xij+M 2-1, yij:yij+N 2-1)=fig Object, fig I, jAll the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij:xij+M 2-1 expression xij walks to xij+M 2-1 row, yij:yij+N 2-1 expression yij is listed as to yij+N 2-1 row; If target image fig ObjectMove downward, then the j+1 number of sub images fig of corresponding i one-way movement process I, j+1Be M 1* N 1Matrix, and fig I, j+1(xij+1:xij+M 2, yij:yij+N 2-1)=fig Object, fig I, j+1All the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij+1:xij+M 2Represent that xij+1 walks to xij+M 2OK, yij:yij+N 2-1 expression yij is listed as to yij+N 2-1 row.
5. according to the discrete degraded image building method of fold return motion target in claim 1 described a kind of static background, it is characterized in that among the described step a, the static background image is fig Background, target image is fig ObjectWherein, fig BackgroundBe M 1* N 1Matrix, fig ObjectBe M 2* N 2Matrix; J (1≤the j≤n of corresponding i one-way movement process i-1) number of sub images fig I, j, fig is arranged I, j(xij:xij+M 2-1, yij:yij+N 2-1)=fig Object, fig I, jAll the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij:xij+M 2-1 expression xij walks to xij+M 2-1 row, yij:yij+N 2-1 expression yij is listed as to yij+N 2-1 row; If target image fig ObjectTo left movement, the j+1 number of sub images fig of corresponding i one-way movement process then I, j+1Be M 1* N 1Matrix, and fig I, j+1(xij:xij+M 2-1, yij-1:yij+N 2-2)=fig Object, fig I, j+1All the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij:xij+M 2-1 expression xij walks to xij+M 2-1 row, yij-1:yij+N 2-2 expression yij-1 are listed as to yij+N 2-2 row.
6. according to the discrete degraded image building method of fold return motion target in claim 1 described a kind of static background, it is characterized in that among the described step a, the static background image is fig Background, target image is fig ObjectWherein, fig BackgroundBe M 1* N 1Matrix, fig ObjectBe M 2* N 2Matrix; J (1≤the j≤n of corresponding i one-way movement process i-1) number of sub images fig I, j, fig is arranged I, j(xij:xij+M 2-1, yij:yij+N 2-1)=fig Object, fig I, jAll the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij:xij+M 2-1 expression xij walks to xij+M 2-1 row, yij:yij+N 2-1 expression yij is listed as to yij+N 2-1 row; If target image fig ObjectMove right, then the j+1 number of sub images fig of corresponding i one-way movement process I, j+1Be M 1* N 1Matrix, and fig I, j+1(xij:xij+M 2-1, yij+1:yij+N 2)=fig Object, fig I, j+1All the other elements and fig BackgroundThe correspondence position element is identical; Wherein, xij:xij+M 2-1 expression xij walks to xij+M 2-1 row, yij+1:yij+N 2Represent that yij+1 is listed as to yij+N 2Row.
7. according to the discrete degraded image building method of fold return motion target in claim 1 described a kind of static background, it is characterized in that when i 〉=2 the 1st number of sub images fig of described corresponding i section one-way movement process I, 1N with corresponding i-1 section one-way movement process I-1Number of sub images
Figure FDA00002186834000031
Equate.
8. the discrete degraded image building method of fold return motion target in a kind of static background according to claim 1 is characterized in that among the described step b weighting coefficient w I, jRatio be expressed as:
w 1,1 : w 1,2 : · · · : w i , j : · · · w m , n m - 1 : w m , n m = 1 v 1,1 : 1 v 1,2 : · · · : 1 v i , j : · · · : 1 v m , n m - 1 : 1 v m , n m
In the formula, v I, jThe j number of sub images fig of corresponding i section one-way movement process I, jCorresponding target image movement velocity.
9. the discrete degraded image building method of fold return motion target in a kind of static background according to claim 1 is characterized in that the resulting discrete degraded image fig of step b is carried out the gray-scale value adjustment according to following formula:
fig_improve=k·fig
In the formula, k is for adjusting coefficient, and fig_improve is the discrete degraded image after adjusting.
10. according to the discrete degraded image building method of fold return motion target in claim 9 described a kind of static background, it is characterized in that described adjustment coefficient
Figure FDA00002186834000033
CN201210359101.9A 2012-09-25 2012-09-25 Discrete degraded image construction method for retracing moving target in static background Active CN102930565B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210359101.9A CN102930565B (en) 2012-09-25 2012-09-25 Discrete degraded image construction method for retracing moving target in static background

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210359101.9A CN102930565B (en) 2012-09-25 2012-09-25 Discrete degraded image construction method for retracing moving target in static background

Publications (2)

Publication Number Publication Date
CN102930565A true CN102930565A (en) 2013-02-13
CN102930565B CN102930565B (en) 2015-03-25

Family

ID=47645355

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210359101.9A Active CN102930565B (en) 2012-09-25 2012-09-25 Discrete degraded image construction method for retracing moving target in static background

Country Status (1)

Country Link
CN (1) CN102930565B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106683147A (en) * 2017-01-23 2017-05-17 浙江大学 Method of image background blur
CN108198131A (en) * 2018-01-23 2018-06-22 北京航空航天大学 A kind of extraterrestrial target shake and motion blur simulation algorithm based on more image co-registrations
CN110070517A (en) * 2019-03-14 2019-07-30 安徽艾睿思智能科技有限公司 Blurred picture synthetic method based on degeneration imaging mechanism and generation confrontation mechanism
CN110895801A (en) * 2019-11-15 2020-03-20 北京金山云网络技术有限公司 Image processing method, device, equipment and storage medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080123995A1 (en) * 2006-11-24 2008-05-29 Gung-Chian Yin Image alignment method
CN102651134A (en) * 2012-03-17 2012-08-29 哈尔滨工业大学 Constant-speed blurred image construction method and device based on splicing of two frames of static images

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080123995A1 (en) * 2006-11-24 2008-05-29 Gung-Chian Yin Image alignment method
CN102651134A (en) * 2012-03-17 2012-08-29 哈尔滨工业大学 Constant-speed blurred image construction method and device based on splicing of two frames of static images

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
黄学雨等: "匀速直线运动模糊图像的退化模型研究", 《科技广场》 *
黎玮: "运动模糊图像恢复的参数估算与算法研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106683147A (en) * 2017-01-23 2017-05-17 浙江大学 Method of image background blur
CN106683147B (en) * 2017-01-23 2019-08-30 浙江大学 A kind of method of image background virtualization
CN108198131A (en) * 2018-01-23 2018-06-22 北京航空航天大学 A kind of extraterrestrial target shake and motion blur simulation algorithm based on more image co-registrations
CN108198131B (en) * 2018-01-23 2020-06-23 北京航空航天大学 Spatial target shaking and motion blur simulation method based on multi-image fusion
CN110070517A (en) * 2019-03-14 2019-07-30 安徽艾睿思智能科技有限公司 Blurred picture synthetic method based on degeneration imaging mechanism and generation confrontation mechanism
CN110070517B (en) * 2019-03-14 2021-05-25 安徽艾睿思智能科技有限公司 Blurred image synthesis method based on degradation imaging mechanism and generation countermeasure mechanism
CN110895801A (en) * 2019-11-15 2020-03-20 北京金山云网络技术有限公司 Image processing method, device, equipment and storage medium

Also Published As

Publication number Publication date
CN102930565B (en) 2015-03-25

Similar Documents

Publication Publication Date Title
Xiao et al. Satellite video super-resolution via multiscale deformable convolution alignment and temporal grouping projection
Wang et al. Fast image dehazing method based on linear transformation
CN113837938B (en) Super-resolution method for reconstructing potential image based on dynamic vision sensor
CN103426148A (en) Method and device for generating a super-resolution version of a low resolution input data structure
CN102930565A (en) Construction method for discrete degradation image of turn-back motion target in static background
CN107369166A (en) A kind of method for tracking target and system based on multiresolution neutral net
CN105913392A (en) Degraded image overall quality improving method in complex environment
CN101216942A (en) An increment type characteristic background modeling algorithm of self-adapting weight selection
CN104599242A (en) Multi-scale non-local regularization blurring kernel estimation method
CN104424628A (en) CCD-image-based method for reducing noise by using frame-to-frame correlation
CN102236887A (en) Motion-blurred image restoration method based on rotary difference and weighted total variation
CN106339996A (en) Image blind defuzzification method based on hyper-Laplacian prior
CN103971354A (en) Method for reconstructing low-resolution infrared image into high-resolution infrared image
CN104966277B (en) A kind of image recovery method based on long short exposed images pair
CN112819697A (en) Remote sensing image space-time fusion method and system
Cheng et al. Improved multi-scale dynamic feature encoding network for image demoiréing
CN114677479A (en) Natural landscape multi-view three-dimensional reconstruction method based on deep learning
CN104504672A (en) NormLV feature based low-rank sparse neighborhood-embedding super-resolution method
Zhang et al. Polarization image demosaicking via nonlocal sparse tensor factorization
CN104200443A (en) Alpha channel and image segmentation combined local motion blur restoration algorithm
CN104574276A (en) Method and device for aligning images on basis of optical flow
CN102867318B (en) The discrete degraded image building method of view picture fold return motion of subimage weighted stacking
CN102930566B (en) Discrete degraded image construction method for unidirectional movement object in static background
CN102930568B (en) Discrete degraded image construction method for uniform motion object in static background
CN100382567C (en) Method for rebuilding super resolution image from reduced quality image caused by interlaced sampling

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
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20200330

Address after: 150001 No. 118 West straight street, Nangang District, Heilongjiang, Harbin

Patentee after: Harbin University of technology high tech Development Corporation

Address before: 150001 Harbin, Nangang, West District, large straight street, No. 92

Patentee before: HARBIN INSTITUTE OF TECHNOLOGY