A State Codebook Generation Algorithm of Side Match Vector Quantization
Abstract
Side match vector quantization (SMVQ) algorithm is an effective low bit rate image compression algorithm which is very useful for data hiding techniques. By replacing the main codebook used in conventional vector quantization (VQ) with a high-quality state codebook (SC) which consists of less codewords, SMVQ algorithm can achieve both much lower bit rate than VQ and acceptable visual quality. However, the generation of the SC is of high complexity that makes the applications of SMVQ limited. To overcome this bottleneck, inequality-based fast search algorithm is used in this paper. Experimental results show that by utilizing the mean feature and the variance feature of a vector, a majority of non-closest codewords in the main codebook can be rejected and the generation of SC can be efficiently speeded up. In addition, the SC generated by using our proposed algorithm is exactly the same as the SC generated by conventional SMVQ.
Keywords
Side match vector quantization Fast state codebook generation Nonexhaustive searchNotes
Acknowledgment
This work is supported in part by the Open Research Fund of Key Laboratory of Spectral Imaging Technology CAS (Grant No. LSIT201606D) and the Open Project Program of the National Laboratory of Pattern Recognition (NLPR) (Grant No. 201800030).
References
- 1.Nasrabadi, N.M., King, R.A.: Image coding using vector quantization: a review. IEEE Trans. Commun. 36(8), 957–971 (1988)CrossRefGoogle Scholar
- 2.Qim, C., Hu, Y.C.: Reversible data hiding in VQ index table with lossless coding and adaptive switching mechanism. Sig. Process. 129, 48–55 (2016)CrossRefGoogle Scholar
- 3.Rahmani, P., Dastghaibyfard, G.: An efficient histogram-based index mapping mechanism for reversible data hiding in VQ-compressed images. Inf. Sci. 435, 224–239 (2018)MathSciNetCrossRefGoogle Scholar
- 4.Chang, C.C., Nguyen, T.S., Lin, M.C., Lin, C.C.: A novel data-hiding and compression scheme based on block classification of SMVQ indices. Digit. Signal Proc. 51, 142–155 (2016)MathSciNetCrossRefGoogle Scholar
- 5.Chang, C.C., Nguyen, T.S., Lin, C.C.: A reversible compression code hiding using SOC and SMVQ indices. Inf. Sci. 300, 85–99 (2015)CrossRefGoogle Scholar
- 6.Wen, S., Pan, J.S., Li, L.: Reversible data hiding based on an adaptive pixel-embedding strategy and two-layer embedding. Inf. Sci. 369(10), 144–159 (2016)Google Scholar
- 7.Kim, T.: Side match and overlap match vector quantizers for images. IEEE Trans. Image Process. 1(2), 170–185 (1992)CrossRefGoogle Scholar
- 8.Park, H., Park, J.I.: Rapid generation of the state codebook in side match vector quantization. IEICE Trans. Inf. Syst. E800D(8), 1934–1937 (2017)CrossRefGoogle Scholar
- 9.Wang, Y., Pan, Z., Li, R.: Performance re-evaluation on “codewords distribution-based optimal combination of equal-average equal-variance equal-norm nearest neighbor fast search algorithm for vector quantization encoding. IEEE Trans. Image Process. 27(12), 718–720 (2018)MathSciNetCrossRefGoogle Scholar
- 10.Baek, S., Jeon, B.K., Sung, K.M.: A fast encoding algorithm for vector quantization. IEEE Signal Process. Lett. 4(2), 325–327 (1997)CrossRefGoogle Scholar
- 11.Pan, Z., Kotani, K., Ohmi, T.: Performance comparison between equal-average equal-variance equal-norm nearest neighbor search (EEENNS) method and improved equal-average equal-variance nearest neighbor search (IEENNS) method for fast encoding of vector quantization. IEICE Trans. Inf. Syst. E88D(9), 2218–2222 (2005)CrossRefGoogle Scholar
- 12.Linde, Y., Buzo, A., Gray, R.: An algorithm for vector quantizer design. IEEE Trans. Commun. 28(1), 84–95 (1980)CrossRefGoogle Scholar