Inter-frame Prediction with Fast Weighted Low-rank Matrix Approximation
Abstract
In the field of video coding, inter-frame prediction plays an important role in improving compression efficiency. The improved efficiency is achieved by finding predictors for video blocks such that the residual data can be close to zero as much as possible. For recent video coding standards, motion vectors are required for a decoder to locate the predictors during video reconstruction. Block matching algorithms are usually utilized in the stage of motion estimation to find such motion vectors. For decoder-side motion derivation, proper templates are defined and template matching algorithms are used to produce a predictor for each block such that the overhead of embedding coded motion vectors in bit-stream can be avoided. However, the conventional criteria of either block matching or template matching algorithms may lead to the generation of worse predictors. To enhance coding efficiency, a fast weighted low-rank matrix approximation approach to deriving decoder-side motion vectors for inter frame video coding is proposed in this paper. The proposed method first finds the dominating block candidates and their corresponding importance factors. Then, finding a predictor for each block is treated as a weighted low-rank matrix approximation problem, which is solved by the proposed column-repetition approach. Together with mode decision, the coder can switch to a better mode between the motion compensation by using either block matching or the proposed template matching scheme.
References
J. Ostermann, J. Bormans, P. List, D. Marpe, M. Narroschke, F. Pereira, T. Stockhammer, and T. Wedi, “Video coding with H.264/AVC: tools, performance, and complexity,” IEEE Circuits and Systems Magazine, pp. 7–28, 2004, First Quarter. 16 Z.-L. HUANG, H.-F. HSIAO
G. J. Han, J. Gary, J. R. Ohm, W. J. Han, and T. Wiegand, “Overview of the High Efficiency Video Coding (HEVC) Standard,” in IEEE Transactions on Circuits and Systems for Video Technology, September 2012, p. 1.
K. Sugimoto, M. Kobayashi, Y. Suzuki, S. Kato, and S. B. Choong, “Inter frame coding with template matching spatio-temporal prediction,” in IEEE International Conference on Image Processing, October 2004, pp. 24–27.
Y. Suzuki, C. S. Boon, and T. K. Tan, “Inter frame coding with template matching averaging,” in IEEE International Conference on Image Processing, 16 September – 19 October 2007.
M. Turkan and C. Guillemot, “Sparse approximation with adaptive dictionary for image prediction,” in IEEE International Conference on Image Processing, Cairo, Egypt, November 2009, pp. 25–28.
J. Wang, Y. Shi, W. Ding, and B. Yin, “A low-rank matrix completion based intra prediction for h.264/AVC,” in Multimedia Signal Processing (MMSP), 2011 IEEE 13th International Workshop, 17–19 October 2011.
Y. Suzuki, C. S. Boon, and S. Kato, “Block-based reduced resolution inter frame coding with template matching prediction,” in IEEE International Conference on Image Processing, 8-11 October 2006, pp. 1701–1704.
K. H. Ng, L. M. Po, K. W. Cheung, X. Y. Xu, and K. M. Wong, “A new motion compensation method using superimposed inter-frame signals,” in IEEE International Conference on Speech and Signal Processing (ICASSP), 25-30 March 2012, pp. 1213–1216.
S. Milani, “Segmentation-based motion compensation for enhanced video coding,” in IEEE International Conference on Image Processing (ICIP), 11-14 September 2011, pp. 1649–1652.
J. Bennett and S. Lanning, “The netflix prize,” in Proceedings of KDD Cup and Workshop, 2007.
S. Ma, D. Goldfarb, and L. Chen, “Robust principal component analysis?: Recovering low-rank matrices from sparse errors,” in IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM), October 2010, pp. 201–204.
H. Ji, C. Liu, Z. Shen, and Y. Xu, “Robust video denoising using low rank matrix completion,” in IEEE Conference on Computer Vision and Pattern Recognition (CVPR), June 2010, pp. 1791–1798.
Z. Lin, M. Chen, L. Wu, and Y. Ma, “The augmented lagrange multiplier method for exact recovery of a corrupted low-rank matrix,” University of Illinois at Urbana-Champaign, Tech. Rep. #UILU-ENG-09-2215, October 2009.
Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, “Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition,” in Proceedings of The 27th Annual Asilomar Conference on Signals, Systems and Computers, 1–3 November 1993, pp. 40–44.
E. J. Cand`es and B. Recht, “Exact matrix completion via convex optimization,”In Magazine Communications of the ACM CACM Homepage, vol. 55, no. 6, pp. 111–119, June 2012.
D. Bertsekas, Constrained optimization and lagrange multiplier method. Academic Press, 1982.
D. Zonoobi, A. A. Kassim, and Y. V. Venkatesh, “Gini index as sparsity measure for signal reconstruction from compressive Samples, ”IEEE Journal on Selected Topics in Signal Processing, pp. 927–932, September 2011.
Downloads
Published
Issue
Section
License
1. License
The non-commercial use of the article will be governed by the Creative Commons Attribution license as currently displayed on https://creativecommons.org/licenses/by/4.0/.
2. Author’s Warranties
The author warrants that the article is original, written by stated author/s, has not been published before, contains no unlawful statements, does not infringe the rights of others, is subject to copyright that is vested exclusively in the author and free of any third party rights, and that any necessary written permissions to quote from other sources have been obtained by the author/s. The undersigned also warrants that the manuscript (or its essential substance) has not been published other than as an abstract or doctorate thesis and has not been submitted for consideration elsewhere, for print, electronic or digital publication.
3. User Rights
Under the Creative Commons Attribution license, the author(s) and users are free to share (copy, distribute and transmit the contribution) under the following conditions: 1. they must attribute the contribution in the manner specified by the author or licensor, 2. they may alter, transform, or build upon this work, 3. they may use this contribution for commercial purposes.
4. Rights of Authors
Authors retain the following rights:
- copyright, and other proprietary rights relating to the article, such as patent rights,
- the right to use the substance of the article in own future works, including lectures and books,
- the right to reproduce the article for own purposes, provided the copies are not offered for sale,
- the right to self-archive the article
- the right to supervision over the integrity of the content of the work and its fair use.
5. Co-Authorship
If the article was prepared jointly with other authors, the signatory of this form warrants that he/she has been authorized by all co-authors to sign this agreement on their behalf, and agrees to inform his/her co-authors of the terms of this agreement.
6. Termination
This agreement can be terminated by the author or the Journal Owner upon two months’ notice where the other party has materially breached this agreement and failed to remedy such breach within a month of being given the terminating party’s notice requesting such breach to be remedied. No breach or violation of this agreement will cause this agreement or any license granted in it to terminate automatically or affect the definition of the Journal Owner. The author and the Journal Owner may agree to terminate this agreement at any time. This agreement or any license granted in it cannot be terminated otherwise than in accordance with this section 6. This License shall remain in effect throughout the term of copyright in the Work and may not be revoked without the express written consent of both parties.
7. Royalties
This agreement entitles the author to no royalties or other fees. To such extent as legally permissible, the author waives his or her right to collect royalties relative to the article in respect of any use of the article by the Journal Owner or its sublicensee.
8. Miscellaneous
The Journal Owner will publish the article (or have it published) in the Journal if the article’s editorial process is successfully completed and the Journal Owner or its sublicensee has become obligated to have the article published. Where such obligation depends on the payment of a fee, it shall not be deemed to exist until such time as that fee is paid. The Journal Owner may conform the article to a style of punctuation, spelling, capitalization and usage that it deems appropriate. The Journal Owner will be allowed to sublicense the rights that are licensed to it under this agreement. This agreement will be governed by the laws of Poland.
By signing this License, Author(s) warrant(s) that they have the full power to enter into this agreement. This License shall remain in effect throughout the term of copyright in the Work and may not be revoked without the express written consent of both parties.
