Fast motion estimation scheme for video coding using feature vector matching and motion vector's correlations

Tingrong Zhao, Masao Yanagisawa, Tatsuo Ohtsuki

    Research output: Contribution to journalArticle

    Abstract

    In this paper, we propose a fast block motion estimation scheme by exploiting the correlations of motion vectors (MV) existing in spatially- and temporally-adjacent as well as hierarchically-related blocks. The basic idea is to use the information obtained from the corresponding block at a coarser resolution level and spatio-temporal neighboring blocks at the same level in order to select a good set of initial MV candidates and then perform further local search to find the best matching MV. In order to further reduce computational complexity, the sign pattern vector (SPV) is defined and used for block matching, as opposed to the pixel intensity values used in the conventional block matching methods. By using the SPV definition, a data block can be presented by a mean and a set of binary sign patterns with a much reduced data set. The block matching motion estimation is then divided into mean matching and binary phase matching. The proposed technique enables a significant reduction in computational complexity compared with the conventional block matching motion estimation (ME) because binary phase matching only involves Boolean logic operations. This scheme also significantly reduces the data transfer time between the frame buffer and motion estimator. Our test results indicate that the performance of the proposed scheme is comparable with the full-search block matching under the same search ranges, however, the proposed scheme has a speed-up factor ranging from 250 to 370 in comparison with full search.

    Original languageEnglish
    Pages (from-to)67-82
    Number of pages16
    JournalJournal of Circuits, Systems and Computers
    Volume9
    Issue number1-2
    Publication statusPublished - 1999 Feb

    Fingerprint

    Motion estimation
    Image coding
    Phase matching
    Computational complexity
    Data transfer
    Pixels

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Electrical and Electronic Engineering

    Cite this

    Fast motion estimation scheme for video coding using feature vector matching and motion vector's correlations. / Zhao, Tingrong; Yanagisawa, Masao; Ohtsuki, Tatsuo.

    In: Journal of Circuits, Systems and Computers, Vol. 9, No. 1-2, 02.1999, p. 67-82.

    Research output: Contribution to journalArticle

    @article{85264a340b05477e89a1d7c2db4cb024,
    title = "Fast motion estimation scheme for video coding using feature vector matching and motion vector's correlations",
    abstract = "In this paper, we propose a fast block motion estimation scheme by exploiting the correlations of motion vectors (MV) existing in spatially- and temporally-adjacent as well as hierarchically-related blocks. The basic idea is to use the information obtained from the corresponding block at a coarser resolution level and spatio-temporal neighboring blocks at the same level in order to select a good set of initial MV candidates and then perform further local search to find the best matching MV. In order to further reduce computational complexity, the sign pattern vector (SPV) is defined and used for block matching, as opposed to the pixel intensity values used in the conventional block matching methods. By using the SPV definition, a data block can be presented by a mean and a set of binary sign patterns with a much reduced data set. The block matching motion estimation is then divided into mean matching and binary phase matching. The proposed technique enables a significant reduction in computational complexity compared with the conventional block matching motion estimation (ME) because binary phase matching only involves Boolean logic operations. This scheme also significantly reduces the data transfer time between the frame buffer and motion estimator. Our test results indicate that the performance of the proposed scheme is comparable with the full-search block matching under the same search ranges, however, the proposed scheme has a speed-up factor ranging from 250 to 370 in comparison with full search.",
    author = "Tingrong Zhao and Masao Yanagisawa and Tatsuo Ohtsuki",
    year = "1999",
    month = "2",
    language = "English",
    volume = "9",
    pages = "67--82",
    journal = "Journal of Circuits, Systems and Computers",
    issn = "0218-1266",
    publisher = "World Scientific Publishing Co. Pte Ltd",
    number = "1-2",

    }

    TY - JOUR

    T1 - Fast motion estimation scheme for video coding using feature vector matching and motion vector's correlations

    AU - Zhao, Tingrong

    AU - Yanagisawa, Masao

    AU - Ohtsuki, Tatsuo

    PY - 1999/2

    Y1 - 1999/2

    N2 - In this paper, we propose a fast block motion estimation scheme by exploiting the correlations of motion vectors (MV) existing in spatially- and temporally-adjacent as well as hierarchically-related blocks. The basic idea is to use the information obtained from the corresponding block at a coarser resolution level and spatio-temporal neighboring blocks at the same level in order to select a good set of initial MV candidates and then perform further local search to find the best matching MV. In order to further reduce computational complexity, the sign pattern vector (SPV) is defined and used for block matching, as opposed to the pixel intensity values used in the conventional block matching methods. By using the SPV definition, a data block can be presented by a mean and a set of binary sign patterns with a much reduced data set. The block matching motion estimation is then divided into mean matching and binary phase matching. The proposed technique enables a significant reduction in computational complexity compared with the conventional block matching motion estimation (ME) because binary phase matching only involves Boolean logic operations. This scheme also significantly reduces the data transfer time between the frame buffer and motion estimator. Our test results indicate that the performance of the proposed scheme is comparable with the full-search block matching under the same search ranges, however, the proposed scheme has a speed-up factor ranging from 250 to 370 in comparison with full search.

    AB - In this paper, we propose a fast block motion estimation scheme by exploiting the correlations of motion vectors (MV) existing in spatially- and temporally-adjacent as well as hierarchically-related blocks. The basic idea is to use the information obtained from the corresponding block at a coarser resolution level and spatio-temporal neighboring blocks at the same level in order to select a good set of initial MV candidates and then perform further local search to find the best matching MV. In order to further reduce computational complexity, the sign pattern vector (SPV) is defined and used for block matching, as opposed to the pixel intensity values used in the conventional block matching methods. By using the SPV definition, a data block can be presented by a mean and a set of binary sign patterns with a much reduced data set. The block matching motion estimation is then divided into mean matching and binary phase matching. The proposed technique enables a significant reduction in computational complexity compared with the conventional block matching motion estimation (ME) because binary phase matching only involves Boolean logic operations. This scheme also significantly reduces the data transfer time between the frame buffer and motion estimator. Our test results indicate that the performance of the proposed scheme is comparable with the full-search block matching under the same search ranges, however, the proposed scheme has a speed-up factor ranging from 250 to 370 in comparison with full search.

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

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

    M3 - Article

    AN - SCOPUS:0347117680

    VL - 9

    SP - 67

    EP - 82

    JO - Journal of Circuits, Systems and Computers

    JF - Journal of Circuits, Systems and Computers

    SN - 0218-1266

    IS - 1-2

    ER -