Estimação de Movimento com Uso de Sequências de Baixa Discrepância para Compressão de Vídeo
DOI:
https://doi.org/10.5540/tema.2011.012.03.0211Abstract
Em processamento de vídeo, um problema relevante é a estimação de movimento, visto que corresponde a aproximadamente 80% da complexidade computacional dos sistemas de codificação de vídeo. Parte desta complexidade diz respeito a medida de similaridade usada no casamento de blocos. Neste artigo, ao invés de usar uma medida que avalia todos os pixels dentro do bloco, usa-se uma que seleciona um subconjunto destes pixels induzida pelas sequências de baixa discrepância. O método proposto é aplicado ao algoritmo de busca em três passos (TSS) tradicionalmente usado como técnica de estimação de movimento em aplicações de vídeo a uma baixa taxa de transferência. Os resultados mostram uma redução da complexidade computacional do TSS em 90% com pouca degradação do quadro recuperado.References
C. Caia, H. Zengb, S.K. Mitrac, Fast motion estimation for H.264, Signal Processing: Image Communication, 24, No. 8 (2009), 630–636.
T. Koga et al., Motion-compensated interframe coding for video conferencing, In Proceedings of NTC81, p. C9.6.1–9.6.5, Los Angeles, November 1981.
Y-W. Chen et al., Content-aware fast motion estimation algorithm, Journal of Visual Communication and Image Representation, 19, No. 4 (2008), 256–269.
J.H. Halton, On the efficiency of certain quasi-random sequences of points in evaluating multidimensional integrals, Numer. Math., (1960) 84–90.
S. Jin, S-J. Park, J. Jeong, Adaptive fast full search algorithm using partitioned region and optimized search order, IEEE Transactions on Consumer Electronics, 53, No. 4 (2009), 1703–1711.
X. Jing, L.P. Chau, Partial distortion search algorithm using predictive search area for fast full-search motion estimation, IEEE Signal Processing Letters, 14, No. 11 (2007), 840–843.
L. Kuipers, H. Neiderreiter, “Uniform Distribution of Sequences”, Addison Wesley Publishing Company, Inc., New York, 1992.
C. W. Lam et al., A new cross-diamond search algorithm for fast block block matching motion estimation, IEEE Int. Conf. Neural Networks and Signal Processing, p. 1262–1265, 2003.
S. Lee, Fast motion estimation based on adaptive search range adjustment and matching error prediction, IEEE Transactions on Consumer Electronics, 55, No. 2 (2009), 805–811.
R. Li, B. Zeng, L.M. Liou, A new three-step search algorithm for block motion estimation, IEEE Transactions on Circuits Systems for Video Technology, 4, No. 4 (1994), 438–442.
W. Li, E. Salari, Successive elimination algorithm for motion estimation, IEEE Transactions on Image Processing, 4, No. 1 (1995), 105–107.
L. Po, W. Ma, A novel four-step search algorithm for fast block motion estimation, IEEE Transactions on Circuits and Systems for Video Technology, 6 (1996), 313–317.
L.M. Po, C.K. Cheung, Normalized partial distortion search algorithm for block motion estimation, IEEE Transactions on Circuits and Systems for Video Technology, 10, No. 3 (2000), 417–422.
O. Teytaud, When does quasi-random work? em “Proceedings of the 10th International Conference on Parallel Problem Solving from Nature: PPSN X” , p. 325–336, 2008.
Downloads
Published
How to Cite
Issue
Section
License
Authors who publish in this journal agree to the following terms:
Authors retain copyright and grant the journal the right of first publication, with the work simultaneously licensed under the Creative Commons Attribution License that allows the sharing of the work with acknowledgment of authorship and initial publication in this journal.
Authors are authorized to assume additional contracts separately, for non-exclusive distribution of the version of the work published in this journal (eg, publish in an institutional repository or as a book chapter), with acknowledgment of authorship and initial publication in this journal.
Authors are allowed and encouraged to publish and distribute their work online (eg, in institutional repositories or on their personal page) at any point before or during the editorial process, as this can generate productive changes as well as increase impact and the citation of the published work (See The effect of open access).
This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles, or use them for any other lawful purpose, without asking prior permission from the publisher or the
author. This is in accordance with the BOAI definition of open access
Intellectual Property
All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License under attribution BY.