A macroblock level adaptive search range algorithm for variable block size motion estimation in H.264/AVC

Zhenxing Chen, Yang Song, Takeshi Ikenaga, Satoshi Goto

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    14 Citations (Scopus)

    Abstract

    Compared with previous video standards, the computational complexity of H.264/AVC is extraordinarily high due to newly adopted tools such as variable block size motion estimation (VBSME). In VBSME, to each macroblock (MB) there are at all 41 blocks corresponded. These 41 blocks are sized from 4×4 through 16×16. As each block of these 41 blocks accounts for one independent search window (SW), thus to each MB there exist 41 SWs corresponded. In the other hand, adaptive search range (ASR) algorithms are defined as algorithms which adaptively adjust the search ranges (SRs) and hence result in dynamically reduced SWs. While considering whether 41 SWs got changed in the same way or not, "macroblock level ASR (MB-ASR) algorithms" are defined as algorithms which adaptively change the search range all-in-once and hence result in the 41 SWs got changed in the same way. "41 blocks level ASR (block-ASR) algorithms" are defined as algorithms that the changing ways of the SRs are specific to each block of the 41 blocks. Since in MB-ASR algorithms for each MB the SR is changed in same way, it is reasonable to consider that the control overhead of MB-ASR is less than that of block-ASR. In this paper, a MB-ASR algorithm is proposed and assessed from being compared with a previously proposed block-ASR algorithm given in [5]. According to experimental results, it is proved the proposed algorithm provides almost the same encoding quality and even a little better SW reducing efficiency (SW-RE) while compared with [5]. Meanwhile, as a MB-ASR one, the proposed algorithm is considered having less control overhead than block-ASR one-[5].

    Original languageEnglish
    Title of host publication2007 International Symposium on Intelligent Signal Processing and Communications Systems, ISPACS 2007 - Proceedings
    Pages598-601
    Number of pages4
    DOIs
    Publication statusPublished - 2008
    Event2007 International Symposium on Intelligent Signal Processing and Communications Systems, ISPACS 2007 - Xiamen
    Duration: 2007 Nov 282007 Dec 1

    Other

    Other2007 International Symposium on Intelligent Signal Processing and Communications Systems, ISPACS 2007
    CityXiamen
    Period07/11/2807/12/1

    Fingerprint

    Motion Estimation
    Motion estimation
    Range of data
    Computational complexity
    Computational Complexity
    Encoding

    Keywords

    • ASR
    • H.264/AVC
    • MB-ASR
    • VBSME

    ASJC Scopus subject areas

    • Computer Science Applications
    • Signal Processing
    • Software
    • Electrical and Electronic Engineering
    • Mathematics(all)

    Cite this

    Chen, Z., Song, Y., Ikenaga, T., & Goto, S. (2008). A macroblock level adaptive search range algorithm for variable block size motion estimation in H.264/AVC. In 2007 International Symposium on Intelligent Signal Processing and Communications Systems, ISPACS 2007 - Proceedings (pp. 598-601). [4445958] https://doi.org/10.1109/ISPACS.2007.4445958

    A macroblock level adaptive search range algorithm for variable block size motion estimation in H.264/AVC. / Chen, Zhenxing; Song, Yang; Ikenaga, Takeshi; Goto, Satoshi.

    2007 International Symposium on Intelligent Signal Processing and Communications Systems, ISPACS 2007 - Proceedings. 2008. p. 598-601 4445958.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Chen, Z, Song, Y, Ikenaga, T & Goto, S 2008, A macroblock level adaptive search range algorithm for variable block size motion estimation in H.264/AVC. in 2007 International Symposium on Intelligent Signal Processing and Communications Systems, ISPACS 2007 - Proceedings., 4445958, pp. 598-601, 2007 International Symposium on Intelligent Signal Processing and Communications Systems, ISPACS 2007, Xiamen, 07/11/28. https://doi.org/10.1109/ISPACS.2007.4445958
    Chen Z, Song Y, Ikenaga T, Goto S. A macroblock level adaptive search range algorithm for variable block size motion estimation in H.264/AVC. In 2007 International Symposium on Intelligent Signal Processing and Communications Systems, ISPACS 2007 - Proceedings. 2008. p. 598-601. 4445958 https://doi.org/10.1109/ISPACS.2007.4445958
    Chen, Zhenxing ; Song, Yang ; Ikenaga, Takeshi ; Goto, Satoshi. / A macroblock level adaptive search range algorithm for variable block size motion estimation in H.264/AVC. 2007 International Symposium on Intelligent Signal Processing and Communications Systems, ISPACS 2007 - Proceedings. 2008. pp. 598-601
    @inproceedings{656ada2fefa44666abcdd8a39b955686,
    title = "A macroblock level adaptive search range algorithm for variable block size motion estimation in H.264/AVC",
    abstract = "Compared with previous video standards, the computational complexity of H.264/AVC is extraordinarily high due to newly adopted tools such as variable block size motion estimation (VBSME). In VBSME, to each macroblock (MB) there are at all 41 blocks corresponded. These 41 blocks are sized from 4×4 through 16×16. As each block of these 41 blocks accounts for one independent search window (SW), thus to each MB there exist 41 SWs corresponded. In the other hand, adaptive search range (ASR) algorithms are defined as algorithms which adaptively adjust the search ranges (SRs) and hence result in dynamically reduced SWs. While considering whether 41 SWs got changed in the same way or not, {"}macroblock level ASR (MB-ASR) algorithms{"} are defined as algorithms which adaptively change the search range all-in-once and hence result in the 41 SWs got changed in the same way. {"}41 blocks level ASR (block-ASR) algorithms{"} are defined as algorithms that the changing ways of the SRs are specific to each block of the 41 blocks. Since in MB-ASR algorithms for each MB the SR is changed in same way, it is reasonable to consider that the control overhead of MB-ASR is less than that of block-ASR. In this paper, a MB-ASR algorithm is proposed and assessed from being compared with a previously proposed block-ASR algorithm given in [5]. According to experimental results, it is proved the proposed algorithm provides almost the same encoding quality and even a little better SW reducing efficiency (SW-RE) while compared with [5]. Meanwhile, as a MB-ASR one, the proposed algorithm is considered having less control overhead than block-ASR one-[5].",
    keywords = "ASR, H.264/AVC, MB-ASR, VBSME",
    author = "Zhenxing Chen and Yang Song and Takeshi Ikenaga and Satoshi Goto",
    year = "2008",
    doi = "10.1109/ISPACS.2007.4445958",
    language = "English",
    isbn = "9781424414475",
    pages = "598--601",
    booktitle = "2007 International Symposium on Intelligent Signal Processing and Communications Systems, ISPACS 2007 - Proceedings",

    }

    TY - GEN

    T1 - A macroblock level adaptive search range algorithm for variable block size motion estimation in H.264/AVC

    AU - Chen, Zhenxing

    AU - Song, Yang

    AU - Ikenaga, Takeshi

    AU - Goto, Satoshi

    PY - 2008

    Y1 - 2008

    N2 - Compared with previous video standards, the computational complexity of H.264/AVC is extraordinarily high due to newly adopted tools such as variable block size motion estimation (VBSME). In VBSME, to each macroblock (MB) there are at all 41 blocks corresponded. These 41 blocks are sized from 4×4 through 16×16. As each block of these 41 blocks accounts for one independent search window (SW), thus to each MB there exist 41 SWs corresponded. In the other hand, adaptive search range (ASR) algorithms are defined as algorithms which adaptively adjust the search ranges (SRs) and hence result in dynamically reduced SWs. While considering whether 41 SWs got changed in the same way or not, "macroblock level ASR (MB-ASR) algorithms" are defined as algorithms which adaptively change the search range all-in-once and hence result in the 41 SWs got changed in the same way. "41 blocks level ASR (block-ASR) algorithms" are defined as algorithms that the changing ways of the SRs are specific to each block of the 41 blocks. Since in MB-ASR algorithms for each MB the SR is changed in same way, it is reasonable to consider that the control overhead of MB-ASR is less than that of block-ASR. In this paper, a MB-ASR algorithm is proposed and assessed from being compared with a previously proposed block-ASR algorithm given in [5]. According to experimental results, it is proved the proposed algorithm provides almost the same encoding quality and even a little better SW reducing efficiency (SW-RE) while compared with [5]. Meanwhile, as a MB-ASR one, the proposed algorithm is considered having less control overhead than block-ASR one-[5].

    AB - Compared with previous video standards, the computational complexity of H.264/AVC is extraordinarily high due to newly adopted tools such as variable block size motion estimation (VBSME). In VBSME, to each macroblock (MB) there are at all 41 blocks corresponded. These 41 blocks are sized from 4×4 through 16×16. As each block of these 41 blocks accounts for one independent search window (SW), thus to each MB there exist 41 SWs corresponded. In the other hand, adaptive search range (ASR) algorithms are defined as algorithms which adaptively adjust the search ranges (SRs) and hence result in dynamically reduced SWs. While considering whether 41 SWs got changed in the same way or not, "macroblock level ASR (MB-ASR) algorithms" are defined as algorithms which adaptively change the search range all-in-once and hence result in the 41 SWs got changed in the same way. "41 blocks level ASR (block-ASR) algorithms" are defined as algorithms that the changing ways of the SRs are specific to each block of the 41 blocks. Since in MB-ASR algorithms for each MB the SR is changed in same way, it is reasonable to consider that the control overhead of MB-ASR is less than that of block-ASR. In this paper, a MB-ASR algorithm is proposed and assessed from being compared with a previously proposed block-ASR algorithm given in [5]. According to experimental results, it is proved the proposed algorithm provides almost the same encoding quality and even a little better SW reducing efficiency (SW-RE) while compared with [5]. Meanwhile, as a MB-ASR one, the proposed algorithm is considered having less control overhead than block-ASR one-[5].

    KW - ASR

    KW - H.264/AVC

    KW - MB-ASR

    KW - VBSME

    UR - http://www.scopus.com/inward/record.url?scp=43749088239&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=43749088239&partnerID=8YFLogxK

    U2 - 10.1109/ISPACS.2007.4445958

    DO - 10.1109/ISPACS.2007.4445958

    M3 - Conference contribution

    SN - 9781424414475

    SP - 598

    EP - 601

    BT - 2007 International Symposium on Intelligent Signal Processing and Communications Systems, ISPACS 2007 - Proceedings

    ER -