Advertisement

Local Feature-Based Photo Album Compression by Eliminating Redundancy of Human Partition

  • Chia-Hsin ChanEmail author
  • Bo-Hsyuan Chen
  • Wen-Jiin Tsai
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10116)

Abstract

With the explosive growth of photo uploading on the web, traditional photo album compression using individual image coding is needed to be improved to save the storage spaces. Recently, an advance technique of photo album compression via video compression is proposed which utilizes the similarity between photos to improve the compression performance. In this paper, we modify the original scheme to improve the compression performance when photos containing human beings. Experiment results show that the proposed method outperforms the state-of-the-art method by at most 12.7% of bit-rate savings for compressing photo albums with humans. Comparing with traditional JPEG compression, the proposed method achieves 70% to 85% of bit-rate savings.

Keywords

Minimum Span Tree High Efficiency Video Code Compression Performance Reference Picture Photo Album 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Shi, Z., Sun, X., Wu, F.: Feature-based image set compression. In: IEEE ICME, pp. 1–6 (2013)Google Scholar
  2. 2.
    Fischler, M.A., Bolles, R.C.: Random sample consensus: a paradigm for model tting with applications to image analysis and automated cartography. ACM Commun. 24, 381–395 (1981)CrossRefGoogle Scholar
  3. 3.
    Shi, Z., Sun, X., Wu, F.: Photo album compression for cloud storage using local features. Emerg. Sel. Top. Circuits Syst. 4, 17–28 (2014)CrossRefGoogle Scholar
  4. 4.
    Viola, P., Jones, M.J.: Robust real-time face detection. Int. J. Comput. Vis. 57, 137–154 (2004)CrossRefGoogle Scholar
  5. 5.
    Musatenko, Y.S., Kurashov, V.N.: Correlated image set compression system based on new fast efficient algorithm of Karhunen-Loeve transform, pp. 518–529. International Society for Optics and Photonics (1998)Google Scholar
  6. 6.
    Karadimitriou, K., Tyler, J.M.: The centroid method for compressing sets of similar images. IEEE Pattern Recogn. Lett. 19, 585–593 (1998)CrossRefGoogle Scholar
  7. 7.
    Ait-Aoudia, S., Gabis, A.: A comparison of set redundancy compression techniques. EURASIP J. Adv. Sig. Process. 2006, 216 (2006)Google Scholar
  8. 8.
    Yeung, C.H., Au, O.C., Tang, K., Yu, Z., Luo, E., Wu, Y., Tu, S.F.: Compressing similar image sets using low frequency template. In: IEEE ICME, pp. 1–6 (2011)Google Scholar
  9. 9.
    Chen, C.P., Chen, C.S., Chung, K.L., Lu, H.I., Tang, G.Y.: Image set compression through minimal-cost prediction structure. In: IEEE ICIP, pp. 1289–1292 (2004)Google Scholar
  10. 10.
    Schmieder, A., Cheng, H., Li, X.: A study of clustering algorithms and validity for lossy image set compression. In: IPCV, pp. 501–506 (2009)Google Scholar
  11. 11.
    Lu, Y., Wong, T.T., Heng, P.A.: Digital photo similarity analysis in frequency domain and photo album compression. In: 3rd International Conference on Mobile and Ubiquitous Multimedia, pp. 237–244 (2004)Google Scholar
  12. 12.
    Zou, R., Au, O.C., Zhou, G., Dai, W., Hu, W., Wan, P.: Personal photo album compression and management. In: IEEE ISCAS, pp. 1428–1431 (2013)Google Scholar
  13. 13.
    Chandrasekhar, V., Takacs, G., Chen, D., Tsai, S.S., Grzeszczuk, R., Girod, B.: CHoG: compressed histogram of gradients a low bit-rate feature descriptor. In: CVPR, pp. 2504–2511 (2009)Google Scholar
  14. 14.
    Reinhard, E., Ashikhmin, M., Gooch, B., Shirley, P.: Color transfer between images. Comput. Graph. Appl. 21, 34–41 (2001)CrossRefGoogle Scholar
  15. 15.
    Day, W.H.E., Edelsbrunner, H.: Efficient algorithms for agglomerative hierarchical clustering methods. J. Classif. 1, 7–24 (1984)CrossRefzbMATHGoogle Scholar
  16. 16.
  17. 17.
  18. 18.
  19. 19.
    Chu, Y.J., Liu, T.H.: On the shortest arborescence of a directed graph. Sci. Sinica 14, 1396–1400 (1965). Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE PAMI 23, 1222–1239 (2011)MathSciNetzbMATHGoogle Scholar
  20. 20.
    Bossen, F.: Common HM test conditions and software reference configurations. In: JCTVC-L1100 (2013)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Department of Computer ScienceNational Chiao Tung UniversityHsinchuTaiwan

Personalised recommendations