By Topic

An improved T-decomposition algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yang, J. ; Dept. of Comput. Sci., Auckland Univ., New Zealand ; Speidel, U.

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.

Published in:

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  (Volume:3 )

Date of Conference:

15-18 Dec. 2003