Sciweavers

336 search results - page 60 / 68
» Compression of Samplable Sources
Sort
View
SIGGRAPH
1997
ACM
13 years 11 months ago
A model of visual masking for computer graphics
In this paper we develop a computational model of visual masking based on psychophysical data. The model predicts how the presence of one visual pattern affects the detectability...
James A. Ferwerda, Peter Shirley, Sumanta N. Patta...
DCC
1996
IEEE
13 years 11 months ago
On the Implementation of Minimum-Redundancy Prefix Codes
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
Alistair Moffat, Andrew Turpin
FPL
2006
Springer
112views Hardware» more  FPL 2006»
13 years 11 months ago
Real-Time Video Pixel Matching
We present an efficient implementation of a state of the art algorithm PixelMatch for matching all pixels within consecutive video frames. The method is of practical interest for ...
Jean-Baptiste Note, Mark Shand, Jean Vuillemin
CGO
2003
IEEE
13 years 11 months ago
METRIC: Tracking Down Inefficiencies in the Memory Hierarchy via Binary Rewriting
In this paper, we present METRIC, an environment for determining memory inefficiencies by examining data traces. METRIC is designed to alter the performance behavior of applicatio...
Jaydeep Marathe, Frank Mueller, Tushar Mohan, Bron...
MM
1995
ACM
173views Multimedia» more  MM 1995»
13 years 11 months ago
An Application Level Video Gateway
The current model for multicast transmission of video over the Internet assumes that a fixed average bandwidth is uniformly present throughout the network. Consequently, sources ...
Elan Amir, Steven McCanne, Hui Zhang