Abstract
With the increasing popularity of digital camera, organizing and managing the large collection of digital photos effectively are therefore required. In this paper, we study the techniques of photo album sorting, clustering and compression in DCT frequency domain without having to decompress JPEG photos into spatial domain firstly. We utilize the first several non-zero DCT coefficients to build our feature set and calculate the energy histograms in frequency domain directly. We then calculate the similarity distances of every two photos, and perform photo album sorting and adaptive clustering algorithms to group the most similar photos together. We further compress those clustered photos by a MPEG-like algorithm with variable IBP frames and adaptive search windows. Our methods provide a compact and reasonable format for people to store and transmit their large number of digital photos. Experiments prove that our algorithm is efficient and effective for digital photo processing.
| Original language | English |
|---|---|
| Title of host publication | MUM 2004 - Proceedings of the 3rd International Conference on Mobile and Ubiquitous Multimedia |
| Publisher | Association for Computing Machinery (ACM) |
| Pages | 237-244 |
| Number of pages | 8 |
| ISBN (Print) | 1581139810, 9781581139815 |
| DOIs | |
| Publication status | Published - 2004 |
| Externally published | Yes |
| Event | International Conference on Mobile and Ubiquitous Multimedia 2004 - College Park, United States of America Duration: 27 Oct 2004 → 29 Oct 2004 Conference number: 3rd https://dl.acm.org/doi/proceedings/10.1145/1052380 (Proceedings) |
Conference
| Conference | International Conference on Mobile and Ubiquitous Multimedia 2004 |
|---|---|
| Abbreviated title | MUM 2004 |
| Country/Territory | United States of America |
| City | College Park |
| Period | 27/10/04 → 29/10/04 |
| Internet address |
|
Keywords
- Adaptive clustering
- DCT
- Energy histogram
- Frequency domain
- Image compression
- JPEG
- MPEG
- Photo album sorting
- Similarity analysis