This invention relates to video signal compression techniques.
In its raw form, video is a high volume form of data. Communication bandwidth in its variety of forms can be quickly consumed by the transmission of raw video information. Video compression techniques are known that attempt to retain the highest reproducibility of the original video while reducing the data volume required to transmit the information.
One form of video compression involves run length encoding in which patterns of pixels in a serial run of pixel information are identified, encoded, and transmitted by the code rather than by the individual pixels. U.S. patent application Ser. No. 10/260,534, entitled “Video Compression System,” filed on Oct. 1, 2002 (the '534 patent application) describes in some detail various kinds of run length encoding combined with some other types of novel pattern encoding. The entire contents of the '534 patent application are incorporated herein by reference. The algorithms referred to in the '534 patent application are sometimes referred to herein as “DVC compression.”
Another form of video compression divides video information into larger blocks of pixels and then transmits information about the block of pixels, rather than about the individual pixels themselves. In such systems, video received by a computer or other video source is usually loaded into a frame buffer. From there, blocks of information are compared to corresponding prior frame blocks to determine whether changes have occurred within the blocks. Video compression occurs because information about blocks without detected change need not be transmitted to the receiving end. Instead, the receiving end, employing the known compression algorithm used at the compression end, assumes that the pixels within a block remain the same from frame-to-frame until told otherwise by the compression end.
In an example block-by-block algorithm 8-bit video is captured and divided into 64×16 bit blocks of video for comparison with corresponding prior blocks. When video in a block is detected as changed, the information for that block is communicated to the receiving end. If no change is detected, no transmission occurs with respect to that block.
Such algorithms are presently employed in the computer environment to permit remote access to computer systems from non-proximate workstations. Keyboard, mouse and other (low volume) serial device information is communicated from the workstation to the remote computer via a communication link, and resultant (potentially high volume) video information is communicated back from the computer to the workstation via the communication link. Such systems and the methods they employ for such communications are by now well-known to the artisan.
In that computer environment, it is important that the computer video not “lag” behind the user's keyboard and mouse movements. It is unacceptable for a user to hit a key or move a mouse and see the results of that on the workstation monitor with any perceptible lag. In the remote computer environment, that means that the serial device information must communicated to the remote computer (usually a relatively easy task due to the low data volume), the computer's video processor must act on the information to create new video, and the computer's communication system must communicate the video back to the user—all before the user can detect lag between the moment the keyboard/mouse is used and the moment the resultant video is returned.
The block-by-block video encoding is one way that the video from the computer to the workstation is moved quickly back to the workstation such that no perceptible lag exists to the user. In the computer environment, many blocks within the computer screen of information may not change from frame to frame (such as on a desktop background, word processing document background, or other “inactive” location of the computer screen). With the block-by-block encoding, such blocks could be effectively ignored by the computer when sending the video information to the workstation because the workstation would assume that the blocks were not changed unless specifically told that they had been.
Block analysis occurred by evaluating pixel values within the block. One method provided a transmission of the block whenever a block change was detected, but a more improved method provided a number of pixels that had to change before the block transmission occurred. Thus, in the situation where blocks were 64×16, for example, a threshold number of six of the 1024 pixels had to change before the block was considered different enough to warrant the block transmission. The threshold gave the system room to accommodate a noise floor such that blocks could be ignored unless a change in the number of pixels exceeded a number that might be expected in a typical, noisy environment.
The block analysis was very effective in eliminating lag between keyboard/mouse entry and the corresponding video presentation. A problem developed, however, in which blocks would experience an important substantive pixel change that would go unreported to the workstation because the substantive pixel change did not cause the block to the exceed the noise threshold of, for example, six pixels changed. Examples of such occurrences included the tip of a mouse pointer moving through one or two pixels of a block. Because the number of pixels in the block that changed (the one or two pixels defining a piece of the mouse tip, or perhaps even three or four pixels once some noisiness was taken into consideration) failed to exceed the threshold, the block changes were unreported to the workstation. The effect was a lack of clarity in the mouse tip displayed at the workstation. The same situation occurred with respect to characters in a word processing document or on the desktop. If a two or three pixels of a changed character, such as the end of the hook in an “r” stretched into a block that was otherwise unchanged, the pixels would not be communicated and the end of the “r” would be deleted.
So, if the number of pixels changed within the block was set to one for the changes to be communicated, noise within the system would cause truly unchanged blocks to be communicated anyway. But, if the number of pixels changed within the block was set to more than one, potentially important pixel changes were lost.
Pixels are defined as N-bits of code defining the red hue, N-bits defining the green hue, and N-bits defining the blue hue of the pixel. In the prior system, if the block analysis detected any change in any of the N-bits of any of the three hues of any of the pixels in the block (for example, 1000 pixels in the 64×16 block), then the pixel was counted as changed for purposes of meeting the threshold number of pixels that had to change before the block was communicated. In the present embodiment, two different analyses are conducted on each block. First, a traditional delta is applied to the number of pixels in a block that change. The delta is referred to herein as a block change threshold and describes the number of pixels within a defined block that change from one reference (such as a frame) to another point (such as a subsequent frame). Thus, if any of the 3N bits in the RGB code change, the pixel is considered changed and counted for purposes of calculating the block change. If the block change exceeds a threshold, the block change is communicated to the receiving end.
The second analysis evaluates the contrast change of each independent pixel within the block. This second delta is referred to herein as a pixel change threshold and describes the extent in value to which a pixel change occurs. High contrast pixel changes will cause a block to be communicated to the receiving end—even though the block change threshold is not met.
The two-part analysis solves both of the problems characteristic of prior block analyses. First, if change occurs in a block solely because of pixel noise, the pixel change should be of low value and will register as a single pixel change for purposes of the block change calculation. If it is the only pixel change, the block change threshold will not be met, nor will the pixel change threshold (because the change in value is low contrast, i.e., low value). Accordingly, the noise will not cause the block to be transmitted, thereby conserving bandwidth. But, if the only pixel change is a high contrast change, then the block change threshold will not be met but the pixel change threshold will. Accordingly, the block will be transmitted even though the block change threshold was not met. Similarly, if a sweeping subtle color change occurs in the corner of a block, the pixel change threshold will not be met but the block change threshold (for number of changed pixels) will. Accordingly, the block will be appropriately communicated to reflect the subtle color change.
In the computer system 10 of
The typical client user will not tolerate much delay between the time the user strikes a key or moves the mouse and the time that that user sees the resultant video on the monitor (not shown) of the client 12. Thus, the loop of information between the client 12 and server 11, together with the above-described processing, must not introduce perceptible lag. Fortunately, hardware and software for processors 19 and 13 are available to rapidly process the keyboard, mouse and video information, without introducing delay perceptible to the user. The communication channel 16, on the other hand, may impose perceptible delay unless the video information 18 is satisfactorily compressed.
For that reason, video encoder 14 and video decoder 15 are provided at, respectively, the server 11 and client 12. The video encoder 14 and decoder 15 can be a system such as that described in the '534 patent application referred to in the background above, with modifications in accordance with the following descriptions.
As described above, the encoder 14 can be a block encoder in which blocks of video information are analyzed for change to determine whether communication of the block is necessary for a particular frame. In accordance with the present invention, that determination occurs on two fronts, one based on a pixel change threshold and the other based on a block change threshold.
In the block change threshold determination, the number of pixels that change in value within the block are counted and compared to a threshold. If the number exceeds the threshold, the block is considered sufficiently changed to warrant transmission.
In the pixel change threshold determination, the value of change in each pixel is analyzed and the change values compared to a threshold. If the change value of any pixel in the block exceeds the threshold, the block is considered sufficiently changed to warrant transmission.
Transmission of “the block” can take a variety of forms, all of which are encompassed within the present invention. In the basic form, the raw pixel values for the block are communicated in serial fashion. In a more preferable form, the serial pixel values for the block are passed through the DVC compression technique of the '534 patent application for further compression. Other forms of compression are equally plausible. The present invention is not limited to any particular manner in which the block (once identified as a candidate for transmission) is transmitted from the server 11 via the channel 16 to the client 12.
If the system used the prior art block analysis, the block 25 would not qualify for transmission because the number of changed pixels (four) would not meet the threshold (six) required for the server 11 to communicate the block change. The result means that the user of the client 12 will receive video on the monitor with block 25 unchanged, i.e., the potion 21A of the cursor 21 will be cut off. Such rounded pointer tips and other flaws in the clarity of characters are characteristic of block analysis systems.
The present invention solves that problem by combining the block threshold analysis with a substantially simultaneous pixel contrast analysis. In accordance with the preferred embodiment, the block 25 of
The present invention is not delimited by actual number for the block count threshold. As described above, a threshold of six pixels per 64×16 block can be useful. But, so too can thresholds of less than a 6/1000 ratio, even to a threshold of 2 pixels per block of many tens or hundreds of thousands of pixels per block. The actual number is not delimiting, since the artisan with the understanding gained from this disclosure will recognize that more or less sensitivity can be achieved as desired by increasing or decreasing the threshold. Thus, the threshold that provides high noise suppression, such as requiring all of the pixels changed per block before the block is transmitted can be envisioned if, for example, the block is defined as a relatively small 2×2. The present invention is intended to cover all such threshold values, from two pixels to 100% of the pixels in a block.
Similarly, the actual pixel change threshold is not a limiting factor of the present invention in its broadest forms. Since the transmission decision is a function of both the block change threshold and the pixel change threshold, the two values should preferably be chosen to compliment each other. A relatively lower pixel change threshold causes lower contrast changes in a single pixel to trigger block transmission. A relatively higher pixel change threshold will reduce the possibility of block transmission. Design choices can be made based on such criteria as the noise floor, nominal noise spikes, the number of bits per color component, and the like such that substantive pixel changes are communicated while noise changes are not. The present invention is intended to cover all such threshold values, from a low pixel contrast delta of value=1 to a high pixel contrast delta of 50% or more of the pixel color value.
Pixel Threshold Block 44 receives a noise threshold 45 which is compared to each pixel difference value received from the Pixel Difference Block 43. That is, as each pixel difference value (indicating the extent of contrast between the three 5-bit color component values of the current pixel compared to its counterpart in the immediately preceding frame) is received from the Pixel Difference Block 43, it is compared to the noise threshold to determined whether a change in the pixel value is going to be deemed to have occurred. Delta values from the Pixel Difference block 43 that fall below the noise threshold 45 will be presumed to have been unchanged, i.e., system induced rather than substantive screen image changes. The noise threshold can be a five bit signal to evaluate each of the three five bit color component values received as the difference signal from the Pixel Difference Block 43. Block 44 responds with a positive output signal to the Threshold Block Counters 50 each time the difference value received from the Pixel Difference block 43 exceeds the noise threshold. The output signal cnt++ is a count signal received by the Threshold Block Counters 50 which count the number of such signals received.
Meanwhile, the same delta value for the current pixel is received from the Pixel Difference Block 43 by the Pixel Threshold Block 46. The Pixel Threshold Block 46 compares the delta to another threshold, the “Override Threshold” 47, which it receives as the threshold over which the pixel will be said to have changed so substantively that it must be communicated to the client 12 regardless of other pixel changes within the block. When the Pixel Threshold Block 46 receives a pixel delta value that exceeds that override threshold, the block 46 communicates a number of signals to the Threshold Block Counters 50 equal to the “Count Threshold Number” 52 at which the system will send the block to the client. In other words, in the example of
The Counter 50 counts all of the pixel reports from both the Block 44 and the Block 46 for a full block. When the block of pixels begins at the Pixel Difference Block 43, the processor (not shown in
The number of excess deltas counted by the Counter 50 is reported to the Comparators 51, which determine whether the counted number of excess deltas exceeded the count threshold 52 for the block reported. If they did, the Comparators 51 report the block condition (changed or unchanged) to the Block Update Memory 55, which sets a flag for each block that requires updating, i.e., communication to the receiving end. When the frame of input video 41 is completed, the Block Update Memory communicates the block identities that require communication (based on the set flags) to the memory controller 58 which causes a download of those blocks from the Reference Memory to the DVC Compression Block 59.
Once a block is identified for transmission, the memory 57 provides the blocks that require communication to the DVC Compression Block 59. The DVC Compression Block 59 receives the requisite blocks, compresses the blocks of information (per the '534 patent application disclosure), and releases the compressed stream to Output FIFO 60. The compressed stream of video can then go on the Processor Bus 61 for transmission via, for example, a communication channel interface, to the communication channel 16.
The structure of
Nor is the method of tricking the Counter 50 into a maximum count the only method envisioned by the present invention for determining when a block will be transmitted prior to the true count of pixel changes reaching the count threshold. Other methods could envision a direct reporting of that condition to the memory controller, or a completely independent path of processing elements for analyzing the block count versus the pixel value count.
While the invention has been described in connection with what is presently considered to be the most practical and preferred embodiment, it is to be understood that the invention is not to be limited to the disclosed embodiment, but on the contrary, is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
3710011 | Altemus et al. | Jan 1973 | A |
3925762 | Heitlinger et al. | Dec 1975 | A |
3935379 | Thornburg et al. | Jan 1976 | A |
4005411 | Morrin, II | Jan 1977 | A |
4134133 | Teramura et al. | Jan 1979 | A |
4142243 | Bishop et al. | Feb 1979 | A |
4369464 | Temime | Jan 1983 | A |
4384327 | Conway et al. | May 1983 | A |
4667233 | Furukawa | May 1987 | A |
4764769 | Hayworth et al. | Aug 1988 | A |
4774587 | Schmitt | Sep 1988 | A |
4816901 | Music et al. | Mar 1989 | A |
4855825 | Santamaki et al. | Aug 1989 | A |
4873515 | Dickson | Oct 1989 | A |
4959833 | Mercola et al. | Sep 1990 | A |
5046119 | Hoffert et al. | Sep 1991 | A |
5083214 | Knowles | Jan 1992 | A |
5235595 | O'Dowd | Aug 1993 | A |
5251018 | Jang et al. | Oct 1993 | A |
5325126 | Keith | Jun 1994 | A |
5339164 | Lim | Aug 1994 | A |
5387947 | Shin | Feb 1995 | A |
5418952 | Morley et al. | May 1995 | A |
5430848 | Waggener | Jul 1995 | A |
5465118 | Hancock et al. | Nov 1995 | A |
5497434 | Wilson | Mar 1996 | A |
5519874 | Yamagishi et al. | May 1996 | A |
5526024 | Gaglianello et al. | Jun 1996 | A |
5566339 | Perholtz et al. | Oct 1996 | A |
5572235 | Mical et al. | Nov 1996 | A |
5630036 | Sonohara et al. | May 1997 | A |
5659707 | Wang et al. | Aug 1997 | A |
5664029 | Callahan et al. | Sep 1997 | A |
5664223 | Bender et al. | Sep 1997 | A |
5721842 | Beasley et al. | Feb 1998 | A |
5731706 | Koeman et al. | Mar 1998 | A |
5732212 | Perholtz et al. | Mar 1998 | A |
5754836 | Rehl | May 1998 | A |
5757973 | Wilkinson | May 1998 | A |
5764479 | Crump et al. | Jun 1998 | A |
5764924 | Hong | Jun 1998 | A |
5764966 | Mote, Jr. | Jun 1998 | A |
5781747 | Smith et al. | Jul 1998 | A |
5784488 | Kuwata | Jul 1998 | A |
5796864 | Callahan | Aug 1998 | A |
5799207 | Wang et al. | Aug 1998 | A |
5805735 | Chen et al. | Sep 1998 | A |
5812169 | Tai et al. | Sep 1998 | A |
5812534 | Davis et al. | Sep 1998 | A |
5828848 | MacCormack et al. | Oct 1998 | A |
5844940 | Goodson et al. | Dec 1998 | A |
5861764 | Singer et al. | Jan 1999 | A |
5864681 | Proctor et al. | Jan 1999 | A |
5867167 | Deering | Feb 1999 | A |
5870429 | Moran et al. | Feb 1999 | A |
5898861 | Emerson et al. | Apr 1999 | A |
5929915 | Cho | Jul 1999 | A |
5946451 | Soker | Aug 1999 | A |
5948092 | Crump et al. | Sep 1999 | A |
5967853 | Hashim | Oct 1999 | A |
5968132 | Tokunaga et al. | Oct 1999 | A |
5997358 | Adriaenssens et al. | Dec 1999 | A |
6003105 | Vicard et al. | Dec 1999 | A |
6008847 | Bauchspies | Dec 1999 | A |
6012101 | Heller et al. | Jan 2000 | A |
6016316 | Moura et al. | Jan 2000 | A |
6032261 | Hulyalkar | Feb 2000 | A |
6038346 | Ratnakar | Mar 2000 | A |
6040864 | Etoh | Mar 2000 | A |
6055597 | Houg | Apr 2000 | A |
6060890 | Tsinker | May 2000 | A |
6065073 | Booth | May 2000 | A |
6070214 | Ahern | May 2000 | A |
6084638 | Hare et al. | Jul 2000 | A |
6094453 | Gosselin et al. | Jul 2000 | A |
6097368 | Zhu et al. | Aug 2000 | A |
6124811 | Acharya | Sep 2000 | A |
6134613 | Stephenson et al. | Oct 2000 | A |
6146158 | Peratoner et al. | Nov 2000 | A |
6154492 | Araki et al. | Nov 2000 | A |
6195391 | Hancock et al. | Feb 2001 | B1 |
6202116 | Hewitt | Mar 2001 | B1 |
6233226 | Gringeri et al. | May 2001 | B1 |
6240481 | Suzuki | May 2001 | B1 |
6240554 | Fenouil | May 2001 | B1 |
6243496 | Wilkinson | Jun 2001 | B1 |
6304895 | Schneider et al. | Oct 2001 | B1 |
6327307 | Brailean et al. | Dec 2001 | B1 |
6330017 | Suzuki | Dec 2001 | B1 |
6345323 | Beasley et al. | Feb 2002 | B1 |
6360017 | Chiu et al. | Mar 2002 | B1 |
6370191 | Mahant-Shetti et al. | Apr 2002 | B1 |
6373890 | Freeman | Apr 2002 | B1 |
6377313 | Yang et al. | Apr 2002 | B1 |
6377640 | Trans | Apr 2002 | B2 |
6404932 | Hata et al. | Jun 2002 | B1 |
6418494 | Shatas et al. | Jul 2002 | B1 |
6425033 | Conway et al. | Jul 2002 | B1 |
6453120 | Takahashi | Sep 2002 | B1 |
6470050 | Ohtani et al. | Oct 2002 | B1 |
6496601 | Migdal et al. | Dec 2002 | B1 |
6512595 | Toda | Jan 2003 | B1 |
6516371 | Lai et al. | Feb 2003 | B1 |
6522365 | Levantovsky et al. | Feb 2003 | B1 |
6539418 | Schneider et al. | Mar 2003 | B2 |
6542631 | Ishikawa | Apr 2003 | B1 |
6567464 | Hamdi | May 2003 | B2 |
6571393 | Ko et al. | May 2003 | B1 |
6574364 | Economidis et al. | Jun 2003 | B1 |
6584155 | Takeda et al. | Jun 2003 | B2 |
6590930 | Greiss | Jul 2003 | B1 |
6661838 | Koga et al. | Dec 2003 | B2 |
6664969 | Emerson et al. | Dec 2003 | B1 |
6701380 | Schneider et al. | Mar 2004 | B2 |
6754241 | Krishnamurthy et al. | Jun 2004 | B1 |
6785424 | Sakamoto | Aug 2004 | B1 |
6829301 | Tinker et al. | Dec 2004 | B1 |
6833875 | Yang et al. | Dec 2004 | B1 |
6871008 | Pintz et al. | Mar 2005 | B1 |
6898313 | Li et al. | May 2005 | B2 |
6940900 | Takamizawa | Sep 2005 | B2 |
6972786 | Ludwig | Dec 2005 | B1 |
6990148 | Yang | Jan 2006 | B2 |
7006700 | Gilgen | Feb 2006 | B2 |
7013255 | Smith, II | Mar 2006 | B1 |
7016413 | Hall et al. | Mar 2006 | B2 |
7020732 | Shatas et al. | Mar 2006 | B2 |
7031385 | Inoue et al. | Apr 2006 | B1 |
7085319 | Prakash et al. | Aug 2006 | B2 |
7093008 | Agerholm et al. | Aug 2006 | B2 |
7143432 | Brooks et al. | Nov 2006 | B1 |
7221389 | Ahern et al. | May 2007 | B2 |
7222306 | Kaasila et al. | May 2007 | B2 |
7272180 | Dambrackas | Sep 2007 | B2 |
7277104 | Dickens et al. | Oct 2007 | B2 |
7321623 | Dambrackas | Jan 2008 | B2 |
7336839 | Gilgen | Feb 2008 | B2 |
7373008 | Clouthier et al. | May 2008 | B2 |
7457461 | Gilgen | Nov 2008 | B2 |
7466713 | Saito | Dec 2008 | B2 |
7515632 | Dambrackas | Apr 2009 | B2 |
7515633 | Dambrackas | Apr 2009 | B2 |
7542509 | Dambrackas | Jun 2009 | B2 |
7609721 | Rao et al. | Oct 2009 | B2 |
7720146 | Dambrackas | May 2010 | B2 |
7782961 | Shelton et al. | Aug 2010 | B2 |
7809058 | Dambrackas | Oct 2010 | B2 |
7941634 | Georgi et al. | May 2011 | B2 |
20010048667 | Hamdi | Dec 2001 | A1 |
20020118754 | Choi | Aug 2002 | A1 |
20030005186 | Gough | Jan 2003 | A1 |
20030048943 | Ishikawa | Mar 2003 | A1 |
20030202594 | Lainema | Oct 2003 | A1 |
20030231204 | Hanggie et al. | Dec 2003 | A1 |
20040017514 | Dickens et al. | Jan 2004 | A1 |
20040062305 | Dambrackas | Apr 2004 | A1 |
20040064198 | Reynolds et al. | Apr 2004 | A1 |
20040122931 | Rowland et al. | Jun 2004 | A1 |
20040228526 | Lin et al. | Nov 2004 | A9 |
20050005102 | Meggitt et al. | Jan 2005 | A1 |
20050025248 | Johnson et al. | Feb 2005 | A1 |
20050057777 | Doron | Mar 2005 | A1 |
20050069034 | Dambrackas | Mar 2005 | A1 |
20050089091 | Kim et al. | Apr 2005 | A1 |
20050108582 | Fung | May 2005 | A1 |
20050135480 | Li et al. | Jun 2005 | A1 |
20050157799 | Raman et al. | Jul 2005 | A1 |
20050198245 | Burgess et al. | Sep 2005 | A1 |
20050231462 | Chen | Oct 2005 | A1 |
20050249207 | Zodnik | Nov 2005 | A1 |
20050286790 | Gilgen | Dec 2005 | A1 |
20060039404 | Rao et al. | Feb 2006 | A1 |
20060092271 | Banno et al. | May 2006 | A1 |
20060120460 | Gilgen | Jun 2006 | A1 |
20060126718 | Dambrackas et al. | Jun 2006 | A1 |
20060126720 | Dambrackas | Jun 2006 | A1 |
20060126721 | Dambrackas | Jun 2006 | A1 |
20060126722 | Dambrackas | Jun 2006 | A1 |
20060126723 | Dambrackas | Jun 2006 | A1 |
20060161635 | Lamkin et al. | Jul 2006 | A1 |
20060262226 | Odryna et al. | Nov 2006 | A1 |
20070019743 | Dambrackas | Jan 2007 | A1 |
20070165035 | Duluk et al. | Jul 2007 | A1 |
20070180407 | Vahtola | Aug 2007 | A1 |
20070248159 | Dambrackas | Oct 2007 | A1 |
20070253492 | Shelton et al. | Nov 2007 | A1 |
20090290647 | Shelton et al. | Nov 2009 | A1 |
Number | Date | Country |
---|---|---|
0395416 | Oct 1990 | EP |
0495490 | Jul 1992 | EP |
0780773 | Jun 1997 | EP |
0 844 567 | May 1998 | EP |
0270896 | Jun 1998 | EP |
0899959 | Mar 1999 | EP |
2318956 | Jun 1998 | GB |
2350039 | Nov 2000 | GB |
2388504 | Nov 2003 | GB |
64-077374 | Sep 1987 | JP |
62-077935 | Oct 1987 | JP |
63-108879 | May 1988 | JP |
01-162480 | Jun 1989 | JP |
01-303988 | Dec 1989 | JP |
H03-130767 | Apr 1991 | JP |
3192457 | Aug 1991 | JP |
6-77858 | Mar 1994 | JP |
H8-223579 | Feb 1995 | JP |
08-033000 | Feb 1996 | JP |
08-263262 | Oct 1996 | JP |
09-233467 | Sep 1997 | JP |
09-231672 | Dec 1997 | JP |
9-321672 | Dec 1997 | JP |
11-308465 | Apr 1998 | JP |
10-215379 | Aug 1998 | JP |
10-257485 | Sep 1998 | JP |
11-184800 | Jul 1999 | JP |
11-184801 | Jul 1999 | JP |
11-203457 | Jul 1999 | JP |
11-308465 | Nov 1999 | JP |
11-313213 | Nov 1999 | JP |
2000-125111 | Apr 2000 | JP |
2001-053620 | Feb 2001 | JP |
2001-148849 | May 2001 | JP |
2001-169287 | Jun 2001 | JP |
2002-043950 | Feb 2002 | JP |
2002-165105 | Jun 2002 | JP |
2003-174565 | Jun 2003 | JP |
2003-244448 | Aug 2003 | JP |
2003-250053 | Sep 2003 | JP |
2004-032698 | Jan 2004 | JP |
2004-220160 | Aug 2004 | JP |
589871 | Jun 2004 | TW |
I220036 | Aug 2004 | TW |
WO 9741514 | Nov 1997 | WO |
WO 9826603 | Jun 1998 | WO |
WO 9854893 | Dec 1998 | WO |
WO 9950819 | Oct 1999 | WO |
WO 0122628 | Mar 2001 | WO |
WO 02062050 | Aug 2002 | WO |
WO 03055094 | Jul 2003 | WO |
WO 03071804 | Aug 2003 | WO |
WO 2004032356 | Apr 2004 | WO |
WO 2004081772 | Sep 2004 | WO |
WO 2004064402 | Jul 2014 | WO |
Entry |
---|
Office Action Issued Jul. 11, 2006, in Corresponding Japanese Patent Application No. 2006-024444. |
Office Action Issued Jul. 4, 2006, in Corresponding Japanese Patent Application No. 2006-024442. |
Office Action Issued Jul. 4, 2006, in Corresponding Japanese Patent Application No. 2006-024443. |
Office Action Issued Mar. 7, 2006, in Corresponding Japanese Patent Application No. 2004-541433. |
Office Action Issued Mar. 7, 2006, in Corresponding Japanese Patent Application No. 2006-024442. |
Office Action Issued Mar. 7, 2006, in Corresponding Japanese Patent Application No. 2006-024443. |
Office Action Issued Mar. 7, 2006, in Corresponding Japanese Patent Application No. 2006-024444. |
International Preliminary Examination Report in Corresponding PCT Application No. PCT/US2003/030650, mailed Aug. 25, 2006. |
PCT International Search Report in corresponding PCT Application No. PCT/US2003/030650 mailed Apr. 20, 2006. |
PCT International Search Report for PCT/US05/17626, International filing date Jan. 3, 2006. |
PCT International Search Report for PCT/US05/19256, International filing date Oct. 25, 2005. |
Chinese Appln. No. 03816346.2—Jun. 12, 2009 SIPO Office Action (Translation). |
Chrysafis et al., “Line-Based, Reduced Memory, Wavelet Image Compression,” Mar. 2000 [retrieved on Aug. 20, 2008], Retrieved from the internet: <http://sipi.usc.edu/˜ortega/Students/chrysafi/doc/ChristosChrysafis—line—based—I—P2000.pdf>. |
EP Appln. No. 03818864.5—Aug. 24, 2009 EPO Office Action. |
IL Appln. No. 171878—Apr. 28, 2009 Translation of Office Action. |
International Search Report and Written Opinion mailed Sep. 4, 2008 in PCT/US07/10376. |
Matsui et al., “High-speed Transmission of Sequential Freeze-pictures by Exchanging Changed Areas”, IEEE Transactions on Communications, IEEE Service Center, Piscataway, NJ, vol. COM-29, No. 12, Dec. 1, 1981, XP002089584, ISSN: 0090-6778. |
Office Action Issued Aug. 5, 2008 in Japanese Patent Application No. 2006-271932 (with English translation). |
Office Action issued Jul. 31, 2007 in Japanese Patent Application No. 2006-024444 (with English translation). |
Search Report and Written Opinion mailed Aug. 26, 2008 in PCT Appln. No. PCT/US2006/021182. |
Thyagarajan K. S. et al., “Image Sequence Coding Using lnterframe VDPCM and Motion Compensation”, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing-proceedings 1989 Publ. by IEEE, vol. 3, 1989, pp. 1858-1861, XP010082957. |
U.S. Appl. No. 11/339,537—May 13, 2009 PTO Office Action. |
U.S. Appl. No. 11/790,994—Jun. 2, 2009 PTO Office Action. |
U.S. Appl. No. 11/819,047—Aug. 26, 2009 PTO Office Action. |
Official Action issued Dec. 9, 2008 in JP Appln. No. 2005-510478 [with English translation]. |
CN Appln. No. 200710167085.2—Jun. 26, 2009 SIPO Office Action. |
U.S. Appl. No. 12/318,074—Sep. 14, 2009 PTO Office Action. |
CA Appln. No. 2,571,478—Jan. 31, 2012 CIPO Office Action. |
CA Appln. No. 2,625,462—Jan. 5, 2012 CIPO Office Action. |
CA Appln. No. 2,625,658—Jun. 4, 2012 CIPO Office Action. |
CA Appln. No. 2,630,532—Mar. 20, 2012 CIPO Office Action. |
CA Appln. No. 2,650,663—Feb. 1, 2012 CIPO Office Action. |
EP Appln. No. 05756603.6—Dec. 13, 2011 EP Office Action. |
Extended European Search Report mailed Feb. 14, 2012 in EPO Appln. No. 05854984.1. |
IL191529—Dec. 4, 2011 Ministry of Justice Commissioner of Patents Office Action with translation. |
Official Letter mailed Mar. 16, 2012 in TW 94117242. |
U.S. Appl. No. 11/889,525—Feb. 15, 2012 PTO Office Action. |
U.S. Appl. No. 12/458,818—Jan. 26, 2012 PTO Office Action. |
“Lossless and Near-Lossless Coding of Continuous Tone Still Images (JPEG-LS)”, ISO/IEC JTC1/SC29/WG1 FCD 14495—Public Draft, XX, XX Jul. 16, 1997, pp. I-IV,1, XP002260316, Retrieved from the Internet: URL:http://www.jpeg.org/public/fcd14495p.pdf paragraphs [04.2], [04.4], [A. |
CN Appln. No. 200910223192.1—May 10, 2012 SIPO Office Action with English translation. |
EP Appln. No. 05754824.0—Jul. 6, 2012 EPO Supplementary Search Report. |
Kyeong Ho Yang et al: “A contex-based predictive coder for lossless and near-lossless compression of video”, Image Processing, 2000. Proceedings. 2000 International Conference on Sep. 10-13, 2000, IEEE, Piscataway, NJ, USA, vol. 1, Sep. 10, 2000 pp. 144-1. |
CA Appln. No. 2,630,532—Jul. 25, 2011 CIPO Office Action. |
U.S. Appl. No. 11/707,879—Nov. 28, 2011 PTO Office Action. |
U.S. Appl. No. 12/458,818—Nov. 22, 2011 PTO Office Action. |
CN Appln. No. 201220113443.8—Aug. 22, 2012 SIPO Office Action with English translation. |
CN Appln. No. 201220113511.0—Aug. 8, 2012 SIPO Office Action. |
U.S. Appl. No. 13/069,726—Oct. 12, 2012 PTO Office Action. |
U.S. Appl. No. 13/070,175—Oct. 12, 2012 PTO Office Action. |
International Search Report and Written Opinion mailed Sep. 14, 2010 in PCT Appln. No. PCT/US2010/001941. |
CA Appln. No. 2,524,001—Aug. 30, 2010 CIPO Office Action. |
CN Appln. No. 200710167085.2—Aug. 2, 2011 SIPO Office Action (with English Translation). |
CA Appln. No. 2,627,037—Sep. 9, 2010 CIPO Office Action. |
CN Appln. No. 200710167085.2—Aug. 6, 2010 SIPO Office Action. |
JP Appln. No. 2007-098267—Jul. 27, 2010 JPO Notice of Reasons for Rejection with translation. |
CA Appln. No. 2,625,658—Oct. 12, 2011 CIPO Office Action. |
JP Appln. No. 2007-098267—Oct. 11, 2011 JPO Final Notice of Reasons for Rejection. |
Bowling, Carl D. et al., “Motion Compensated Image Coding with a Combined Maximum A Posteriori and Regression Algorithm,” IEEE Transactions on Communications, New York, USA, vol. COM-33, No. 8, Aug. 1, 1985, pp. 844-857. |
EP Appln. No. 03818864.5—Sep. 20, 2012 EPO Office Action. |
Puri, A. et al., “Motion-compensated transform coding based on block motion-tracking algorithm,” International Conferences on Communications 1987, IEEE, pp. 136-140. |
Chinese Appln. No. 03816346.2—Jul. 6, 2011 SIPO Office Action (Translation). |
EP Appln. No. 03723915—Aug. 1, 2011 EPO Supplementary European Search Report. |
EP Appln. No. 07776613—Jul. 25, 2011 EPO Supplementary European Search Report. |
JP Appln. No. 2007-518071—Sep. 6, 2011 Decision of Rejection with statement of relevancy. |
U.S. Appl. No. 12/801,293—Aug. 15, 2011 PTO Office Action. |
U.S. Appl. No. 10/260,534, filed Oct. 1, 2002, Dambrackas. |
U.S. Appl. No. 10/434,339, filed May 9, 2003, Dambrackas. |
U.S. Appl. No. 10/629,855, filed Jul. 30, 2003, Johnson et al. |
U.S. Appl. No. 10/875,678, filed Jun. 24, 2004, Gilgen. |
U.S. Appl. No. 10/875,679, filed Jun. 25, 2004, Gilgen. |
U.S. Appl. No. 11/282,688, filed Nov. 21, 2005, Dambrackas et al. |
U.S. Appl. No. 11/339,537, filed Jan. 26, 2006, Dambrackas. |
U.S. Appl. No. 11/339,541, filed Jan. 26, 2006, Dambrackas. |
U.S. Appl. No. 11/339,542, filed Jan. 26, 2006, Dambrackas. |
U.S. Appl. No. 11/340,476, filed Jan. 27, 2006, Dambrackas. |
U.S. Appl. No. 11/528,569, filed Sep. 28, 2006, Dambrackas et al. |
U.S. Appl. No. 11/707,863, filed Feb. 20, 2007, Hickey et al. |
U.S. Appl. No. 11/707,879, filed Feb. 20, 2007, Hickey et al. |
U.S. Appl. No. 11/707,880, filed Feb. 20, 2007, Hickey et al. |
U.S. Appl. No. 11/819,047, filed Jun. 25, 2007, Dambrackas. |
U.S. Appl. No. 11/889,268, filed Aug. 10, 2007, Hickey et al. |
U.S. Appl. No. 60/774,186, filed Feb. 17, 2006, Hickey. |
U.S. Appl. No. 60/795,577, filed Apr. 28, 2006, Shelton, Gary. |
U.S. Appl. No. 60/836,649, filed Aug. 10, 2006, Hickey. |
U.S. Appl. No. 60/836,930, filed Aug. 11, 2006, Hickey. |
U.S. Appl. No. 60/848,488, filed Sep. 29, 2006, Hickey. |
“Avocent Install and Discovery Protocol Specification,” Version 1.3, Avocent Corporation Jul. 9, 2003 [30 pages]. |
“Avocent Secure Management Protocol Specification,” Version 1.8, Avocent Corporation Apr. 8, 2005 [64 pages]. |
CA Appln. No. 2,382,403—Dec. 8, 2009 CIPO Office Action. |
CA Appln. No. 2,476,102—Apr. 16, 2009 CIPO Office Action. |
CA Appln. No. 2,676,794—Feb. 12, 2010 CIPO Office Action. |
Digital Semiconductor 21152 PCI-To-PCI Bridge, Data Sheet, Feb. 1996, Digital Equipment Corporation, Maynard, Mass. |
Duft et al. (ed.) “Xilinx Breaks One Million-Gate Barrier with Delivery of New Virtex Series”, Press Kit, Xilinx, Oct. 1998. |
EP Appln. No. 057756603.6—Nov. 23, 2010 EPO Supplementary Search Report. |
European Office Action in European application 99960160.2, dated Mar. 16, 2006. |
European Office Action in European Application No. 99960160.2-2212 dated Nov. 15, 2006. |
Hill, T. “Virtex Design Methodology Using Leonardo Spectrum 1999.1”, Applications Note, Exemplar Logic Technical Marketing, Apr. 1999, Rev. 3.0, pp. 1-47. |
Hsieh et al “Architectural Power Optimization by Bus Splitting”, Design, Automation and Test in Europe Conference and Exhibition 2000. Proceedings, pp. 612-616. |
IBM Tech. Disc. Bull. “Procedure and Design to Facilitate”, Apr. 1994, vol. 37, Issue 4B, pp. 215-216. |
IBM Technical Disclosure Bulletin, “Multimedia System Packaging”, Sep. 1993, vol. 36, Issue 9A, pp. 525-530. |
IL Appln. No. 184058—Jul. 14, 2010 Ministry of Justice Commissioner of Patents Office Action with translation. |
International Preliminary Examination Report in PCT application PCT/US2003/04707, mailed Oct 1, 2004. |
International Search Report and Written Opinion mailed Aug. 1, 2008 in PCT Application PCT/US05/46352. |
International Search Report and Written Opinion mailed Jul. 29, 2008 in PCT Application PCT/US07/17700. |
International Search Report relating to PCT/US03/04707 dated Jul. 11, 2003. |
International Search Report, PCT/US99/25290 mailed Feb. 10, 2000. |
International Search Report, PCT/US99/25291 mailed Feb. 7, 2000. |
JP Appln. No. 2003-570573—Jul. 21, 2009 Office Action with English translation. |
McCloghrie, K., “Management Information Base for Network Management of TCP/IP-based internets: MIB II,” Network Working Group, Performance Systems International, (RFC 1213) Mar. 1991 [70 pages]. |
Mobility Electronics, Inc. Brochure for PCI Split Bridge, Scottsdale, AZ, 1999. |
MY Appln. No. PI20030508—Mar. 6, 2007 MyIPO Substantive Examination Adverse Report. |
MY Appln. No. PI20056038—Sep. 11, 2009 MyIPO Substantive Examination Adverse Report. |
MY Appln. No. PI20056038—Aug. 30, 2010 MyIPO Substantive Examination Adverse Report. |
MY Appln. No. PI20062195—Sep. 11, 2009 MyIPO Adverse Examination Report. |
Official Action mailed Feb. 6, 2008 in Japanese Application No. 2003-570573 [with English translation]. |
PCI Local Bus Specification, Revision 2.1, Jun. 1995, The PCI Special Interest Group, Portland, Oregon. |
PCT Written Opinion in PCT application PCT/US2003/04707, mailed Mar. 4, 2004. |
Schutti et al. “Data Transfer between Asynchronous Clock Domains without Pain”, RIIC, SNUG Europe 2000, Rev. 1.1, Feb. 2000, pp. 1-12. |
Search Report and Written Opinion mailed Jul. 16, 2008 in PCT Appln. No. PCT/US2007/17699. |
Supplementary European Search Report dated Aug. 9, 2010 in EP Appln. No. 03709132.9. |
U.S. Appl. No. 11/303,031—Apr. 29, 2009 PTO Office Action. |
CN Appln. No. 03816346.2—Nov. 13, 2011 Office Action (with English translation). |
EP Appln. No. 03818864.5—May 8, 2009 EPO Office Action. |
Supplementary European Search Report mailed Nov. 23, 2010 in EP Appln. No. 05756603. |
CA Appln. No. 2,524,001—Nov. 30, 2009 CIPO Office Action. |
IL Appln. No. 167787—Jul. 21, 2009 Office Action. |
JP Appln. No. 2005-510478—Jul. 7, 2009 Notice of Reasons for Rejection [English translation]. |
JP Appln. No. 2006-271932—Oct. 6, 2009 Office Action with English summary. |
U.S. Appl. No. 11/790,994—Feb. 2, 2010 PTO Office Action. |
European Office Action in EP Appln. No. 057566036, dated Apr. 7, 2011 [6 pages]. |
U.S. Appln. No. 12/533,073—Mar. 9, 2011 PTO Office Action. |
CN Appln. No. 200710167085.2—Dec. 27, 2010 SIPO Office Action translation. |
JP 2007-518071—Feb. 8, 2011 JIPO Office Action. |
JP Appln. No. 2007-518086—Feb. 15, 2011 JPO Office Action. |
U.S. Appl. No. 11/282,688—Apr. 28, 2010 PTO Office Action. |
U.S. Appl. No. 11/528,569—May 20, 2011 PTO Office Action. |
U.S. Appl. No. 12/533,073—May 23, 2011 PTO Office Action. |
JP Appln. No. 2007-518086—Jun. 21, 2011 JIPO Office Action. |
CA Appln. No. 2,630,532—Nov. 27, 2012 CIPO Office Action. |
Cagnazzo, Marco et al., “Low-Complexity Scalable Video Coding through Table Lookup VQ and Index Coding,” IDMS/PROMS 2002, LNCS 2515, pp. 166-175, 2002. |
EP Appln. No. 05754824.0—Sep. 14, 2012 EPO Office Action. |
EP Appln. No. 06849789.0—Oct. 23, 2012 Supplementary European Search Report. |
Goldberg, Morris et al., “Image Sequence Coding Using Vector Quantization,” IEEE Transactions on Communications., vol. COM-34, No. 7, Jul. 1986. |
MY Appln. No. P120084298—Aug. 30, 2012 MyIPO Substantive Examination Adverse Report. |
Official Letter mailed Sep. 17, 2012 in TW Appln. No. 95120039. |
TW Appln. No. 94145077—May 17, 2012 Taiwanese Patent Office Official Letter. |
JP Appln. No. 2005-510478—Jul. 6, 2010 Decision of Rejection (English translation). |
Extended European Search Report mailed Jul. 16, 2014 in EP Appln. No. 07776448.8. |
U.S. Appl. No. 10/629,855—Aug. 12, 2014 Examiner's Answer. |
U.S. Appl. No. 11/889,525—Apr. 23, 2014 PTO Notice of Allowance. |
U.S. Appl. No. 13/749,219—Oct. 22, 2014 PTO Office Action. |
U.S. Appl. No. 13/908,647—Feb. 12, 2016 PTO Office Action. |
Number | Date | Country | |
---|---|---|---|
20050025248 A1 | Feb 2005 | US |