CN109640065A - A method of for picture data processing - Google Patents
A method of for picture data processing Download PDFInfo
- Publication number
- CN109640065A CN109640065A CN201811257059.3A CN201811257059A CN109640065A CN 109640065 A CN109640065 A CN 109640065A CN 201811257059 A CN201811257059 A CN 201811257059A CN 109640065 A CN109640065 A CN 109640065A
- Authority
- CN
- China
- Prior art keywords
- value
- pixel
- group
- clock cycle
- data processing
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N9/00—Details of colour television systems
- H04N9/64—Circuits for processing colour signals
-
- G—PHYSICS
- G09—EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
- G09G—ARRANGEMENTS OR CIRCUITS FOR CONTROL OF INDICATING DEVICES USING STATIC MEANS TO PRESENT VARIABLE INFORMATION
- G09G3/00—Control arrangements or circuits, of interest only in connection with visual indicators other than cathode-ray tubes
- G09G3/20—Control arrangements or circuits, of interest only in connection with visual indicators other than cathode-ray tubes for presentation of an assembly of a number of characters, e.g. a page, by composing the assembly by combination of individual elements arranged in a matrix no fixed position being assigned to or needed to be assigned to the individual characters or partial characters
- G09G3/2003—Display of colours
Abstract
The present invention relates to field of display technology more particularly to a kind of methods for picture data processing, obtain the pixel of every a line image first；It is compared by R, G, B pixel value of the algorithm to the pixel that every a line obtains；Value is given up in setting one, and the pixel quantity in the clock cycle that different modes are obtained is compared with giving up value；Give up condition value for one in setting, and by the clock periodicity measurer of statistics compared with this gives up condition value, obtains the RGB grayscale value and quantity of new pixel；After the completion of every a line processing, matrix operation is carried out according to the RGB grayscale value and quantity recorded, the RGB grayscale value of new consistency is obtained and writes down the quantity；Each column is handled according to same step, in this way, the identical quantity maximum value of data and its RGB grayscale value quickly can be found from same frame when handling more full frame data volume and compressed data data well.
Description
Technical field
The present invention relates to field of display technology more particularly to a kind of methods for picture data processing.
Background technique
With the continuous development of photoelectricity and semiconductor technology, the progress in the fields such as display device has also been driven.And display
Associated components further reflect the height of display display effect to the processing technique of display picture image in part.
Show that color to be expressed is more and more abundant and finer and smoother on screen, shields by force in particular for superelevation
For curtain (Ultra High Definition, UD), these all originate from the increase of screenful information data, in same display frame, institute
The information content for including is huger, currently, also more and more for the calculation technology of display picture processing, screenful information amount is deposited
It is also very huge to store up the memory space occupied.Such as in UD screen, the data volume in one frame data is 3840*2160*28*
28*28, entirely show that the total pixel number amount of equipment reaches 8,000,000 or more, data information amount is especially huge, therefore, to these numbers
When being handled according to picture, the ratio of compressing data will be very big, and data phase cannot be quickly found from same frame
Same quantity maximum value and its RGB grayscale value, in existing compress technique, the ratio of compression is bigger, the distortion feelings of picture
Condition is more, undesirable to the picture processing of color colour cast, so that the display effect of the strong screen of superelevation reduces, while to same frame
When data information is compared, completion can not be operated since data volume is too many.
Therefore, existing technology cannot be quickly from same when handling more full frame data volume and compressed data data
The identical quantity maximum value of data and its RGB grayscale value are found in frame, accuracy is low, limits the display that superelevation waits by force screens
Effect needs to propose further to improve scheme.
Summary of the invention
The present invention provides a kind of method for picture data processing, is handling more full frame data to solve the prior art
The identical quantity maximum value of data and its RGB grayscale cannot be quickly found from same frame when amount and compressed data data
Value, the low problem of accuracy.
In order to solve the above technical problems, technical solution provided by the invention is as follows:
According to the first aspect of the embodiments of the present disclosure, a kind of method for picture data processing is provided；
The described method includes:
S100, the pixel for obtaining every a line image, wherein when handling every a line image, each data algorithm can be simultaneously
Handle n pixel；
One S101, setting fluctuation status register, wherein the predetermined value of the fluctuation status register is X；
S102, the R value of the different pixels point of the data algorithm process is compared, while compares each pixel
In corresponding G and B value；
Peak Y is given up in S103, setting one；
S104, it is counted since first clock cycle, it is described if identical as first clock cycle itself
The assignment of data algorithm just becomes the quantity of clock cycle multiplied by n, if encountering the value phase of pixel R, G, B in the clock cycle
Together, but the value of described pixel R, G, B are different from the value of pixel R, G, B in the previous clock cycle, then just according to
Step S106, to the quantity of the identical clock cycle counted on, whether long enough judges；
One S105, setting maximal condition value Hthro given up；
If S106, the quantity of the clock cycle counted on be not less than Hthro, just write down consecutive identical pixel R, G,
The quantity of the value of B and identical pixel, meanwhile, the value of R, G, B of the pixel are set as new pixel consistency checking value；
If S107, encountering itself different clock cycle, if the quantity of identical pixel is not less than
Value Hthro writes down R, G, B value and its quantity of consecutive identical pixel；
R, G, B value to be determined is not changed, until counting on itself consistent clock cycle, changes consistency at this time
R, G, B value of decision content, and update the quantity of same pixel；
S108, a line processing complete after, recorded according to described value Hthro the m group pixel retained R, G, B value and
The quantity of pixel；
S109, the matrix that the quantity of R, G, B value of the m group pixel retained and pixel is formed to a m*4；Its
In, whether i-th group respectively in trip current be identical as each group after i-th group, identical that i-th group of the quantity adds up
To on i-th group；And most one group of quantity is denoted as consistency R, G, B value of the row, while writing down quantitative value；
S110, every row are arranged a maximum and give up time Hth；
S111, by the quantitative value in step S109 compared with Hth, if quantity is greater than Hth, the i-th row is consistent；
S112, each column are arranged a maximum and give up value Vthro, are transported according to the same method of step S106 to S111
It calculates, to find out the line number of whole frame pixel identical R, G, B value and the pixel.
According to one preferred embodiment of the present invention, in the S101, each data algorithm meeting when handling every a line image
2 or 4 or 8 pixels are handled simultaneously；
According to one preferred embodiment of the present invention, in the S102, if in each group R, G, B three difference no more than
The X, then the fluctuation status of this clock cycle is that itself is consistent；If the difference of R, G, B three are all larger than described in each group
X, then it is inconsistent to be denoted as itself for the fluctuation status of this clock cycle；
According to one preferred embodiment of the present invention, in the S106, at this point, the quantity update of the new pixel becomes described
The quantity of consecutive identical pixel is multiplied by n；
According to one preferred embodiment of the present invention, in the S107, the quantity update of the same pixel becomes n multiplied by described
The quantity of consecutive identical pixel；
According to one preferred embodiment of the present invention, in the S105, the maximal condition value Hthro given up is set as 960；
According to one preferred embodiment of the present invention, the data algorithm is twice of the clock cycle in assignment；
According to one preferred embodiment of the present invention, R, G, B pixel value of the different pixels point are one in 0-255；
According to one preferred embodiment of the present invention, in the S109, when the matrix of a 4*4, specific steps include,
Whether judgement and group 2,3,4 are identical respectively for group 1, identical that this group of quantity is added in group 1；
Whether judgement and group 3 are identical respectively for group 2, identical that this group of quantity is added in group 2；
Whether 3 judgement of group and group 4 are identical, identical that this group of quantity is added in group 3.
In conclusion the invention has the benefit that
By new program technic, by above description it is found that the present invention is respectively by carrying out different processing to image,
And the image of processing is compared with the parameter value of setting, thus the number of the pixel of pixel value required for obtaining and needs
Amount, in such manner, it is possible to quickly find out the quantity maximum value and its corresponding R, G, B pixel of identical pixel from a frame
Value, while also can determine that the line number where it, for the pixel that these find, targetedly these pictures can be carried out
Specially treated, solve the prior art cannot quickly be found from same frame the identical quantity maximum value of data and its
RGB grayscale value, the low problem of accuracy.
Detailed description of the invention
It, below will be to embodiment or the prior art in order to illustrate more clearly of embodiment or technical solution in the prior art
Attached drawing needed in description is briefly described, it should be apparent that, the accompanying drawings in the following description is only some of invention
Embodiment for those of ordinary skill in the art without creative efforts, can also be attached according to these
Figure obtains other attached drawings.
Fig. 1 is algorithm simple flow chart schematic diagram of the invention；
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description.Obviously, described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.
A method of for picture data processing, handled according to step provided by the invention, processing step is as follows:
S100, the pixel for obtaining every a line image, wherein when handling every a line image, each data algorithm can be simultaneously
Handle n pixel；
Specifically, wherein 2,4 can be handled in data algorithm simultaneously within a clock cycle (clock cycle)
A or 8 pixels, i.e. n=2, n=4 or n=8.
One S101, setting fluctuation (dithering) status register, wherein the fluctuation status register makes a reservation for
Numerical value is X；
S102, R, G, B value of the different pixels point of the data algorithm process are compared, if R, G in each group,
The difference of B three is no more than the X, then it is consistent to be denoted as itself for the fluctuation status of this clock cycle；If R, G, B in each group
The difference of three is all larger than the X, then it is inconsistent to be denoted as itself for the fluctuation status of this clock cycle；
Specifically, the processing in step S102 is just are as follows: compares R for handling two pixels simultaneously1-R2≤ X, simultaneously
G1-G2≤ X, while B1-B2≤ X, when above three comparison expression is set up simultaneously, just by the fluctuation status of this clock cycle be denoted as from
Body is consistent；If above three comparison expression is not set up simultaneously, it is inconsistent that the fluctuation status of this clock cycle is denoted as itself.It is logical
Such method is crossed quickly to distinguish to different pixels.
Peak Y is given up in S103, setting one；
S104, it is counted since first clock cycle, it is described if identical as first clock cycle itself
The assignment of data algorithm just becomes the quantity of clock cycle multiplied by n, if encountering the value phase of pixel R, G, B in the clock cycle
Together, but the value of described pixel R, G, B are different from the value of pixel R, G, B in the previous clock cycle, then just according to
Step S106, to the quantity of the identical clock cycle counted on, whether long enough judges；
One S105, setting maximal condition value Hthro given up；
If S106, the quantity of the clock cycle counted on be not less than Hthro, just write down consecutive identical pixel R, G,
The quantity of the value of B and identical pixel, meanwhile, the value of R, G, B of the pixel are set as new pixel consistency checking value,
At this point, the quantity of the new pixel updates the quantity for becoming the consecutive identical pixel multiplied by n；
If S107, encountering itself different clock cycle, if the quantity of identical pixel is not less than
Value Hthro writes down R, G, B value and its quantity of consecutive identical pixel；
R, G, B value to be determined is not changed, until counting on itself consistent clock cycle, changes consistency at this time
R, G, B value of decision content, and the quantity of same pixel is updated, the quantity of the same pixel becomes n multiplied by the continuous phase
The quantity of same pixel；
S108, a line processing complete after, recorded according to described value Hthro the m group pixel retained R, G, B value and
The quantity of pixel；
S109, the matrix that the quantity of R, G, B value of the m group pixel retained and pixel is formed to a m*4；Its
In, whether i-th group respectively in trip current be identical as each group after i-th group, identical to be added to i-th group of quantity
On i-th group；And most one group of quantity is denoted as consistency R, G, B value of the row while writing down quantitative value；
S110, every row are arranged a maximum and give up time Hth；
S111, by the quantitative value in step S109 compared with Hth, if quantity is greater than Hth, the i-th row is consistent；
S112, each column are arranged a maximum and give up value Vthro, are transported according to the same method of step S106 to S111
It calculates, to find out the line number of whole frame pixel identical R, G, B value and the pixel.
Preferably, in the step S100, if when n=2, that is, n is assigned a value of in data (n) algorithm
2, in this way, data (n) assignment just becomes twice of clock cycle, therefore the pixel quantity obtained in subsequent step be required to multiplied by
2, become new obtained pixel quantity.
Several rgb values write down and its quantity can be left after a line processing, the group number write down is depending on Hthro's
It chooses, Hthro is bigger, and the condition write down is stringenter, and the group number that every a line is write down is fewer, then every a line needs is dynamic
State space is fewer, in the step S109, the maximal condition value Hthro given up is set as (3840/4) 960, then often
4 groups of rgb values and its quantity are left after a line statistics, therefore form the matrix of a following 4*4:
| R1 | G1 | B1 | Group 1 |
| R2 | G2 | B2 | Group 2 |
| R3 | G3 | B3 | Group 3 |
| R4 | G4 | B4 | Group 4 |
When handling above-mentioned matrix,
Whether judgement and the value in group 2,3,4 are identical respectively for group 1, and just this group of quantity is added in group 1 if identical；
Whether judgement and the value in group 3,4 are identical respectively for group 2, and just this group of quantity is added in group 2 if identical；
Group 3 finally judge whether with group 4 it is identical, it is identical if just by this group of quantity be added to group 3 on.
As shown in fig. 1, a kind of specific flow chart of method for picture data processing of the invention is as follows:
S201: extracting the pixel of every a line, and the statistical magnitude clock of clock cycle is set as 0 when starting；
S202: according to decision condition, at this time by taking n=2 as an example, by the R value of different pixels point and G value and B value same time-division
It is not compared；
S203: value qualified in S202 is counted and writes down corresponding quantity；
S204: the quantity of the clock cycle counted on is judged with Hthro；
S205: the rgb value for meeting that equation is set up in the 5th step is write down, and writes down its quantity；
S206: the rgb value of obtained every a line and its quantity are formed into an operation matrix；
S207: whether i-th group respectively in trip current be identical as each group after i-th group, identical i.e. by described i-th group
Quantity is added on i-th group,
S208: one group of quantity at most is denoted as consistency R, G, B value of the row while writing down quantitative value No.final；
S209: by the No.final acquired in S208 compared with assignment Hth.
Finally, most one group of obtained quantity to be denoted as to consistency R, G, B value of the row, wherein R, G, B value are 0-255
In one, while writing down the quantity of the same pixel, by repeatedly such processing, can accurately find multiple identical
The quantity of rgb pixel value and its grayscale value.
In conclusion be provided for the embodiments of the invention above it is a kind of for picture data processing method carried out in detail
It is thin to introduce, according to an embodiment of the invention, can quickly be found out from a frame identical pixel quantity maximum value and
Its corresponding R, G, B pixel value, while also can determine that the line number where it, for the pixel that these find, can be directed to
Property to these pictures carry out specially treated, to improve the accuracy of processing.
Used herein a specific example illustrates the principle and implementation of the invention, and above embodiments are said
It is bright to be merely used to help understand technical solution of the present invention and its core concept；Those skilled in the art should understand that:
It is still possible to modify the technical solutions described in the foregoing embodiments, or part of technical characteristic is carried out etc.
With replacement；And these are modified or replaceed, the technical side for various embodiments of the present invention that it does not separate the essence of the corresponding technical solution
The range of case.
Claims (9)
1. a kind of method for picture data processing, which is characterized in that step includes,
S100, the pixel for obtaining every a line image, wherein when handling every a line image, each data algorithm can be handled simultaneously
N pixel；
One S101, setting fluctuation status register, wherein the predetermined value of the fluctuation status register is X；
S102, the R value of the different pixels point of the data algorithm process is compared, at the same compare it is right in each pixel
The value of the G and B that answer；
Peak Y is given up in S103, setting one；
S104, it is counted since first clock cycle, if identical as first clock cycle itself, the data is calculated
The assignment of method just becomes the quantity of clock cycle multiplied by n, if the value for encountering pixel R, G, B in the clock cycle is identical, directly
It connects and jumps to S109；If the value of described pixel R, G, B are different from the value of pixel R, G, B in the previous clock cycle,
S106 is so just jumped to, whether long enough judges to the quantity of the identical clock cycle counted on；
One S105, setting maximal condition value Hthro given up；
If S106, the quantity of the clock cycle counted on are not less than Hthro, just write down R, G, B's of consecutive identical pixel
The quantity of value and identical pixel, is put into matrix, meanwhile, the value of R, G, B of the pixel are set as to R, G, B of existing pixel
It is worth consistency checking value；
If if S107, the quantity of identical pixel is write down continuously not less than value Hthro when encountering a clock cycle
R, G, B value and its quantity of identical pixel；
R, G, B value to be determined is not changed, until counting on itself consistent clock cycle, changes consistency checking at this time
R, G, B value of value, and update the quantity of same pixel；
After S108, a line processing are completed, R, G, B value and pixel of the m group pixel retained are recorded according to described value Hthro
Quantity；
S109, the matrix that the quantity of R, G, B value of the m group pixel retained and pixel is formed to a m*4；Wherein, divide
Whether i-th group in other trip current be identical as each group after i-th group, identical that i-th group of the quantity is added to i-th
In group；And most one group of quantity is denoted as consistency R, G, B value of the row, while writing down quantitative value；
S110, every row are arranged a maximum and give up time Hth；
S111, by the quantitative value in step S109 compared with Hth, if quantity be greater than Hth, the i-th row is consistent, then jumps
Go to S108 execution；If quantitative value is less than Hth, S112 is executed；
S112, each column are arranged a maximum and give up value Vthro, carry out operation according to the same method of step S106 to S111, from
And find out the line number of whole frame pixel identical R, G, B value and the pixel.
2. the method according to claim 1 for picture data processing, which is characterized in that in the S101, handling
Each data algorithm can handle 2,4 or 8 pixels within the same clock cycle when every a line image.
3. the method according to claim 1 for picture data processing, which is characterized in that in the S102, if often
The difference of R, G, B three are no more than the X in one group, then it is consistent to be denoted as itself for the fluctuation status of this clock cycle；If every
The difference of R, G, B three are all larger than the X in one group, then it is inconsistent to be denoted as itself for the fluctuation status of this clock cycle.
4. the method according to claim 1 for picture data processing, which is characterized in that in the S106, at this point, institute
The quantity for stating new pixel updates the quantity for becoming the consecutive identical pixel multiplied by n.
5. the method according to claim 1 for picture data processing, which is characterized in that in the S107, the phase
Quantity update with pixel becomes n multiplied by the quantity of the consecutive identical pixel.
6. the method according to claim 1 for picture data processing, which is characterized in that in the S105, the house
The maximal condition value Hthro of abandoning is set as 960.
7. the method according to claim 1 for picture data processing, which is characterized in that the data algorithm is in assignment
When be twice of the clock cycle.
8. the method according to claim 1 for picture data processing, which is characterized in that the R of the different pixels point,
G, B pixel value is one in 0-255.
9. the method according to claim 1 for picture data processing, which is characterized in that in the S109, work as m=4
When, specific steps include,
Whether judgement and group 2,3,4 are identical respectively for group 1, identical that this group of quantity is added in group 1；
Whether judgement and group 3 are identical respectively for group 2, identical that this group of quantity is added in group 2；
Whether 3 judgement of group and group 4 are identical, identical that this group of quantity is added in group 3.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811257059.3A CN109640065A (en) | 2018-10-26 | 2018-10-26 | A method of for picture data processing |
| PCT/CN2019/072496 WO2020082632A1 (en) | 2018-10-26 | 2019-01-21 | Method for processing image data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811257059.3A CN109640065A (en) | 2018-10-26 | 2018-10-26 | A method of for picture data processing |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109640065A true CN109640065A (en) | 2019-04-16 |
Family
ID=66066731
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811257059.3A Pending CN109640065A (en) | 2018-10-26 | 2018-10-26 | A method of for picture data processing |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109640065A (en) |
| WO (1) | WO2020082632A1 (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1595452A (en) * | 2003-09-10 | 2005-03-16 | 联想(北京)有限公司 | Lossless compression method for graphic file |
| CN101068350A (en) * | 2007-06-04 | 2007-11-07 | 北京派瑞根科技开发有限公司 | Image coding and decoding processing method based on picture element st atistical characteristic and visual characteristic |
| US20100238347A1 (en) * | 2002-10-01 | 2010-09-23 | Avocent Corporation | Video compression system |
| CN103139567A (en) * | 2013-01-28 | 2013-06-05 | 东软集团股份有限公司 | Image compressing and uncompressing method and device |
| CN103873868A (en) * | 2012-12-13 | 2014-06-18 | 比亚迪股份有限公司 | Bitmap data compression method |
| CN105022788A (en) * | 2015-06-19 | 2015-11-04 | 江苏新通达电子科技股份有限公司 | Lossless compression algorithm for bin file in PNG picture format and full liquid crystal instrument display system |
| CN107248136A (en) * | 2017-05-12 | 2017-10-13 | 西安交通大学 | A kind of image histogram information acquisition method based on FPGA |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4699776B2 (en) * | 2005-02-22 | 2011-06-15 | ルネサスエレクトロニクス株式会社 | Pull-down detection apparatus and pull-down detection method |
| JP4727614B2 (en) * | 2007-03-30 | 2011-07-20 | シャープ株式会社 | Image processing apparatus, control program, computer-readable recording medium, electronic apparatus, and control method for image processing apparatus |
| JP4340711B2 (en) * | 2007-06-13 | 2009-10-07 | シャープ株式会社 | Image processing method, image processing apparatus, image forming apparatus, computer program, and recording medium |
| CN103793873B (en) * | 2014-01-26 | 2017-06-13 | 大唐移动通信设备有限公司 | The acquisition methods and device of image pixel intermediate value |
| CN107102186B (en) * | 2017-06-09 | 2020-04-28 | 中国电子科技集团公司第四十一研究所 | Digital oscilloscope fluorescent image parallel high-speed processing system and method |
-
2018
- 2018-10-26 CN CN201811257059.3A patent/CN109640065A/en active Pending
-
2019
- 2019-01-21 WO PCT/CN2019/072496 patent/WO2020082632A1/en active Application Filing
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100238347A1 (en) * | 2002-10-01 | 2010-09-23 | Avocent Corporation | Video compression system |
| CN1595452A (en) * | 2003-09-10 | 2005-03-16 | 联想(北京)有限公司 | Lossless compression method for graphic file |
| CN101068350A (en) * | 2007-06-04 | 2007-11-07 | 北京派瑞根科技开发有限公司 | Image coding and decoding processing method based on picture element st atistical characteristic and visual characteristic |
| CN103873868A (en) * | 2012-12-13 | 2014-06-18 | 比亚迪股份有限公司 | Bitmap data compression method |
| CN103139567A (en) * | 2013-01-28 | 2013-06-05 | 东软集团股份有限公司 | Image compressing and uncompressing method and device |
| CN105022788A (en) * | 2015-06-19 | 2015-11-04 | 江苏新通达电子科技股份有限公司 | Lossless compression algorithm for bin file in PNG picture format and full liquid crystal instrument display system |
| CN107248136A (en) * | 2017-05-12 | 2017-10-13 | 西安交通大学 | A kind of image histogram information acquisition method based on FPGA |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2020082632A1 (en) | 2020-04-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| DE69822936T2 (en) | Image display device and image evaluation device | |
| US10224955B2 (en) | Data compression and decompression method of demura table, and mura compensation method | |
| CN103632352B (en) | Method for time domain noise reduction of noise image and related device | |
| CN107454285A (en) | Image noise estimation method and device and image extraction device | |
| CN107977754A (en) | Data predication method, system and computer-readable recording medium | |
| US20210224954A1 (en) | Image processing method and device, storage medium and computer device | |
| CN104166967B (en) | Method for improving definition of video image | |
| CN113516939B (en) | Brightness correction method and device, display equipment, computing equipment and storage medium | |
| CN108053381A (en) | Dynamic tone mapping method, mobile terminal and computer readable storage medium | |
| CN106296779A (en) | A kind of threedimensional model rendering indication method and system | |
| CN107257452A (en) | A kind of image processing method, device and computing device | |
| CN109949224A (en) | A kind of method and device of the connection grade super-resolution rebuilding based on deep learning | |
| DE102013213093A1 (en) | A system, method and computer program product for simultaneously determining settings for a plurality of parameter variations | |
| CN107610675A (en) | A kind of image processing method and device based on dynamic level | |
| CN106454303A (en) | RGBW image processing method and apparatus | |
| CN112907457A (en) | Image processing method, image processing device and computer equipment | |
| CN114863882A (en) | Refreshing method and device of electronic ink screen | |
| CN110321892A (en) | A kind of picture screening technique, device and electronic equipment | |
| CN108122194A (en) | A kind of method and device of image luminescence | |
| CN109640065A (en) | A method of for picture data processing | |
| CN109920381A (en) | A kind of method and apparatus adjusting backlight value | |
| CN112419950B (en) | Display difference judging method and system of display device and display device | |
| CN112231020B (en) | Model switching method and device, electronic equipment and storage medium | |
| CN109102018B (en) | The multi-tag classification method of Gynecological secretion image | |
| CN109658218A (en) | It provides a loan singulated method, apparatus, equipment and readable storage medium storing program for executing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190416 |