Sciweavers

327 search results - page 3 / 66
» Algorithms for infinite huffman-codes
Sort
View
TITB
2010
111views Education» more  TITB 2010»
13 years 1 months ago
ECG signal compression and classification algorithm with quad level vector for ECG holter system
An ECG signal processing method with quad level vector (QLV) is proposed for the ECG holter system. The ECG processing consists of the compression flow and the classification flow,...
Hyejung Kim, Refet Firat Yazicioglu, Patrick Merke...
ENC
2003
IEEE
13 years 11 months ago
Metrics for Symbol Clustering from a Pseudoergodic Information Source
We discuss a set of metrics, which aims to facilitate the formation of symbol groups from a pseudoergodic information source. An optimal codification can then be applied on the sy...
Angel Fernando Kuri Morales, Oscar Herrera-Alcanta...
DCC
2004
IEEE
14 years 5 months ago
Fast Near-Lossless or Lossless Compression of Large 3D Neuro-Anatomical Images
3D neuro-anatomical images and other volumetric data sets are important in many scientific and biomedical fields. Since such sets may be extremely large, a scalable compression me...
Rongkai Zhao, Michael Gabriel, Geneva G. Belford
COMAD
2008
13 years 7 months ago
An Experiment with Distance Measures for Clustering
Distance measure plays an important role in clustering data points. Choosing the right distance measure for a given dataset is a non-trivial problem. In this paper, we study vario...
Ankita Vimal, Satyanarayana R. Valluri, Kamalakar ...
CORR
2008
Springer
80views Education» more  CORR 2008»
13 years 6 months ago
Reserved-Length Prefix Coding
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...
Michael B. Baer