DocumentCode
2898947
Title
An improved T-decomposition algorithm
Author
Yang, Jia ; Speidel, Ulrich
Author_Institution
Dept. of Comput. Sci., Auckland Univ., New Zealand
Volume
3
fYear
2003
fDate
15-18 Dec. 2003
Firstpage
1551
Abstract
The bijective relationship between T-Code sets and finite strings discovered by Nicolescu and Titchener is of interest not only in coding, but also in information measurement and lately in content-based retrieval. Their T-decomposition algorithm that accomplishes the mapping from the string to the T-code set was implemented in 1996 by Wackrow and Titchener. This paper introduces a new algorithm that permits faster T-decomposition. Initial experimental results are also given.
Keywords
content-based retrieval; entropy; variable length codes; T-code set; T-decomposition algorithm; content-based retrieval; finite strings; Area measurement; Compression algorithms; Computer science; Content based retrieval; Counting circuits; Decoding; Entropy; Information retrieval; Particle measurements; Search engines;
fLanguage
English
Publisher
ieee
Conference_Titel
Information, Communications and Signal Processing, 2003 and Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint Conference of the Fourth International Conference on
Print_ISBN
0-7803-8185-8
Type
conf
DOI
10.1109/ICICS.2003.1292727
Filename
1292727
Link To Document