logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A distributed adaptive block matching algorithm: Dis-ABMA

delete2001-01-01
delete3
delete
OA
AI
F
F. Vermaut *
Y
Yves Deville
X
Xavier Marichal
B
Benoît Macq
DOI：10.1016/S0923-5965(00)00008-4delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In the context of motion estimation for video sequences processing, variable block size algorithms, like the Adaptive Block Matching Algorithm (ABMA), have been proposed to match better objects in motion compared to the classical BMA. However, the variable block size grid derivation and the related motion estimation relies on a regularization process which implies heavy iterative and inter-dependent computations. Though the parallelization of the BMA is straightforward, the ABMA needs a deeper analysis before its implementation in a distributed environment: this is the goal of this paper. We first designed a modelization of the motion estimation of ABMA. This model call lead to several different distributed versions. A specific distributed model, with one master and several slaves, is then described. An implementation of this model has been realized and experimentations demonstrate a linear speedup with respect to the number of processors. (C) 2001 Elsevier Science B.V. All rights reserved.
Keywords:
video processing
video coding
motion estimation
distributed algorithms
PVM
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

S
Signal Processing and Image Communication
IF:
2.7
Papers:
2.8K
Citations:
4.2K

Organization

No organization information available