Fractal image compression: theory and application
Fractal image compression: theory and application
Arithmetic coding for data compression
Communications of the ACM
An image transport protocol for the Internet
ICNP '00 Proceedings of the 2000 International Conference on Network Protocols
Matching pursuits with time-frequency dictionaries
IEEE Transactions on Signal Processing
Weighted Finite Automata encoding over Thai language
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
| Hi-index | 0.09 |
Fractal-based image compression techniques give efficient decoding time with primitive hardware requirements, and favor real-time communication purposes. One such technique, the weighted finite automata (WFA), is studied on grayscale images. An improved image partitioning technique-the binary or bintree partitioning-is tested on the WFA encoding method. Experimental results show that binary partitioning consistently gives higher compression ratios than the conventional quadtree partitioning method for large images. Moreover, the ability to decode images progressively rendering finer and finer details can be used to display the image over a congested and loss-prone network such as the image transport protocol (ITP) for the Internet, as well as to pave way for multilayered error protection over an often unreliable networking environment. Also, the proposed partitioning approach can be parallelized to reduce its high encoding complexity.