Abstract
We propose and study in details a similarity enrichment scheme for the application to the image compression through the exten-sion of the weighted nite automata (WFA). We then develop a mech-anism with which rich families of legitimate similarity images can be systematically created so as to reduce the overall WFA size, leading to an eventual better WFA-based compression performance. A number of desirable properties, including WFA of minimum states, have been estab-lished for a class of packed WFA. Moreover, a codec based on a special extended WFA is implemented to exemplify explicitly the performance gain due to extended WFA under otherwise the same conditions.
| Original language | English |
|---|---|
| Title of host publication | Computing and Combinatorics - 6th Annual International Conference, COCOON 2000, Proceedings |
| Editors | Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma |
| Publisher | Springer Verlag |
| Pages | 447-456 |
| Number of pages | 10 |
| ISBN (Print) | 3540677879, 9783540677871 |
| DOIs | |
| Publication status | Published - 2000 |
| Externally published | Yes |
| Event | 6th Annual International Conference on Computing and Combinatorics, COCOON 2000 - Sydney, Australia Duration: 26 Jul 2000 → 28 Jul 2000 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1858 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 6th Annual International Conference on Computing and Combinatorics, COCOON 2000 |
|---|---|
| Country/Territory | Australia |
| City | Sydney |
| Period | 26/07/00 → 28/07/00 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2000.