CN104735449A - Image transmission method and system based on rectangular segmentation and interlaced scanning - Google Patents
Image transmission method and system based on rectangular segmentation and interlaced scanning Download PDFInfo
- Publication number
- CN104735449A CN104735449A CN201510089351.9A CN201510089351A CN104735449A CN 104735449 A CN104735449 A CN 104735449A CN 201510089351 A CN201510089351 A CN 201510089351A CN 104735449 A CN104735449 A CN 104735449A
- Authority
- CN
- China
- Prior art keywords
- change
- ordinate
- rectangle
- rectangular area
- image
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Image Analysis (AREA)
Abstract
The invention discloses an image transmission method and system based on rectangular segmentation and interlaced scanning. The image transmission method based on rectangular segmentation and interlaced scanning comprises the steps that firstly, all image change areas are found out by comparing every two adjacent frames of images; secondly, a set of non-overlapping rectangular areas with the smallest areas is obtained according to the coordinates of variable pixels, wherein only image data contained in the set of rectangular areas are sent each time, so that transmitted data of each frame are reduced, and the purpose of effectively reducing the size of transmitted data is realized. According to the image transmission method and system based on rectangular segmentation and interlaced scanning, a screen is dynamically divided into different numbers of rectangular blocks according to the different numbers of variable areas of the frames of images, and the problems that the number of blocks into which a screen is divided can not be determined easily and the adaptability is poor when a fixed blocking image transmission algorithm is adopted are solved; the screen is divided into rectangular blocks in different sizes according to the difference of the variation scope of each frame of image, and the problem that the size of transmitted data can not be effectively reduced under the condition that the image variation area of the screen is right located at the critical point of multiple rectangular blocks when the fixed blocking image transmission algorithm is adopted is solved.
Description
Technical field
The invention belongs to computer network communication technology field, particularly relate to a kind of based on rectangle segmentation every the image transfer method of column scan and system.
Background technology
Along with the development of network technology, remote computer is imparted knowledge to students, and RMON, the engineerings such as video conference are widely applied, and in such applications, all need real-time Transmission computer screen bitmap.Therefore, service is provided in order to not affect other application programs while ensureing to provide good screen picture transmission service to user, real time screen image delivering system should meet the following conditions: low CPU usage, low bandwidth occupancy, avoids the generation etc. of time delay, shake and Huaping phenomenon as far as possible.In order to meet this condition, usually adopt two kinds of methods: one is the bandwidth improving network; Two is the data volumes reducing transmission.Because the network bandwidth is limited to the network hardware to a great extent, therefore, by optimizing compression and transmission algorithm, reducing volume of transmitted data and becoming the key of dealing with problems.
Computer screen image is not all change in the moment, only has parts of images in change, if only transmit the parts of images changed, then will greatly reduce screen data transmission amount in the most of the time.The present frame of desktop picture is carried out piecemeal by patent 201210264229.7, and build hierarchical index, detect the modified-image block of present frame relative image block cache and non-modified-image block according to hierarchical index, together with the label after being compressed by modified-image block with non-modified-image block in image block buffer memory, be packaged into final transmission data; First image is divided into the capable multiple regions of X row Y by patent 201310318030.2, the content in each region and the same area of previous frame image are made comparisons, change if had in this region, then the data in this region are filled out to the header of identified areas information, then carry out compression transmission; Patent 201210544289.4 by carrying out Format Type identification to source data waiting for transmission before coded treatment, and the source data for different-format type selects different compression algorithms.
Image transmitting algorithm conventional in current screen picture transmission system is fixed block image transmitting algorithm, screen is carried out piecemeal based on rectangle by this algorithm, and each piecemeal is numbered, the size of each piecemeal and the quantity of piecemeal are fixing, then the data of adjacent for front and back two width bitmaps are preserved, and contrast according to the number block of correspondence respectively, if image changes, compression sends the image in current block.Judge that the method whether front and back two frame screen changes has direct comparison method and CRC comparison method.The internal storage data byte-by-byte of direct comparison method to front and back two frame lattice screen compares; By the crc value comparing two two field pictures, the crc value of CRC comparison method computed image data, judges whether image changes.Only send the view data in change block, so the transmission quantity of data can be reduced due to fixed block image transmitting algorithm at every turn.
The number of fixed block image transmitting algorithm screen block is difficult to determine, if number too much will cause the summation in piecemeal processing time to exceed the transmission time of whole screen data, although the network bandwidth takies little like this, real-time may decline; If number is very few, then to process the network bandwidth fall that takies little for more whole screen, and speed improves DeGrain, exists to reduce transmitted data amount and depend on the defect that image block number and piecemeal number be difficult to set; The number of fixed block image transmitting algorithm screen block and the resolution of screen closely related, if resolution changing, take for guaranteeing network bandwidth little must the number of adjustment algorithm screen block, its bad adaptability; The size and number of fixed block image transmitting algorithm to screen block is fixing, when screen picture region of variation is just in time positioned at the critical point of multiple rectangular partition, just there will be the phenomenon that the piecemeal of image change is too much, effectively can not reduce transmitted data amount.
Summary of the invention
The object of the present invention is to provide a kind of based on rectangle segmentation every the image transfer method of column scan and system, be intended to solve screen block number in fixed block image transmitting algorithm be difficult to determine with bad adaptability, when screen picture region of variation is just in time positioned at multiple rectangular partition critical point, can not effectively reduce transmitted data amount problem.
The present invention realizes like this, a kind of based on the image transfer method of rectangle segmentation every column scan, should based on image transfer method first more adjacent two two field pictures of rectangle segmentation every column scan, find out the region of all image change, then obtain the set in the minimum not overlapping rectangles region of area according to the coordinate of change pixel; The view data and respective coordinates information that comprise are gathered in each rectangular area that only sends;
Obtain changing rectangular area according to the coordinate of pixel, formula (1) and formula (2) are the formulas judging rectangle R scope according to change pixel;
R
l≤P
xAND R
t＝P
yi(1)
R
r≥P
xAND R
b≥P
y(2)
Wherein R
land R
trepresent abscissa and the ordinate in the rectangle upper left corner, R
rand R
brepresent abscissa and the ordinate in the rectangle lower right corner, P
xand P
ythe abscissa of representative change pixel and ordinate, P
y0represent the ordinate of first time change pixel; The scope of change rectangular area is tried to achieve according to formula (1) and formula (2); First the data of adjacent for front and back two width bitmaps are preserved, and judge whether the value of pixel corresponding to the frame screen of front and back two changes; When first time detects the sampled point of change, can by the coordinate (P of change sampled point
x0, P
y0) carry out record, as the top left co-ordinate (R of change rectangular area
l, R
t), and be designated false by unchanged for row; Continuing contrast, when different sampled point again being detected, being first designated false by unchanged for row, then by the abscissa P of sampled point
xwith the abscissa R in the rectangle upper left corner
lcompare and get minimum value, simultaneously coordinate (the R in the rectangle lower right corner
r, R
b) meeting and point coordinate (P
x, P
y) relatively and get maximum; That is:
R
l＝min(P
xi,R
l)(i>1) R
t＝P
yi(i＝1)
R
r＝max(R
xi,R
r)(i>1) R
b＝max(R
yi,R
b)(i>1)
When detecting that certain row sampling point value is all identical, obtain the rectangular area block of a change.
Further, in a scanning area, the employing of rectangle partitioning algorithm is carried out to region of variation and judge in the image buffer of front and back, corresponding to two frame screen pictures, whether pixel changes thus find out the rectangular area of change every row direct comparison method; According to from top to bottom, principle from left to right, obtains the set in the minimum not overlapping rectangles region of area based on rectangle segmentation two field picture after the image transfer method of column scan is found out relative to previous frame image all changes region based on rectangle partitioning algorithm.
Further, adopt and judge corresponding to the frame screen picture of front and back two, whether pixel changes every row direct comparison method, first from left to right start to extract pixel corresponding to front and back two width images for sampled point every N row with behavior unit, whether the value comparing corresponding pixel points is identical; According to the difference of application scenarios and the requirement of bandwidth, can adjust to interval columns N, the value of N is less, and the time needed for detecting every row direct comparison method is longer.
Further, in a scanning area, rectangle partitioning algorithm concrete grammar carries out to region of variation as follows:
Step one, first image transmitting terminal obtains the resolution of screen, obtains the scope 0 ~ C of column scan and the scope 0 ~ R of line scanning;
Step 2, the data of current frame image conservation zone are saved in previous frame image buffering area by transmitting terminal; Intercept and capture current screen bitmaps data and be kept at current frame image buffering area;
Step 3, transmitting terminal first initialization change rectangular area top left co-ordinate and lower right corner coordinate is (0,0), and next sweep starting point coordinate is (0,0), and row is unchanged is designated true, upgrades the scope of column scan and the scope of line scanning;
Step 4, judges whether to be expert in sweep limits, does not exist, jump to step 10;
Step 5, judges whether, within the scope of column scan, not exist, jumps to step 8; Adopt within the scope of column scan and every row direct comparison method, current sampling point is detected; Value is different, first unchanged for row mark is set to false, then judge whether it is first the change sampled point detected, using the top left co-ordinate of sample point coordinate as change rectangular area, not first change sampled point, using the coordinate of the coordinate in the rectangle lower right corner and this point relatively and get maximum as new rectangle lower right corner coordinate, judging that whether this sampled point is one's own profession first change sampled point again, is just compared with the ordinate in the rectangle upper left corner by the ordinate of this sampled point and get the top left co-ordinate of minimum value more new change rectangular area; Be worth identical, need to judge whether the unchanged mark of row is false, if false, the starting point that record coordinate scanned as next time, detects it is last row sampled point, using the starting point that last row sample point coordinate scanned as next time, jumps to step 7;
Step 6, row coordinate move to right N row, jump to step 5 and detect next sampled point;
Step 7, one's own profession detects complete, is compared by the next sweep starting point coordinate of one's own profession, and get maximum as new next sweep starting point coordinate with the next sweep starting point coordinate of lastrow record, line number adds 1, jumps to step 4 and starts anew from left to right to detect from next line;
Step 8, judges whether the unchanged mark of row is true and change rectangular area top left co-ordinate is not (0,0), and be not true, line number adds 1, jumps to step 4; Be true, then show full line same pixel invariably, obtain the rectangular area block of a change; The block upper left corner, the change rectangular area ordinate obtained is moved to the left N row, and the ordinate N that moves right in the lower right corner arranges to comprise image boundary information;
Step 9, record the change rectangular area coordinate and corresponding next sweep starting point coordinate that detect, whether the scope judging current column scan 0 ~ C and the scope of line scanning whether 0 ~ R, be, arranging the change rectangular area mark first time that mark shows that current detection goes out detects, then line number adds 1 and jumps to the rectangular area block that step 4 detects next change from next line; Until detect the scope exceeding line scanning;
Step 10, after this detects, in detecting this, all next sweep starting points process, and calculate the set of next sweep limits; First check that whether the ordinate of this first next sweep starting point detected is less than the ordinate of last row sampled point, whether or not this region detection completes, and detects the ordinate of next next sweep starting point; That the abscissa in the upper left corner, change rectangular area detected with first time is for abscissa, and the ordinate of the next sweep starting point coordinate of being correlated with current change rectangular area, for ordinate, generates the top left co-ordinate of a next sweep limits; The abscissa in the lower right corner, change rectangular area detected with first time for abscissa, with the maximum number of column C of screen for ordinate generates the lower right corner coordinate of a next sweep limits; Then second next sweep starting point is processed, until all next sweep starting points are all processed in this detection;
Step 11, detect scanning areas all in next sweep limits set, first based on width and the height of first scanning area in next sweep limits set, generate the scope of line scanning and column scan, repeat step 3 and detect the rectangular area block changed in first scanning area to step 10, then second scanning area is processed, until all scanning areas are all detected in next sweep limits set;
Step 12, repeats step 10 to step 11, obtains the change rectangular area block of sweep limits next time, until the ordinate of all next sweep starting points is more than or equal to the ordinate of last row sampled point, whole screen detects complete;
Step 13, obtain the set in the minimum not overlapping rectangles region of area that this two field pictures all change relative to previous frame image, check the rectangular area in this set, two its upper left corner ordinates of rectangle are identical with lower right corner ordinate, and the lower right corner abscissa of a rectangle is adjacent with another rectangle upper left corner abscissa, merge into a rectangle, and then compress and the view data that comprises of the set sending rectangular area and respective coordinates to client;
Step 14, image-receptive end will be integrated in previous frame image based on each rectangular region image data and respective coordinates after the data decompression of reception and show;
Step 15, repeats step 2 to step 14 every T, according to the difference of application scenarios and the requirement of bandwidth, can adjust to T interval time second.
Another object of the present invention is to provide a kind of based on the image delivering system of rectangle segmentation every column scan, transmitting terminal and receiving terminal should be comprised based on rectangle segmentation every the image delivering system of column scan:
Transmitting terminal comprises:
Screen picture acquisition module, for carrying out IMAQ to the screen of transmitting terminal;
Rectangle segmentation is every column scan module, contrast every the previous frame image of column sweep algorithm by current frame image and buffer memory based on rectangle segmentation, find out the region of all image change, then obtain the set in the minimum not overlapping rectangles region of area according to the coordinate of change pixel;
Compression sending module, the view data that comprises of set of compression rectangular area, then sends the view data of compression and respective coordinates to client by network;
Receiving terminal comprises:
Receiver module, the modified-image data that receiving end/sending end sends;
Pressure-reduction module, by the data decompression received, the view data that the set obtaining rectangular area comprises and respective coordinates;
Upgrade display module, upgrade the previous frame image corresponding region of buffer memory based on each rectangular region image data and respective coordinates and show.
Provided by the invention based on rectangle segmentation every the image transfer method of column scan and system, first more adjacent two two field pictures, find out the region of all image change, then the set in the minimum not overlapping rectangles region of area is obtained according to the coordinate of change pixel, the view data comprised is gathered in each rectangular area that only sends, to reduce the transmission data of each frame, reach the object of the transmitted data amount effectively reduced.The present invention is different according to the number of every two field picture region of variation, screen is divided into the different rectangular partition of quantity dynamically, overcomes fixed block image transmitting algorithm screen block number and be difficult to determine the problem with bad adaptability; Screen is divided into according to the difference of each excursion of every two field picture the rectangular partition varied in size, to overcome in fixed block image transmitting algorithm when screen picture region of variation is just in time positioned at multiple rectangular partition critical point, effectively can not reduce the problem of transmitted data amount.Adopt the method image delivering system to compare the image delivering system adopting fixed block interlacing scan algorithm, more effectively can reduce CPU usage, reduce bandwidth usage, improve the performance of image transmitting.
Accompanying drawing explanation
Fig. 1 be the embodiment of the present invention provide based on rectangle segmentation every the image transfer method flow chart of column scan;
Fig. 2 is the scanning schematic diagram that the embodiment of the present invention provides;
Fig. 3 is the flow chart detecting a rectangular area that the embodiment of the present invention provides;
Fig. 4 is the set flow chart of change detected rectangle in a scanning area that the embodiment of the present invention provides;
Fig. 5 is the set flow chart of calculating sweep limits next time that the embodiment of the present invention provides;
Fig. 6 is the change detected rectangle flow chart in the set of a sweep limits that the embodiment of the present invention provides;
Fig. 7 is the image change schematic diagram that the embodiment of the present invention provides;
Fig. 8 be the embodiment of the present invention provide based on rectangle segmentation every the image delivering system structural representation of column scan;
Embodiment
In order to make object of the present invention, technical scheme and advantage clearly understand, below in conjunction with embodiment, the present invention is further elaborated.Should be appreciated that specific embodiment described herein only in order to explain the present invention, be not intended to limit the present invention.
Below in conjunction with drawings and the specific embodiments, application principle of the present invention is further described.
As shown in Figure 1, the comprising the following steps every the image transfer method of column scan based on rectangle segmentation of the embodiment of the present invention:
S101: first more adjacent two two field pictures, finds out the region of all image change;
S102: the set then obtaining the minimum not overlapping rectangles region of area according to the coordinate of change pixel, the view data comprised is gathered in each rectangular area that only sends.
The concrete steps of the embodiment of the present invention:
Splitting every first more adjacent two two field pictures of column sweep algorithm based on rectangle of the embodiment of the present invention, find out the region of all image change, then obtain the set in the minimum not overlapping rectangles region of area according to the coordinate of change pixel; How the focusing on of algorithm obtain changing rectangular area according to the coordinate of pixel; Shown in; Based on Fig. 2, its concrete principle is described below;
R
l≤P
xAND R
t＝P
yi(1)
R
r≥P
xAND R
b≥P
y(2)
Formula (1) and formula (2) are the formulas judging rectangle R scope according to change pixel; Wherein R
land R
trepresent abscissa and the ordinate in the rectangle upper left corner, R
rand R
brepresent abscissa and the ordinate in the rectangle lower right corner, P
xand P
ythe abscissa of representative change pixel and ordinate, P
y0represent the ordinate of first time change pixel; According to the custom of 2D graphics, X-axis level increases progressively to the right, and Y-axis level increases progressively downwards; The scope of change rectangular area can be tried to achieve according to formula (1) and formula (2); The data of adjacent for front and back two width bitmaps first preserve by algorithm, and judge whether the value of pixel corresponding to the frame screen of front and back two changes to it; When first time detects the sampled point of change, can by the coordinate (P of change sampled point
x0, P
y0) carry out record, as the top left co-ordinate (R of change rectangular area
l, R
t), and be designated false by unchanged for row; Continuing contrast, when different sampled point again being detected, being first designated false by unchanged for row, then by the abscissa P of this sampled point
xwith the abscissa R in the rectangle upper left corner
lcompare and get minimum value, simultaneously coordinate (the R in the rectangle lower right corner
r, R
b) coordinate (P of meeting and this point
x, P
y) relatively and get maximum; That is:
R
l＝min(P
xi,R
l)(i>1) R
t＝P
yi(i＝1)
R
r＝max(R
xi,R
r)(i>1) R
b＝max(R
yi,R
b)(i>1)
When detecting that certain row sampling point value is all identical, just obtain the rectangular area block of a change; In a scanning area, rectangle partitioning algorithm flow process is carried out as shown in Figure 3 to region of variation based on above-mentioned principle;
For improving the speed judging screen change region, judge in front and back image buffer two frame screen pictures corresponding to whether pixel change thus find out the rectangular area of change every the image transfer method employing of column scan every row direct comparison method based on rectangle segmentation; First from left to right start to extract pixel corresponding to front and back two width images for sampled point every N row (assay intervals columns N needs to determine as the case may be) with behavior unit, whether the value comparing corresponding pixel points is identical; According to from top to bottom, principle from left to right, obtains the set in the minimum not overlapping rectangles region of area based on rectangle segmentation two field picture after the image transfer method of column scan is found out relative to previous frame image all changes region based on rectangle partitioning algorithm; Its detailed operation flow process is as follows:
Step 1, first image transmitting terminal obtains the resolution of screen, obtains the scope 0 ~ C of column scan and the scope 0 ~ R of line scanning;
Step 2, the data of current frame image conservation zone are saved in previous frame image buffering area by transmitting terminal; Intercept and capture current screen bitmaps data and be kept at current frame image buffering area;
Step 3, transmitting terminal first initialization change rectangular area top left co-ordinate and lower right corner coordinate is (0,0), and next sweep starting point coordinate is (0,0), and row is unchanged is designated true, upgrades the scope of column scan and the scope of line scanning;
Step 4, judges whether to be expert in sweep limits, if not, jump to step 10;
Step 5, judges whether within the scope of column scan, if not, jump to step 8, current sampling point is detected every row direct comparison method if adopted within the scope of column scan, if value is different, first unchanged for row mark is set to false, then judge whether it is first the change sampled point detected, if using the top left co-ordinate of sample point coordinate as change rectangular area, if not first change sampled point, using the coordinate of the coordinate in the rectangle lower right corner and this point relatively and get maximum as new rectangle lower right corner coordinate, judge whether this sampled point is one's own profession first change sampled point again, if just the ordinate of this sampled point compared with the ordinate in the rectangle upper left corner and get the top left co-ordinate of minimum value more new change rectangular area, if be worth identical, need to judge whether the unchanged mark of row is false, if false, record the starting point that its coordinate scanned as next time, if detect it is last row sampled point, using the starting point that last row sample point coordinate scanned as next time, jump to step 7,
Step 6, row coordinate move to right N row, jump to step 5 and detect next sampled point;
Step 7, one's own profession detects complete, is compared by the next sweep starting point coordinate of one's own profession, and get maximum as new next sweep starting point coordinate with the next sweep starting point coordinate of lastrow record, line number adds 1, jumps to step 4 and starts anew from left to right to detect from next line;
Step 8, judges whether the unchanged mark of row is true and change rectangular area top left co-ordinate is not (0,0), and if not true, line number adds 1, jumps to step 4; If true, then show full line same pixel invariably, so just obtain the rectangular area block of a change; Owing to adopting every row direct comparison method, there will be the change of modified-image border and the phenomenon causing boundary information to lose do not detected, for addressing this problem, the block upper left corner, the rectangular area ordinate of the change obtained is moved to the left N row, and the ordinate N that moves right in the lower right corner arranges to comprise image boundary information;
Step 9, record the change rectangular area coordinate and corresponding next sweep starting point coordinate that detect, whether the scope judging current column scan 0 ~ C and the scope of line scanning whether 0 ~ R, if, arranging the change rectangular area mark first time that mark shows that current detection goes out detects, then line number adds 1 and jumps to the rectangular area block that step 4 detects next change from next line; Until detect the scope exceeding line scanning, its flow process is shown in Fig. 4;
Step 10, this detection is complete, check that whole screen has the part detected or not, therefore need the change rectangular area coordinate that detects based on this and corresponding next sweep starting point coordinate to calculate and generate next sweep limits, its method checks that whether the ordinate of this first next sweep starting point detected is less than the ordinate of last row sampled point, if not, this region detection completes, and detects the ordinate of next next sweep starting point; If so, the abscissa in the upper left corner, change rectangular area detected with first time is for abscissa, and the ordinate of the next sweep starting point coordinate of being correlated with current change rectangular area, for ordinate, generates the top left co-ordinate of a next sweep limits; The abscissa in the lower right corner, change rectangular area detected with first time for abscissa, with the maximum number of column C of screen for ordinate generates the lower right corner coordinate of a next sweep limits; Next sweep starting point process all in this being detected based on said method, calculate the set of next sweep limits, its flow process is shown in Fig. 5;
Step 11, based on the width of first scanning area in next sweep limits set and the scope of high computational line scanning and column scan, repeat the rectangular area block that step 3 obtains to step 10 changing in this scanning area, based on said method to scanning area process all in sweep limits set, its flow process is shown in Fig. 5;
Step 12, repeats step 10 to 11, obtains the change rectangular area block of sweep limits next time, until the ordinate of all next sweep starting points is more than or equal to the ordinate of last row sampled point, whole screen detects complete;
Step 13, obtain the set in the minimum not overlapping rectangles region of area that this two field pictures all change relative to previous frame image, check the rectangular area in this set, if two its upper left corner ordinates of rectangle are identical with lower right corner ordinate, and the lower right corner abscissa of a rectangle is adjacent with another rectangle upper left corner abscissa, merged into a rectangle, and then compress and the view data that comprises of the set sending rectangular area and respective coordinates to client;
Step 14, image-receptive end will be integrated in previous frame image based on each rectangular region image data and respective coordinates after the data decompression of reception and show;
Step 15, to repeat step 2 second to step 14 every T, according to the difference of application scenarios and the requirement of bandwidth, can adjust to T interval time.
As shown in Figure 8, mainly the comprising every the image delivering system of column scan based on rectangle segmentation of the embodiment of the present invention: transmitting terminal and receiving terminal
Transmitting terminal comprises:
Screen picture acquisition module, for carrying out IMAQ to the screen of transmitting terminal;
Rectangle segmentation is every column scan module, contrast every the previous frame image of column sweep algorithm by current frame image and buffer memory based on rectangle segmentation, find out the region of all image change, then obtain the set in the minimum not overlapping rectangles region of area according to the coordinate of change pixel;
Compression sending module, the view data that comprises of set of compression rectangular area, then sends the view data of compression and respective coordinates to client by network;
Receiving terminal comprises:
Receiver module, the modified-image data that receiving end/sending end sends;
Pressure-reduction module, by the data decompression received, the view data that the set obtaining rectangular area comprises and respective coordinates;
Upgrade display module, upgrade the previous frame image corresponding region of buffer memory based on each rectangular region image data and respective coordinates and show.
Below in conjunction with accompanying drawing 7, realization of the present invention is described in detail:
Set up network between transmitting terminal with receiving terminal to be connected, the image of transmitting terminal to the former frame of current frame image and buffer memory contrasts, obtain the set in the minimum not overlapping rectangles region of area in two two field pictures, only the view data comprised is gathered, to reduce the transmission data of each frame in compression transmission rectangular area; The view data of reception to be integrated in previous frame image and to show by receiving terminal, thus to save bandwidth usage and CPU usage, realizes image fast transport; Be that 1024 × 768 screen pictures are transmitted as example with screen resolution below, Fig. 7 is shown as the change of current frame image relative to previous frame image, is described in detail as follows below in conjunction with accompanying drawing 7:
Step 1, the width that first transmitting terminal obtains screen is 1024 and is highly 768, and this Two Variables is using the scope as column scan and line scanning;
Step 2, first transmitting terminal obtains the first two field picture and preserves current frame image buffering area, is sent to receiving terminal after then being compressed by this two field picture, displays image information after receiving terminal reception view data;
Step 3, after 2 seconds, the data of current frame image buffering area are saved in previous frame image buffering area by transmitting terminal; Intercept and capture current screen image data and be kept in current frame image buffering area;
Step 4, transmitting terminal first initialization change rectangular area top left co-ordinate and lower right corner coordinate is (0,0), next time, sweep starting point coordinate was (0,0), row is unchangedly designated true, the scope upgrading column scan be 0 ~ 1024 and the scope of line scanning be 0 ~ 768;
Step 5, adopts and judges corresponding to the frame screen of front and back two, whether pixel changes the rectangular area finding out change every row direct comparison method; It is whether the value that the pixel of (1,5) is more corresponding is identical that pointer pCurData and pBakData points to current frame image and previous frame image coordinate respectively; If identical, just with behavior unit, to right septum 4 pixels, (number of pixels at interval can be determined as the case may be, for 4 pixels) get the next corresponding pixel of front and back two two field picture for sampled point, relatively coordinate (1 in two two field pictures, 10) value of corresponding pixel points is identical, then next sample point coordinate (1 is detected, 15) respective pixel point value is different, unchanged for row mark is set to false, this is first the change sampled point detected, using the top left co-ordinate of its coordinate as change rectangular area; Sampled point (1,15) is that one's own profession first detects change, then needs the ordinate of the ordinate of sampled point (1,15) with the rectangle upper left corner compare and get minimum value, and rectangle top left co-ordinate is updated to (1,15);
Step 6, the value then detecting next sampled point (1,20) is in the same row identical, records the starting point of its coordinate (1,20) as scanning next time, then starts anew from left to right to detect from next line (the second row);
Step 7, transmitting terminal detects the sampled point (2 of the second row, 5) and (2,10) value is identical, the value continuing to detect next sampled point (2,15) is different, by the coordinate (1 in the rectangle lower right corner, 15) and the coordinate of this point relatively and get maximum and upgrade rectangle lower right corner coordinate for (2,15); Sampled point (2,15) is the sampled point of the second row first change, and need the ordinate of the ordinate of this sampled point with the rectangle upper left corner compare and get minimum value, rectangle top left co-ordinate is updated to (1,15); Then detect that next sampled point (2,20) value is identical, upgrade the starting point (2,20) of scanning next time, then start anew from left to right to detect from next line (the third line);
Step 8, the value that transmitting terminal detects the sampled point (3,5) of the third line is different, by the coordinate of the coordinate (2,15) in the rectangle lower right corner and this point relatively and get maximum and upgrade rectangle lower right corner coordinate for (3,15); Sampled point (3,5) be the sampled point that the third line first changes, need the ordinate (15) of the ordinate (5) of this sampled point with the rectangle upper left corner compare and get minimum value, rectangle top left co-ordinate is updated to (1,5); Then sampled point (3 relatively below, 10) value of (3,15) (3,20) is all different, by coordinates of the coordinate in the rectangle lower right corner and these points relatively and get maximum and upgrade rectangle lower right corner coordinate for (3,20);
Step 9, transmitting terminal detects the sampled point of often going successively; The value of the sampled point (10,20) of the 10th row is different, by the coordinate of the coordinate in the rectangle lower right corner and this point relatively and get maximum and upgrade rectangle lower right corner coordinate for (10,20); Sampled point (10,20) be the sampled point that the 10th row first changes, need the ordinate (5) of the ordinate (20) of this sampled point with the rectangle upper left corner compare and get minimum value, rectangle top left co-ordinate is updated to (1,5); Then the value detecting next sampled point (10,25) is in the same row identical, records the starting point of its coordinate (10,25) as scanning next time, then starts anew from left to right to detect from next line (the 11st row);
Step 10, transmitting terminal detects that the 11st row sampling point value is all identical, the unchanged mark of row is for true and change rectangular area top left co-ordinate is not (0,0), then show full line same pixel invariably, the block upper left corner, rectangular area so just obtaining a change is (1,5), the lower right corner (10,20), the starting point (10,25) of scanning next time; Lose problem for solving modified-image boundary information, the block upper left corner, the rectangular area ordinate of the change obtained is moved to the left 5 row, and lower right corner ordinate moves right 5 row to comprise image boundary information; The block upper left corner, rectangular area obtaining the change upgraded is (1,0), the lower right corner (10,25), the scope of current front column scan is 0 ~ C and the scope of line scanning is 0 ~ R, arranges mark and shows that the change rectangular area mark first time that current detection goes out detects;
Step 11, adopting said method to continue to detect the block upper left corner, rectangular area obtaining next change is downwards (12,20), the lower right corner (20,40), the starting point (18 of scanning next time, 40), arrange first time detect mark;
Step 12, whether transmitting terminal detects its value of sampled point that often row is corresponding line by line identical, until last column of screen; Scan based on this example first time, obtain the block upper left corner, rectangular area of two changes for (1,0), the lower right corner (10,25), starting point (10,25) and the block upper left corner, rectangular area of scanning next time are (12,20), the lower right corner (20,40), the starting point (18,40) of scanning next time;
Step 13, owing to also there is the starting point (10 of scanning next time, 25) and (18,40) ordinate is less than the ordinate of last row sampled point, whole screen has the part detected or not, therefore transmitting terminal needs to determine the region next time detected, calculates generate second time sweep limits based on the change rectangular area coordinate detected from top to bottom and corresponding next sweep starting point coordinate; First be (1,0) based on the upper left corner, first rectangular area, the lower right corner (10,25), the starting point (10,25) of scanning next time calculates first scanning area; First due to rectangular area (1,0), (10,25) be the change rectangular area detected the first round, therefore the scanning area upper left corner and lower right corner abscissa are respectively the upper left corner, first rectangular area for (1,0), the lower right corner (10,25) abscissa, namely the scanning area upper left corner and lower right corner abscissa are respectively 1 and 10; Then the ordinate (1020) of the ordinate 25 of sweep starting point coordinate and last row sampled point of screen is compared; The ordinate of sweep starting point coordinate is less than the ordinate of last row of screen, obtains the ordinate 25 that scanning area top left co-ordinate ordinate is sweep starting point coordinate; Be scanning area lower right corner coordinate ordinate with the width 1024 of screen, resulting in a scanning area (1,25) (10,1024) in second time sweep limits; Then be (12,20) based on the block upper left corner, rectangular area, the lower right corner (20,40), next time, the starting point (18,40) of scanning calculated next scanning area; The same with the method calculating first scanning area, obtain a scanning area (12,40) (20,1024) in second time sweep limits;
Step 14, after calculating the regional ensemble generating second time sweep limits, can obtain the scope of the scanning of second time scan columns and line scanning; In this example, the set of second time scanning area is first region (1,25) (10,1024) and Two Areas (12,40) (20,1024); In scanning area set next time, the scope of first scanning area column scan is the scope (1≤y≤10) of (25≤x≤1024) and line scanning, and the scope of the column scan of second scanning area is the scope (12≤y≤20) of (40≤x≤1024) and line scanning;
Step 15, transmitting terminal first initialization change rectangular area top left co-ordinate and lower right corner coordinate is (0,0), then adopt the rectangular area block judging whether to exist in first scanning area change every row direct comparison method, the block upper left corner, rectangular area of a change can be obtained based on this example for (2,40) in first region, the lower right corner (9,55), the starting point (7,55) of scanning next time;
Step 16, then transmitting terminal adopts and judges every row direct comparison method the rectangular area block that whether there is change in second scanning area, it is all identical for scanning last 1 row in this region last 1 row sampled point (20,1020) value based on this routine transmitting terminal, there is not the rectangular area of change; The starting point coordinate that next time is scanned is set to (20,1020) by transmitting terminal; The ordinate of the corresponding sweep starting point coordinate in this change rectangular area is identical with the ordinate of last row sampled point, and this change rectangular area is scanned; Second time has scanned, and obtains the block upper left corner, rectangular area of a change for (2,40), the lower right corner (9,55), the starting point (7,55) of scanning next time;
Step 17, owing to also there is the starting point (7 of scanning next time, 55) ordinate is less than the ordinate of last row sampled point, transmitting terminal again calculates and generates third time sweep limits, is first (2,40) based on the upper left corner, rectangular area, the lower right corner (9,55), the starting point (3,55) of scanning next time calculates; Due to the upper left corner, current rectangle region (2,40), the lower right corner (9,55) not the change rectangular area detected the first round, in sweep limits, the scanning area upper left corner and lower right corner abscissa continue to have, and are compared by the ordinate (1020) of the ordinate 55 of sweep starting point coordinate and last row sampled point of screen; The ordinate of sweep starting point coordinate is less than the ordinate of last row of screen, obtains the ordinate 55 that scanning area top left co-ordinate ordinate is sweep starting point coordinate; Be lower right corner ordinate with the width 1024 of screen; Resulting in a scanning area (1,55) (10,1024) in third time sweep limits;
Step 18, then transmitting terminal adopts the rectangular area block judging whether to exist in third time sweep limits change every row direct comparison method, it is all identical for scanning last 1 row in this region last 1 row sampled point (10,1020) value based on this routine transmitting terminal, there is not the rectangular area of change; The starting point coordinate that next time is scanned is set to (20,1020) by transmitting terminal; The ordinate of the corresponding sweep starting point coordinate in this change rectangular area is identical with the ordinate of last row sampled point, and this change rectangular area is scanned;
Step 19, so far, the ordinate of all sweep starting point coordinates is identical with the ordinate of last row sampled point, whole screen scanning completes, and the change rectangular area obtained is the block upper left corner, rectangular area is (1,0), the lower right corner (10,25), the block upper left corner, rectangular area is (12,20), the lower right corner (20,40), the block upper left corner, rectangular area is (2,40), the lower right corner (9,55);
Step 20, transmitting terminal compresses and sends the view data that comprises of set of change rectangular area and coordinate information to client; The view data of reception to be integrated in previous frame image and to show by image-receptive end.
Step 21, repeated step 3 to step 20, according to the difference of application scenarios and the requirement of bandwidth, can adjust to interval time every 2 seconds.
The foregoing is only preferred embodiment of the present invention, not in order to limit the present invention, all any amendments done within the spirit and principles in the present invention, equivalent replacement and improvement etc., all should be included within protection scope of the present invention.
Claims (5)
1. one kind based on rectangle segmentation every the image transfer method of column scan, it is characterized in that, should based on image transfer method first more adjacent two two field pictures of rectangle segmentation every column scan, find out the region of all image change, then obtain the set in the minimum not overlapping rectangles region of area according to the coordinate of change pixel; The view data and respective coordinates information that comprise are gathered in each rectangular area that only sends;
Obtain changing rectangular area according to the coordinate of pixel, formula (1) and formula (2) are the formulas judging rectangle R scope according to change pixel;
R
l≤P
xAND R
t＝P
yi(1)
R
r≥P
xAND R
b≥P
y(2)
Wherein R
land R
trepresent abscissa and the ordinate in the rectangle upper left corner, R
rand R
brepresent abscissa and the ordinate in the rectangle lower right corner, P
xand P
ythe abscissa of representative change pixel and ordinate, P
y0represent the ordinate of first time change pixel; The scope of change rectangular area is tried to achieve according to formula (1) and formula (2); First the data of adjacent for front and back two width bitmaps are preserved, and judge whether the value of pixel corresponding to the frame screen of front and back two changes; When first time detects the sampled point of change, can by the coordinate (P of change sampled point
x0, P
y0) carry out record, as the top left co-ordinate (R of change rectangular area
l, R
t), and be designated false by unchanged for row; Continuing contrast, when different sampled point again being detected, being first designated false by unchanged for row, then by the abscissa P of sampled point
xwith the abscissa R in the rectangle upper left corner
lcompare and get minimum value, simultaneously coordinate (the R in the rectangle lower right corner
r, R
b) meeting and point coordinate (P
x, P
y) relatively and get maximum; That is:
R
l＝min(P
xi,R
l)(i>1) R
t＝P
yi(i＝1)
R
r＝max(R
xi,R
r)(i>1) R
b＝max(R
yi,R
b)(i>1)
When detecting that certain row sampling point value is all identical, obtain the rectangular area block of a change.
2. as claimed in claim 1 based on the image transfer method of rectangle segmentation every column scan, it is characterized in that, in a scanning area, the employing of rectangle partitioning algorithm is carried out to region of variation and judge in the image buffer of front and back, corresponding to two frame screen pictures, whether pixel changes thus find out the rectangular area of change every row direct comparison method; According to from top to bottom, principle from left to right, obtains the set in the minimum not overlapping rectangles region of area based on rectangle segmentation two field picture after the image transfer method of column scan is found out relative to previous frame image all changes region based on rectangle partitioning algorithm.
3. as claimed in claim 2 based on the image transfer method of rectangle segmentation every column scan, it is characterized in that, adopt and judge corresponding to the frame screen picture of front and back two, whether pixel changes every row direct comparison method, first from left to right start to extract pixel corresponding to front and back two width images for sampled point every N row with behavior unit, whether the value comparing corresponding pixel points is identical; According to the difference of application scenarios and the requirement of bandwidth, adjust to interval columns N, the value of N is less, and the time needed for detecting every row direct comparison method is longer.
4. as claimed in claim 2 based on rectangle segmentation every the image transfer method of column scan, it is characterized in that, in a scanning area, rectangle partitioning algorithm concrete grammar carries out to region of variation as follows:
Step one, first image transmitting terminal obtains the resolution of screen, obtains the scope 0 ~ C of column scan and the scope 0 ~ R of line scanning;
Step 2, the data of current frame image conservation zone are saved in previous frame image buffering area by transmitting terminal; Intercept and capture current screen bitmaps data and be kept at current frame image buffering area;
Step 3, transmitting terminal first initialization change rectangular area top left co-ordinate and lower right corner coordinate is (0,0), and next sweep starting point coordinate is (0,0), and row is unchanged is designated true, upgrades the scope of column scan and the scope of line scanning;
Step 4, judges whether to be expert in sweep limits, does not exist, jump to step 10;
Step 5, judges whether, within the scope of column scan, not exist, jumps to step 8; Adopt within the scope of column scan and every row direct comparison method, current sampling point is detected; Value is different, first unchanged for row mark is set to false, then judge whether it is first the change sampled point detected, using the top left co-ordinate of sample point coordinate as change rectangular area, not first change sampled point, using the coordinate of the coordinate in the rectangle lower right corner and this point relatively and get maximum as new rectangle lower right corner coordinate, judging that whether this sampled point is one's own profession first change sampled point again, is just compared with the ordinate in the rectangle upper left corner by the ordinate of this sampled point and get the top left co-ordinate of minimum value more new change rectangular area; Be worth identical, need to judge whether the unchanged mark of row is false, if false, the starting point that record coordinate scanned as next time, detects it is last row sampled point, using the starting point that last row sample point coordinate scanned as next time, jumps to step 7;
Step 6, row coordinate move to right N row, jump to step 5 and detect next sampled point;
Step 7, one's own profession detects complete, is compared by the next sweep starting point coordinate of one's own profession, and get maximum as new next sweep starting point coordinate with the next sweep starting point coordinate of lastrow record, line number adds 1, jumps to step 4 and starts anew from left to right to detect from next line;
Step 8, judges whether the unchanged mark of row is true and change rectangular area top left co-ordinate is not (0,0), and be not true, line number adds 1, jumps to step 4; Be true, then show full line same pixel invariably, obtain the rectangular area block of a change; The block upper left corner, the change rectangular area ordinate obtained is moved to the left N row, and the ordinate N that moves right in the lower right corner arranges to comprise image boundary information;
Step 9, record the change rectangular area coordinate and corresponding next sweep starting point coordinate that detect, whether the scope judging current column scan 0 ~ C and the scope of line scanning whether 0 ~ R, be, arranging the change rectangular area mark first time that mark shows that current detection goes out detects, then line number adds 1 and jumps to the rectangular area block that step 4 detects next change from next line; Until detect the scope exceeding line scanning;
Step 10, after this detects, in detecting this, all next sweep starting points process, and calculate the set of next sweep limits; First check that whether the ordinate of this first next sweep starting point detected is less than the ordinate of last row sampled point, whether or not this region detection completes, and detects the ordinate of next next sweep starting point; That the abscissa in the upper left corner, change rectangular area detected with first time is for abscissa, and the ordinate of the next sweep starting point coordinate of being correlated with current change rectangular area, for ordinate, generates the top left co-ordinate of a next sweep limits; The abscissa in the lower right corner, change rectangular area detected with first time for abscissa, with the maximum number of column C of screen for ordinate generates the lower right corner coordinate of a next sweep limits; Then second next sweep starting point is processed, until all next sweep starting points are all processed in this detection;
Step 11, detect scanning areas all in next sweep limits set, first based on width and the height of first scanning area in next sweep limits set, generate the scope of line scanning and column scan, repeat step 3 and detect the rectangular area block changed in first scanning area to step 10, then second scanning area is processed, until all scanning areas are all detected in next sweep limits set;
Step 12, repeats step 10 to step 11, obtains the change rectangular area block of sweep limits next time, until the ordinate of all next sweep starting points is more than or equal to the ordinate of last row sampled point, whole screen detects complete;
Step 13, obtain the set in the minimum not overlapping rectangles region of area that this two field pictures all change relative to previous frame image, check the rectangular area in this set, two its upper left corner ordinates of rectangle are identical with lower right corner ordinate, and the lower right corner abscissa of a rectangle is adjacent with another rectangle upper left corner abscissa, merge into a rectangle, and then compress and the view data that comprises of the set sending rectangular area and respective coordinates to client;
Step 14, image-receptive end will be integrated in previous frame image based on each rectangular region image data and respective coordinates after the data decompression of reception and show;
Step 15, repeats step 2 to step 14 every T, according to the difference of application scenarios and the requirement of bandwidth, adjust to T interval time second.
5. split the image delivering system every column scan based on rectangle, it is characterized in that, transmitting terminal and receiving terminal should be comprised based on rectangle segmentation every the image delivering system of column scan:
Transmitting terminal comprises:
Screen picture acquisition module, for carrying out IMAQ to the screen of transmitting terminal;
Rectangle segmentation is every column scan module, contrast every the previous frame image of column sweep algorithm by current frame image and buffer memory based on rectangle segmentation, find out the region of all image change, then obtain the set in the minimum not overlapping rectangles region of area according to the coordinate of change pixel;
Compression sending module, the view data that comprises of set of compression rectangular area, then sends the view data of compression and respective coordinates to client by network;
Receiving terminal comprises:
Receiver module, the modified-image data that receiving end/sending end sends;
Pressure-reduction module, by the data decompression received, the view data that the set obtaining rectangular area comprises and respective coordinates;
Upgrade display module, upgrade the previous frame image corresponding region of buffer memory based on each rectangular region image data and respective coordinates and show.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510089351.9A CN104735449B (en) | 2015-02-27 | 2015-02-27 | A kind of image transfer method split based on rectangle every column scan |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510089351.9A CN104735449B (en) | 2015-02-27 | 2015-02-27 | A kind of image transfer method split based on rectangle every column scan |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104735449A true CN104735449A (en) | 2015-06-24 |
| CN104735449B CN104735449B (en) | 2017-12-26 |
Family
ID=53458818
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510089351.9A Active CN104735449B (en) | 2015-02-27 | 2015-02-27 | A kind of image transfer method split based on rectangle every column scan |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104735449B (en) |
Cited By (34)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106954004A (en) * | 2017-03-17 | 2017-07-14 | 宇龙计算机通信科技(深圳)有限公司 | Screen sharing method and device |
| CN107705257A (en) * | 2017-09-15 | 2018-02-16 | 重庆科技学院 | One kind is based on partial fractional differential graph of equation image contrast method |
| CN107767368A (en) * | 2017-09-27 | 2018-03-06 | 贵阳中医学院 | A kind of multifunction electromagnetic heat cure control system and control method |
| CN107801038A (en) * | 2017-10-31 | 2018-03-13 | 灏瑰浆 | A kind of English long-distance education and test system and method |
| CN107841526A (en) * | 2017-11-16 | 2018-03-27 | 北华大学 | A kind of malic dehydrogenase diagnostic kit |
| CN108039087A (en) * | 2017-12-06 | 2018-05-15 | 陈天 | A kind of long-range Piano Teaching interactive management system |
| CN108182673A (en) * | 2017-12-07 | 2018-06-19 | 山东省林业科学研究院 | A kind of improvement in salt-soda soil and administering method and system |
| CN108389444A (en) * | 2018-03-29 | 2018-08-10 | 湖南城市学院 | A kind of English language tutoring system and teaching application method |
| CN108398384A (en) * | 2018-01-29 | 2018-08-14 | 重庆交通大学 | A kind of landslide downslide amount parameter remote rapid reconnaissance method based on big data |
| CN108398905A (en) * | 2018-03-23 | 2018-08-14 | 湖南文理学院 | A kind of detection method and system of industrial stokehold technological process safety |
| CN108416833A (en) * | 2018-03-02 | 2018-08-17 | 景德镇陶瓷大学 | One kind synchronizing indoor design imaging control system based on mobile terminal data |
| CN108416700A (en) * | 2018-02-05 | 2018-08-17 | 湖南城市学院 | A kind of interior decoration design system based on AR virtual reality technologies |
| CN108426785A (en) * | 2018-01-29 | 2018-08-21 | 重庆交通大学 | A kind of rock soil medium Test Analysis of Pre-stressed method based on big data |
| CN108447535A (en) * | 2018-03-02 | 2018-08-24 | 河南中医药大学 | A kind of obstetrical and gynecological disease Medical treatment control system Internet-based |
| CN108466684A (en) * | 2018-03-27 | 2018-08-31 | 江西理工大学 | A kind of novel seabed robot |
| CN108492310A (en) * | 2018-03-27 | 2018-09-04 | 江西理工大学 | Workbench and implementation under a kind of intelligent water |
| CN108510123A (en) * | 2018-04-04 | 2018-09-07 | 农业部环境保护科研监测所 | A kind of method for optimization analysis of wet land protection and exploitation based on Internet of Things |
| CN108519745A (en) * | 2018-05-03 | 2018-09-11 | 广东水利电力职业技术学院（广东省水利电力技工学校） | A kind of motion controller system |
| CN108520231A (en) * | 2018-04-04 | 2018-09-11 | 农业部环境保护科研监测所 | A kind of analysis system and method for intelligence wetland landscape evolution process |
| CN108536104A (en) * | 2018-04-09 | 2018-09-14 | 湖南城市学院 | A kind of construction energy-conserving control method based on new energy |
| CN108645385A (en) * | 2018-04-28 | 2018-10-12 | 黄冈职业技术学院 | A kind of heavy construction steel construction intelligence deformation detecting system |
| CN108635153A (en) * | 2018-04-08 | 2018-10-12 | 鞠红梅 | A kind of occupational health diagnostic couch |
| CN108648307A (en) * | 2018-05-09 | 2018-10-12 | 青岛职业技术学院 | A kind of access control system of applying electronic password |
| CN109639926A (en) * | 2018-12-27 | 2019-04-16 | Tcl移动通信科技（宁波）有限公司 | Mobile terminal Bluetooth image method for transmission processing, mobile terminal and storage medium |
| CN109829866A (en) * | 2019-02-01 | 2019-05-31 | 安谋科技（中国）有限公司 | Column noise detecting method, device, medium and system |
| CN110235176A (en) * | 2019-04-17 | 2019-09-13 | 京东方科技集团股份有限公司 | Processing method and processing device, data transmission method and device, the storage medium of image |
| CN110248159A (en) * | 2019-06-10 | 2019-09-17 | 江苏省产品质量监督检验研究院 | One kind being used for food and beverage enterprise's offsite surveillance inspection method |
| CN110896497A (en) * | 2019-10-30 | 2020-03-20 | 厦门天锐科技股份有限公司 | Image processing method, video playing method and device |
| CN112214188A (en) * | 2020-09-11 | 2021-01-12 | 西安万像电子科技有限公司 | Image processing method and device, storage medium and processor |
| CN112565766A (en) * | 2020-11-11 | 2021-03-26 | 航天银山电气有限公司 | Video transmission method, device and storage medium |
| CN112954261A (en) * | 2021-03-18 | 2021-06-11 | 深圳奇实科技有限公司 | Video conference network flow control method and system |
| CN113546416A (en) * | 2021-08-16 | 2021-10-26 | 网易（杭州）网络有限公司 | Game scene processing method and device, computer equipment and storage medium |
| CN115496914A (en) * | 2022-08-18 | 2022-12-20 | 成都智元汇信息技术股份有限公司 | Maximum outline package extraction method and device based on column data |
| CN116469055A (en) * | 2023-04-26 | 2023-07-21 | 杨利容 | Key image area judging system for branch mark |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109537791A (en) * | 2018-11-01 | 2019-03-29 | 湖南城市学院 | A kind of dismountable modularization indoor decoration Combined type suspended ceiling structure |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101313592A (en) * | 2005-09-27 | 2008-11-26 | 高通股份有限公司 | Methods and device for data alignment with time domain boundary |
| US20120182321A1 (en) * | 2011-01-19 | 2012-07-19 | Sony Corporation | Image converter, image conversion method, program and electronic equipment |
-
2015
- 2015-02-27 CN CN201510089351.9A patent/CN104735449B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101313592A (en) * | 2005-09-27 | 2008-11-26 | 高通股份有限公司 | Methods and device for data alignment with time domain boundary |
| US20120182321A1 (en) * | 2011-01-19 | 2012-07-19 | Sony Corporation | Image converter, image conversion method, program and electronic equipment |
Non-Patent Citations (2)
| Title |
|---|
| 刘德胜: "基于矩形分割的局部渲染技术在无线图像通信中的应用", 《成都信息工程学院学报 》 * |
| 赵司井,林宏刚: "动态分块隔行扫描算法设计与实现", 《成都信息工程学院学报 》 * |
Cited By (41)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106954004A (en) * | 2017-03-17 | 2017-07-14 | 宇龙计算机通信科技(深圳)有限公司 | Screen sharing method and device |
| CN107705257A (en) * | 2017-09-15 | 2018-02-16 | 重庆科技学院 | One kind is based on partial fractional differential graph of equation image contrast method |
| CN107767368A (en) * | 2017-09-27 | 2018-03-06 | 贵阳中医学院 | A kind of multifunction electromagnetic heat cure control system and control method |
| CN107801038A (en) * | 2017-10-31 | 2018-03-13 | 灏瑰浆 | A kind of English long-distance education and test system and method |
| CN107841526A (en) * | 2017-11-16 | 2018-03-27 | 北华大学 | A kind of malic dehydrogenase diagnostic kit |
| CN108039087A (en) * | 2017-12-06 | 2018-05-15 | 陈天 | A kind of long-range Piano Teaching interactive management system |
| CN108182673A (en) * | 2017-12-07 | 2018-06-19 | 山东省林业科学研究院 | A kind of improvement in salt-soda soil and administering method and system |
| CN108426785A (en) * | 2018-01-29 | 2018-08-21 | 重庆交通大学 | A kind of rock soil medium Test Analysis of Pre-stressed method based on big data |
| CN108398384A (en) * | 2018-01-29 | 2018-08-14 | 重庆交通大学 | A kind of landslide downslide amount parameter remote rapid reconnaissance method based on big data |
| CN108416700A (en) * | 2018-02-05 | 2018-08-17 | 湖南城市学院 | A kind of interior decoration design system based on AR virtual reality technologies |
| CN108416833A (en) * | 2018-03-02 | 2018-08-17 | 景德镇陶瓷大学 | One kind synchronizing indoor design imaging control system based on mobile terminal data |
| CN108447535A (en) * | 2018-03-02 | 2018-08-24 | 河南中医药大学 | A kind of obstetrical and gynecological disease Medical treatment control system Internet-based |
| CN108398905A (en) * | 2018-03-23 | 2018-08-14 | 湖南文理学院 | A kind of detection method and system of industrial stokehold technological process safety |
| CN108466684A (en) * | 2018-03-27 | 2018-08-31 | 江西理工大学 | A kind of novel seabed robot |
| CN108492310A (en) * | 2018-03-27 | 2018-09-04 | 江西理工大学 | Workbench and implementation under a kind of intelligent water |
| CN108389444A (en) * | 2018-03-29 | 2018-08-10 | 湖南城市学院 | A kind of English language tutoring system and teaching application method |
| CN108510123A (en) * | 2018-04-04 | 2018-09-07 | 农业部环境保护科研监测所 | A kind of method for optimization analysis of wet land protection and exploitation based on Internet of Things |
| CN108520231A (en) * | 2018-04-04 | 2018-09-11 | 农业部环境保护科研监测所 | A kind of analysis system and method for intelligence wetland landscape evolution process |
| CN108635153A (en) * | 2018-04-08 | 2018-10-12 | 鞠红梅 | A kind of occupational health diagnostic couch |
| CN108536104A (en) * | 2018-04-09 | 2018-09-14 | 湖南城市学院 | A kind of construction energy-conserving control method based on new energy |
| CN108645385A (en) * | 2018-04-28 | 2018-10-12 | 黄冈职业技术学院 | A kind of heavy construction steel construction intelligence deformation detecting system |
| CN108519745A (en) * | 2018-05-03 | 2018-09-11 | 广东水利电力职业技术学院（广东省水利电力技工学校） | A kind of motion controller system |
| CN108648307A (en) * | 2018-05-09 | 2018-10-12 | 青岛职业技术学院 | A kind of access control system of applying electronic password |
| CN109639926A (en) * | 2018-12-27 | 2019-04-16 | Tcl移动通信科技（宁波）有限公司 | Mobile terminal Bluetooth image method for transmission processing, mobile terminal and storage medium |
| CN109829866B (en) * | 2019-02-01 | 2021-02-19 | 安谋科技（中国）有限公司 | Column noise detection method, apparatus, medium, and system |
| CN109829866A (en) * | 2019-02-01 | 2019-05-31 | 安谋科技（中国）有限公司 | Column noise detecting method, device, medium and system |
| CN110235176A (en) * | 2019-04-17 | 2019-09-13 | 京东方科技集团股份有限公司 | Processing method and processing device, data transmission method and device, the storage medium of image |
| WO2020211021A1 (en) * | 2019-04-17 | 2020-10-22 | 京东方科技集团股份有限公司 | Image processing method and device, data transmission method and device, and storage medium |
| US11336906B2 (en) | 2019-04-17 | 2022-05-17 | Boe Technology Group Co., Ltd. | Image processing method and device for image, data transmission method and device, and storage medium compression by combining rectangular regions of binarized images |
| CN110235176B (en) * | 2019-04-17 | 2024-03-22 | 京东方科技集团股份有限公司 | Image processing method and device, data transmission method and device and storage medium |
| CN110248159A (en) * | 2019-06-10 | 2019-09-17 | 江苏省产品质量监督检验研究院 | One kind being used for food and beverage enterprise's offsite surveillance inspection method |
| CN110896497A (en) * | 2019-10-30 | 2020-03-20 | 厦门天锐科技股份有限公司 | Image processing method, video playing method and device |
| CN112214188A (en) * | 2020-09-11 | 2021-01-12 | 西安万像电子科技有限公司 | Image processing method and device, storage medium and processor |
| CN112214188B (en) * | 2020-09-11 | 2024-06-07 | 西安万像电子科技有限公司 | Image processing method, device, storage medium and processor |
| CN112565766A (en) * | 2020-11-11 | 2021-03-26 | 航天银山电气有限公司 | Video transmission method, device and storage medium |
| CN112954261A (en) * | 2021-03-18 | 2021-06-11 | 深圳奇实科技有限公司 | Video conference network flow control method and system |
| CN113546416A (en) * | 2021-08-16 | 2021-10-26 | 网易（杭州）网络有限公司 | Game scene processing method and device, computer equipment and storage medium |
| CN113546416B (en) * | 2021-08-16 | 2024-07-02 | 网易（杭州）网络有限公司 | Game scene processing method, game scene processing device, computer equipment and storage medium |
| CN115496914A (en) * | 2022-08-18 | 2022-12-20 | 成都智元汇信息技术股份有限公司 | Maximum outline package extraction method and device based on column data |
| CN115496914B (en) * | 2022-08-18 | 2023-05-02 | 成都智元汇信息技术股份有限公司 | Method and device for extracting package of maximum outline based on column data |
| CN116469055A (en) * | 2023-04-26 | 2023-07-21 | 杨利容 | Key image area judging system for branch mark |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104735449B (en) | 2017-12-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104735449A (en) | Image transmission method and system based on rectangular segmentation and interlaced scanning | |
| US20110276653A1 (en) | Information processing device, image transmission program, image display program, and image display method | |
| WO2018103243A1 (en) | Bandwidth conserving method, system, live-streaming terminal, and readable storage medium | |
| US20210281718A1 (en) | Video Processing Method, Electronic Device and Storage Medium | |
| US9396519B2 (en) | Content aware video resizing | |
| CN105338323A (en) | Video monitoring method and device | |
| EP2458872A1 (en) | Adaptive method and system for encoding digital images for the internet | |
| EP1351494A2 (en) | Motion vector detector and motion vector detecting method | |
| CN110740352A (en) | SPICE protocol-based difference image display method in video card transparent transmission environment | |
| US7835596B2 (en) | Componentized application sharing | |
| CN106713739B (en) | Two-dimensional code identification method based on electronic screen display | |
| US7999877B2 (en) | Displaying data on lower resolution displays | |
| WO2009129419A2 (en) | Interactive display recognition devices and related methods and systems for implementation thereof | |
| CN110650309B (en) | Video conference video image transmission method, terminal and readable storage medium | |
| CN113986168B (en) | Image display method, device, equipment and readable storage medium | |
| US20230084031A1 (en) | Image-processing device and display-control method for use in display-wall system | |
| CN107318021B (en) | Data processing method and system for remote display | |
| KR101139680B1 (en) | Image dispaly apparatus for changing resolution of image data and thereof method | |
| EP3926584A1 (en) | Method, computer program and system for detecting changes and moving objects in a video view | |
| US11270442B2 (en) | Motion image integration method and motion image integration system capable of merging motion object images | |
| CN115190303A (en) | Cloud desktop image processing method and system and related equipment | |
| KR101526490B1 (en) | Visual data processing apparatus and method for Efficient resource management in Cloud Computing | |
| US20070098277A1 (en) | Transmitting apparatus, image processing system, image processing method, program, and recording medium | |
| CN112199006B (en) | Terminal equipment picture display self-adaption method | |
| CN115913939B (en) | Real-time image data modification method and device in cloud desktop image transmission process |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210622 Address after: No.105, 1st floor, building 2, No.88 Keyuan South Road, high tech Zone, Chengdu, Sichuan 610000 Patentee after: Chengdu Feige Medical Technology Co.,Ltd. Address before: 610225, No. 24, Section 1, Xuefu Road, Southwest Economic Development Zone, Chengdu, Sichuan Patentee before: CHENGDU University OF INFORMATION TECHNOLOGY |