CN101159125B - Method for detecting data variation - Google Patents
Method for detecting data variation Download PDFInfo
- Publication number
- CN101159125B CN101159125B CN200710031275A CN200710031275A CN101159125B CN 101159125 B CN101159125 B CN 101159125B CN 200710031275 A CN200710031275 A CN 200710031275A CN 200710031275 A CN200710031275 A CN 200710031275A CN 101159125 B CN101159125 B CN 101159125B
- Authority
- CN
- China
- Prior art keywords
- scanning
- buffer
- site
- display
- scanned
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Control Of Indicators Other Than Cathode Ray Tubes (AREA)
Abstract
The invention relates to a data processing method, specifically to a method for detecting data change, which comprises following steps: (1) selecting a region having the same size as a display buffer block to be detected as a comparison buffer block, and dividing both the display buffer block and the comparison buffer block into a large grid pattern consisting of K (M multiplied by N) grid patterns; and (2) scanning the grids of the display buffer block and the comparison buffer block in different turns in such a manner that K scanning processes are executed in each turn and 1/K grid content of two corresponding buffer blocks are scanned respectively in each scanning process, which includes determining whether the contents of the corresponding grids on the two buffer blocks are identical by comparing the grids one by one, wherein the content that has been scanned in the turn is not scan repeatedly, and K, M and N are integers. The method is simple and convenient and has the prominent advantages of high efficiency and less resource occupation.
Description
[technical field]
The present invention relates to data processing, be specifically related to the method that a kind of detecting data changes.
[background technology]
Need constantly to scan the demonstration situation of change of display buffer in the use of computing machine, described display buffer is meant pairing pixel data memory when showing in the display.24 colors are meant that color is all used a byte representation in the red, green, blue three, and every kind of color depth is 256 grades.Generally represent at calculator memory, perhaps claim 32 colors with nybble.The 4th byte generally need not or be used for doing monochrome information.For thirty-two bit computer, most of computing is all finished with 32 bit data, and memory setting, bus setting and register etc. all are 32, so computing machine is the highest to 32 bit data efficient.For storer, we wish that CPU once reads or to write data The more the better.Popular computer memory highway width is 128 at present, is equivalent to 4 32, can once deposit or get 4 32 pixels.But the cpu cycle that computing machine takies when 64 of processing or 128 bit data is long, so influence the travelling speed of refresh rate and server.
Application number is 200510034435.9, the name be called " a kind of " based on server end/client terminal structure remote display processing method patent disclosure a kind of remote display processing method, it mainly is the technology that the data of adjacent position in server end adopts special interframe increment compression and frame are relatively compressed, and then, improve the occupancy of refresh rate and reduction resource for computer system in the method that the mode of customer end adopted incremental refreshment is carried out the image demonstration.But this method still exists and takies more resource of computing machine and the fast inadequately shortcoming of refresh rate.
[summary of the invention]
The method that provides a kind of detecting data simple and convenient, that efficient is high and resource occupation is few to change is provided in order to overcome above-mentioned shortcoming and defect of the prior art.For achieving the above object, the present invention adopts following technical scheme:
The method that a kind of detecting data changes may further comprise the steps:
(1) open up and the display buffer block zone of a size that will detect buffer blocks as a comparison, with the display buffer block and relatively buffer blocks all be divided into the big half-tone of forming by the half-tone of K M * N;
(2) site of dividing wheel scan display buffer piece then and comparing buffer blocks, every branch of taking turns scans for K time, scan the display buffer block at every turn respectively and compare the content of the corresponding K of buffer blocks/site, described scanning is whether the content of corresponding each site on above one by one two buffer blocks is the same, during each scanning, scanned no longer multiple scanning of content in the epicycle, described K, M and N are positive integers;
Described each scanning is the scanning of satisfying following two conditions at least:
1. have at least any to be scanned in M the laterally continuous arbitrarily site;
2. have at least any to be scanned in N the vertically continuous arbitrarily site;
3. have at least a site to be scanned in [M/2+1] * [N/2+1] matrix arbitrarily.
Described step (1) is preceding also can to comprise the steps: to open up a same big zone with the display buffer that will detect buffer zone as a comparison, (1) described method all is divided into several corresponding buffer blocks with display buffer and comparison buffer zone then set by step, each buffer blocks all is divided into the big half-tone of being made up of K M * N half-tone again.
Described step also can may further comprise the steps in (2): step (2) if in find in corresponding two buffer blocks that some positions change arbitrarily during each scanning, be that a certain size square scope of center scans comprehensively one by one then to this position, with the corresponding relatively data of buffer zone of all vicissitudinous Data Update of this square scope, and it is all vicissitudinous data of this square scope are compressed or do not compress, send to client immediately or send to client when this scanning or the epicycle end of scan, described square scope does not comprise that this or epicycle carried out the part of scanning.
Described a certain size square scope is the square scope of 256 * 256 to 1024 * 768 sizes.
A described site can unify correspondence or 1,2,4,8 or 16 pixel is represented in unification.
Compared with prior art, the present invention has following beneficial effect:
One, the present invention realizes easily because method is simple;
Two, the present invention can call the single pass program during free time or by certain frequency in system, whenever call K scanning sequence and finish a wheel scan, if data variation is not all found in each scanning of epicycle, illustrate that then this display buffer does not have update content in this scan period; If certain scanning discovery has data variation, illustrate that then this display buffer does not have update content in this scan period.So just do not need to wait until that buffer zone is just known the variation whether display message is arranged after relatively finishing one by one one by one, thereby shortened the time of detecting greatly;
Three, the present invention can significantly reduce the taking of computing machine precious resources because the detecting time is short, and computing machine can move more or bigger application software, comprises that internal memory or cpu resource take bigger application software.
[description of drawings]
Fig. 1 be when using method of the present invention buffer zone being detected to the scanning process synoptic diagram of each 4 * 4 sites scanning, each site synoptic diagram all has 44 * 4 the same half-tones (wherein A is that the 1st scanning site synoptic diagram, B are that the 2nd scanning site synoptic diagram, C are that the 3rd scanning site synoptic diagram, D are the 4th scanning site synoptic diagram);
Fig. 2 is the 1st scanning site synoptic diagram during to the scanning of each 9 * 9 site when using method of the present invention buffer zone being detected, and this site synoptic diagram is the same by 4, and 9 * 9 half-tones that are used for the 1st scanning are formed;
Fig. 3 is the 6th scanning site synoptic diagram during to the scanning of each 9 * 9 site when using method of the present invention buffer zone being detected, and this site synoptic diagram is the same by 4, and 9 * 9 half-tones that are used for the 6th scanning are formed.
Fig. 4 be when using method of the present invention buffer zone being detected to the scanning process synoptic diagram of each 4 * 3 sites scanning, each site synoptic diagram all has 44 * 3 the same half-tones (wherein A is that the 1st scanning site synoptic diagram, B are that the 2nd scanning site synoptic diagram, C are the 3rd scanning site synoptic diagram);
[embodiment]
Below enumerate specific embodiments of the invention, further specifying the present invention, but protection scope of the present invention is not limited in this.
Embodiment 1
The method that a kind of detecting data changes may further comprise the steps:
(1) opens up the same big zone buffer zone as a comparison with the display buffer that will detect, then display buffer and comparison buffer zone all are divided into several corresponding buffer blocks, again each buffer blocks all are divided into the big half-tone of forming by K M * N half-tone;
(2) site of dividing wheel scan display buffer piece then and comparing buffer blocks, every branch of taking turns scans for K time, scan the display buffer block at every turn respectively and compare the content of the corresponding K of buffer blocks/site, described scanning is whether the content of corresponding each site on above one by one two buffer blocks is the same, during each scanning, scanned no longer multiple scanning of content in the epicycle, described K, M and N are positive integers.
Step (2) if in find in corresponding two buffer blocks that some positions change arbitrarily during each scanning, be the center to this position then scans in 256 * 256 to 1024 * 768 square scope comprehensively one by one, with all vicissitudinous data of this square scope, upgrade the relatively data of buffer zone, and it is compressed or do not compress, send to client when this scanning or the epicycle end of scan, described square scope does not comprise that this or epicycle carried out comprehensively the part of scanning one by one.
Described each scanning is the scanning of satisfying following two conditions at least:
1. have at least any to be scanned in M the laterally continuous arbitrarily site;
2. have at least any to be scanned in N the vertically continuous arbitrarily site;
3. having at least a site to be scanned in [M/2+1] * [N/2+1] matrix arbitrarily.
A described site can unify correspondence or 1,2,4,8 or 16 pixel is represented in unification.
Described display buffer is meant pairing pixel data memory when showing in the display, and described relatively buffer zone is the storer of the display buffer content after the storage recent renewal, has relation one to one with the display buffer.During beginning, need copy to the comparison buffer zone to the display buffer total data, carry out comprehensively upgrading the relatively content of buffer zone according to the variation of display buffer in the scanning process one by one afterwards.The position of supposing the corresponding display of data order of these two buffer stores is earlier from left to right, and then from top to bottom.What the display buffer began is the corresponding display of first pixel upper left corner; The corresponding display of last pixel lower right corner.The display first line content displayed is stored in the display buffer and begins part.
Embodiment 2 Application Examples 1 described method is detected the display buffer
Each display buffer block and comparison buffer blocks all are divided into the big half-tone of being made up of 44 * 4 net point net point diagram, scan the content of 1/4th sites, display buffer at every turn, other press the described step operation of embodiment.Each scanning site as shown in Figure 1; Fig. 1 is the method for Application Example 1 scanning process synoptic diagram to each 4 * 4 sites scanning when the display buffer is detected, and each site synoptic diagram all has 44 * 4 the same half-tones (wherein A is that the 1st scanning site synoptic diagram, B are that the 2nd scanning site synoptic diagram, C are that the 3rd scanning site synoptic diagram, D are the 4th scanning site synoptic diagram);
The site of black will be scanned when this scans, and blank site is not scanned.We stack up these 4 times scanning sites and see that each site of 4 * 4 sites all has been covered to.
If whole buffer zone can not be divided exactly by 4, then rest parts from each corresponding half-tone keep left, by last or keep left on part scan.
For the purpose of simple and convenient, the K time scanning half-tone is that first row of the K-1 time scanning half-tone are put into last row back.
Embodiment 3 Application Examples 1 described method is detected the display buffer
Press embodiment 1 described step, wherein, the resolution of display buffer is 25600 * 3072, and color depth is 32, promptly uses 4 byte representations, is divided into the buffer blocks that 4 row, 25 row are formed, and the resolution of each buffer blocks is 1024 * 768.Open up one with the same big zone, the display buffer that will detect (25600 * 3072 * 4=314572800 byte) buffer zone (also being 314572800 bytes) as a comparison, each display buffer block and comparison buffer blocks all are divided into the big half-tone of being made up of 99 * 9 half-tones, a pixel is represented in each site, these 9 big half-tones are respectively applied for 9 scanning, the site of dividing the corresponding display buffer of wheel scan then and comparing buffer zone, every branch of taking turns scans for 9 times, the content of each each buffer blocks 1/9th of scanning, described scanning is whether the corresponding site content of corresponding blocks of above one by one two buffer zones is the same, and described corresponding site is meant above two positions that buffer zone is identical.
Call the single pass program when system is idle or by certain frequency, whenever call 9 scanning sequences and finish a wheel scan,, illustrate that then this display buffer does not have update content in this scan period if data variation is not all found in each scanning of epicycle; If certain scanning discovery has data variation, illustrate that then this display buffer does not have update content in this scan period.
Fig. 2 is the 1st scanning site synoptic diagram during to the scanning of each 9 * 9 site when using method of the present invention buffer zone being detected, and this site synoptic diagram is the same by 4, and 9 * 9 half-tones that are used for the 1st scanning are formed;
Fig. 3 is the 6th scanning site synoptic diagram during to the scanning of each 9 * 9 site when using method of the present invention buffer zone being detected, and this site synoptic diagram is the same by 4, and 9 * 9 half-tones that are used for the 6th scanning are formed.
Be noted that 1024 and 768 all can not be divided exactly by 9, remaining respectively 7 and 3 points, then rest parts from each corresponding half-tone keep left, lean on last or keep left on part scan.
The site of black will be scanned when this scans, and blank site is not scanned.We stack up these 9 times scanning sites and see that each site of 9 * 9 sites all has been covered to.
The renewal situation of change of the corresponding site of buffer blocks is compared in the each scanning back relatively site of each display buffer block of this scanning with each.If finding certain buffer blocks changes, then this buffer blocks is scanned comprehensively one by one, with all vicissitudinous data of this buffer blocks, upgrade the relatively data of buffer zone, and it is compressed or do not compress, when this scanning or the epicycle end of scan, send to client, then scan this remaining buffer blocks again.If finding has data variation on the edge of certain piece, then to the piece adjacent with this edge be scanned comprehensively one by one, and follow-up similar operation.
For the purpose of simple and convenient, the K time scanning half-tone is that first row of the K-1 time scanning half-tone are put into last row back.
Embodiment 4 Application Examples 1 described method is detected the display buffer
Press embodiment 1 described step, wherein, the resolution of display buffer is 25600 * 3072, and color depth is 16, promptly uses 2 byte representations, is divided into the buffer blocks that 4 row, 25 row are formed, and the resolution of each buffer blocks is 1024 * 768.Open up one with the same big zone, the display buffer that will detect (25600 * 3072 * 2=157286400 byte) buffer zone (also being 157286400 bytes) as a comparison, each display buffer block and comparison buffer blocks all are divided into the big half-tone of being made up of 34 * 3 net point net point diagram, horizontal two pixels are represented in each site, corresponding display buffer block of each scanning and the content that compares 1/3rd sites of buffer blocks, other press embodiment 3 described steps operations.Each scanning site as shown in Figure 4; Fig. 4 is the method for Application Example 1 scanning process synoptic diagram to each 4 * 3 sites scanning when the display buffer is detected, and each site synoptic diagram all has 44 * 3 the same half-tones (wherein A is that the 1st scanning site synoptic diagram, B are that the 2nd scanning site synoptic diagram, C are the 3rd scanning site synoptic diagram);
The site of black will be scanned when this scans, and blank site is not scanned.We stack up these 3 times scanning sites and see that each site of 4 * 3 sites all has been covered to.
For the display buffer of forming by 1024 * 768 multiple, laterally can be divided exactly (8 pixels are represented in 4 sites) by 8, vertically can be divided exactly by 3, can not produce remainder.
Other operation reference examples 3 are carried out.
Present PC is obviously compared 16 bit data operation efficiency height to 32 bit data computings, so we represent a site 2 16 pixels proper.When computing machine was compared 32 bit data computing benefits and obviously improved 64 bit data computings, we can represent horizontal 2 32 pixels to a site equally, perhaps, can represent horizontal 4 16 pixels to a site.Equally, during for 128 or 256 bit machines, we can be the laterally more a plurality of pixels of site representative.In a word, a site can be unified correspondence or unify to represent 1,2,4,8 or 16 pixel.
In the jumbotron spliced display wall, we often find that major part is indeclinable pixel, and fraction changes, and individual areas is to need playing animation.Indeclinable pixel region is many more, and effect of the present invention is just obvious more.Make the concentrate one's energy content of processing variation of computing machine, animation information is in time shown in client, realize refresh rate faster as far as possible.On the contrary, the pixel of variation is many more, and this way also detects the content of variation more soon, and the present invention can the additional significant increase detecting time.
The above only is preferred embodiment of the present invention, in fact, for the bigger spliced display wall of display area, spliced display wall can be divided into several zones, and handle in order to last method separately in each zone again; The present invention also can be applied to the big buffer zone of other types, and relatively whether this buffer zone is updated, thereby makes the relevant action after the timely response buffering of computing machine district changes; Also can select multiple different form or the like, protection scope of the present invention is not limited thereto, and those of skill in the art are any to be included within protection domain of the present invention based on non-material change on the technical solution of the present invention.
Claims (5)
1. the method that detecting data changes is characterized in that, may further comprise the steps:
(1) open up and the display buffer block zone of a size that will detect buffer blocks as a comparison, with the display buffer block and relatively buffer blocks all be divided into the big half-tone of forming by the half-tone of K M * N;
(2) site of dividing wheel scan display buffer piece then and comparing buffer blocks, every branch of taking turns scans for K time, scan the display buffer block at every turn respectively and compare the content of the corresponding K of buffer blocks/site, described scanning is whether the content of corresponding each site on above one by one two buffer blocks is the same, during each scanning, scanned no longer multiple scanning of content in the epicycle, described K, M and N are positive integers;
Described each scanning is the scanning of satisfying following two conditions at least:
1. have at least any to be scanned in M the laterally continuous arbitrarily site;
2. have at least any to be scanned in N the vertically continuous arbitrarily site;
3. have at least a site to be scanned in [M/2+1] * [N/2+1] matrix arbitrarily.
2. the method that a kind of detecting data according to claim 1 changes, it is characterized in that, described step (1) is preceding also to comprise the steps: to open up a same big zone with the display buffer that will detect buffer zone as a comparison, (1) described method all is divided into several corresponding buffer blocks with display buffer and comparison buffer zone then set by step, each buffer blocks all is divided into the big half-tone of being made up of K M * N half-tone again.
3. the method that a kind of detecting data according to claim 1 and 2 changes, it is characterized in that, further comprising the steps of: step (2) if in find in corresponding two buffer blocks that some positions change arbitrarily during each scanning, be that a certain size square scope of center scans comprehensively one by one then to this position, with the corresponding relatively data of buffer zone of all vicissitudinous Data Update of this square scope, and it is all vicissitudinous data of this square scope are compressed or do not compress, send to client immediately or send to client when this scanning or the epicycle end of scan, described square scope does not comprise that this or epicycle carried out the part of scanning.
4. the method that a kind of detecting data according to claim 3 changes is characterized in that, described a certain size square scope is the square scope of 256 * 256 to 1024 * 768 sizes.
5. the method that a kind of detecting data according to claim 1 changes is characterized in that, 1,2,4,8 or 16 pixel is represented in unified correspondence in a described site or unification.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710031275A CN101159125B (en) | 2007-11-06 | 2007-11-06 | Method for detecting data variation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200710031275A CN101159125B (en) | 2007-11-06 | 2007-11-06 | Method for detecting data variation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101159125A CN101159125A (en) | 2008-04-09 |
| CN101159125B true CN101159125B (en) | 2010-05-26 |
Family
ID=39307193
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200710031275A Active CN101159125B (en) | 2007-11-06 | 2007-11-06 | Method for detecting data variation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101159125B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102012799A (en) * | 2010-12-02 | 2011-04-13 | 无敌科技(西安)有限公司 | Display system and accelerated display method thereof |
| CN109887456A (en) * | 2019-01-17 | 2019-06-14 | 硅谷数模半导体（北京）有限公司 | Data compression method and apparatus |
| CN110007885A (en) * | 2019-04-04 | 2019-07-12 | 广州驷骏精密设备股份有限公司 | A kind of display control method and device based on mosaic screen |
| CN112783056B (en) * | 2021-01-04 | 2022-09-23 | 潍柴动力股份有限公司 | Data programming method, device and equipment of ECU and storage medium |
-
2007
- 2007-11-06 CN CN200710031275A patent/CN101159125B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN101159125A (en) | 2008-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101159125B (en) | Method for detecting data variation | |
| CN86105001A (en) | The display control method of multi-window system | |
| CN1439154A (en) | Automatic optimization of the position of stems of text characters | |
| JPH11231838A (en) | Display device and its driving method | |
| CN101261740A (en) | An image storage and processing method | |
| CN105321165A (en) | Image processing apparatus, image processing method and image processing system | |
| CN1154958C (en) | Image processing apparatus and image processing method | |
| CN101795350A (en) | Non-linear image double amplifying method based on relevance detection | |
| CN108460385A (en) | A kind of Document Segmentation method and apparatus | |
| CN102067204A (en) | Image processing device, display device, image processing method, program, and recording medium | |
| CN101794566A (en) | Method and related device for determining font data of character to be displayed in mobile terminal | |
| CN109493331B (en) | Method for rapidly acquiring overlapping area of two images based on parallel computing algorithm | |
| US8355580B2 (en) | Method and system for generating boundary in the process of rasterizing vector graphic as well as method for producing the system | |
| CN102542528B (en) | Image conversion processing method and system | |
| CN105046632A (en) | Space-time efficient binary image binary logic operation method | |
| CN103065349B (en) | A kind of data rendering method and device | |
| CN104331883A (en) | Image boundary extraction method based on non-symmetry and anti-packing model | |
| CN101103379A (en) | Method and apparatus for pixel sampling | |
| CN108269522A (en) | Display device and image display method thereof | |
| CN101000758A (en) | Anti-flash display method and device | |
| CN100353382C (en) | Low-cost supersampling rasterization | |
| CN102662612B (en) | A method and a system for displaying MRC-form picture files by using Qt bank | |
| CN100476880C (en) | Method and system for producing volume shade | |
| CN1723485A (en) | Information display | |
| CN105139333B (en) | A kind of picture loading display method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |