CN111063309B

CN111063309B - Method for refreshing irregular graph conflict, storage device and display terminal

Info

Publication number: CN111063309B
Application number: CN201811207823.6A
Authority: CN
Inventors: 刘辉; 唐禹谱
Original assignee: Allwinner Technology Co Ltd
Current assignee: Allwinner Technology Co Ltd
Priority date: 2018-10-17
Filing date: 2018-10-17
Publication date: 2021-08-06
Anticipated expiration: 2038-10-17
Also published as: CN111063309A

Abstract

The invention provides a method for refreshing irregular graphs in a collision manner, which comprises the following steps: A1. configuring information for the current PIPE and acquiring necessary parameters; A2. acquiring a minimum rectangular display area according to the difference between the new updated image and the last displayed image; A3. calculating the ratio of the number of pixels with changed gray scales to the total number of pixels in the minimum rectangular display area; A4. and if the ratio is smaller than the preset threshold, entering an irregular local refreshing mode, calculating a new Index and a new mask of the current PIPE, and performing waveform decoding and driving display when the conflict mark is not true according to the new Index and the new mask. The invention also discloses a storage device and a display terminal. The technical scheme of the invention can solve the problem of how to refresh and display the irregular graph without being limited to the minimum rectangular area, and can effectively solve the problem of conflict between the updated areas.

Description

Method for refreshing irregular graph conflict, storage device and display terminal

Technical Field

The invention relates to the field of pixel processing, in particular to a method for refreshing irregular graphs in a collision mode, a storage device and a display terminal.

Background

The microcapsules of the electronic ink screen are filled with transparent medium liquid, a plurality of black and white charged particles are suspended in the liquid, and the distribution of the two black and white charged particles determines the gray scale state of the final display. When an electric field is applied externally across the capsule, the charged electron particles are thus moved by the electric field. When all white ink moves to the surface of the screen, a white picture is displayed; when all the black ink moves to the surface of the screen, displaying a black picture; and when the grey ink is distributed on the surface of the screen in a certain proportion, a grey picture is displayed. By controlling the external electric field, a desired picture can be finally displayed. In particular, when the external electric field is removed from the electronic ink screen, the charged ink can keep a bistable state for a long time, namely, the current displayed picture can be kept for a long time like a paper pattern. The bistable state determines the characteristic of low power consumption of the electronic ink screen, and therefore, the electronic ink screen is widely applied to practical life applications such as electronic books and electronic labels.

The basic steps of refreshing the display image of the current electronic ink screen are firstly obtaining the gray scale information of the image to be displayed, and secondly, carrying out difference comparison on the gray scale information of the image to be displayed and the image displayed last time to obtain the minimum rectangular updating area. For the pixels outside the update area, the waveform data for driving the display is set to 0, i.e. no voltage is applied, so that the gray scale information of the pixels outside the update area is not changed. And for the pixels in the update area, searching a corresponding waveform file according to the change direction of the gray scale information, and acquiring waveform data for driving display, wherein the waveform data represents that positive voltage is applied, negative voltage is applied or no voltage is applied. Finally, all the waveform data are used for driving the electronic ink screen to refresh the display image. Therefore, for a complete update, only the waveform data 0 needs to be set for a portion that does not need to be updated. Therefore, in most cases, the refresh display can be performed simultaneously for a plurality of different update areas. Many current refresh display schemes can support multiple updates and refresh display at the same time, but the update area of most schemes can only be the minimum rectangular area, and the irregular area cannot be well supported, and the conflict influence among multiple refreshes is ignored. For example:

patent document 1(US 008373649B 2) discloses a mechanism for performing multi-region refresh simultaneously. In this scheme, a partial region in the entire image is associated with each update PIPE, and waveform data is generated for each pixel in the corresponding region of each update PIPE. It can be seen that this scheme can only support updates of non-overlapping rectangular regions.

Patent document 2(US 20120194532a1) discloses a mechanism of multi-pipeline parallel refresh that processes in parallel by storing coordinates of display data. But again can only be limited to updates of rectangular areas, for which case the mechanism is not efficiently supported.

Such a mechanism is disclosed in patent document 3(US 20120188272a1), which includes an overlap detector, a collision detector, a configuration processor, and the like. When the overlap detector detects that the pixels in the rectangular updating area overlap in time and space, if the target gray-scale value of the pixels in the current rectangular updating area meets a certain condition, the collision detector sends collision correction to the pixels in the rectangular updating area. Although the mechanism can better solve the problem of conflict refresh among multiple updates, the mechanism is relatively complex, for example, the mechanism needs to judge that current pixels overlap in time and space, needs to reconstruct pixels, and the like. And this mechanism can only be applied to the partial refresh mode.

Disclosure of Invention

In order to solve the above problems, the present invention provides a method for refreshing irregular graphics in a collision manner, a storage device, and a display terminal.

The technical scheme of the invention is realized as follows:

the invention discloses a method for refreshing irregular graphs in a collision way, which comprises the following steps:

A1. configuring information for the current PIPE and acquiring necessary parameters;

A2. acquiring a minimum rectangular display area according to the difference between the new updated image and the last displayed image;

A3. calculating the ratio of the number of pixels with changed gray scales to the total number of pixels in the minimum rectangular display area;

A4. and if the ratio is smaller than the preset threshold value, entering an irregular local refreshing mode, calculating a new Index and a new mask of the current PIPE, and performing waveform decoding and driving display according to the new Index and the new mask when the conflict mark is not true.

Further, step a4 further includes:

and judging whether the ratio is larger than a preset threshold value, if so, entering a regular global refreshing mode to calculate a new Index and a new mask, and when the conflict mark is not true, performing waveform decoding and driving display.

Further, the calculating of the new Index and the new mask by the regular global refresh method specifically includes:

acquiring a pixel value, a state value mask and an index under a current coordinate;

and if the current pixel is in the rectangular area and the mask state value is equal to the maximum value, calculating the new index of the current pixel, setting the new mask value as the sequence number of the current PIPE and refreshing all the current pixels.

Further, the irregular local refresh method specifically includes:

and if the current pixel is in the rectangular area, the mask state value is equal to the maximum value, and the new pixel value is changed compared with the last displayed pixel value, setting a new mask as the sequence number of the current PIPE, calculating the new index of the current pixel, and refreshing all current pixels.

The invention discloses a storage device, wherein a plurality of instructions are stored, the instructions are suitable for being loaded and executed by a processor, and the instructions are as follows:

Further, step a4 further includes:

and judging whether the ratio is larger than a preset threshold value or not, if so, entering a regular global refreshing mode, calculating a new Index and a new mask, and when the conflict mark is not true, performing waveform decoding and driving display.

Further, the irregular local refresh method specifically includes:

The invention discloses a display terminal, comprising: the processor is suitable for realizing all instructions, and the storage device is the storage device.

The method for refreshing the irregular graph in the conflict, the storage device and the display terminal have the following beneficial technical effects:

compared with the prior art, most of the current technical schemes can only refresh and display by directly updating the pixels of the minimum rectangular area, and the technical scheme provided by the invention can solve the problem of how to refresh and display irregular graphs without being limited to the minimum rectangular area and can effectively solve the problem of conflict between the updated areas.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.

FIG. 1A is a flowchart of a method for conflict refresh of irregular patterns according to an embodiment of the present invention;

FIG. 2A is a schematic diagram of a full white image currently being displayed;

FIG. 2B is a diagram of a new update PIPE₀A schematic of an image to be refreshed;

FIG. 2C Next New update PIPE₀A schematic of an image to be refreshed;

FIG. 3 is an expanded flow chart of the embodiment of FIG. 1A applied to the present invention;

FIG. 4 is a flowchart of the calculation of new index and new mask using the global refresh mode of rules;

FIG. 5 is a flow chart of waveform decoding and driving display;

FIG. 6 is a flowchart of calculating a new index and a new mask using an irregular partial refresh scheme;

FIG. 7 is a block diagram of a memory device according to an embodiment of the present invention;

fig. 8 is a schematic block diagram of a display terminal according to an embodiment of the present invention.

Detailed Description

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

In the practical application of the electronic ink screen, most displayed graphs are irregular, and most of the prior art solutions can only refresh and display by dividing the irregular graphs into the regular minimum rectangular display area. And the minimum rectangular display area is refreshed directly, the following problems exist:

1. under the condition that more pixels are not updated, the bandwidth and the calculation time are easily wasted;

2. subsequent refreshing display delay is easily caused by the problem of update conflict, and the user experience is greatly influenced;

3. patent document 3 provides a good solution to the conflict, but this solution is relatively complicated and not easy to implement. And can only be applied to a partial refresh mode.

Aiming at the defects of the prior art, the invention aims to provide a simple irregular graph conflict refreshing display method. The method is not limited to refreshing of the rectangular area, and a global refreshing mode or a local refreshing mode can be flexibly selected according to the updating condition of the actual pixel. If the ratio of the number of the actually updated pixels to the total number of the pixels in the rectangular display area exceeds a preset threshold value, a global refreshing mode for directly updating the whole rectangular display area is automatically selected, so that the effect of reducing the ghost is achieved. Conversely, if the ratio is less than the predetermined threshold, then an irregular local refresh pattern is automatically selected. A mask state table is introduced under each pixel coordinate and used for judging whether a pixel in the current coordinate is in the refreshing process (whether a conflict situation exists), and then the waveform index and the state table mask in the current coordinate are calculated and updated according to the gray value of a new pixel in the current coordinate and the gray value of a pixel displayed last time. And finally, decoding waveform data of all pixels according to the waveform index, the state table mask and other parameter information, and driving final display of the electronic ink screen. The invention can effectively solve the problem of conflict refreshing display of irregular images, thereby effectively improving the refreshing speed.

Referring to fig. 1A and fig. 3, in an embodiment, a method for conflict refresh of an irregular pattern includes:

as is well known, the refresh display of an electronic ink screen image requires the driving of a plurality of frames of waveform data to finally display the image as required, for example, the typical GC16 refresh mode requires 51 frames of refresh to finally display the image, and the number of frames required for the refresh is determined by the refresh mode.

For convenience of description, the update request issued by each upper layer is defined as "PIPE". It is disclosed in patent document 3(US 20120188272a1) that when a pixel is being updated to a target gray level G1 from the current PIPE, another PIPE cannot update the pixel to another target gray level G2(G1 is not equal to G2) until the current PIPE refresh is completed. Because the refreshing of the electronic ink screen depends on the gray scale displayed last time, and the gray scale displayed last time is in an unstable state at the moment, the initial gray scale is uncertain. The waveform data stored in the waveform file provided by the E-ink can only drive one pixel to refresh from a fixed initial gray level to another fixed target gray level. Therefore, if the pixel needs to be refreshed to another target gray level G2, it is necessary to wait for the current pixel to be refreshed after the current pixel is refreshed, and then apply the waveform data from the current target gray level G1 to another target gray level G2 to the pixel for refreshing. It is for this reason that directly updating all pixels within the smallest rectangular area tends to make subsequent new updates impossible to perform immediately due to collisions, thus resulting in a delay in the time to refresh the display. For example:

as shown in FIG. 2A, assuming that the currently displayed image is all white, a new updated PIPE₀The image to be refreshed is one month, as shown in fig. 2B. The minimum rectangular area calculated from the difference between the two is a rectangular area surrounded by a dotted line in fig. 2B. It is clear that in this rectangular display area only the gray "moon" needs to be updated, and the other mostly white parts are unchanged. However, most of the current schemes can only update all pixels in the whole rectangular display area, i.e. the white part also needs to be updated forcibly. In practice, only the "moon" part of the grey colour needs to be updated. In addition, if during the "moon" process of updating this gray color, the next new PIPE update occurs₁As shown in fig. 2C, the smallest rectangular display area obtained from the difference compared with fig. 2B appears as a rectangular area surrounded by a dotted line. As is apparent from FIG. 2C, in PIPE₁Only the grey "crosses" need to be updated, while the other large number of white pixels do not need to be updated. Put it back, even if PIPE₁All pixels including the white portion need to be updated, but as previously described, the PIPE is now present₁Will be due to the current PIPE₀The inner white part is being forcedUpdate to enable PIPE₁Cannot start, must wait until the PIPE₀The update is complete and can continue. And in fact, PIPE₁The white portion of (A) need not be updated at all, and thus PIPE₁All pixels of (a) can then be directly updated at all.

Step a4 further includes:

Calculating a new Index and a new mask by a regular global refreshing mode, and specifically comprising the following steps:

The irregular local refresh mode specifically includes:

Referring to fig. 3, 4, 5 and 6, the following details are described:

in the present invention, unlike this approximation scheme, the present invention has no concept of temporal and spatial overlap at all, nor does it require reconstruction of pixels. For whether the new update needs to be updated, the invention only needs to judge the conflict condition under the current coordinate through the value of the introduced state bit mask, the target gray value of the new update pixel and the current gray value.

The innovation is that: the invention provides a simple irregular graph conflict refreshing method, wherein a state table mask is introduced and used for judging whether a pixel is in a refreshing process (whether a conflict situation exists) or not in a current coordinate and serving as a basis for acquiring waveform data in a current updating area. By using the introduced state table mask, the conflict situation of the pixels under the current coordinate can be easily judged, and the irregular graphs can be processed without being limited to the minimum rectangular area which needs to be updated because the state table mask is specific to the pixel level. On the other hand, the invention can determine to adopt a regular global refreshing mode or an irregular local refreshing mode according to the updating condition of the pixel, and better considers the refreshing speed and reduces the ghost shadow.

Wherein, fig. 3 shows a basic flow of the irregular graph conflict refresh display method of the present invention. When a new PIPE is issued, the waveform data is output after the process is carried out, and finally the electronic ink screen is driven to display the image. The basic flow of the invention is as follows:

information is first configured for the current PIPE and necessary parameters are acquired at step S1. The required configuration parameters are included: assuming that the serial number of the current PIPE is configured to be i, the first address of the waveform lookup table is LUT_iNumber of frames F that need to be refreshed_i(ii) a The parameter information to be acquired includes: global state table mask, global index, and new updated image gray-scale information p_updAnd gray scale information p of the last display image_last. Wherein:

PIPE_iindicating that the new update request is handled by the channel labeled i. Wherein the value range of i belongs to [0, N ]]N determines the maximum number of simultaneous update requests, the value of which is determined by the system requirementsSetting, for example, if a maximum of 64 PIPE are currently supported, N is equal to 63; for convenience of description, the currently configured PIPE number is assumed to be i in the following.

The global state table mask is used for judging a conflict situation and decoding waveform data. A mask value is assigned to each pixel. The value range is that mask belongs to [0, mask ∈_max]Wherein mask_maxN + 1. When mask < mask_maxTime indicates that the current coordinate is being processed by PIPE_maskThe channel updates the pixel, and other PIPEs cannot update; when mask is equal to mask_maxWhen the current coordinate is in the idle state, the current coordinate can be updated; the mask value for each pixel of the "Global State Table mask" is initialized to the maximum value mask before the first boot update_maxThen, acquiring a current mask state table before updating and starting each time;

the global index is used for searching the index number of the waveform file so as to acquire the waveform data. Also, each pixel needs to correspond to an index. As can be seen from the waveform file provided by the E-ink, under a 16-gray image, the index size is 8 bits, i.e., the value range is [0,255], wherein the upper 4 bits store the "gray level of the displayed pixel", and the lower 4 bits store the "gray level of the displayed or displaying pixel".

For a 32 gray level image, the index size is 10 bits, i.e., the value range is [0,1024], where the upper 5 bits store the "gray level of the displayed pixel" and the lower 5 bits store the "gray level of the displayed or displaying pixel". The value of each pixel index of "global index" is initialized to the maximum value before the first start of updating, i.e. index is 255 or 1024; indicating that the last displayed image was "all white". For convenience, the following description is assumed to be performed under a 16-gray-scale image.

Gray-scale information p of new updated image_updFrom the new updated image. It is to be noted that "gradation information p of the last displayed image_last"can be obtained from the lower 4 bits of index.

In step S2, the difference between the gray levels of the pixels in the new updated image and the previous image is compared to calculate the minimum rectangular display areaAnd O, expressed by the coordinates of the upper left corner and the coordinates of the lower right corner. For example, FIG. 2B is represented as the top left corner vertex (x) relative to the smallest rectangular display area of FIG. 2A₀,y₀) And the lower right corner vertex (x)₁,y₁) The surrounding area, i.e.

O＝{(x,y)|x₀＜＝x＜＝x₁,y₀＜＝y＜＝y₁}。

In step S3, the number N of pixels in the rectangular display area O obtained in step S2, the gray level of which is to be changed by the new updated pixel, is counted_cAnd the total number of pixels N_t。

In step S4, the number N of pixels to be changed is obtained according to step S3_cAnd the total number of pixels N_tCalculating the ratio of the two

And make the ratio of the two

And comparing with a preset threshold value T. If it is

Then go to step S5, and use the regular global refresh method to calculate the new index _ new and the new state value mask _ new of the pixel in the current rectangular update area. The sub-flow of step S5 is shown in fig. 4. In the sub-flow of step S5, the entire update image needs to be processed pixel by pixel in a manner of raster scanning:

『

first, in sub-flow step S1, a gray scale value p of coordinates (x, y) of a new pixel is obtained_upd(x, y), and mask at the current pixel coordinate_(x,y)Value and index_(x,y)The value is obtained.

Then, in the sub-flow step S2, it is determined whether the current pixel coordinate is outside the rectangular display area O, if so

Skipping the pixel and turning to the sub-pixelThe flow proceeds to step S1 where the next pixel is retrieved. If (x, y) e O, then go to sub-flow step S3: mask for judging current coordinate_(x,y)Whether the value is equal to the maximum value mask_max. If mask_(x,y)＝mask_maxIf no PIPE update is present at the current coordinates, then the flow may continue to sub-flow step S4.

In sub-flow step S4, a new index _ new for the current pixel is calculated_(x,y)The calculation formula is:

and sets a new mask _ new at the current coordinate_(x,y)For the current PIPE_iThe sequence number of (a) is:

mask_new_(x,y)＝i

then, the flow proceeds to sub-flow step S6: and judging whether the current pixel is the last pixel, if not, the sub-flow goes to the step S1, and the next pixel is continuously operated repeatedly. Otherwise, go to sub-process step S7: it is determined whether the conflict flag is true. If the conflict flag is true, the sub-process ends. Otherwise, go to sub-process step S8: the new index _ new to be calculated in the sub-flow step S4_(x,y)And mask _ new_(x,y)And updating the global parameters of mask and index, and ending the sub-process.

Returning to step S3 of the sub-flow of the global refresh mode, if the mask is determined_(x,y)＜mask_maxThen it means that there is a mask sequence number in the current coordinate_(x,y)The PIPE is updating the pixel with the current PIPE_iA conflict is created. Go to sub-flow step S5, set conflict flag_collIs true, and the current mask is set_(x,y)The value is recorded in the collision index coll _ index, and the flow continues to the sub-flow step S6 until the sub-flow ends.

Through the sub-processes, the new index _ new without conflict is finally determined_(x,y)And mask _ new_(x,y)Or a conflict is determined to exist.

』

After the sub-process of step S5 is completed, the flow goes to step S7 to determine the conflict flag_collWhether it is true. If flag_collIf true, go to step S8: the current PIPE must wait until the sequence number is mask_(x,y)After the PIPE refreshing is finished, the updating is issued again; otherwise, the flow advances to a sub-flow of step S11: waveform decoding and driving display. The sub-flow of waveform decoding and driving display is shown in fig. 5.

『

In sub-flow step S1: signals for decoding a frame are continuously acquired. If the acquisition is successful, the flow goes to sub-flow step S2.

In sub-flow step S2: and sequentially and one by one according to the scanner scanning mode and the mask state of the pixels under the current coordinate to obtain the current decoding frame number CurF in the current PIPE.

In sub-flow step S3: decoding the waveform data WD pixel by pixel according to the latest global parameters mask and index, and the LUT of the current PIPE and the parameter information of the current frame CurF corresponding to the mask value, wherein the method comprises the following steps:

if mask_(x,y)＝mask_maxThen, then

WD_(x,y)＝0

If not, then,

WD_(x,y)＝index_(x,y)+LUT_j+CurF_j*offset

wherein j is mask_(x,y)Offset is 256. It should be noted that it is currently assumed that under a 16 gray level image, the lookup table offset is 256. If the image is 32 gray scale image, the lookup table offset should be 1024.

In sub-flow step S4: all of the decoded waveform data may be used to drive an electronic ink screen display.

In sub-flow step S5: and judging whether the frame is the last frame of the current PIPE. Comparing the current frame with the total frame number, wherein the total frame number is F_jIt is acquired in step S1 of "basic flow of embodiment of the present invention". Thus if CurF_j＝F_jThen, it indicates that the refresh is complete, and the flow goes to the final step S6. OtherwiseProceed to subroutine step S1.

In sub-flow step S6: when the current PIPE is refreshed, the mask states of all updated pixels in the current PIPE are required to be reset to be maximum value masks_maxTo ensure that the next new update can be refreshed normally.

』

Returning to step S4, if yes, judging

The flow goes to step S6, and a new index _ new and a new state value mask _ new of the pixel in the current rectangular update area are calculated by using the irregular local refresh method. Step S6 sub-flow as shown in fig. 6, in the sub-flow of step S5, the entire update image needs to be processed pixel by pixel in the manner of raster scan:

『

first, in sub-flow step S1, coordinates (x, y) and gray value p of a new pixel are obtained_upd(x, y), and mask at the current pixel coordinate_(x,y)Value and index_(x,y)The value is obtained.

In the sub-flow step S2, it is determined whether the current pixel is outside the rectangular display area O, if so

The pixel is skipped and the process goes to step S1 to retrieve the next pixel. If (x, y) ∈ O, go to step S3:

at sub-flow step S3, mask is judged_(x,y)Whether the value is equal to the maximum value mask_max. If mask_(x,y)＝mask_maxIf it indicates that there is no PIPE update at the current coordinates, the flow may continue to sub-flow step S4:

at sub-flow step S4 a new pixel value p is determined_upd(x, y) whether to sum with the last pixel p displayed_last(x, y) is changed, p_lastThe information of (x, y) has been stored in index_(x,y)In, p_lastThe calculation method of (x, y) is as follows:

if p is_upd(x,y)＝p_last(x, y), indicating that the pixel value has not changed, the flow goes to sub-flow step S5: setting mask _ new_(x,y)＝mask_max(ii) a Otherwise, indicating that the pixel value has changed, flow passes to sub-flow step S6: setting mask _ new_(x,y)For the currently configured PIPE_iSequence number, i.e. mask _ new_(x,y)＝i。

At sub-flow step S7, a new index _ new is calculated_(x,y)The calculation method is consistent with equation (1).

In the sub-process step S10, if the current pixel is not the last pixel, the sub-process goes to step S1 to retrieve the next pixel. Otherwise, the sub-flow goes to step S11. And updating the calculated new index _ new and the new state value mask _ new into the global parameter index and the mask. The sub-process ends.

On the other hand, the sub-flow returns to step S3, and if it is determined that the mask is present_(x,y)＜mask_maxThen it means that there is a mask sequence number in the current coordinate_(x,y)Is updating the pixel. The sub-process goes to step S8 to determine the new pixel value p_upd(x, y) whether to sum with the last pixel p displayed_last(x, y) is changed. p is a radical of_lastThe calculation of (x, y) coincides with expression (2) in expression substep S4.

If p is_upd(x,y)＝p_last(x, y), indicating that the pixel value has not changed, the sub-process goes to step S1. Otherwise, indicating that the pixel value has changed, the sub-flow proceeds to step S9.

In sub-flow step S9, the current pixel is considered to be associated with a sequence number mask_(x,y)So that the conflict flag is set to true and the sequence number mask of the current PIPE is recorded_(x,y)To the collision index coll _ index and updates the minimum collision area O_coll. Suppose O_coll＝{(x,y)|x₀＜＝x＜＝x₁,y₀＜＝y＜＝y₁}，x₀、y₀、x₁、y₁Respectively is the abscissa of the top left corner vertex, the ordinate of the top left corner vertex, the abscissa of the bottom right corner vertex and the ordinate of the bottom right corner vertex. The minimum collision area O_collThe update method of (1) is as follows:

x₀＝min(x,x₀)

y₀＝min(y,y₀)

x₁＝max(x,x₁)

y₁＝max(y,y₁)

note that O is the first time a conflicting pixel occurs_collThe top left corner vertex and the bottom right corner vertex of (1) are the coordinates of the first-time collision pixel. Otherwise, the minimum conflict area O is updated according to the above_coll

Next, the sub-flow proceeds to step S10. And circulating the steps until the sub-process is finished.

』

After the sub-process of step S6 is completed, the flow goes to step S9 to determine whether the conflict flag is true. If the conflict flag is true, go to step S10: once the PIPE recorded by the conflict index coll _ index is refreshed, the remaining minimum conflict area can be issued again as a new PIPE to complete the display of the remaining conflict part; on the other hand, if the conflict flag is not true, the process proceeds to the sub-flow of step S11, which is identical to the above.

To sum up: the technical scheme is characterized in that:

1) and the introduced state table mask is used for judging whether a pixel in the current coordinate is in the refreshing process (whether a conflict situation exists). By using the introduced state table mask, the judgment of the pixel conflict situation under the current coordinate is more convenient and simpler, and the state table mask is specific to the pixel level, so that irregular graphs can be processed without being limited to the minimum rectangular area which needs to be updated.

2) And a regular global refreshing mode or an irregular local refreshing mode is determined in a self-adaptive manner according to the updating condition of the pixel, so that the refreshing speed and the ghost can be reduced well.

3) The basic flow of the embodiment of the invention comprises the flow of calculating the new index and the new mask in a global refreshing mode and the flow of calculating the new index and the new mask in a local refreshing mode, and comprises the methods of condition judgment, conflict and the like.

Compared with the prior art, the invention has the following advantages:

1) better solves the problem of refreshing and displaying irregular graphs

2) The conflict problem is effectively solved, and the conflict judgment is simpler. And therefore, the system bandwidth is reduced, and the refreshing speed is increased.

3) Adaptive selection of global or local refresh mode

The invention determines to adopt a global or local refreshing mode according to the comparison of the proportion of the updated pixels to the total pixels and a preset threshold value. This step can freely adopt other implementation modes to decide the refreshing mode, but the final judgment result does not influence the result of the invention.

Referring to fig. 7, a memory device 10 is provided in which a plurality of instructions are stored, the instructions being adapted to be loaded and executed by a processor to:

Step a4 further includes:

The irregular local refresh mode specifically includes:

Referring to fig. 8, a display terminal 100 includes: a processor 200 and a storage device, the processor 200 being adapted to implement the instructions, the storage device being the storage device 10 described above.

The display terminal 100 may be a device applied to various E-ink screen display related devices, such as an electronic book, a billboard, an electronic tag, and the like.

As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart or block diagram block or blocks.

While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.

It will be apparent to those skilled in the art that various modifications and variations can be made in the embodiments of the present invention without departing from the spirit or scope of the embodiments of the invention. Thus, if such modifications and variations of the embodiments of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to encompass such modifications and variations.

Claims

1. A method for conflicting refreshing of irregular graphics, comprising:

A4. if the ratio is smaller than the preset threshold value, entering an irregular local refreshing mode, calculating a new Index and a new mask of the current PIPE, and performing waveform decoding and driving display according to the new Index and the new mask when the conflict mark is not true,

the PIPE is an update request issued by each upper layer, the Index is a waveform Index under each pixel coordinate and is used for decoding waveform data, and the mask is a state table used for judging the conflict situation of pixels under the current coordinate;

the necessary parameters include: the global state table mask, the global index, the gray scale information of the new updated image and the gray scale information of the last displayed image;

the Index has the following value ranges:

under a 16 gray scale image, the value range is [0,255 ];

under 32 gray-scale images, the value range is [0,1024 ];

the value range of the mask is as follows: mask ∈ [0, mask max ], where mask max is N +1, and N is the maximum number of update requests to be performed simultaneously.

2. The method of claim 1, wherein step a4 further comprises: and judging whether the ratio is larger than a preset threshold value, if so, entering a regular global refreshing mode to calculate a new Index and a new mask, and when the conflict mark is not true, performing waveform decoding and driving display.

3. The method according to claim 2, wherein the calculating of the new Index and the new mask by the regular global refresh method specifically comprises:

acquiring a pixel value, a state value mask and an index under a current coordinate; and if the current pixel is in the rectangular area and the mask state value is equal to the maximum value, calculating the new index of the current pixel, setting the new mask value as the sequence number of the current PIPE and refreshing all the current pixels.

4. The method according to claim 1, wherein the irregular local refresh pattern comprises:

acquiring a pixel value, a state value mask and an index under a current coordinate; and if the current pixel is in the rectangular area, the mask state value is equal to the maximum value, and the new pixel value is changed compared with the last displayed pixel value, setting a new mask as the sequence number of the current PIPE, calculating the new index of the current pixel, and refreshing all current pixels.

5. A memory device having stored therein a plurality of instructions, the instructions adapted to be loaded and executed by a processor to:

s1, configuring information for the current PIPE and acquiring necessary parameters;

s2, acquiring a minimum rectangular display area according to the difference between the new updated image and the last displayed image;

s3, calculating the ratio of the number of pixels with changed gray scales in the minimum rectangular display area to the total number of pixels;

s4, if the ratio is smaller than a preset threshold value, entering an irregular local refreshing mode, calculating a new Index and a new mask of the current PIPE, and performing waveform decoding and driving display according to the new Index and the new mask when the conflict mark is not true,

the Index has the following value ranges:

under a 16 gray scale image, the value range is [0,255 ];

under 32 gray-scale images, the value range is [0,1024 ];

6. The storage device according to claim 5, wherein step S4 further comprises: and judging whether the ratio is larger than a preset threshold value or not, if so, entering a regular global refreshing mode, calculating a new Index and a new mask, and when the conflict mark is not true, performing waveform decoding and driving display.

7. The storage device according to claim 5, wherein the calculating of the new Index and the new mask by the regular global refresh method specifically includes:

acquiring a pixel value, a state value mask and an index under a current coordinate; if the current pixel is in the rectangle

And when the mask state value is equal to the maximum value in the region, calculating the new index of the current pixel, setting the new mask value as the sequence number of the current PIPE, and refreshing all current pixels.

8. The memory device according to claim 5, wherein the irregular partial refresh pattern specifically comprises: acquiring a pixel value, a state value mask and an index under a current coordinate; and if the current pixel is in the rectangular area, the mask state value is equal to the maximum value, and the new pixel value is changed compared with the last displayed pixel value, setting a new mask as the sequence number of the current PIPE, calculating the new index of the current pixel, and refreshing all current pixels.

9. A display terminal, comprising: a processor and a memory device, the processor being adapted to implement instructions, wherein the memory device is the memory device of any one of claims 5 to 8.