CN106296614A - Image processing apparatus and image processing method - Google Patents
Image processing apparatus and image processing method Download PDFInfo
- Publication number
- CN106296614A CN106296614A CN201610678354.0A CN201610678354A CN106296614A CN 106296614 A CN106296614 A CN 106296614A CN 201610678354 A CN201610678354 A CN 201610678354A CN 106296614 A CN106296614 A CN 106296614A
- Authority
- CN
- China
- Prior art keywords
- value
- pixel
- pixel value
- image
- processing unit
- 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
Links
- 238000003672 processing method Methods 0.000 title claims abstract description 32
- 239000000654 additive Substances 0.000 claims abstract description 7
- 230000000996 additive effect Effects 0.000 claims abstract description 7
- 239000000872 buffer Substances 0.000 claims description 27
- 238000000034 method Methods 0.000 claims description 18
- 238000006243 chemical reaction Methods 0.000 description 13
- 230000008569 process Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000003384 imaging method Methods 0.000 description 2
- PLXMOAALOJOTIY-FPTXNFDTSA-N Aesculin Natural products OC[C@@H]1[C@@H](O)[C@H](O)[C@@H](O)[C@H](O)[C@H]1Oc2cc3C=CC(=O)Oc3cc2O PLXMOAALOJOTIY-FPTXNFDTSA-N 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 239000003086 colorant Substances 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T5/00—Image enhancement or restoration
- G06T5/73—Deblurring; Sharpening
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Image Processing (AREA)
Abstract
A kind of image processing method, performed by the processing unit receiving image, image includes M row pixel column, every string pixel column includes N number of pixel value, and image processing method comprises the steps of the X pixel value of the m row pixel column of (A) processing unit storage image to (Y 1) individual pixel value；(B) processing unit receives the Y pixel value of m row pixel column of image, and carries out interpolation extension according to the X pixel value to the Y pixel value and produce extension pixel column；(C) processing unit carries out convolution algorithm generation convolution value according to extension pixel column and template；(D) processing unit carries out additive operation according to b stored pixel value and convolution value and produces the b pixel value of m row pixel column of new image, thereby reaches minimizing ring can the image procossing of real-time operation.
Description
Technical field
The invention relates to a kind of device and method, particularly relate to reach the most sharpened and can eliminate again ring
Image processing apparatus and image processing method.
Background technology
Prior art image treatment technology has the disadvantages that
1. have serious ringing, prior art image treatment technology realize image sharpened while be usually associated with tight
The ring effect of weight, therefore, generally requires at least 9 pixel values of single treatment (3 × 3) to obtain average convolution value and excellent
Change the ringing of new image.2. need bigger hardware storage area: prior art image treatment technology for ring to be eliminated,
Single treatment need to process at least 9 pixel values, therefore needs to store at least nine pixel values in advance, further according to nine stored pictures
Element value in addition calculation process and obtain one of them of the multiple new pixel value of new image, therefore, prior art image processes skill
The hardware storage space of art must can store nine pixel values, causes hardware storage area excessive.
Summary of the invention
Therefore, the first object of the present invention, i.e. providing one can improve ringing, at the image that can process in real time again
Reason method.
Then, image processing method of the present invention is performed by processing unit, and processing unit receives image, and image includes M row picture
Element row, every string pixel column includes that N number of pixel value, wherein, 1 M, 3 N, and M, N are positive integer, and image processing method comprises
Following step (A), step (B), step (C) and step (D).
Step (A): processing unit stores the X pixel value of m row pixel column of image to (Y-1) individual pixel value,
Wherein, 1 X, X ＜ a Y N, 1 m, and a, Y, X, m be positive integer.
Step (B): the Y pixel value of the m row pixel column of processing unit real-time reception image, and according to the X picture
Element value carries out interpolation extension to the Y pixel value and produces extension pixel column.
Step (C): processing unit carries out convolution algorithm according to extension pixel column and template and produces convolution value.
Step (D): processing unit carries out additive operation according to b stored pixel value and convolution value and produces new image
The b pixel value of m row pixel column, wherein, X b Y, and b is positive integer.
Two purposes of the present invention, are i.e. providing one can improve ringing, and the image procossing that can process in real time again fills
Put.
Then, image processing apparatus of the present invention comprises processing unit.
Processing unit receives image, and image includes that M row pixel column, every string pixel column include N number of pixel value, wherein, 1
M, 3 N, and M, N be positive integer.Processing unit includes buffer, arithmetical unit and adder.
Buffer in order to the X pixel value of received in sequence the m row pixel column storing image to (Y-1) individual pixel
Value, wherein, 1 X, X ＜ a Y N, 1 m M, and a, Y, X, m be positive integer.
Electrically connect buffer arithmetical unit to receive the X pixel value of the m row pixel column stored by buffer to (Y-
1) individual pixel value, and receive the Y pixel value of the m row pixel column of image, and according to the X pixel value to the Y pixel
Value carries out interpolation extension and produces extension pixel column, carries out convolution algorithm further according to extension pixel column and template and produces convolution
Value.
Adder electrical connection arithmetical unit and buffer are carried out to receive the b pixel value stored by convolution value and buffer
Additive operation produces the b pixel value of the m row pixel column of new image, wherein, X b Y, and b is positive integer.
Effect of the present invention is: by interpolation extension, Y the pixel value received is extended to multiple pixel value, mat
Border drop between this makes adjacent two pixel value each other will not be excessive, and then makes the ringing of new image reduce, and
Energy the Y pixel value of real-time reception is with real-time operation.
Accompanying drawing explanation
Fig. 1 is the block chart of an embodiment of image processing method of the present invention；
Fig. 2 is the video conversion schematic diagram of the embodiment of image processing method of the present invention；
The flow chart of the embodiment of Fig. 3 image processing method of the present invention；
Fig. 4 is the block chart of the first stage of the embodiment of image processing method of the present invention；
Fig. 5 is the block chart of the second stage of the embodiment of image processing method of the present invention；
Fig. 6 is the block chart of the phase III of the embodiment of image processing method of the present invention；
Fig. 7 is interpolation extension and the convolution algorithm schematic diagram of the embodiment of image processing method of the present invention；
Fig. 8 is schematic diagram, and the new image of the embodiment of image processing method of the present invention is described；
Fig. 9 is that the embodiment of image processing method of the present invention extends the convolution algorithm schematic diagram obtained according to interpolation.
Symbol description
1 image processing apparatus
2 gamut conversion unit
21 raw videos
22 images
3 processing units
31 buffers
32 arithmetical units
33 adders
4 new images
A0 step
A ~ H step
Δ convolution value.
Detailed description of the invention
Refering to Fig. 1, image processing method of the present invention is that processing unit 3 electrical connection stores image 22 by performed by processing unit 3
Gamut conversion unit 2, and processing unit 3 and gamut conversion unit 2 collectively constitute image processing apparatus 1.
Simultaneously refering to Fig. 2, gamut conversion unit 2 receives raw video 21, and is converted in the RGB color territory of raw video 21
HSL colour gamut, so-called RGB color territory is based on red (Red), green (Green) and the color picture of blue (Blue) three primary colors
Element, and HSL colour gamut to be form and aspect (Hue), saturation (Saturation) and brightness (Lightness/Luminance) be main color
Polychrome element.
It is to say, the rgb value of multiple pixels of raw video 21 is converted into multiple HSL by gamut conversion unit 2 respectively
Value, and multiple L-value of the HSL value such as storage and form image 22, image 22 includes M row pixel column, and every string pixel column includes N number of
Pixel value, wherein, waiting L-value (M × N number of pixel value) to be the brightness of M × N number of pixel, 1 M, 3 N, and M, N is positive integer,
It addition, should be noted the raw video 21 of Fig. 2 and image 22 etc. the numerical value of pixel value indicated the most for convenience of description, not
The actual numerical value waiting pixel value.
Processing unit 3 electrically connects gamut conversion unit 2, and includes buffer 31, arithmetical unit 32, and adder 33, in order to
Received in sequence also stores the X pixel value of image 22 to the Y-1 pixel value, further according to the X stored pixel value extremely
The Y-1 pixel value, and the Y pixel value that self imaging 22 receives carry out image procossing and produce new image 4, wherein, slow
Rushing device 31 is first-in first-out buffer (FIFO buffer, First In First Out Buffer), and 1 X, X ＜ a
Y N, and a, Y, X be positive integer.
Refering to Fig. 3 and Fig. 4, the present embodiment definition buffer 31 has the storage area storing two pixels for convenience of description,
Therefore definition a is equal to 3, but is not limited to this, can set according to actual demand.
Processing unit 3 performs image processing method and comprises the steps of
<first stage>
Step (A0) utilizes processing unit 3 received in sequence from the X of the m row pixel column of the image 22 of gamut conversion unit 2
Individual pixel value is to (Y-1) individual pixel value, wherein, and 1 m, and m is positive integer.
Step (A) processing unit 3 stores the X pixel of the m row pixel column of the image 22 from gamut conversion unit 2
Value is to (Y-1) individual pixel value.
Specifically, the image 22 of the present embodiment is with six row pixel columns (M=6), and every string pixel column is with six pixel values
As a example by (N=6), the buffer 31 received in sequence image 22 of processing unit 3 first row picture element row (m=1) first pixel value
(L1) to second pixel value (L2), and according to the concept first stored first received by first pixel value (L1) and second
Pixel value (L2) is stored in buffer 31.
Step (B) is when processing unit 3 real-time reception is from the Y of the m row pixel column of the image 22 of gamut conversion unit 2
Individual pixel value, then carry out interpolation extension according to the X pixel value to the Y pixel value and produce extension pixel column.
Wherein, extension pixel column is that the X the pixel value received by the arithmetical unit 32 of processing unit 3 is to the Y pixel
Value extension individual with (Y-X) pixel value collectively constitutes, and often extension pixel value is the meansigma methods of adjacent two pixel values, meansigma methods
Operation method is, wherein, I and J is respectively the pixel value of adjacent two pixels.
In more detail, first pixel value (L1) stored by buffer 31 and is received the arithmetical unit 32 of the present embodiment
Two pixel values (L2), also receive the 3rd pixel value (L3), now, arithmetical unit from the image 22 of gamut conversion unit 2 simultaneously
32 bases with first pixel value (L1) to the 3rd pixel value (L3) carry out interpolation extension and produce extension pixel column (as
Shown in Fig. 7).
Step (C) utilizes processing unit 3 to carry out convolution algorithm according to extension pixel column and template and produces convolution value Δ.
Need to it should be noted that arithmetical unit 32 of processing unit 3 is that the convolution algorithm formula using (formula 1) obtains convolution
Value Δ.
Convolution value Δ
(formula 1)
Wherein, parameter I, J, K and L extend the X pixel value of pixel column, the b pixel value respectively to the Y pixel value, andWithFor expanding pixel value, parameter G is the coefficient weights of the template of corresponding b pixel value, the image of the present invention
The coefficient number of the template of processing method is equal to the number of extension pixel column, and the coefficient power of the template of corresponding b pixel value
Heavily can be higher, it is equal to it addition, it is noted that the coefficient weights that designing points is all coefficients of the coefficient weights of template is added
Zero, therefore, the coefficient weights of G be-[(-1)+(-1)+...+(-1)+(-1)+(-1)] }.
With the present embodiment become apparent from explanation, the first stage of the present embodiment be with second pixel value (b=2) be main
Conversion pixel, therefore the value of the coefficient weights of the template of corresponding second pixel value (L2) should be relatively big, and with for this example, G is with 4
As a example by (G={-[(-1)+(-1)+(-1)+(-1)] }=4), as it is shown in fig. 7, therefore, the convolution value Δ of the present embodiment present stage is such as
Shown in (formula 2).
Convolution value Δ
(formula 2)
Step (D) utilizes processing unit 3 to carry out additive operation according to b pixel value and convolution value Δ and produces a new image 4
The b pixel value of m row pixel column, wherein, X b Y, and b is positive integer.
Second pixel value (L2) and convolution value Δ are carried out additive operation and obtain new shadow by the adder 33 of processing unit 3
Second pixel value (M2) as the first row pixel column (m=1) of 4.
Step (E) processing unit 3 judges that the existing numerical value of Y whether equal to N, the most then completes the image procossing of m row,
If it is not, then enter step (F).
The existing numerical value of X is added 1 as next numerical value by step (F) processing unit 3, under conduct that the existing numerical value of Y adds 1
One numerical value, returns to step (A).
Processing unit 3 judges that six the most non-computings of pixel value of first row pixel column complete, and processing unit 3 then starts second
Stage and enter step (F).
<second stage>
Refering to Fig. 5, the existing numerical value of the X of first stage and the existing numerical value of Y are each added 1 respectively as second by processing unit 3
The X value in stage and Y value (X=2, Y=4) and return to step (A) and perform to store the first row of the image 22 from gamut conversion unit 2
Second pixel value (L2) of pixel column (m=1) is to the 4th pixel value (L4), and continues step (B) to step (F), this action
Illustrate to be similar to the first stage, therefore repeat no more, until processing unit 3 judges that the existing numerical value of Y equal to N (N=6), then enters step
Suddenly (G).
Step (G) processing unit 3 judges that the existing numerical value of m whether equal to M, the most then completes image procossing, if it is not, then
Enter step (H).
The existing numerical value of m is added 1 as next numerical value by step (H) processing unit 3, and the next numerical value of X is equal to 1, Y's
Next numerical value, equal to a, returns to step (A0)
<phase III>
Refering to Fig. 6, the existing numerical value of the m of second stage is added 1 as the numerical value (m=2) of phase III by processing unit 3, and in
The numerical value of X during three stages is equal to 1 (X=1), and the numerical value of Y is equal to a (Y=a=3), returns to step (A0) received in sequence image 22
First pixel value (L7) of secondary series pixel column is to the 3rd pixel value (L9), and continues step (A) to step (G), and this moves
Explain and be similar to first stage and second stage, therefore repeat no more, until processing unit 3 judges that the existing numerical value of m is equal to M (M
, and the existing numerical value of Y is equal to N (N=6), then complete image procossing, as shown in Figure 8=6).
It addition, specifically, the main pixel of changing of image processing method of the present invention is into every string pixel column (m=
1 ~ M) second pixel value to the N-1 pixel value (b=2 ~ (N-1)), for the present embodiment, the main of the present embodiment turns
Changing pixel is first row pixel column to second pixel value of the 6th row pixel column to the 5th pixel value, and first row pixel column
To the 6th row pixel column first pixel value (L1, L7, L13, L19, L25 and L31) and the 6th pixel value (L6, L12,
L18, L24, L30 and L36) then maintaining the original state does not processes.
Furthermore, the convolution value Δ that image processing method of the present invention also can obtain by (formula 2) institute computing of the present embodiment
Simplified again and obtained the convolution value Δ as shown in (formula 3).
Convolution value
(formula 3)
Refering to Fig. 9, another template also be can be used directly the arithmetical unit 32 of the present invention with first pixel value (L1) to the 3rd picture
Element value (L3) carries out convolution algorithm, and another template only has three coefficient number, and the three of three coefficients coefficient weights are respectively
Design via the computing of (formula 3) and be set as (-1.5), 3 and (-1.5), therefore, arithmetical unit 32 can be directly by first pixel
Value (L1) carries out convolution algorithm to the 3rd pixel value (L3) and another template and obtains the step (B) with the above-mentioned first stage and step
Suddenly the convolution value that (C) is identical, say, that image processing method of the present invention can be weighed with coefficient by the coefficient number changing template
Weight, and make step (B) and step (C) be combined into a step and the processing procedure of simplified operation device 32.
In sum, above-described embodiment understand the image processing apparatus 1 of the present invention and possess advantages below:
1. reduce ringing: receive three pixel values are extended to five pixels by interpolation extension by arithmetical unit 32
Value, the border drop between thereby making adjacent two pixel value each other will not be excessive, and then makes the ringing of new image 4 drop
Low.
2. reduce hardware storage area: the image processing techniques of prior art at least stores nine pixel values, and according to institute
Nine pixel values stored in addition calculation process and obtain one of them of the multiple new pixel value of new image；And figure of the present invention
As processing means 1, as a example by above-described embodiment, it is only necessary to store two pixel values in advance (the X pixel value is extremely by buffer 31
The Y-1 pixel value), then receive according to two pixel values and real-time self imaging 22 that are stored in buffer 31 by arithmetical unit 32
The one other pixel value (the Y pixel value) arrived, carries out real-time operation and produces therein the one of multiple pixel values of new image 4
Individual, it is clear that due to the present invention can real-time reception one other pixel value (the Y pixel value), so the hardware storage of buffer 31
Area is down to store two pixel values from storing nine pixel values, and therefore, image processing apparatus 1 of the present invention can reduce really firmly
Part stores area.
Obviously, image processing apparatus 1 of the present invention and image processing method thereof can reach the purpose of the present invention really.
Only as described above, only embodiments of the invention, when can not with this limit the present invention implement scope, all
It is the simple equivalence change and modification made according to scope of the present invention patent and patent specification content, the most still belongs to the present invention
In the range of patent contains.
Claims (10)
1. an image processing method, is performed by processing unit, and this processing unit receives image, and this image includes M row pixel column,
Every string pixel column includes that N number of pixel value, wherein, 1 M, 3 N, and M, N are positive integer, and this image processing method comprises:
This processing unit stores the X pixel value of the m row pixel column of this image to (Y-1) individual pixel value, wherein, and 1
X, X ＜ a Y N, 1 m M, and a, Y, X, m be positive integer；
The Y pixel value of this m row pixel column of this processing unit this image of real-time reception, and according to this X pixel value
Carry out interpolation extension to this Y pixel value and produce extension pixel column；
This processing unit carries out convolution algorithm according to this extension pixel column and template and produces convolution value；
This processing unit carries out additive operation according to the b stored pixel value and this convolution value and produces the m row of new image
The b pixel value of pixel column, wherein, X b Y, and b is positive integer.
2. image processing method as claimed in claim 1, wherein, also comprises before this step (A):
(A0) the X pixel value of the m row pixel column of this processing unit this image of received in sequence is to (Y-1) individual pixel value.
3. image processing method as claimed in claim 2, wherein, rear also the comprising of this step (D):
This processing unit judges that the existing numerical value of Y whether equal to N, the most then completes the image procossing of m row, if it is not, then enter
Step (F),
The existing numerical value of X is added 1 as next numerical value by this processing unit, and the existing numerical value of Y adds 1 as next numerical value, returns
To step (A).
4. image processing method as claimed in claim 3, wherein, when step (E) judges the existing numerical value of Y equal to N, step
(E) rear also comprises:
This processing unit judges that the existing numerical value of m whether equal to M, the most then completes image procossing, if it is not, then enter step
(H),
The existing numerical value of m is added 1 as next numerical value by this processing unit, and the next numerical value of X is equal to 1, the next numerical value of Y
Equal to a, return to step (A0).
5. image processing method as claimed in claim 1, wherein, this extension pixel column is by being somebody's turn to do that this processing unit is received
The X pixel value collectively constitutes to this Y pixel value extension individual with (Y-X) pixel value, and wherein, often extension pixel value is adjacent
The meansigma methods of two pixel values.
6. image processing method as claimed in claim 5, wherein, this processing unit system uses meansigma methods operation method to obtain this and puts down
Average,
This meansigma methods=
Wherein, I and J is respectively the pixel value of adjacent two pixels.
7. image processing method as claimed in claim 6, wherein, the coefficient number of this template is equal to this extension pixel column
The number of such pixel value, and to should the coefficient weights of this template of b pixel value can be higher.
8. image processing method as claimed in claim 7, wherein, this processing unit system uses following convolution algorithm formula to obtain
This convolution value, this convolution value=this extension pixel columnThis template
=
Wherein, this X pixel value of parameter I, J, K and L this extension pixel column respectively, this b pixel value are to this Y picture
Element value, and be to expand pixel value, parameter G is to should the coefficient weights of this template of b pixel value.
9. an image processing apparatus, comprises:
Processing unit, receives image, and this image includes that M row pixel column, every string pixel column include N number of pixel value, wherein, 1
M, 3 N, and M, N be positive integer, this processing unit includes:
Buffer, in order to the X pixel value of received in sequence the m row pixel column storing this image to (Y-1) individual pixel
Value, wherein, 1 X, X ＜ a Y N, 1 m M, and a, Y, X, m be positive integer；
Arithmetical unit, electrically connect this buffer to receive the X pixel value of this m row pixel column stored by this buffer to
(Y-1) individual pixel value, and receive the Y pixel value of the m row pixel column of this image, and according to this X pixel value to being somebody's turn to do
The Y pixel value carries out interpolation extension and produces extension pixel column, carries out convolution fortune further according to this extension pixel column and template
Calculate and produce convolution value；And
Adder, electrically connects this arithmetical unit and this buffer to receive the b pixel stored by this convolution value and this buffer
Value carries out the b pixel value that additive operation produces the m row pixel column of new image, wherein, X b Y, and b is positive integer.
10. image processing apparatus as claimed in claim 9, wherein, this buffer is first-in first-out buffer (FIFO
buffer, First In First Out Buffer)。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610678354.0A CN106296614B (en) | 2016-08-17 | 2016-08-17 | Image processing apparatus and image processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610678354.0A CN106296614B (en) | 2016-08-17 | 2016-08-17 | Image processing apparatus and image processing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106296614A true CN106296614A (en) | 2017-01-04 |
| CN106296614B CN106296614B (en) | 2019-12-13 |
Family
ID=57678984
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610678354.0A Active CN106296614B (en) | 2016-08-17 | 2016-08-17 | Image processing apparatus and image processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106296614B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110047031A (en) * | 2019-03-26 | 2019-07-23 | 深兰科技（上海）有限公司 | A kind of method and apparatus of pixel fragment splicing |
| CN111028183A (en) * | 2019-12-27 | 2020-04-17 | 合肥众群光电科技有限公司 | Method for realizing graph trimming or expansion in LDI exposure |
| CN113905171A (en) * | 2020-07-06 | 2022-01-07 | 瑞昱半导体股份有限公司 | Multi-channel image processing device and method |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2991180B2 (en) * | 1998-01-28 | 1999-12-20 | 日本電気株式会社 | Pixel interpolation method, pixel interpolation circuit, and recording medium recording pixel interpolation program |
| CN101242506A (en) * | 2007-02-07 | 2008-08-13 | 扬智科技股份有限公司 | Non feedback value interposer for filtering dynamic compensation |
| CN101499163A (en) * | 2008-01-28 | 2009-08-05 | 奇景光电股份有限公司 | Image scaling method |
| CN101551899A (en) * | 2008-04-02 | 2009-10-07 | 联咏科技股份有限公司 | Image edge detection method and image interpolation method using same |
| CN101919238A (en) * | 2007-10-26 | 2010-12-15 | 豪威科技有限公司 | High dynamic range image sensor with reduced line memory for color interpolation |
| CN102750681A (en) * | 2012-07-04 | 2012-10-24 | 青岛海信信芯科技有限公司 | Processing device and method for sharpening edge of image |
| CN105335987A (en) * | 2014-06-09 | 2016-02-17 | 联想(北京)有限公司 | Image data processing method and apparatus |
-
2016
- 2016-08-17 CN CN201610678354.0A patent/CN106296614B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2991180B2 (en) * | 1998-01-28 | 1999-12-20 | 日本電気株式会社 | Pixel interpolation method, pixel interpolation circuit, and recording medium recording pixel interpolation program |
| CN101242506A (en) * | 2007-02-07 | 2008-08-13 | 扬智科技股份有限公司 | Non feedback value interposer for filtering dynamic compensation |
| CN101919238A (en) * | 2007-10-26 | 2010-12-15 | 豪威科技有限公司 | High dynamic range image sensor with reduced line memory for color interpolation |
| CN101499163A (en) * | 2008-01-28 | 2009-08-05 | 奇景光电股份有限公司 | Image scaling method |
| CN101551899A (en) * | 2008-04-02 | 2009-10-07 | 联咏科技股份有限公司 | Image edge detection method and image interpolation method using same |
| CN102750681A (en) * | 2012-07-04 | 2012-10-24 | 青岛海信信芯科技有限公司 | Processing device and method for sharpening edge of image |
| CN105335987A (en) * | 2014-06-09 | 2016-02-17 | 联想(北京)有限公司 | Image data processing method and apparatus |
Non-Patent Citations (2)
| Title |
|---|
| RYOHEI FUNATSU 等: "133Mpixel 60fps CMOS Image Sensor with 32-Column Shared High-Speed Column-Parallel SAR ADCs", 《2015 IEEE》 * |
| 忻晟: "H.264/AVC解码运动补偿的VLSI优化实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110047031A (en) * | 2019-03-26 | 2019-07-23 | 深兰科技（上海）有限公司 | A kind of method and apparatus of pixel fragment splicing |
| CN111028183A (en) * | 2019-12-27 | 2020-04-17 | 合肥众群光电科技有限公司 | Method for realizing graph trimming or expansion in LDI exposure |
| CN111028183B (en) * | 2019-12-27 | 2023-03-24 | 合肥众群光电科技有限公司 | Method for realizing graph trimming or expansion in LDI exposure |
| CN113905171A (en) * | 2020-07-06 | 2022-01-07 | 瑞昱半导体股份有限公司 | Multi-channel image processing device and method |
| CN113905171B (en) * | 2020-07-06 | 2024-04-26 | 瑞昱半导体股份有限公司 | Multi-path image processing device and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106296614B (en) | 2019-12-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106782428B (en) | A kind of the colour gamut method of adjustment and colour gamut adjustment system of display device | |
| CN104811677B (en) | The display control method of mobile terminal and device | |
| CN102118624A (en) | Method for converting an image from an RGB color space to a YUV color space | |
| CN102893609B (en) | Image processing apparatus and control method for image processing apparatus | |
| US10223778B2 (en) | Image contrast enhancement method and apparatus thereof | |
| CN106296614A (en) | Image processing apparatus and image processing method | |
| WO2023005115A1 (en) | Image processing method, image processing apparatus, electronic device, and readable storage medium | |
| WO2024027287A9 (en) | Image processing system and method, and computer-readable medium and electronic device | |
| CN105744275A (en) | Video data input method, video data output method, video data input device and video data output device | |
| CN111491149A (en) | Real-time image matting method, device, equipment and storage medium based on high-definition video | |
| CN101866574B (en) | Digital video experiment device and experiment method | |
| JPH05241550A (en) | Color picture converting method | |
| JP2006211610A (en) | Imaging system | |
| CN117974512A (en) | Image processing method and device | |
| CN113450270A (en) | Correction parameter generation method, electronic device, and storage medium | |
| CN106846234B (en) | Image video enhancement method, system and equipment based on FPGA | |
| CN108259876B (en) | Automatic white balance adjusting method and device | |
| CN113034412A (en) | Video processing method and device | |
| JP2846809B2 (en) | Raster format conversion circuit for high-definition television | |
| CN113409196B (en) | High-speed global chromatic aberration correction method for real-time video splicing | |
| CN100535984C (en) | Color image enhancing device and method | |
| CN105991937A (en) | Virtual exposure method and device based on Bayer format image | |
| CN116092423A (en) | Color correction method and device for display panel | |
| Sudhakaran et al. | High-quality image scaling using v-model | |
| CN101207828A (en) | Image processing apparatus and image processing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 100176 56, Jingyuan North Street, Daxing District economic and Technological Development Zone, Beijing, 56 Applicant after: BEIJING CHIPONE NORTH TECHNOLOGY CO., LTD. Address before: 100088 13 floor, 4 building, 31 North Third Ring Road, Haidian District, Beijing Applicant before: BEIJING CHIPONE NORTH TECHNOLOGY CO., LTD. |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |