Quadtree-structured variable-size block-matching motion estimation with minimal error

Injong Rhee, Graham R. Martin, Shanmugavelayutham Muthukrishnan, Roger A. Packwood

    Research output: Contribution to journalArticle

    Abstract

    This paper reports two efficient quadtree-based algorithms for variable-size block matching (VSBM) motion estimation. The schemes allow the dimensions of blocks to adapt to local activity within the image, and the total number of blocks in any frame can be varied while still accurately representing true motion. This permits adaptive bit allocation between the representation of displacement and residual data, and also the variation of the overall bit-rate on a frame-by-frame basis. The first algorithm computes the optimal selection of variable-sized blocks to provide the best-achievable prediction error under the fixed number of blocks for a quadtree-based VSBM technique. The algorithm employs an efficient dynamic programming technique utilizing the special structure of a quadtree. Although this algorithm is computationally intensive, it does provide a yardstick by which the performance of other more practical VSBM techniques can be measured. The second algorithm adopts a heuristic way to select variable-sized square blocks. It relies more on local motion information than on global error optimization. Experiments suggest that the effective use of local information contributes to minimizing the overall error. The result is a more computationally efficient VSBM technique than the optimal algorithm, but with a comparable prediction error.

    Original languageEnglish (US)
    Pages (from-to)42-50
    Number of pages9
    JournalIEEE Transactions on Circuits and Systems for Video Technology
    Volume10
    Issue number1
    DOIs
    StatePublished - Jan 1 2000

    Fingerprint

    Motion estimation
    Dynamic programming
    Experiments

    ASJC Scopus subject areas

    • Media Technology
    • Electrical and Electronic Engineering

    Cite this

    Quadtree-structured variable-size block-matching motion estimation with minimal error. / Rhee, Injong; Martin, Graham R.; Muthukrishnan, Shanmugavelayutham; Packwood, Roger A.

    In: IEEE Transactions on Circuits and Systems for Video Technology, Vol. 10, No. 1, 01.01.2000, p. 42-50.

    Research output: Contribution to journalArticle

    Rhee, Injong ; Martin, Graham R. ; Muthukrishnan, Shanmugavelayutham ; Packwood, Roger A. / Quadtree-structured variable-size block-matching motion estimation with minimal error. In: IEEE Transactions on Circuits and Systems for Video Technology. 2000 ; Vol. 10, No. 1. pp. 42-50.
    @article{6f89b8d81b23456989f9d39c0c48cf18,
    title = "Quadtree-structured variable-size block-matching motion estimation with minimal error",
    abstract = "This paper reports two efficient quadtree-based algorithms for variable-size block matching (VSBM) motion estimation. The schemes allow the dimensions of blocks to adapt to local activity within the image, and the total number of blocks in any frame can be varied while still accurately representing true motion. This permits adaptive bit allocation between the representation of displacement and residual data, and also the variation of the overall bit-rate on a frame-by-frame basis. The first algorithm computes the optimal selection of variable-sized blocks to provide the best-achievable prediction error under the fixed number of blocks for a quadtree-based VSBM technique. The algorithm employs an efficient dynamic programming technique utilizing the special structure of a quadtree. Although this algorithm is computationally intensive, it does provide a yardstick by which the performance of other more practical VSBM techniques can be measured. The second algorithm adopts a heuristic way to select variable-sized square blocks. It relies more on local motion information than on global error optimization. Experiments suggest that the effective use of local information contributes to minimizing the overall error. The result is a more computationally efficient VSBM technique than the optimal algorithm, but with a comparable prediction error.",
    author = "Injong Rhee and Martin, {Graham R.} and Shanmugavelayutham Muthukrishnan and Packwood, {Roger A.}",
    year = "2000",
    month = "1",
    day = "1",
    doi = "10.1109/76.825857",
    language = "English (US)",
    volume = "10",
    pages = "42--50",
    journal = "IEEE Transactions on Circuits and Systems for Video Technology",
    issn = "1051-8215",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "1",

    }

    TY - JOUR

    T1 - Quadtree-structured variable-size block-matching motion estimation with minimal error

    AU - Rhee, Injong

    AU - Martin, Graham R.

    AU - Muthukrishnan, Shanmugavelayutham

    AU - Packwood, Roger A.

    PY - 2000/1/1

    Y1 - 2000/1/1

    N2 - This paper reports two efficient quadtree-based algorithms for variable-size block matching (VSBM) motion estimation. The schemes allow the dimensions of blocks to adapt to local activity within the image, and the total number of blocks in any frame can be varied while still accurately representing true motion. This permits adaptive bit allocation between the representation of displacement and residual data, and also the variation of the overall bit-rate on a frame-by-frame basis. The first algorithm computes the optimal selection of variable-sized blocks to provide the best-achievable prediction error under the fixed number of blocks for a quadtree-based VSBM technique. The algorithm employs an efficient dynamic programming technique utilizing the special structure of a quadtree. Although this algorithm is computationally intensive, it does provide a yardstick by which the performance of other more practical VSBM techniques can be measured. The second algorithm adopts a heuristic way to select variable-sized square blocks. It relies more on local motion information than on global error optimization. Experiments suggest that the effective use of local information contributes to minimizing the overall error. The result is a more computationally efficient VSBM technique than the optimal algorithm, but with a comparable prediction error.

    AB - This paper reports two efficient quadtree-based algorithms for variable-size block matching (VSBM) motion estimation. The schemes allow the dimensions of blocks to adapt to local activity within the image, and the total number of blocks in any frame can be varied while still accurately representing true motion. This permits adaptive bit allocation between the representation of displacement and residual data, and also the variation of the overall bit-rate on a frame-by-frame basis. The first algorithm computes the optimal selection of variable-sized blocks to provide the best-achievable prediction error under the fixed number of blocks for a quadtree-based VSBM technique. The algorithm employs an efficient dynamic programming technique utilizing the special structure of a quadtree. Although this algorithm is computationally intensive, it does provide a yardstick by which the performance of other more practical VSBM techniques can be measured. The second algorithm adopts a heuristic way to select variable-sized square blocks. It relies more on local motion information than on global error optimization. Experiments suggest that the effective use of local information contributes to minimizing the overall error. The result is a more computationally efficient VSBM technique than the optimal algorithm, but with a comparable prediction error.

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

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

    U2 - 10.1109/76.825857

    DO - 10.1109/76.825857

    M3 - Article

    AN - SCOPUS:0033888431

    VL - 10

    SP - 42

    EP - 50

    JO - IEEE Transactions on Circuits and Systems for Video Technology

    JF - IEEE Transactions on Circuits and Systems for Video Technology

    SN - 1051-8215

    IS - 1

    ER -