Low-complexity video error concealment for mobile applications using OBMA

Low-complexity error concealment techniques for mobile applications are studied extensively in this paper. The boundary matching algorithm (BMA) is an attractive choice for mobile video concealment due to its low complexity. Here, we examine a variant of BMA called the outer boundary matching algori...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on consumer electronics 2008-05, Vol.54 (2), p.753-761
Main Authors: Thaipanich, T., Ping-Hao Wu, Kuo, C.-C.J.
Format: Article
Language:English
Subjects:
Algorithms
Boundaries
Cellular phones
Complexity
Consumer electronics
Decoding
Electronics
Error analysis
Error correction
Errors
Image coding
Matching
Mobile TV
Noise levels
Testing
Video coding
Video compression
Video sequences
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Low-complexity error concealment techniques for mobile applications are studied extensively in this paper. The boundary matching algorithm (BMA) is an attractive choice for mobile video concealment due to its low complexity. Here, we examine a variant of BMA called the outer boundary matching algorithm (OBMA). Although BMA and OBMA are similar in their design principle, it is empirically observed that OBMA outperforms BMA by a significant margin (typically, 0.5 dB or higher) while maintaining the same level of complexity. In this work, we attempt to explain the superior performance of OBMA, and conclude that OBMA provides an excellent tradeoff between the complexity and the quality of concealed video for a wide range of test video sequences and error conditions.
ISSN:0098-3063
1558-4127
DOI:10.1109/TCE.2008.4560157