A fast motion estimation algorithm for an MPEG Video coder

Eric Chan, Rakeshkumar Gandhi, Sethuraman Panchanathan

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

Video compression is becoming increasingly important with the advent of the compression standards and broadband networks. Typical applications include high-definition television, multimedia communications, etc. There are two kinds of redundancies that exist in a video sequence, namely, temporal and spatial which are exploited to achieve compression. The spatial redundancies are removed by using techniques such as discrete cosine transform, vector quantization, etc. while the temporal redundancies are removed by the motion estimation/compensation techniques. Recently, several block based motion estimation algorithms have been reported in the literature. However, these algorithms are either computationally expensive or converge to a local optimum. In this paper, we propose a reduced complexity block-matching motion estimation algorithm for an MPEG video coder. This algorithm consists of a layered structure and hence does not converge to a local optimum. Most importantly, it employs a simple matching criterion, namely, the modified pixel difference classification (MPDC) and hence results in a reduced computational complexity. The MPEG video coder has been simulated using the proposed layered structure MPDC algorithm (LSA-MPDC). Simulation results indicate that the LSA-MPDC algorithm achieves a good performance for both slow and fast moving sequences. In addition, the hardware implementation of the LSA-MPDC algorithm is very simple because of the binary operations used in the matching criteria.

Original languageEnglish (US)
Pages (from-to)222-228
Number of pages7
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume2187
DOIs
StatePublished - May 2 1994
EventDigital Video Compression on Personal Computers: Algorithms and Technologies 1994 - San Jose, United States
Duration: Feb 6 1994Feb 10 1994

Fingerprint

Motion Estimation
Motion estimation
coders
Estimation Algorithms
Pixel
Classification Algorithm
Pixels
pixels
Redundancy
redundancy
Compression
Multimedia Communication
Converge
Block Matching
Video Compression
Binary operation
Discrete Cosine Transform
Vector Quantization
Hardware Implementation
high definition television

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

A fast motion estimation algorithm for an MPEG Video coder. / Chan, Eric; Gandhi, Rakeshkumar; Panchanathan, Sethuraman.

In: Proceedings of SPIE - The International Society for Optical Engineering, Vol. 2187, 02.05.1994, p. 222-228.

Research output: Contribution to journalConference article

@article{186db61f8a8844189d30050486b4332b,
title = "A fast motion estimation algorithm for an MPEG Video coder",
abstract = "Video compression is becoming increasingly important with the advent of the compression standards and broadband networks. Typical applications include high-definition television, multimedia communications, etc. There are two kinds of redundancies that exist in a video sequence, namely, temporal and spatial which are exploited to achieve compression. The spatial redundancies are removed by using techniques such as discrete cosine transform, vector quantization, etc. while the temporal redundancies are removed by the motion estimation/compensation techniques. Recently, several block based motion estimation algorithms have been reported in the literature. However, these algorithms are either computationally expensive or converge to a local optimum. In this paper, we propose a reduced complexity block-matching motion estimation algorithm for an MPEG video coder. This algorithm consists of a layered structure and hence does not converge to a local optimum. Most importantly, it employs a simple matching criterion, namely, the modified pixel difference classification (MPDC) and hence results in a reduced computational complexity. The MPEG video coder has been simulated using the proposed layered structure MPDC algorithm (LSA-MPDC). Simulation results indicate that the LSA-MPDC algorithm achieves a good performance for both slow and fast moving sequences. In addition, the hardware implementation of the LSA-MPDC algorithm is very simple because of the binary operations used in the matching criteria.",
author = "Eric Chan and Rakeshkumar Gandhi and Sethuraman Panchanathan",
year = "1994",
month = "5",
day = "2",
doi = "10.1117/12.174956",
language = "English (US)",
volume = "2187",
pages = "222--228",
journal = "Proceedings of SPIE - The International Society for Optical Engineering",
issn = "0277-786X",
publisher = "SPIE",

}

TY - JOUR

T1 - A fast motion estimation algorithm for an MPEG Video coder

AU - Chan, Eric

AU - Gandhi, Rakeshkumar

AU - Panchanathan, Sethuraman

PY - 1994/5/2

Y1 - 1994/5/2

N2 - Video compression is becoming increasingly important with the advent of the compression standards and broadband networks. Typical applications include high-definition television, multimedia communications, etc. There are two kinds of redundancies that exist in a video sequence, namely, temporal and spatial which are exploited to achieve compression. The spatial redundancies are removed by using techniques such as discrete cosine transform, vector quantization, etc. while the temporal redundancies are removed by the motion estimation/compensation techniques. Recently, several block based motion estimation algorithms have been reported in the literature. However, these algorithms are either computationally expensive or converge to a local optimum. In this paper, we propose a reduced complexity block-matching motion estimation algorithm for an MPEG video coder. This algorithm consists of a layered structure and hence does not converge to a local optimum. Most importantly, it employs a simple matching criterion, namely, the modified pixel difference classification (MPDC) and hence results in a reduced computational complexity. The MPEG video coder has been simulated using the proposed layered structure MPDC algorithm (LSA-MPDC). Simulation results indicate that the LSA-MPDC algorithm achieves a good performance for both slow and fast moving sequences. In addition, the hardware implementation of the LSA-MPDC algorithm is very simple because of the binary operations used in the matching criteria.

AB - Video compression is becoming increasingly important with the advent of the compression standards and broadband networks. Typical applications include high-definition television, multimedia communications, etc. There are two kinds of redundancies that exist in a video sequence, namely, temporal and spatial which are exploited to achieve compression. The spatial redundancies are removed by using techniques such as discrete cosine transform, vector quantization, etc. while the temporal redundancies are removed by the motion estimation/compensation techniques. Recently, several block based motion estimation algorithms have been reported in the literature. However, these algorithms are either computationally expensive or converge to a local optimum. In this paper, we propose a reduced complexity block-matching motion estimation algorithm for an MPEG video coder. This algorithm consists of a layered structure and hence does not converge to a local optimum. Most importantly, it employs a simple matching criterion, namely, the modified pixel difference classification (MPDC) and hence results in a reduced computational complexity. The MPEG video coder has been simulated using the proposed layered structure MPDC algorithm (LSA-MPDC). Simulation results indicate that the LSA-MPDC algorithm achieves a good performance for both slow and fast moving sequences. In addition, the hardware implementation of the LSA-MPDC algorithm is very simple because of the binary operations used in the matching criteria.

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

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

U2 - 10.1117/12.174956

DO - 10.1117/12.174956

M3 - Conference article

AN - SCOPUS:33645485869

VL - 2187

SP - 222

EP - 228

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

SN - 0277-786X

ER -