Multi-feature ordinal ranking for facial age estimation
In this paper, we propose a multi-feature ordinal ranking (MFOR) method for facial age
estimation. Different from most existing facial age estimation approaches where age …
estimation. Different from most existing facial age estimation approaches where age …
Efficient algorithms for the inverse sort transform
G Nong, S Zhang - IEEE Transactions on Computers, 2007 - ieeexplore.ieee.org
As an important variant of the Burrows-WheelerTransform (BWT), the Sort Transform (ST)
can speed up thetransformation by sorting only a portion of the matrix. However, because …
can speed up thetransformation by sorting only a portion of the matrix. However, because …
Investigation of block-sorting of multiset permutations
Z Arnavut, M Arnavut - International Journal of Computer …, 2004 - Taylor & Francis
A recent development in data compression area is Burrows–Wheeler Compression
algorithm (BWCA). Introduced by Burrows and Wheeler, the BWCA achieves compression …
algorithm (BWCA). Introduced by Burrows and Wheeler, the BWCA achieves compression …
Lossless compression of color palette images with one-dimensional techniques
Palette images are widely used on the World Wide Web (WWW) and in game-cartridge
applications. Many images used on the WWW are stored and transmitted after they are …
applications. Many images used on the WWW are stored and transmitted after they are …
Efficient indexing algorithms for approximate pattern matching in text
M Petri, JS Culpepper - Proceedings of the Seventeenth Australasian …, 2012 - dl.acm.org
Approximate pattern matching is an important computational problem with a wide variety of
applications in Information Retrieval. Efficient solutions to approximate pattern matching can …
applications in Information Retrieval. Efficient solutions to approximate pattern matching can …
Revisiting bounded context block‐sorting transformations
SUMMARY The Burrows–Wheeler Transform (bwt) produces a permutation of a string X,
denoted X∗, by sorting the n cyclic rotations of X into full lexicographical order and taking …
denoted X∗, by sorting the n cyclic rotations of X into full lexicographical order and taking …
Computing inverse ST in linear complexity
G Nong, S Zhang, WH Chan - … : 19th Annual Symposium, CPM 2008, Pisa …, 2008 - Springer
Abstract The Sort Transform (ST) can significantly speed up the block sorting phase of the
Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best …
Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best …
Lossless and near-lossless compression of ECG signals with block-sorting techniques
Z Arnavut - The International Journal of High Performance …, 2007 - journals.sagepub.com
In this work, we investigate the lossless and near-lossless compression of electrocardiogram
(ECG) signals with different block-sorting transformations. We show that transformations with …
(ECG) signals with different block-sorting transformations. We show that transformations with …
Lossless image compression by using gradient adjusted prediction and Burrows-Wheeler transformation
KS Ng, LM Cheng - IEEE Transactions on consumer …, 1999 - ieeexplore.ieee.org
In general text compression techniques cannot be used directly in image compression
because the model of text and image are different. Previously, a new class of text …
because the model of text and image are different. Previously, a new class of text …
Backwards search in context bound text transformations
The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective
compression and self-indexing methods used today. A key to the versatility of the BWT is the …
compression and self-indexing methods used today. A key to the versatility of the BWT is the …