Fast two-dimensional pattern matching
Information Processing Letters
Digital video processing
Using latency to evaluate interactive system performance
OSDI '96 Proceedings of the second USENIX symposium on Operating systems design and implementation
The interactive performance of SLIM: a stateless, thin-client architecture
Proceedings of the seventeenth ACM symposium on Operating systems principles
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
IEEE Internet Computing
Measuring Thin-Client Performance Using Slow-Motion Benchmarking
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
A Streaming Piecewise-Constant Model
DCC '99 Proceedings of the Conference on Data Compression
Content Layer Progressive Coding of Digital Maps
DCC '00 Proceedings of the Conference on Data Compression
A Novel Codec for Thin Client Computing
DCC '00 Proceedings of the Conference on Data Compression
Context Models for Palette Images
DCC '98 Proceedings of the Conference on Data Compression
A Lossless 2-D Image Compression Technique for Synthetic Discrete-Tone Images
DCC '98 Proceedings of the Conference on Data Compression
Lossless Image Data Sequence Compression Using Optimal Context Quantization
DCC '01 Proceedings of the Data Compression Conference
Evaluating windows NT terminal server performance
WINSYM'99 Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3
THINC: a virtual display architecture for thin-client computing
Proceedings of the twentieth ACM symposium on Operating systems principles
Systems support for remote visualization of genomics applications over wide area networks
GCCB'06 Proceedings of the 2006 international conference on Distributed, high-performance and grid computing in computational biology
| Hi-index | 0.00 |
State-of-the-art lossless compression methods have enabled thin client computing across wide area networks which is rapidly gaining momentum. While these compression methods exploit redundancies typically found in synthetic images, none of them exploits large blocks often occurring verbatim in sequences of display updates because detecting movements of such blocks is computationally demanding. In this paper, we present a novel algorithm for detecting block movements in image sequences that is fast enough for interactive logins. We also integrate our algorithm into TCC, the best previously known codec for thin client computing. In the presence of motion, our new codec, TCC-M, typically compresses 50 to 950 times more efficiently than TCC. It also reduces the end-to-end latency of scrolling web pages at DSL speeds by a factor of 5.