Journal Home > Volume 20 , Issue 4

Subspace appearance models are widely used in computer vision and image processing tasks to compactly represent the appearance variations of target objects. In order to ensure algorithm performance, they are typically stored in high-precision formats; this results in a large storage footprint, rendering redistribution costly and difficult. Since for most image and vision applications, pixel values are quantized to 8 bits by the acquisition apparatuses, we show that it is possible to construct a fixed-width, effectively lossless representation of the bases vectors, in the sense that reconstructions from the original bases and from the quantized bases never deviate by more than half of the quantization step-size. In addition to directly applying this result to losslessly compress individual models, we also propose an algorithm to compress appearance models by utilizing prior information on the modeled objects in the form of prior appearance subspaces. Experiments conducted on the compression of person-specific face appearance models demonstrate the effectiveness of the proposed algorithms.


menu
Abstract
Full text
Outline
About this article

Effectively Lossless Subspace Appearance Model Compression Using Prior Information

Show Author's information Yang LiXiaoming Tao( )Jianhua Lu
Department of Electronic Engineering, Tsinghua University, Beijing 100084, China.

Abstract

Subspace appearance models are widely used in computer vision and image processing tasks to compactly represent the appearance variations of target objects. In order to ensure algorithm performance, they are typically stored in high-precision formats; this results in a large storage footprint, rendering redistribution costly and difficult. Since for most image and vision applications, pixel values are quantized to 8 bits by the acquisition apparatuses, we show that it is possible to construct a fixed-width, effectively lossless representation of the bases vectors, in the sense that reconstructions from the original bases and from the quantized bases never deviate by more than half of the quantization step-size. In addition to directly applying this result to losslessly compress individual models, we also propose an algorithm to compress appearance models by utilizing prior information on the modeled objects in the form of prior appearance subspaces. Experiments conducted on the compression of person-specific face appearance models demonstrate the effectiveness of the proposed algorithms.

Keywords: principal component analysis, data compression, appearance modeling

References(14)

[1]
Jia X. and Lu H., Visual tracking via adaptive structural local sparse appearance model, in Proc. CVPR ’12, 2012, pp. 1822-1829.
DOI
[2]
Aldrian O. and Smith W. A. P., Inverse rendering of faces with a 3D morphable model, IEEE Trans. Pattern Anal. Mach. Intell., vol. 35, no. 5, pp. 1080-1093, 2013.
[3]
Assassa G. M. R., Mursi M. F. M., and Aboalsamh H. A., Evolutionary eigenspace learning using CCIPCA and IPCA for face recognition, in Proc. ICCIT, 2009, pp. 451-456.
[4]
Turk M. and Pentland A., Face recognition using eigenfaces, in Proc. CVPR ’91, IEEE Comput. Sco. Press, 1991, pp. 586-591.
[5]
Wright J., Peng Y., Ma Y., Ganesh A., and Rao S., Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization, in Proc. NIPS ’09, 2009.
[6]
Pantic M. and Rothkrantz L. J., Automatic analysis of facial expressions: The state of the art, IEEE Trans. Pattern Anal. Mach. Intell., vol. 22, no. 12, pp. 1424-1445, 2000.
[7]
Yurtkan K., Soyel H., Demirel H., Ozkaramanli H., Uyguroglu M., and Varoglu E., Face modeling and adaptive texture mapping for model based video coding, in Computer Analysis of Images and Patterns, 2005, vol. 3691, pp. 498-505.
DOI
[8]
Cootes T., Edwards G., and Taylor C., Active appearance models, IEEE Trans. Pattern Anal. Mach. Intell., vol. 23, no. 6, pp. 681-685, 2001.
[9]
Witten I. H., Neal R. M., and Cleary J. G., Arithmetic coding for data compression, Communications of the ACM, vol. 30, no. 6, pp. 520-540, 1987.
[10]
Sullivan G., Ohm J., Han W., and Wiegand T., Overview of the high efficiency video coding (HEVC) standard, IEEE Trans. Circ. Syst. Video Technol., vol. 22, no. 12, pp. 1649-1668, 2012
[11]
Wu W., Guo H., Hu Y., Fan J., and Wang H., Improvable deflate algorithm, in Proc. IEEE Conference on Industrial Electronics and Applications, 2008, pp. 1572-1574.
[12]
Szecówka P. M. and Mandrysz T., Towards hardware implementation of bzip2 data compression algorithm, in Proc. MIXDES ’09, 2009.
[13]
Salomon D., Data Compression: The Complete Reference, 4th ed. 2006.
[14]
Gross R., Matthews I., Cohn J., Kanade T., and Baker S., Multi-PIE, in Proc. FG ’08, IEEE, 2008.
DOI
Publication history
Copyright
Acknowledgements
Rights and permissions

Publication history

Received: 12 January 2015
Accepted: 27 March 2015
Published: 03 August 2015
Issue date: August 2015

Copyright

© The authors 2015

Acknowledgements

This work was supported by the National key Basic Research and Development (973) Program of China (No. 2013CB329006), the National Natural Science Foundation of China (Nos. 61471220 and 61021001), Tsinghua University Initiative Scientific Research Program, and Tsinghua-Qualcomm Joint Research Program.

Rights and permissions

Return