CN1333372C - Resampling method for digital signal - Google Patents
Resampling method for digital signal Download PDFInfo
- Publication number
- CN1333372C CN1333372C CNB2006100115922A CN200610011592A CN1333372C CN 1333372 C CN1333372 C CN 1333372C CN B2006100115922 A CNB2006100115922 A CN B2006100115922A CN 200610011592 A CN200610011592 A CN 200610011592A CN 1333372 C CN1333372 C CN 1333372C
- Authority
- CN
- China
- Prior art keywords
- pixel
- sequence
- sequences
- fifty
- make
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000012952 Resampling Methods 0.000 title claims description 33
- 238000005070 sampling Methods 0.000 claims abstract description 9
- 238000001914 filtration Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 230000008676 import Effects 0.000 description 2
- 230000000630 rising effect Effects 0.000 description 2
- 238000009795 derivation Methods 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 238000004321 preservation Methods 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Abstract
The present invention discloses a re-sampling method for digital signals, which is used for reducing the sample of pixel sequence 0 with the input length of W1 and outputting a pixel sequence R with the length of W2, and W1 is bigger than the W2. The utility model is characterized in that when re-sample method takes place and the W1 pixels in the sequence 0 are input step by step, S1 pixels are averaged for X1 times and are used as one pixel in the output sequence R; S2 pixels are averaged for X2 times and are used as a pixel of R to obtain a pixel sequence R, wherein X1 is equal to W1 percent W2, the X2 is equal to (W2-X1), S1 is equal to Ceil (W1/W2), and the s2 is equal to floor (w1/w2). Ceil () expresses upward integral calculation, the floor () expresses downward integral calculation, the 'percent' expresses remainder calculation, and W1 is equal to S1*X1 and S2*X2. With the method of the present invention, calculating capacity and storage capacity can be reduced, and flexible re-sampling method for the digital signals can be realized.
Description
Technical field
The present invention relates to digital signal processing, relate in particular to a kind of method for resampling of digital signal.
Background technology
Image zoom technology of the prior art generally all realizes by wave filter.On digital pixel treatment theory, be length that the pixel sequences O resampling of W1 is that the pixel sequences R of length W2 requires to have following operation:
1: is length that the pixel of W1 is inserted 0 and handled and become the pixel S that length is W.W is the lowest common multiple of W1 and W2, W/W1=N1, W/W2=N2.This operation requires (or back) insertion N1-1 0 value before each original pixel.
2: S is carried out obtaining S ' after the Filtering Processing F.The bandwidth of wave filter F is 2 π/N, and N=max (N1, N2)
3: S ' is carried out extraction operation obtain R, promptly extract a point every N2 point.
The wave filter that adopts when step 2 is generally the FIR wave filter, and iir filter can bring the advantage on internal memory and the degree of stability relatively.Suppose that F is the FIR wave filter, its length is L, because F is a low-pass filter, in order to satisfy its bandwidth condition, L is generally the integer more than or equal to 2N.
When adopting the FIR wave filter to realize the resampling of image, following problem is arranged
1:W1 and W2 constantly change, so the resampling rate is constantly to change.Picture quality for after guaranteeing to resample often needs the FIR wave filter different according to the different designs of resampling rate, and preserves the FIR filter coefficient.When a lot of different resampling rate of needs support, storage FIR filter coefficient need account for very big memory space.
2: when adopting the FIR wave filter, in the FIR filtering, need preservation present picture element O[I] the pixel O[I-1 before], O[I-2] ... if the exponent number of FIR wave filter is L in theory, need to keep the individual pixel in the past of Ceil (L/N1) so at most.This may cause bigger memory space demand in practice.
The 3:FIR filtering needs multiply-add operation, and when the FIR wave filter that uses the L rank resampled pixel sequences O (length is W1) to R (length is W2), the add operation number of taking advantage of of needs was about W2*L/N1 time.
Summary of the invention
The technical problem to be solved in the present invention provides a kind of method for resampling of digital signal, can reduce calculated amount and memory space, realizes the resampling of digital signal neatly.
In order to solve the problems of the technologies described above, the invention provides a kind of method for resampling of digital signal, the length that is used for importing is that the pixel sequences O of W1 is down-sampled, output length is the pixel sequences R of W2, W1＞W2, it is characterized in that, during resampling, progressively during W1 pixel among the list entries O, have X1 time S1 pixel to be averaged a pixel as output sequence R, have and X2 time S2 pixel be averaged a pixel as output sequence R, obtain pixel sequences R, X1=W1%W2 wherein, X2=(W2-X1), S1=Ceil (W1/W2), S2=Floor (W1/W2), Ceil () represents to round up computing, Floor () represents downward rounding operation, " % " expression complementation computing, W1=S1*X1+S2*X2.
Further, said method also can have following characteristics: in the resampling process, also operation that is averaged by S1 pixel and the operation that is averaged by S2 pixel will be scatter fifty-fifty.
Further, said method also can have following characteristics: be by following steps realize operation that S1 pixel is averaged and the operation that is averaged by S2 pixel scattered fifty-fifty, progressively each picture element of Shu Ru pixel sequences O is expressed as O[I], 0＜=I＜W1, progressively each picture element of Shu Chu pixel sequences R is expressed as R[J], 0＜=J＜W2:
(a) initializing variable D is arbitrarily less than W2 and more than or equal to 0 integer, A=0, C=0, I=J=0;
(b) if I, has obtained the pixel sequences R that will export more than or equal to W1, finish; Otherwise carry out next step;
(c) the new pixel O[I of input], make I=I+1, A=A+O[I], D=D+W2; C=C+1;
(d) if D＜W1 returns step (b), otherwise carries out next step;
(e) make R[J]=A/C, C=0, J=J+1, D=D-W1, A=0 returns step (b).
Further, said method also can have following characteristics: be by following steps realize operation that S1 pixel is averaged and the operation that is averaged by S2 pixel scattered fifty-fifty, progressively each picture element of Shu Ru pixel sequences O is expressed as O[I], 0＜=I＜W1, progressively each picture element of Shu Chu pixel sequences R is expressed as R[J], 0＜=J＜W2:
(g) calculate S1=Ceil (W1/W2), S2=Floor (W1/W2), increment deta=W1%W2, initialization LT=S2 or S1, loop variable J=0 is arbitrarily less than W2 and more than or equal to an integer D of 0;
(h) from sequence O, take out LT pixel, this LT pixel got average, as the picture element R[J of the pixel sequences R that will export], make J=J+1 then;
(i) judge whether J equals W2, if, obtained the pixel sequences R that will export, finish, otherwise, next step carried out;
(j) make D=D+deta, whether judge D more than or equal to W2, if, execution in step (k), otherwise, execution in step (1);
(k) make D=D-W2, LT=S1 returns step (h);
(1) makes LT=S2, return step (h).
The present invention also provides a kind of method for resampling of digital signal, be used for the length of input is the pixel sequences O liter sampling of W1, output length is the pixel sequences R of W2, W1＜W2, it is characterized in that, during resampling, progressively during W1 pixel among the list entries O, have X1 time the pixel of sequence O to be copied as the pixel of S1 output sequence R, have X2 a pixel to copy as the pixel of S2 output sequence R, thereby obtain pixel sequences R sequence O, X1=W2%W1 wherein, X2=(W1-X1), S1=Ceil (W2/W1), S2=Floor (W2/W1), Ceil () represents to round up computing, Floor () represents downward rounding operation, " % " expression complementation computing, W2=S1*X1+S2*X2.
Further, said method also can have following characteristics: in the resampling process, also will pixel of sequence O be copied as the operation of S1 output sequence R pixel and X2 time with X1 time the operation that pixel of sequence O copies as S2 output sequence R pixel is scatter fifty-fifty.
Further, said method also can have following characteristics: be to realize that by following steps with X1 time pixel of sequence O being copied as the operation of S1 output sequence R pixel and X2 time scatter the operation that pixel of sequence O copies as S2 output sequence R pixel fifty-fifty, if progressively each picture element of Shu Ru pixel sequences O is expressed as O[I], 0＜=I＜W1, progressively each picture element of Shu Chu pixel sequences R is expressed as R[J], 0＜=J＜W2:
(A) initializing variable D=is arbitrarily less than W1 and more than or equal to 0 integer, I=J=0;
(B) if I, has obtained the pixel sequences R that will export more than or equal to W1, finish; Otherwise, carry out next step;
(C) from the new pixel O[I of sequence O input], make I=I+1;
(D) make R[J]=O[I], J=J+1; D=D+W1;
(E) if D＜W2 returns step (D), otherwise, make D=D-W2, return step (B).
Further, said method also can have following characteristics: be to realize that by following steps with X1 time pixel of sequence O being copied as the operation of S1 output sequence R pixel and X2 time scatter the operation that pixel of sequence O copies as S2 output sequence R pixel fifty-fifty, if progressively each picture element of Shu Ru pixel sequences O is expressed as O[I], 0＜=I＜W1, progressively each picture element of Shu Chu pixel sequences R is expressed as R[J], 0＜=J＜W2:
(H) calculate S1=Ceil (W2/W1), S2=Floor (W2/W1), initializing variable deta=W2%W1, D are arbitrarily less than W1 and more than or equal to 0 integer, LT=S2 or S1, I=J=0;
(I), if I＞=W1 has obtained the pixel sequences R that will export, finish, otherwise carry out next step;
(J), the new pixel O[I of input from sequence W1], make I=I+1;
(K), O[J]=R[I], J=J+1; And repeat this operation LT time;
(L), make D=D+deta, if D＞=W1 then makes D=D-W1, LT=S1 returns step (I); Otherwise make LT=S2, return step (I).
In sum, the invention provides a kind of method for resampling of digital signal, overcome required memory in the prior art too much and realize the problem of variable resampling rate more complicated, be particularly suitable for simple and realize of the resampling of an image sequence neatly to the random length image sequence.
Description of drawings
Fig. 1 is the process flow diagram of a kind of down-sampled method of first embodiment of the invention;
Fig. 2 is a kind of process flow diagram that rises the method for sampling of second embodiment of the invention.
Embodiment
Below with the data image signal be example the present invention will be described, but the present invention also can be applied to during other digital signal resamples.
First embodiment
In the present embodiment, be length that the pixel sequences O resampling of W1 is the pixel sequences R of length W2, establish this resampling for down-sampled, i.e. W2＜W1.
If S is 1=Ceil (W1/W2), S2=Floor (W1/W2), wherein Ceil () represents to round up computing, Floor () represents downward rounding operation.
Definition again: X1=W1%W2, X2=(W2-X1), i.e. X1+X2=W2." % " expression complementation computing.Significantly, have:
W1＝S1*X1+S2*X2，
The implication of above-mentioned derivation is the pixel for the W1 among the O, is divided into the W2 section, wherein has the X1 section to contain S1 pixel, has the X2 section to contain S2 pixel.If we ask the average pixel of this section of average back output just to obtain W2 pixel just at last to the picture element of each section wherein, realized the process that from O to R, must resample.
But, if have only segmentation in this process and ask average operation, the partial distortion that can cause pixel sequences O, because certain part among the O is by 1 picture element of S1 picture element average out to, in addition-a little partly by 1 picture element of S2 picture element average out to, though S1 and S2 are relatively more approaching but also unequal, cause this two parts ground resolution inconsistent.Therefore, must find a kind of method that these two kinds of different parts of resolution are scatter fifty-fifty, see on the whole that promptly the part of two kinds of different resolutions is scattered among the sequence R very fifty-fifty, so just can avoid R distortion visually.
Suppose W1=27, W2=8, S 1=Ceil (W1/W2) 4 then, S2=Floor (W1/W2)=3, X1=W1%W2=3, X2=(W2-X1)=5.Have:
W1=S1*X1+S2*X2=4*3+3*5=27, it is on average to be obtained by the picture element among continuous 4 O that 3 points are promptly arranged in the R sequence, it is on average to be obtained by the picture element among continuous 3 O that 5 points are arranged.For fear of visual distortion, 34 picture elements that become 1 and 53 change 1 should on average spread out on the whole.Otherwise may allow the observer aware image fault.
When below introduce a kind of down-sampled concrete grammar, be used for control and when S1 point asked average, be that S2 point asks average, and two kinds of different resolutions are scatter.
Import the pixel sequences O that length is W1 one by one, each picture element is expressed as O[I], 0＜=I＜W1 exports the pixel sequences R that length is W2 one by one, each picture element is expressed as R[J], 0＜=J＜W2.Carry out following computing in the resampling process, as shown in Figure 1:
Step 110, initializing variable D=is arbitrarily less than W2 and more than or equal to 0 integer, A=0; C=0; I=J=0;
Step 120 if I, has obtained the pixel sequences R that will export more than or equal to W1, finishes; Otherwise carry out next step;
Step 130 is from the new pixel O[I of sequence O input], make I progressively increase 1, A=A+O[I], D=D+W2; C=C+1;
Step 140, if D＜W1 returns step 120, otherwise, carry out next step;
Step 150 makes R[J]=A/C, C=0, J=J+1, D=D-W1, A=0 returns step 120.
For W1=27, the example of W2=8, D is initialized as 2, and then operation result is successively 4,3,3,4,3,3,4,3 picture elements to be asked all, as seen also evenly scatter.
For the scattered fifty-fifty down-sampled method of part that resolution is different with two kinds, top method is not unique, for example, can also adopt following method:
Steps A calculates S1=Ceil (W1/W2), S2=Floor (W1/W2), and increment deta=W1%W2, initialization LT=S2 (or S 1), loop variable J=0 is arbitrarily less than W2 and more than or equal to an integer D of 0;
Step B takes out LT pixel from sequence O, this LT pixel is got average, as the picture element R[J of the pixel sequences R that will export], make J=J+1 then;
Step C judges whether J equals W2, if, obtained the pixel sequences R that will export, finish, otherwise, carry out next step;
Step D makes D=D+deta, whether judges D more than or equal to W2, if, execution in step E, otherwise, execution in step F;
Step e makes D=D-W2, and LT=S1 returns step B;
Step F makes LT=S2, returns step B.
For W1=27, the example of W2=8, S1=4, S2=3, X1=3, X2=5 makes deta=3, initialization D=4, LT=3, then operation result is successively 3,3,4,3,4,3,3,4 picture elements to be asked all, also evenly scatter.
Second embodiment
In the present embodiment, be length that the pixel sequences O resampling of W1 is the pixel sequences R of length W2, and this resample to rising sampling, i.e. W2＜W1.
Similarly, make S1=Ceil (W2/W1), S2=Floor (W2/W1).X1=W2%W1, X2=(W1-X1) then has: W2=S1*X1+S2*X2.
During resampling, for the picture element among the O, wherein X1 pixel duplicated by a pixel and becomes S1 pixel for S1 time, and X2 pixel duplicated by a pixel and become S2 pixel for S2 time in addition, obtains the pixel sequences R that length is W2 at last.Similarly, must guarantee two kinds differently resolution can on average spread out on the whole, could guarantee that the pixel sequences R that obtains is visually undistorted.
Suppose W1=8, W2=27, S1=Ceil (W2/W2)=4 then, S2=Floor (W2/W2)=3, X1=W2%W1=3, X2=(W1-X1)=5.Have
W2=S1*X1+S2*X2=4*3+3*5=27, promptly the picture element among the O has 5 to duplicate 3 times, has 3 to duplicate 4 times, just can obtain the sequence R of 27 picture elements.The pixel that duplicates 3 times must scatter with the pixel that duplicates 4 times, otherwise will cause distortion.
When below introduce a kind of concrete grammar that rises sampling, be used for control and when S1 point duplicated, be that S2 point duplicates, and two kinds of different resolutions are scatter.
Import the pixel sequences O that length is W1 one by one, each picture element is expressed as O[I], 0＜=I＜W1 exports the pixel sequences R that length is W2 one by one, each picture element is expressed as R[J], 0＜=J＜W2.This resamples to rising sampling, i.e. W2＞W1.In the resampling process, carry out following steps, as shown in Figure 2:
Step 220 if I, has obtained the pixel sequences R that will export more than or equal to W1, finishes; Otherwise, carry out next step;
Step 230 is from the new pixel O[I of sequence O input], make I=I+1;
Step 240 makes R[J]=O[I], J=J+1; D=D+W1;
For W1=8, the example of W2=27, D is initialized as 5, and then operation result is successively each input pixel to be duplicated 3,4,3,3,4,3,3,4 times, as seen evenly scatter.
For the scattered fifty-fifty method of sampling that rises of part that resolution is different with two kinds, top method neither be unique, for example, can also adopt following method:
Step H calculates S1=Ceil (W2/W1) earlier, and S2=Floor (W2/W1), initializing variable deta=W2%W1, D are arbitrarily less than W1 and more than or equal to 0 integer, LT=S2 (or S 1), I=J=0;
Step I if I＞=W1 has obtained the pixel sequences R that will export, finishes, otherwise carries out next step;
Step J, the new pixel O[I of input from sequence W1], make I=I+1;
Step K, O[J]=R[I], J=J+1; And repeat this operation LT time;
Step L makes D=D+deta, if D＞=W1 then makes D=D-W1, LT=S1 returns step I; Otherwise make LT=S2, return step I.
In algorithm set forth above, gone out control variable I, J, T, LT, outside the deta, in fact the demand of storage has only the demand of a temporary variable A, thereby its memory requirements is very little, also is constant.In addition for the specific algorithm that different resolution is separated, be not limited to above severally, any feasible mode all can be applicable to the present invention.
In sum, the method for the present invention's proposition utilizes a kind of method of low-pass filtering different from the past to carry out the image resampling operation.This method can realize flexibly resampling from the sequence of length W1 and be the W2 sequence, has avoided design and has stored a cover filter coefficient, avoided in the FIR filtering normal use take advantage of add operation, saved calculated amount.Simultaneously, this method can also a large amount of save keep intermediate results required impact damper.
Claims (8)
1, a kind of method for resampling of digital signal, the length that is used for importing is that the pixel sequences O of W1 is down-sampled, output length is the pixel sequences R of W2, W1＞W2 is characterized in that, during resampling, progressively during W1 pixel among the list entries O, have X1 time S1 pixel to be averaged a pixel as output sequence R, have X2 time S2 pixel to be averaged a pixel as output sequence R, obtain pixel sequences R, X1=W1%W2 wherein, X2=(W2-X1), S1=Ceil (W1/W2), S2=Floor (W1/W2), Ceil () represents to round up computing, Floor () represents downward rounding operation, " % " expression complementation computing, W1=S1*X1+S2*X2.
2, the method for claim 1 is characterized in that, in the resampling process, also operation that is averaged by S1 pixel and the operation that is averaged by S2 pixel will be scatter fifty-fifty.
3, method as claimed in claim 2, it is characterized in that, be by following steps realize operation that S1 pixel is averaged and the operation that is averaged by S2 pixel scattered fifty-fifty, progressively each picture element of Shu Ru pixel sequences O is expressed as O[I], 0＜=I＜W1, progressively each picture element of Shu Chu pixel sequences R is expressed as R[J], 0＜=J＜W2:
(a) initializing variable D is arbitrarily less than W2 and more than or equal to 0 integer, A=0, C=0, I=J=0;
(b) if I, has obtained the pixel sequences R that will export more than or equal to W1, finish; Otherwise carry out next step;
(c) the new pixel O[I of input], make I=I+1, A=A+O[I], D=D+W2; C=C+1;
(d) if D＜W1 returns step (b), otherwise carries out next step;
(e) make R[J]=A/C, C=0, J=J+1, D=D-W1, A=0 returns step (b).
4, method as claimed in claim 2, it is characterized in that, be by following steps realize operation that S1 pixel is averaged and the operation that is averaged by S2 pixel scattered fifty-fifty, progressively each picture element of Shu Ru pixel sequences O is expressed as O[I], 0＜=I＜W1, progressively each picture element of Shu Chu pixel sequences R is expressed as R[J], 0＜=J＜W2:
(g) calculate S1=Ceil (W1/W2), S2=Floor (W1/W2), increment deta=W1%W2, initialization LT=S2 or S1, loop variable J=0 is arbitrarily less than W2 and more than or equal to an integer D of 0;
(h) from sequence O, take out LT pixel, this LT pixel got average, as the picture element R[J of the pixel sequences R that will export], make J=J+1 then;
(i) judge whether J equals W2, if, obtained the pixel sequences R that will export, finish, otherwise, next step carried out;
(j) make D=D+deta, whether judge D more than or equal to W2, if, execution in step (k), otherwise, execution in step (1);
(k) make D=D-W2, LT=S1 returns step (h);
(1) makes LT=S2, return step (h).
5, a kind of method for resampling of digital signal, be used for the length of input is the pixel sequences O liter sampling of W1, output length is the pixel sequences R of W2, W1＜W2, it is characterized in that, during resampling, progressively during W1 pixel among the list entries O, have X1 time the pixel of sequence O to be copied as the pixel of S1 output sequence R, have X2 a pixel to copy as the pixel of S2 output sequence R, thereby obtain pixel sequences R sequence O, X1=W2%W1 wherein, X2=(W1-X1), S1=Ceil (W2/W1), S2=Floor (W2/W1), Ceil () represents to round up computing, Floor () represents downward rounding operation, " % " expression complementation computing, W2=S1*X1+S2*X2.
6, method as claimed in claim 5, it is characterized in that, in the resampling process, also to pixel of sequence O be copied as the operation of S1 output sequence R pixel and X2 time the operation that pixel of sequence O copies as S2 output sequence R pixel is scatter fifty-fifty X1 time.
7, method as claimed in claim 6, it is characterized in that, be to realize that by following steps with X1 time pixel of sequence O being copied as the operation of S1 output sequence R pixel and X2 time scatter the operation that pixel of sequence O copies as S2 output sequence R pixel fifty-fifty, if progressively each picture element of Shu Ru pixel sequences O is expressed as O[I], 0＜=I＜W1, progressively each picture element of Shu Chu pixel sequences R is expressed as R[J], 0＜=J＜W2:
(A) initializing variable D=is arbitrarily less than W1 and more than or equal to 0 integer, I=J=0;
(B) if I, has obtained the pixel sequences R that will export more than or equal to W1, finish; Otherwise, carry out next step;
(C) from the new pixel O[I of sequence O input], make I=I+1;
(D) make R[J]=O[I], J=J+1; D=D+W1;
(E) if D＜W2 returns step (D), otherwise, make D=D-W2, return step (B).
8, method as claimed in claim 6, it is characterized in that, be to realize that by following steps with X1 time pixel of sequence O being copied as the operation of S1 output sequence R pixel and X2 time scatter the operation that pixel of sequence O copies as S2 output sequence R pixel fifty-fifty, if progressively each picture element of Shu Ru pixel sequences O is expressed as O[I], 0＜=I＜W1, progressively each picture element of Shu Chu pixel sequences R is expressed as R[J], 0＜=J＜W2:
(H) calculate S1=Ceil (W2/W1), S2=Floor (W2/W1), initializing variable deta=W2%W1, D are arbitrarily less than W1 and more than or equal to 0 integer, LT=S2 or S1, I=J=0;
(I), if I＞=W1 has obtained the pixel sequences R that will export, finish, otherwise carry out next step;
(J), the new pixel O[I of input from sequence W1], make I=I+1;
(K), O[J]=R[I], J=J+1; And repeat this operation LT time;
(L), make D=D+deta, if D＞=W1 then makes D=D-W1, LT=S1 returns step (I); Otherwise make LT=S2, return step (I).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100115922A CN1333372C (en) | 2006-03-30 | 2006-03-30 | Resampling method for digital signal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100115922A CN1333372C (en) | 2006-03-30 | 2006-03-30 | Resampling method for digital signal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1822045A CN1822045A (en) | 2006-08-23 |
| CN1333372C true CN1333372C (en) | 2007-08-22 |
Family
ID=36923394
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100115922A Expired - Fee Related CN1333372C (en) | 2006-03-30 | 2006-03-30 | Resampling method for digital signal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1333372C (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1991004636A2 (en) * | 1989-09-11 | 1991-04-04 | Independent Broadcasting Authority | Improvements in or relating to motion adaptive video signal converters |
| CN1201333A (en) * | 1997-05-29 | 1998-12-09 | 三星电子株式会社 | Interpolation method for binary picture |
| US20050107701A1 (en) * | 2003-11-19 | 2005-05-19 | Dubberstein David T. | Automatic color gain adjustments |
| CN1750042A (en) * | 2004-09-15 | 2006-03-22 | 德鑫科技股份有限公司 | Interpolation processing method for digital image |
-
2006
- 2006-03-30 CN CNB2006100115922A patent/CN1333372C/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO1991004636A2 (en) * | 1989-09-11 | 1991-04-04 | Independent Broadcasting Authority | Improvements in or relating to motion adaptive video signal converters |
| CN1201333A (en) * | 1997-05-29 | 1998-12-09 | 三星电子株式会社 | Interpolation method for binary picture |
| US20050107701A1 (en) * | 2003-11-19 | 2005-05-19 | Dubberstein David T. | Automatic color gain adjustments |
| CN1750042A (en) * | 2004-09-15 | 2006-03-22 | 德鑫科技股份有限公司 | Interpolation processing method for digital image |
Non-Patent Citations (1)
| Title |
|---|
| 视频图像缩放的设计及实现 汪颖等，电视技术，第6期 2004 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1822045A (en) | 2006-08-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102194216B (en) | Image processing equipment and image processing method | |
| CN111784570A (en) | Video image super-resolution reconstruction method and device | |
| CN104899835B (en) | Image Super-resolution processing method based on blind blur estimation and anchoring space mapping | |
| CN111553867B (en) | Image deblurring method and device, computer equipment and storage medium | |
| US20040234165A1 (en) | Image interpolation apparatus and method | |
| Lakshman et al. | Image interpolation using shearlet based iterative refinement | |
| CN110636289A (en) | Image data transmission method, system, device, electronic equipment and storage medium | |
| KR100301543B1 (en) | Digital Image Resizing Device | |
| CN114494022B (en) | Model training method, super-resolution reconstruction method, device, equipment and medium | |
| CN110782397A (en) | Image processing method, generation type countermeasure network, electronic equipment and storage medium | |
| CN110782398B (en) | Image processing method, generative countermeasure network system and electronic device | |
| CN1333372C (en) | Resampling method for digital signal | |
| JP2005217532A (en) | Resolution conversion method and resolution conversion apparatus | |
| Wang et al. | Efficient implementation of a cubic-convolution based image scaling engine | |
| WO2012124591A1 (en) | Signal processing device, control program, and integrated circuit | |
| Lu et al. | Utilizing homotopy for single image superresolution | |
| US20110317773A1 (en) | Method for downsampling images | |
| Pham et al. | Normalized averaging using adaptive applicability functions with applications in image reconstruction from sparsely and randomly sampled data | |
| JP2008523489A (en) | Method and apparatus for changing image size | |
| CN109996078A (en) | A kind of method for compressing image, device and electronic equipment | |
| CN105894481B (en) | Histogram equalization method and device for video monitoring equipment | |
| CN100389591C (en) | Method for carrying out zoom on two-dimensional digital signal | |
| CN108492264B (en) | Single-frame image fast super-resolution method based on sigmoid transformation | |
| CN112184568A (en) | Image processing method and device, electronic equipment and readable storage medium | |
| CN103916649B (en) | A kind of image processing method and device, system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20070822 Termination date: 20120330 |