Sciweavers

1114 search results - page 150 / 223
» Optimizing XML Compression
Sort
View
TIT
1998
90views more  TIT 1998»
13 years 9 months ago
Source Codes as Random Number Generators
—A random number generator generates fair coin flips by processing deterministically an arbitrary source of nonideal randomness. An optimal random number generator generates asy...
Karthik Visweswariah, Sanjeev R. Kulkarni, Sergio ...
ICIP
2010
IEEE
13 years 8 months ago
Anisotropic diffusion using power watersheds
Many computer vision applications such as image filtering, segmentation and stereo-vision can be formulated as optimization problems.Whereas in previous decades continuousdomain, ...
Camille Couprie, Leo J. Grady, Laurent Najman, Hug...
ICIP
2001
IEEE
14 years 11 months ago
Progressive fractal coding
Progressive coding is an important feature of compression schemes. Wavelet coders are well suited for this purpose because the wavelet coefficients can be naturally ordered accord...
Iv An Kopilovic, Dietmar Saupe, Raouf Hamzaoui
ICIP
1998
IEEE
14 years 11 months ago
Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
Mark A. Robertson, Robert L. Stevenson
DCC
2006
IEEE
14 years 9 months ago
Making the Correct Mistakes
We propose a new sequential, adaptive, quadratic-time algorithm for variable-rate lossy compression of memoryless sources at a fixed distortion. The algorithm uses approximate pat...
Dharmendra S. Modha, Narayana P. Santhanam