Abstract
Variable block size algorithms for estimation, like the Adaptive Block Matching Algorithm (ABMA) [10], have been proposed to better match to objects in motion compared to the classical BMA [4, 2]. However, the variable block size grid derivation and the related estimation relies on a regularization process which implies heavy iterative and inter-dependent computation. Though the paral-lelization of the BMA is si gh forward, 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 detection of ABMA. This model can 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 (in C++, using the PVM platform). Experimentations show a linear speedup with respect to the number of processors.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Zenodo (CERN European Organization for Nuclear Research)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
