Abstract
Clustered Causal State Algorithm (CCSA), a pattern discovery algorithm, is developed in lossy video compression to approximate E-machines, for use in real time and resource limited applications. CCSA performs unsupervised pattern discovery, producing pattern descriptions with computational efficiency for use in data compression in exchange for a small loss in description fidelity. It is based on the hierarchical agglomerative clustering method and attempts to describe patterns intrinsic to a process, which it achieves at a lower computational cost. The inputs to the CCSA program are the symbol stream and the algorithm executes in the following steps: initialization, clustering, finalization. CCSA has the distinct advantage of polynomial computational complexity, and using this algorithm image compression takes few seconds and it could reliably generate 10 to 20 fold compressions.
| Original language | English (US) |
|---|---|
| Article number | 1677484 |
| Pages (from-to) | 59-67 |
| Number of pages | 9 |
| Journal | Computing in Science and Engineering |
| Volume | 8 |
| Issue number | 5 |
| DOIs | |
| State | Published - Sep 2006 |
All Science Journal Classification (ASJC) codes
- General Computer Science
- General Engineering
Fingerprint
Dive into the research topics of 'The clustered causal state algorithm efficient pattern discovery for lossy data-compression applications'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver