High-performance block matching algorithm for high bit-rate real-time video communication

Although the advancements in hardware solutions are growing exponentially along with the communication channels capacity, high quality video encoders for real-time applications are still considered an open area of research. The majority of researchers interested in video encoders target their invest...

Full description

Saved in:
Bibliographic Details
Published in:Jordanian Journal of Computers and Information Technology Vol. 4; no. 1; pp. 10 - 24
Main Author: AlNajdawi, Nijad
Format: Journal Article
Language:Arabic
English
Published: Amman, Jordan Princess Sumaya University for Technology 01.04.2018
Scientific Research Support Fund of Jordan Princess Sumaya University for Technology
Scientific Research Support Fund of Jordan (SRSF) and Princess Sumaya University for Technology (PSUT)
Subjects:
Algorithms
Block Matching
Communication
Data compression
Information technology
Investigations
Literature reviews
Motion Estimation
Optimization techniques
Video Coding
Video Communication
Video compression
Video Conferencing
ISSN:2413-9351, 2415-1076
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Although the advancements in hardware solutions are growing exponentially along with the communication channels capacity, high quality video encoders for real-time applications are still considered an open area of research. The majority of researchers interested in video encoders target their investigations towards motion estimation and block matching algorithms. Many algorithms that aim to reduce the total number of required mathematical operations when compared to Full Search have been proposed. However, the results often converge to local minima and a significant amount of computations is still required. Therefore, in this research, a hierarchy-based block matching method that facilitates the transmission of high bit-rate videos over standard communication methods is proposed. The proposed algorithm is based on the frequency domain, where the algorithm examines the similarities between a chosen frequency subset, which significantly reduces the total number of comparisons and the total mathematical computations required per block.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2413-9351
2415-1076
DOI:10.5455/jjcit.71-1511348607