CN101599260B - Method and device for enlarging or shrinking image through sharable hardware - Google Patents
Method and device for enlarging or shrinking image through sharable hardware Download PDFInfo
- Publication number
- CN101599260B CN101599260B CN2008100384218A CN200810038421A CN101599260B CN 101599260 B CN101599260 B CN 101599260B CN 2008100384218 A CN2008100384218 A CN 2008100384218A CN 200810038421 A CN200810038421 A CN 200810038421A CN 101599260 B CN101599260 B CN 101599260B
- Authority
- CN
- China
- Prior art keywords
- variable
- pixel
- stored
- image
- new
- 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.)
- Active
Links
Images
Landscapes
- Image Processing (AREA)
Abstract
The invention provides a method and a device for processing images, which can enlarge or shrink the images through sharable hardware. The device comprises a row buffer, a first variable, a second variable and a pantograph. The pantograph is used for matching with the row buffer, the first variable and the second variable to enlarge or shrink the images. The pantograph executes a shrinking procedure for shrinking the images or executes an enlarging procedure for enlarging the images.
Description
Technical field
The invention relates to the method for image processing, especially carry out the method that image amplifies or dwindles about sharing hardware.
Background technology
Along with multimedia development, people hurriedly increase the demand of image processing.And image processing comprise multiple towards, one of them will be imported image exactly and do the action (abbreviation image-zooming) of dwindling (scaling down) or amplifying (scaling up), the hardware of carrying out this function then is a scaler (scaler).
For the application of image-zooming, for example: the image-zooming of network map, the normal requirement taken into account speed and degree of accuracy, and therefore, how to carry out image-zooming and reach real-time and distortionless requirement as far as possible, then be an important topic.
Yet, carry out one of method of image-zooming, for example, be with in the complete internal memory that is stored in high power capacity of all pixel datas in the image, cooperate high speed processor to do computing again.This measure no doubt can obtain optimized image, yet will significantly increase cost, and does not meet the industry actual demand.In addition, industry is had nothing in common with each other for the practice of described image-zooming, even has image dwindled with amplifying and transfer to the practice that different hardware is carried out, and often makes hardware structure become suitable complexity and inefficiency.
Summary of the invention
Based on above-mentioned purpose, the invention provides a kind of image treatment method, can share hardware and carry out image amplification (scaling up) or dwindle (scaling down), and it uses the internal memory of minute quantity can reach the function that image amplifies.This image has corresponding to one and has a plurality of pixels of the two-dimensional array of a plurality of row and a plurality of row.Method of the present invention comprises provides a column buffer, has at least 2N storage location, one first variable and one second variable are provided, and amplifies or dwindles in order to cooperate this column buffer to carry out image.Wherein, when carrying out image when dwindling, carry out one and dwindle program, this dwindles program and comprises a plurality of pixels to k row that should two-dimensional array are stored in the 1st to N the storage location of this column buffer in regular turn, to be listed as the capable pixel of j to a k+1 that should two-dimensional array is stored in this first variable, to be listed as the capable pixel of j+1 to a k+1 that should two-dimensional array is stored in this second variable, use one first algorithm capable according to being temporary in this column buffer j respectively, j+1 is capable, these pixels in this first variable and this second variable calculate one first new pixel, export this first new pixel, with above-mentioned j the storage location of this pixel shift to this line buffer that is stored in this first variable, be stored in this pixel shift in this second variable to this first variable with above-mentioned, to be listed as the capable pixel of j+2 to a k+1 that should two-dimensional array is stored in this second variable, use this first algorithm capable according to being temporary in this column buffer j+1 respectively, j+2 is capable, these pixels in this first variable and this second variable calculate one second new pixel, and export this second new pixel.Moreover, when carrying out the image amplification, carry out an amplification procedure, this amplification procedure comprises a plurality of pixels to k row that should two-dimensional array is stored in the 1st to N the storage location of this column buffer in regular turn, to be listed as the capable pixel of j to a k+1 that should two-dimensional array is stored in this first variable, to be listed as the capable pixel of j+1 to a k+1 that should two-dimensional array is stored in this second variable, use one second algorithm capable according to being temporary in this column buffer j respectively, j+1 is capable, these pixels in this first variable and this second variable calculate one first new row pixel group, and export this first new row pixel group, with above-mentioned N+j the storage location of this pixel shift to this line buffer that is stored in this first variable, be stored in this pixel shift in this second variable to this first variable with above-mentioned, to be listed as the capable pixel of j+2 to a k+1 that should two-dimensional array is stored in this second variable, use this second algorithm capable according to being temporary in this column buffer j+1 respectively, j+2 is capable, these pixels in this first variable and this second variable calculate one second new row pixel group, and export this second new row pixel group.Wherein in carrying out this amplification procedure when with the above-mentioned step that is stored in N+j the storage location of this pixel shift to this line buffer in this first variable, more comprise when j=N, this column buffer j is capable according to being temporary in respectively, j+1 these pixels capable, that N+j is capable, N+j+1 is capable calculate at least one the 3rd new row pixel group then to use this second algorithm, and exports the 3rd new row pixel group at least.
The present invention provides a kind of image processor again, can share hardware and carry out image and amplify or dwindle, and this image has with above-mentioned a plurality of pixels.The inventive system comprises a column buffer, have 2N storage location, one first variable, one second variable and a scaler at least.This scaler is amplified or is dwindled in order to cooperate this column buffer and this first, second variable to carry out image.This scaler is carried out above-mentioned this and is dwindled program so that image is dwindled, and can carry out above-mentioned this amplification procedure so that image is amplified.
Description of drawings
For above-mentioned purpose of the present invention, feature and advantage can be become apparent, below in conjunction with accompanying drawing the specific embodiment of the present invention is elaborated, wherein:
Fig. 1 is the Organization Chart of image processor of the prior art.
Fig. 2 is for carrying out the method flow diagram of image-zooming according to the present invention.
Fig. 3 a is for to dwindle the method flow diagram of program according to the present invention.
Fig. 3 b be carry out the present invention dwindle before the program pixel and the synoptic diagram of back new pixel.
Fig. 3 c is the storage data synoptic diagram that carries out column buffer among the step S402 of the present invention.
Fig. 3 d is the storage data synoptic diagram that carries out column buffer among the step S404 of the present invention.
Fig. 3 e is the storage data synoptic diagram that carries out column buffer among the step S406 of the present invention.
Fig. 4 a is the method flow diagram according to amplification procedure of the present invention.
Fig. 4 b be carry out before the amplification procedure of the present invention pixel and the synoptic diagram of back new pixel.
Fig. 4 c is the storage data synoptic diagram that carries out column buffer among the step S402 of the present invention.
Fig. 4 d is the storage data synoptic diagram that carries out column buffer among the step S404 of the present invention.
Fig. 4 e is the storage data synoptic diagram that carries out column buffer among the step S406 of the present invention.
Fig. 4 f is the storage data synoptic diagram that carries out column buffer among the step S418 of the present invention.
The primary clustering symbol description:
100～image processing system
101～image source
102～column buffer
103～image processor
104～the first variablees
105～display device
106～the second variablees
108～scaler
S202～S210～step
S302～S316～step
S402～S418 step
D
1～D
N～D
2N～storage location
Embodiment
For allow purpose of the present invention, feature, and advantage can become apparent preferred embodiment cited below particularly, and cooperate institute's accompanying drawing to be described in detail.Instructions of the present invention provides different embodiment that the technical characterictic of the different embodiments of the present invention is described.
Fig. 1 is the Organization Chart according to image processing system 100 of the present invention.Image source 101 provides an image among the figure, this image has corresponding to one and has a plurality of row and a plurality of row (in the present embodiment, for example, it is capable to have M row N) a plurality of pixels of two-dimensional array, and the form of these pixels can classify as YUV pixel format and rgb format etc., to express color density and the information in the video image.Image processor 103 receives from the data of image source 101 this image is carried out various IPFs, yet according to the present invention, this paper only does explanation with regard to the image-zooming function in the IPF.Comprise a scaler 108 in the image processor 103, the function of can this image be amplified (scaling up) or dwindling (scaling down) in the present invention, be different from prior art, it can be shared hardware and comprise a column buffer 102, one first variable 104 and one second variable 106 etc., as shown in fig. 1.Produce a new image after this image processor 103 is handled these images, this new image has corresponding to one and has a plurality of new pixel of the two-dimensional array of a plurality of row and a plurality of row (do not limit is that M row N is capable), may be output to a display device 105.
In order to reach the above-mentioned purpose that can share hardware when carrying out the image amplification or dwindling, the present invention provides a method again, as shown in Figure 2.This method provides in step S202 provides one first variable 104 and one second variable 106 among a column buffer 102, the step S204, and judges it is to carry out that image amplifies or image dwindles in step S206.This method comprises again when carrying out image when dwindling, and carries out one and dwindles program S208, and when carrying out the image amplification, carry out an amplification procedure S210.
This dwindles the method flow diagram of program S208 in Fig. 3 a presentation graphs 2.Fig. 3 b represents to have an image synoptic diagram of a plurality of pixels, in the present embodiment, desires to dwindle the new pixel b that program S208 is produced by this
1, b
2Also be shown on the figure with convenient explanation.When carrying out this when dwindling program S208, for example, can calculate by bilinear interpolation method (bilinear), for example, pixel a from figure
k j, a
k J+1, a
K+1 jAnd a
K+1 J+1Get one first new pixel b
1, from figure pixel a
k J+1, a
k J+2, a
K+1 J+1And a
K+1 J+2Obtain one second new pixel b
2, by that analogy, gather all new pixels and can obtain a new image that dwindles.When in step S302, will be to a plurality of pixel a of k row that should two-dimensional array
k 1, a
k 2, a
k 3..., a
k j, a
k J+1, a
k J+2... a
k NBe stored in a plurality of storage location D of this column buffer in regular turn
1, D
2, D
3... D
j, D
J+1, D
J+2... D
NIn, shown in Fig. 3 c (these storage locations have only indicated N among the figure, yet its quantity is not subject to the limits).Among the step S304, will be listed as the capable pixel a of j to a k+1 that should two-dimensional array
K+1 jBe stored in this first variable 104, shown in Fig. 3 d.And in step S306, will be listed as the capable pixel a of j+1 to a k+1 that should two-dimensional array
K+1 J+1Be stored in this second variable 106.Yet, it should be noted that in the ordinary course of things image processing can be since a pixel of the 1st row the 1st row, but bright more in a broad sense in order to do, present embodiment is with these storage locations D among Fig. 3 d since the capable j row of k
1, D
2, D
3To D
J-1And these pixels that these storage locations of institute store among previous Fig. 3 c different, repeat after the reason appearance.Among the step S308, this scaler 108 is used one first algorithm, for example is aforesaid this bilinear interpolation method, according to being temporary in D respectively
j, D
J+1, these pixels a in this first variable 104 and this second variable 106
k j, a
k J+1, a
K+1 jAnd a
K+1 J+1Calculate one first new pixel b
1(being shown among Fig. 3 b), and export this first new pixel b
1Next, in step S310, with above-mentioned this pixel a that is stored in this first variable 104
K+1 jBe displaced to j storage location D in this line buffer 102
j, in step S312, with above-mentioned this pixel a that is stored in this second variable 106
K+1 J+1Be displaced in this first variable 104, and in step S314, will be listed as the capable pixel a of j+2 a k+1 that should two-dimensional array
K+1 J+2Be stored in this second variable 106, above-mentioned steps S310, S314, S316 can be with reference to shown in the figure 3e, so far, but these storage locations D of key diagram 3d institute
1, D
2, D
3To D
J-1These stored pixels are how different with Fig. 3 c.Afterwards, step S316 is similar to step S308, and this scaler 108 is used this first algorithm, with this bilinear interpolation method of step S308, according to being temporary in D respectively
J+1, D
J+2, these pixels a in this first variable 104 and this second variable 106
k J+1, a
k J+2, a
K+1 J+1, a
K+1 J+2Calculate one second new pixel b
2(being shown among Fig. 3 b), and export this second new pixel b
2From present embodiment is to be listed as capable this pixel a of j from k
k jBeginning is calculated two new pixel b though only enumerate
1, b
2Method, yet the personnel that are familiar with this skill are when extending to all pixel { a according to the present invention
k j, 1≤k≤M, 1≤j≤N}, and produce the new image that a former relatively image dwindles.
The method flow diagram of this amplification procedure 210 in Fig. 4 a presentation graphs 2.Fig. 4 b represents to have an image synoptic diagram of a plurality of pixels.When carrying out this amplification procedure S210, for example, can calculate by bilinear interpolation method (bilinear), for example, pixel a from figure
k j, a
k J+1, a
K+1 jAnd a
K+1 J+1Get one first new row pixel group B
1(comprise new pixel b again
11, b
12) and one the 3rd new row pixel group B
3(comprise new pixel b again
31, b
32), pixel a from figure again
k J+1, a
k J+2, a
K+1 J+1And a
K+1 J+2Obtain one second new pixel B
2(comprise new pixel b again
21, b
22), and a "four news" (new ideas row pixel group B
4(comprise new pixel b again
41, b
42), by that analogy, gather the new image that all pixels and new pixel can obtain an amplification.When in step S402, will be to a plurality of pixel a of k row that should two-dimensional array
k 1, a
k 2, a
k 3..., a
k j, a
k J+1, a
k J+2... a
k NBe stored in a plurality of storage location D of this column buffer in regular turn
1, D
2, D
3... D
j, D
J+1, D
J+2... D
NIn, shown in Fig. 4 c, and D
NTo D
2NAlso have pixel to store, reason can be by knowing by inference among the following embodiment.Among the step S404, will be listed as the capable pixel a of j to a k+1 that should two-dimensional array
K+1 jBe stored in this first variable 104, shown in Fig. 4 d.And in step S406, will be listed as the capable pixel a of j+1 to a k+1 that should two-dimensional array
K+1 J+1Be stored in this second variable 106.Yet, it should be noted that in the ordinary course of things image processing can be since a pixel of the 1st row the 1st row, but bright more in a broad sense in order to do, present embodiment is to be listed as since the capable j of k.Among the step S408, this scaler 108 is used one second algorithm, for example, and with aforesaid this bilinear interpolation method, according to being temporary in D respectively
j, D
J+1, these pixels a in this first variable 104 and this second variable 106
k j, a
k J+1, a
K+1 jAnd a
K+1 J+1Calculate one first new row pixel group B
1(comprise new pixel b again
11, b
12, be shown among Fig. 4 b), and export this first new pixel B
1Next, in step S410, with above-mentioned this pixel a that is stored in this first variable 104
K+1 jBe displaced to N+j storage location D in this line buffer 102
N+j, in step S412, with above-mentioned this pixel a that is stored in this second variable 106
K+1 J+1Be displaced in this first variable 104, and in step S414, will be listed as the capable pixel a of j+2 a k+1 that should two-dimensional array
K+1 J+2Be stored in this second variable 106, above-mentioned steps S410, S414, S416 can be with reference to figure 4e.Afterwards, step S416 is similar to step S408, and this scaler 108 is used this second algorithm, with this bilinear interpolation method of step S408, according to being temporary in D respectively
J+1, D
J+2, these pixels a in this first variable 104 and this second variable 106
k J+1, a
k J+2, a
K+1 J+1, a
K+1 J+2Calculate one second newline pixel B
2(comprise new pixel b again
21, b
22, be shown among Fig. 4 b), and export this second new row pixel group B
2Must further specify at this, when carrying out the image amplification, the use interpolation method can be by four contiguous pixels (as a among Fig. 4 b
k J+1, a
k J+2, a
K+1 J+1, a
K+1 J+2) and produce four new pixels in the present embodiment (as the b among Fig. 4 b
11, b
12, b
31, b
32), and then gather all pixels and new pixel and reach the purpose that image amplifies.Yet, be familiar with this skill personage and can understand easily, according to the image scan principle of display device, be arranged in same row person (as the b of Fig. 4 b in the new pixel
11, b
12, b
21, b
22) must be to after this display device permutation output, the new pixel in the inferior row is (as the b among Fig. 4 b
31, b
32, b
41, b
42) just exported.So the present invention stores the mode (as step S410) of time row pixel in carrying out this amplification procedure different with the mode (as step S410) of dwindling in the program.Be with, in Fig. 4 a, in carrying out this amplification procedure when step S410 " when with above-mentioned N+j the storage location of this pixel shift to this line buffer that is stored in this first variable ", more comprise when j=N, according to step S418, use this second algorithm according to being temporary in capable, these pixels (a that j+1 is capable, N+j is capable, N+j+1 is capable of this column buffer 102 j respectively
k j, a
k J+1, a
K+1 jAnd a
K+1 J+1) calculate and export at least one the 3rd new row pixel group B
3(comprise new pixel b again
31, b
32, be shown among Fig. 4 b).It should be noted that other a plurality of and the 3rd new row pixel group are in all new pixels ("four news" (new ideas row pixel group B of same column
4In new pixel b
41, b
42Promptly belong to this) can also above-mentioned similar mode calculate in the lump and export, shown in Fig. 4 f.From present embodiment is to be listed as capable this pixel a of j from k
k jBeginning is calculated two new row pixel group B though only enumerate
1, B
2, B
3And B
4Method, yet be familiar with this skill personage when can extending to all pixel { a according to the present invention
k j, 1≤k≤M, 1≤j≤N}, and produce the new image that a former relatively image amplifies.
Though the present invention discloses as above with preferred embodiment; right its is not in order to qualification the present invention, any those skilled in the art, without departing from the spirit and scope of the present invention; when can doing a little modification and perfect, so protection scope of the present invention is when with being as the criterion that claims were defined.
Claims (10)
1. image treatment method can be shared hardware and carry out image and dwindle; This image has a plurality of pixel { a that have a capable two-dimensional array of M row and N corresponding to
k j, 1≤k≤M, 1≤j≤N}, this method comprises:
A column buffer is provided, has 2N storage location at least;
One first variable and one second variable are provided, dwindle in order to cooperate this column buffer to carry out image; And
When carrying out image when dwindling, to carry out one and dwindle program, this dwindles program and comprises:
Will be to a plurality of pixel { a of k row that should two-dimensional array
k j, j=1,2,3, N, be stored in regular turn in the 1st to N the storage location of this column buffer;
To be listed as the capable pixel a of j to a k+1 that should two-dimensional array
K+1 jBe stored in this first variable;
To be listed as the capable pixel a of j+1 to a k+1 that should two-dimensional array
K+1 J+1Be stored in this second variable;
Use bilinear interpolation method this column buffer j be capable, j+1 is capable according to being temporary in respectively, these pixels a in this first variable and this second variable
k j, a
k J+1, a
K+1 jAnd a
K+1 J+1Calculate one first new pixel b
k j, and export this first new pixel;
With above-mentioned j the storage location of this pixel shift to this line buffer that is stored in this first variable;
Be stored in this pixel shift in this second variable to this first variable with above-mentioned;
To be listed as the capable pixel a of j+2 to a k+1 that should two-dimensional array
K+1 J+2Be stored in this second variable; And
Use bilinear interpolation method this column buffer j+1 be capable, j+2 is capable according to being temporary in respectively, these pixels a in this first variable and this second variable
k J+1, a
k J+2, a
K+1 J+1, a
K+1 J+2Calculate one second new pixel, and export this second new pixel.
2. image treatment method as claimed in claim 1 is characterized in that, also can share hardware and carry out the image amplification, when carrying out the image amplification, carries out an amplification procedure, and this amplification procedure comprises:
Will be to a plurality of pixel { a of k row that should two-dimensional array
k j, j=1,2,3, N} is stored in the 1st to N the storage location of this column buffer in regular turn;
To be listed as the capable pixel a of j to a k+1 that should two-dimensional array
K+1 jBe stored in this first variable;
To be listed as the capable pixel a of j+1 to a k+1 that should two-dimensional array
K+1 J+1Be stored in this second variable;
Use bilinear interpolation method this column buffer j be capable, j+1 is capable according to being temporary in respectively, these pixels a in this first variable and this second variable
k j, a
k J+1, a
K+1 jAnd a
K+1 J+1Calculate one first new row pixel group, and export this first new row pixel group;
With above-mentioned N+j the storage location of this pixel shift to this line buffer that is stored in this first variable;
Be stored in this pixel shift in this second variable to this first variable with above-mentioned;
To be listed as the capable pixel a of j+2 to a k+1 that should two-dimensional array
K+1 J+2Be stored in this second variable; And
Use bilinear interpolation method this column buffer j+1 be capable, j+2 is capable according to being temporary in respectively, these pixels a in this first variable and this second variable
k J+1, a
k J+2, a
K+1 J+1, a
K+1 J+2Calculate one second new row pixel group, and export this second new row pixel group.
3. image treatment method as claimed in claim 2, it is characterized in that, in carrying out this amplification procedure when with the above-mentioned step that is stored in N+j the storage location of this pixel shift to this line buffer in this first variable, more comprise when j=N, then use bilinear interpolation method according to being temporary in capable, these pixels a that j+1 is capable, N+j is capable, N+j+1 is capable of this column buffer j respectively
k j, a
k J+1, a
K+1 jAnd a
K+1 J+1Calculate at least one the 3rd new row pixel group, and export the 3rd new row pixel group at least.
4. image treatment method as claimed in claim 1 is characterized in that, the form of these pixels is the YUV pixel format.
5. image treatment method as claimed in claim 1 is characterized in that, the form of these pixels is the rgb pixel form.
6. image processor can be shared hardware and carry out image and dwindle; This image has a plurality of pixel { a that have a capable two-dimensional array of M row and N corresponding to
k j, 1≤k≤M, 1≤j≤N}, this device comprises:
A column buffer has 2N storage location at least;
One first variable and one second variable; And
One scaler is dwindled in order to cooperate this column buffer and this first, second variable to carry out image;
Wherein, this scaler execution one is dwindled program and is dwindled to carry out image, and this dwindles program and comprises:
Will be to a plurality of pixel { a of k row that should two-dimensional array
k j, j=1,2,3, N} is stored in the 1st to N the storage location of this column buffer in regular turn;
To be listed as the capable pixel a of j to a k+1 that should two-dimensional array
K+1 jBe stored in this first variable;
To be listed as the capable pixel a of j+1 to a k+1 that should two-dimensional array
K+1 J+1Be stored in this second variable;
Use bilinear interpolation method this column buffer j be capable, j+1 is capable according to being temporary in respectively, these pixels a in this first variable and this second variable
k j, a
k J+1, a
K+1 jAnd a
K+1 J+1Calculate one first new pixel b
k j, and export this first new pixel;
With above-mentioned j the storage location of this pixel shift to this line buffer that is stored in this first variable;
Be stored in this pixel shift in this second variable to this first variable with above-mentioned;
To be listed as the capable pixel a of j+2 to a k+1 that should two-dimensional array
K+1 J+2Be stored in this second variable; And
Use bilinear interpolation method this column buffer j+1 be capable, j+2 is capable according to being temporary in respectively, these pixels a in this first variable and this second variable
k J+1, a
k J+2, a
K+1 J+1, a
K+1 J+2Calculate one second new pixel, and export this second new pixel.
7. image processor as claimed in claim 6 is characterized in that, also can share hardware and carry out the image amplification, and this scaler is carried out an amplification procedure to carry out the image amplification, and this amplification procedure comprises:
Will be to a plurality of pixel { a of k row that should two-dimensional array
k j, j=1,2,3, N} is stored in the 1st to N the storage location of this column buffer in regular turn;
To be listed as the capable pixel a of j to a k+1 that should two-dimensional array
K+1 jBe stored in this first variable;
To be listed as the capable pixel a of j+1 to a k+1 that should two-dimensional array
K+1 J+1Be stored in this second variable;
Use bilinear interpolation method this column buffer j be capable, j+1 is capable according to being temporary in respectively, these pixels a in this first variable and this second variable
k j, a
k J+1, a
K+1 jAnd a
K+1 J+1Calculate one first new row pixel group, and export this first new row pixel group;
With above-mentioned N+j the storage location of this pixel shift to this line buffer that is stored in this first variable;
Be stored in this pixel shift in this second variable to this first variable with above-mentioned;
To be listed as the capable pixel a of j+2 to a k+1 that should two-dimensional array
K+1 J+2Be stored in this second variable; And
Use bilinear interpolation method this column buffer j+1 be capable, j+2 is capable according to being temporary in respectively, these pixels a in this first variable and this second variable
k J+1, a
k J+2, a
K+1 J+1, a
K+1 J+2Calculate one second new pixel group, and export this second new pixel group.
8. image processor as claimed in claim 7, it is characterized in that, when this scaler carry out in this amplification procedure when with the above-mentioned step that is stored in N+j the storage location of this pixel shift to this line buffer in this first variable, more comprise when j=N, then use bilinear interpolation method according to being temporary in capable, these pixels a that j+1 is capable, N+j is capable, N+j+1 is capable of this column buffer j respectively
k j, a
k J+1, a
K+1 jAnd a
K+1 J+1Calculate one the 3rd new row pixel group, and export the 3rd new row pixel group.
9. image processor as claimed in claim 6 is characterized in that, the form of these pixels is the YUV pixel format.
10. image processor as claimed in claim 6 is characterized in that, the form of these pixels is the rgb pixel form.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100384218A CN101599260B (en) | 2008-06-02 | 2008-06-02 | Method and device for enlarging or shrinking image through sharable hardware |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008100384218A CN101599260B (en) | 2008-06-02 | 2008-06-02 | Method and device for enlarging or shrinking image through sharable hardware |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101599260A CN101599260A (en) | 2009-12-09 |
| CN101599260B true CN101599260B (en) | 2011-12-21 |
Family
ID=41420677
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008100384218A Active CN101599260B (en) | 2008-06-02 | 2008-06-02 | Method and device for enlarging or shrinking image through sharable hardware |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101599260B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20110048794A (en) * | 2009-11-03 | 2011-05-12 | 삼성전자주식회사 | Image processor and electric device including the same |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001157040A (en) * | 1999-11-29 | 2001-06-08 | Matsushita Electric Ind Co Ltd | Resolution converting method and encoding/decoding device using the same |
| CN1574977A (en) * | 2003-05-28 | 2005-02-02 | 精工爱普生株式会社 | Method and device for changing image size |
| CN101105932A (en) * | 2006-07-10 | 2008-01-16 | 宏正自动科技股份有限公司 | Apparatus for rescaling an image and its method |
-
2008
- 2008-06-02 CN CN2008100384218A patent/CN101599260B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001157040A (en) * | 1999-11-29 | 2001-06-08 | Matsushita Electric Ind Co Ltd | Resolution converting method and encoding/decoding device using the same |
| CN1574977A (en) * | 2003-05-28 | 2005-02-02 | 精工爱普生株式会社 | Method and device for changing image size |
| CN101105932A (en) * | 2006-07-10 | 2008-01-16 | 宏正自动科技股份有限公司 | Apparatus for rescaling an image and its method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101599260A (en) | 2009-12-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103366342B (en) | Be applied to the subsection linearity inser value method that video image amplifies | |
| US10129385B2 (en) | Method and apparatus for generating and playing animated message | |
| CN101261740B (en) | Processing method of an image storage | |
| CN102881000B (en) | A kind of super-resolution method, device and equipment of video image | |
| CN106204441B (en) | Image local amplification method and device | |
| CN101448120A (en) | Dynamic generation system of diagram video | |
| CN101179669B (en) | Session television terminal subtitling generating and stacking method | |
| CN101227554B (en) | Method and system for implementing self-adapting display of set-top box on television | |
| US20230362328A1 (en) | Video frame insertion method and apparatus, and electronic device | |
| CN101795350A (en) | Non-linear image double amplifying method based on relevance detection | |
| CN101789234A (en) | Digital image scaling method and integrated system | |
| CN102542298A (en) | Electronic device and image similarity degree comparison method thereof | |
| CN103780863B (en) | A kind of high-definition picture generation method and device | |
| CN101599260B (en) | Method and device for enlarging or shrinking image through sharable hardware | |
| TW201011684A (en) | Image processing methods | |
| Kumar et al. | A distortion-sensitive seam carving algorithm for content-aware image resizing | |
| US20090285507A1 (en) | Method and device for scaling-up or scaling-down images with the same hardware | |
| CN106063252A (en) | Techniques for processing subtitles | |
| WO2017101702A1 (en) | Method and device for processing, displaying and reading barcode | |
| CN109933262B (en) | GIF screen capturing method and device | |
| CN102376094B (en) | For the fast image marking method that video detects | |
| CN102779329B (en) | Image processing apparatus and image processing method | |
| US8754908B2 (en) | Optimized on-screen video composition for mobile device | |
| JPS598074A (en) | Picture processing system | |
| CN104915923A (en) | Adaptive scaling method of images with different resolutions |
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 |