Abstract
The possibility of applying compressed matching in JPEG encoded images is investigated and the problems raised by the scheme are discussed. A part of the problems can be solved by the use of some auxiliary data which yields various time/space trade-offs. Finally, approaches to deal with extensions such as allowing scaling or rotations are suggested.
| Original language | English |
|---|---|
| Pages (from-to) | 1297-1306 |
| Number of pages | 10 |
| Journal | International Journal of Foundations of Computer Science |
| Volume | 17 |
| Issue number | 6 |
| DOIs | |
| State | Published - Dec 2006 |
Keywords
- Data compression
- Huffman coding
- JPEG
- Pattern matching