CN106296614B - Image processing apparatus and image processing method - Google Patents
Image processing apparatus and image processing method Download PDFInfo
- Publication number
- CN106296614B CN106296614B CN201610678354.0A CN201610678354A CN106296614B CN 106296614 B CN106296614 B CN 106296614B CN 201610678354 A CN201610678354 A CN 201610678354A CN 106296614 B CN106296614 B CN 106296614B
- Authority
- CN
- China
- Prior art keywords
- pixel
- value
- image
- processing unit
- equal
- 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
- 238000003672 processing method Methods 0.000 title claims abstract description 34
- 238000000034 method Methods 0.000 claims description 10
- 238000010586 diagram Methods 0.000 description 8
- 238000006243 chemical reaction Methods 0.000 description 5
- 235000019557 luminance Nutrition 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 101100377097 Neurospora crassa (strain ATCC 24698 / 74-OR23-1A / CBS 708.71 / DSM 1257 / FGSC 987) yth-1 gene Proteins 0.000 description 1
- 239000003086 colorant Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000009466 transformation Effects 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
An image processing method executed by a processing unit receiving an image, the image including M rows of pixel rows, each row of pixel rows including N pixel values, the image processing method comprising the steps of: (A) the processing unit stores the X pixel value to the (Y-1) pixel value of the m row pixel row of the image; (B) the processing unit receives the Y pixel value of the m pixel row of the image and carries out interpolation expansion according to the X pixel value to the Y pixel value to generate an expanded pixel row; (C) the processing unit carries out convolution operation according to the expansion pixel column and the template to generate a convolution value; (D) the processing unit carries out addition operation according to the stored b-th pixel value and the convolution value to generate the b-th pixel value of the m-th row of pixel row of the new image, thereby achieving the image processing which reduces ringing and can carry out real-time operation.
Description
Technical Field
the present invention relates to an image processing apparatus and method, and more particularly, to an image processing apparatus and method capable of achieving a certain sharpness and eliminating ringing.
Background
The prior art image processing techniques have the following disadvantages:
1. there is a severe ringing phenomenon, and the prior art image processing technology is often accompanied by a severe ringing effect while realizing image sharpness, so that it is often necessary to process at least 9 pixel values (3 × 3) at a time to obtain a more average convolution value to optimize the ringing phenomenon of a new image. 2. A large hardware storage area is required: in order to eliminate ringing, the prior art image processing technique needs to process at least 9 pixel values at a time, so at least nine pixel values need to be stored in advance, and then, one of a plurality of new pixel values of a new image is obtained by performing operation processing according to the stored nine pixel values.
disclosure of Invention
therefore, a first object of the present invention is to provide an image processing method capable of improving ringing and real-time processing.
Thus, the image processing method of the present invention is executed by a processing unit, the processing unit receives an image, the image includes M pixel rows, each pixel row includes N pixel values, where 1 ≦ M, 3 ≦ N, and M, N is a positive integer, and the image processing method includes the following steps (a), (B), (C), and (D).
Step (A): the processing unit stores the pixel value from the Xth pixel value to the (Y-1) th pixel value of the mth pixel row of the image, wherein 1 is less than or equal to X, X < a is less than or equal to Y is less than or equal to N, 1 is less than or equal to m, and a, Y, X and m are positive integers.
Step (B): the processing unit receives the Y pixel value of the m pixel row of the image in real time and conducts interpolation expansion according to the X pixel value to the Y pixel value to generate an expanded pixel row.
Step (C): the processing unit performs convolution operation according to the extended pixel column and the template to generate a convolution value.
step (D): the processing unit generates a b-th pixel value of an m-th pixel column of the new image by adding the stored b-th pixel value and the convolution value, wherein X is less than or equal to b is less than or equal to Y, and b is a positive integer.
Two objects of the present invention are to provide an image processing apparatus capable of improving a ringing phenomenon and performing real-time processing.
Thus, the image processing apparatus of the present invention includes a processing unit.
The processing unit receives an image comprising M rows of pixels, each row of pixels comprising N pixel values, wherein 1 ≦ M, 3 ≦ N, and M, N is a positive integer. The processing unit comprises a buffer, an arithmetic unit and an adder.
The buffer is used for receiving and storing an Xth pixel value to a (Y-1) th pixel value of an M-th pixel row of the image in sequence, wherein 1 is less than or equal to X, X < a is less than or equal to Y is less than or equal to N, 1 is less than or equal to M, and a, Y, X and M are positive integers.
The arithmetic unit is electrically connected with the buffer to receive the Xth pixel value to the (Y-1) th pixel value of the mth row of pixel row stored in the buffer, receive the Yth pixel value of the mth row of pixel row of the image, perform interpolation expansion according to the Xth pixel value to the Yth pixel value to generate an expanded pixel row, and perform convolution operation according to the expanded pixel row and the template to generate a convolution value.
the adder is electrically connected to the arithmetic unit and the buffer for receiving the convolution value and the b-th pixel value stored in the buffer to perform an addition operation to generate a b-th pixel value of the m-th pixel row of the new image, wherein X is less than or equal to b is less than or equal to Y, and b is a positive integer.
The invention has the following effects: the received Y pixel values are expanded into a plurality of pixel values by means of interpolation expansion, so that the boundary difference between two adjacent pixel values is not too large, the ringing phenomenon of a new image is reduced, and the Y-th pixel value can be received in real time for real-time operation.
drawings
FIG. 1 is a block diagram of one embodiment of an image processing method of the present invention;
FIG. 2 is a schematic diagram illustrating image transformation according to an embodiment of the image processing method of the present invention;
FIG. 3 is a flow chart of an embodiment of an image processing method of the present invention;
FIG. 4 is a block diagram of a first stage of an embodiment of an image processing method of the present invention;
FIG. 5 is a block diagram of a second phase of an embodiment of an image processing method of the present invention;
FIG. 6 is a block diagram of a third stage of an embodiment of an image processing method of the present invention;
FIG. 7 is a schematic diagram of interpolation expansion and convolution operations according to an embodiment of the image processing method of the present invention;
FIG. 8 is a diagram illustrating a new image according to an embodiment of the image processing method of the present invention;
FIG. 9 is a diagram illustrating convolution operations extended according to interpolation in an embodiment of the image processing method of the present invention.
Description of the symbols
1 image processing apparatus
2 color gamut conversion unit
21 original image
22 images
3 processing unit
31 buffer
32 arithmetic unit
33 adder
4 New image
A0 step
A to H steps
The delta convolution value.
Detailed Description
Referring to fig. 1, the image processing method of the present invention is executed by the processing unit 3, the processing unit 3 is electrically connected to the color gamut converting unit 2 storing the image 22, and the processing unit 3 and the color gamut converting unit 2 together form the image processing apparatus 1.
Referring to fig. 2, the color gamut converting unit 2 receives the original image 21 and converts an RGB color gamut of the original image 21 into an HSL color gamut, wherein the RGB color gamut is a color pixel mainly composed of three primary colors of Red (Red), Green (Green) and Blue (Blue), and the HSL color gamut is a color pixel mainly composed of Hue (Hue), Saturation (Saturation) and brightness (Luminance/Luminance).
that is, the gamut conversion unit 2 converts RGB values of a plurality of pixels of the original image 21 into a plurality of HSL values respectively, and stores a plurality of L values of the HSL values to form the image 22, where the image 22 includes M pixel columns, each pixel column includes N pixel values, where the L values (M × N pixel values) are luminances of M × N pixels, 1 ≦ M, 3 ≦ N, and M, N are positive integers, and it should be noted that the values of the equal pixel values of the original image 21 and the image 22 in fig. 2 are only indicated for convenience of description and are not actual values of the equal pixel values.
The processing unit 3 is electrically connected to the gamut converting unit 2, and includes a Buffer 31, an operator 32, and an adder 33, and is configured to receive and store the xth pixel value to the Y-1 th pixel value of the image 22 In sequence, and perform image processing according to the stored xth pixel value to the Y-1 th pixel value, and the yth pixel value received from the image 22 to generate a new image 4, where the Buffer 31 is a First-In-First-Out (FIFO) Buffer, and 1 ≦ X, X < a ≦ Y ≦ N, and a, Y, and X are positive integers.
Referring to fig. 3 and 4, for convenience of description, the definition buffer 31 of the embodiment has a storage space for storing two pixels, and therefore, the definition a is equal to 3, but is not limited thereto, and may be set according to actual requirements.
The processing unit 3 executes an image processing method comprising the steps of:
< first stage >
In step (a0), the processing unit 3 sequentially receives the X-th pixel value to the (Y-1) -th pixel value of the m-th pixel row of the image 22 from the gamut conversion unit 2, where 1 ≦ m, and m is a positive integer.
In step (A), the processing unit 3 stores the Xth pixel value to the (Y-1) th pixel value of the mth pixel row of the image 22 from the color gamut converting unit 2.
Specifically, the image 22 of the present embodiment has six pixel rows (M =6), and each pixel row has six pixel values (N =6), the buffer 31 of the processing unit 3 sequentially receives the first pixel value (L1) to the second pixel value (L2) of the first pixel row (M =1) of the image 22, and stores the first pixel value (L1) and the second pixel value (L2) in the buffer 31 according to the previously received concept.
in the step (B), when the processing unit 3 receives the Y-th pixel value of the m-th pixel row of the image 22 from the color gamut converting unit 2 in real time, the interpolation expansion is performed according to the X-th pixel value to the Y-th pixel value to generate an expanded pixel row.
Wherein the extended pixel row is composed of the Xth pixel value to the Yth pixel value received by the arithmetic unit 32 of the processing unit 3 and (Y-X) extended pixel values, and each extended pixel value is the average value of two adjacent pixel values, and the operation method of the average value isWherein, I and J are the pixel values of two adjacent pixels respectively.
in more detail, the operator 32 of the present embodiment receives the first pixel value (L1) and the second pixel value (L2) stored in the buffer 31, and also receives the third pixel value (L3) from the image 22 of the color gamut converting unit 2, at this time, the operator 32 generates an extended pixel row (as shown in fig. 7) by interpolating and extending the extended pixel row with the first pixel value (L1) to the third pixel value (L3).
and (C) carrying out convolution operation by using the processing unit 3 according to the extended pixel column and the template to generate a convolution value delta.
It should be noted that the operator 32 of the processing unit 3 uses the convolution formula (formula 1) to obtain the convolution value Δ.
Convolution value Δ
(formula 1)
wherein the parameters I, J, K and L respectively extend the Xth pixel value, the b-th pixel value to the Yth pixel value of the pixel column, andAndfor extended pixel values, the parameter G is the coefficient weight of the template corresponding to the b-th pixel value, the number of coefficients of the template of the image processing method of the present invention is equal to the number of extended pixel columns, and the coefficient weight of the template corresponding to the b-th pixel value is higher, and it should be noted that the design point of the coefficient weight of the template is that the sum of the coefficient weights of all the coefficients is equal to zero, so that the coefficient weight of G is { - [ (-1) + (-1) + … + (-1) + (-1) + (-1)]}。
As will be more clearly described in this embodiment, the first stage of this embodiment uses the second pixel value (b =2) as the main transform pixel, so the value of the coefficient weight of the template corresponding to the second pixel value (L2) should be larger, and G is, for example, 4 (G = { - [ (-1) + (-1) + (-1) ] } as shown in fig. 7, so the convolution value Δ at the present stage of this embodiment is shown in (equation 2).
Convolution value Δ
(formula 2)
and (D) utilizing the processing unit 3 to perform addition operation according to the b-th pixel value and the convolution value delta to generate a b-th pixel value of the m-th pixel row of the new image 4, wherein X is less than or equal to b is less than or equal to Y, and b is a positive integer.
The adder 33 of the processing unit 3 adds the second pixel value (L2) and the convolution value Δ to obtain the second pixel value (M2) of the first row of the pixel row (M =1) of the new video 4.
Step (E) the processing unit 3 determines whether the existing value of Y is equal to N, if so, completes the image processing of the mth column, and if not, proceeds to step (F).
And (F) adding 1 to the existing numerical value of X by the processing unit 3 to be used as a next numerical value, adding 1 to the existing numerical value of Y to be used as a next numerical value, and returning to the step (A).
The processing unit 3 determines that the six pixel values of the first row of pixel rows have not been completely calculated, and the processing unit 3 starts the second stage and proceeds to step (F).
< second stage >
Referring to fig. 5, the processing unit 3 adds 1 to each of the current values of X and Y in the first stage to obtain the X value and Y value (X =2, Y =4) in the second stage, returns to step (a) to store the second pixel value (L2) to the fourth pixel value (L4) of the first row of pixel row (m =1) of the image 22 from the color gamut converting unit 2, and continues to step (B) to step (F), which is similar to the first stage and will not be described again until the processing unit 3 determines that the current value of Y is equal to N (N =6), and then proceeds to step (G).
Step (G) the processing unit 3 determines whether the existing value of M is equal to M, if so, completes the image processing, otherwise, proceeds to step (H).
Step (H) the processing unit 3 adds 1 to the existing value of m as the next value, the next value of X equals 1, the next value of Y equals a, and returns to step (A0)
< third stage >
Referring to fig. 6, the processing unit 3 adds 1 to the current value of M in the second stage to obtain a value (M =2) in the third stage, where the value of X in the third stage is equal to 1(X =1), the value of Y is equal to a (Y = a =3), and returns to step (a0) to sequentially receive the first pixel value (L7) to the third pixel value (L9) in the second row of the pixel row of the image 22, and continues to step (a) to step (G), which is similar to the first stage and the second stage, so that the description is not repeated until the processing unit 3 determines that the current value of M is equal to M (M =6) and the current value of Y is equal to N (N =6), and then the image processing is completed, as shown in fig. 8.
it should be noted that the main conversion pixels in the image processing method of the present invention are the second pixel value ~ the N-1 th pixel value (b =2 ~ (N-1)) of each pixel column (M =1 ~ M), and in this embodiment, the main conversion pixels are the second pixel value ~ the fifth pixel value of the first pixel column ~ the sixth pixel column, and the first pixel values (L1, L7, L13, L19, L25 and L31) and the sixth pixel values (L6, L12, L18, L24, L30 and L36) of the first pixel column ~ the sixth pixel column are left as they are and are not processed.
Furthermore, the image processing method of the present invention can also obtain the convolution value Δ shown in (equation 3) by simplifying the convolution value Δ obtained by the operation of (equation 2) in this embodiment.
Convolution value
(formula 3)
Referring to fig. 9, the operator 32 of the present invention may also directly use another template to perform convolution operation with the first pixel value (L1) to the third pixel value (L3), and the other template has only three coefficients, and the three coefficient weights of the three coefficients are set to (-1.5), (3) and (-1.5) through the operation design of (formula 3), so that the operator 32 can directly perform convolution operation on the first pixel value (L1) to the third pixel value (L3) and the other template to obtain the convolution values identical to those in the step (B) and the step (C) of the first stage, that is, the image processing method of the present invention can simplify the processing procedure of the operator 32 by changing the coefficient number and the coefficient weight of the template to combine the step (B) and the step (C) into one step.
As described above, the image processing apparatus 1 according to the present invention has the following advantages:
1. And (3) ringing phenomenon reduction: the calculator 32 expands the received three pixel values into five pixel values by interpolation, so that the boundary difference between two adjacent pixel values is not too large, and the ringing of the new image 4 is reduced.
2. Reducing hardware storage area: the image processing technique in the prior art stores at least nine pixel values, and obtains one of a plurality of new pixel values of a new image by performing operation processing according to the stored nine pixel values; in the image processing apparatus 1 of the present invention, as an example of the above embodiment, only two pixel values (the xth pixel value to the yth-1 pixel value) need to be stored in the buffer 31 in advance, and then the computing unit 32 performs real-time computation to generate one of the pixel values of the new image 4 according to the two pixel values stored in the buffer 31 and the other pixel value (the yth pixel value) received from the image 22 in real time.
It is clear that the image processing apparatus 1 and the image processing method thereof of the present invention can achieve the object of the present invention.
However, the above description is only an example of the present invention, and the scope of the present invention should not be limited thereby, and all simple equivalent changes and modifications made according to the claims and the contents of the patent specification are still included in the scope of the present invention.
Claims (10)
1. an image processing method, performed by a processing unit that receives an image, the image comprising M rows of pixels, each row of pixels comprising N pixel values, wherein 1 ≦ M, 3 ≦ N, and M, N is a positive integer, the image processing method comprising:
(A) The processing unit stores the X pixel value to the (Y-1) pixel value of the M pixel row of the image, wherein 1 is less than or equal to X, X < a is less than or equal to Y is less than or equal to N, 1 is less than or equal to M, and a, Y, X and M are positive integers;
(B) The processing unit receives the Y pixel value of the m pixel row of the image in real time and carries out interpolation expansion according to the X pixel value to the Y pixel value to generate an expanded pixel row;
(C) The processing unit carries out convolution operation according to the extended pixel array and the template to generate a convolution value;
(D) The processing unit generates a b-th pixel value of an m-th pixel row of the new image by adding the stored b-th pixel value and the convolution value, wherein X is less than or equal to b is less than or equal to Y, and b is a positive integer.
2. The image processing method of claim 1, wherein the step (a) further comprises, before:
(A0) The processing unit receives the Xth pixel value to the (Y-1) th pixel value of the mth row of the image in sequence.
3. The image processing method of claim 2, wherein the image processing method further comprises:
(E) The processing unit determines whether the existing value of Y is equal to N;
(F) The processing unit adds 1 to the existing value of X to be the next value, adds 1 to the existing value of Y to be the next value, and returns to the step (A);
Wherein step (E) is performed after step (D); in the step (E), if the processing unit determines that the existing value of Y is equal to N, the image processing of the mth column is completed; and (F) if the processing unit judges that the existing numerical value of Y is not equal to N.
4. The image processing method of claim 3, wherein the image processing method further comprises:
(G) The processing unit determines whether the existing value of M is equal to M;
(H) The processing unit adds 1 to the existing value of m as the next value, the next value of X equals 1, the next value of Y equals a, and returns to step (a 0);
Wherein, when the step (E) judges that the existing numerical value of Y is equal to N, the step (G) is executed; in the step (G), if the processing unit determines that the existing value of M is equal to M, the image processing is completed; and (H) if the processing unit judges that the existing value of M is not equal to M.
5. The image processing method as claimed in claim 1, wherein the extended pixel row is composed of the xth pixel value to the yth pixel value received by the processing unit and (Y-X) extended pixel values, wherein each extended pixel value is an average of two adjacent pixel values.
6. the image processing method as claimed in claim 5, wherein the processing unit obtains the average value by using an average value operation method,
Wherein, I and J are the pixel values of two adjacent pixels respectively.
7. the image processing method of claim 6, wherein the number of extended pixel columns is equal to the number of coefficients of the template.
8. The image processing method as claimed in claim 7, wherein said processing unit obtains said convolution value by using the following convolution formula, said convolution value being equal to said extended pixel rowthe template is made of
Wherein the parameters I, J, K and L are used to expand the Xth pixel value, the b-th pixel value to the Y-th pixel value of the pixel row, respectivelyAndTo expand the pixel values, the parameter G is the coefficient weight of the template corresponding to the b-th pixel value.
9. An image processing apparatus comprising:
A processing unit that receives an image comprising M rows of pixels, each row of pixels comprising N pixel values, wherein 1 ≦ M, 3 ≦ N, and M, N is a positive integer, the processing unit comprising:
a buffer for receiving and storing in sequence an Xth pixel value to a (Y-1) th pixel value of an M-th pixel row of the image, wherein 1 is less than or equal to X, X < a is less than or equal to Y is less than or equal to N, 1 is less than or equal to M, and a, Y, X, M are positive integers;
An arithmetic unit electrically connected to the buffer for receiving the Xth pixel value to the (Y-1) th pixel value of the mth row of pixel rows stored in the buffer, receiving the Yth pixel value of the mth row of pixel rows of the image, performing interpolation expansion according to the Xth pixel value to the Yth pixel value to generate an expanded pixel row, and performing convolution operation according to the expanded pixel row and a template to generate a convolution value; and
And the adder is electrically connected with the arithmetic unit and the buffer to receive the convolution value and the b-th pixel value stored in the buffer to carry out addition operation to generate the b-th pixel value of the m-th pixel row of the new image, wherein X is less than or equal to b is less than or equal to Y, and b is a positive integer.
10. The image processing apparatus as claimed In claim 9, wherein the Buffer is a First In First Out (FIFO) 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 CN106296614A (en) | 2017-01-04 |
CN106296614B true 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) |
Families Citing this family (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 |
CN111028183B (en) * | 2019-12-27 | 2023-03-24 | 合肥众群光电科技有限公司 | Method for realizing graph trimming or expansion in LDI exposure |
CN113905171B (en) * | 2020-07-06 | 2024-04-26 | 瑞昱半导体股份有限公司 | Multi-path 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 |
---|
133Mpixel 60fps CMOS Image Sensor with 32-Column Shared High-Speed Column-Parallel SAR ADCs;Ryohei Funatsu 等;《2015 IEEE》;20151231;第112-113页 * |
H.264/AVC解码运动补偿的VLSI优化实现;忻晟;《中国优秀硕士学位论文全文数据库 信息科技辑》;20100415;正文第1-50页 * |
Also Published As
Publication number | Publication date |
---|---|
CN106296614A (en) | 2017-01-04 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US5608824A (en) | Image processing apparatus in which filters having different filtering characteristics can be switched among themselves | |
US5678033A (en) | Multi-stage interpolation processor | |
CN102118624A (en) | Method for converting an image from an RGB color space to a YUV color space | |
CN106296614B (en) | Image processing apparatus and image processing method | |
JP4317619B2 (en) | Image processing device | |
US20170061843A1 (en) | Image processing method and image processing apparatus | |
JP6251029B2 (en) | Control device, image processing device, control method, and program | |
CN102280096A (en) | Method for combining image scaling and color space switching | |
CN115004220B (en) | Neural network for raw low-light image enhancement | |
CN109345464B (en) | Method and system for realizing HDR image processing in Bayer data field | |
CN107220934A (en) | Image rebuilding method and device | |
EP3301908A1 (en) | Numerical image conversion method and device, and storage medium and device | |
JP5887809B2 (en) | Image processing apparatus and program | |
CN111985617A (en) | Processing method and device of 3D convolutional neural network on neural network processor | |
JP7022696B2 (en) | Image processing equipment, image processing methods and programs | |
US20160284056A1 (en) | Image processing apparatus and method | |
CN104637034A (en) | Method and device for regulating image saturation degree | |
TWI586168B (en) | Image processing apparatus and image processing method | |
KR102586816B1 (en) | Image enhancement apparatus and method for obtaining image in which image quliaty is enhanced based on multiple transformation function estimation | |
JP6448410B2 (en) | Data conversion apparatus, control method therefor, and program | |
JPWO2019082283A1 (en) | Image analyzer | |
JP2004213100A (en) | Color conversion processor and color conversion processing method | |
CN113313787B (en) | Data processing method, device, computer equipment and storage medium | |
JP2009044426A (en) | Image processor | |
JP6902425B2 (en) | Color information magnifiers and color information estimators, and their programs |
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 |