@article {10.3844/jcssp.2007.130.133,
article_type = {journal},
title = {Adapting the LMF Temporal Splining Procedure From Serial to MPI/Linux Clusters},
author = {Akhter, Sajia and Sarkar, Ipshita and Rabbany, Kazi G. and Akter, Nahid and Akhter, Shamim and Chemin, Yann and Kiyoshi, Honda},
volume = {3},
number = {3},
year = {2007},
month = {Mar},
pages = {130-133},
doi = {10.3844/jcssp.2007.130.133},
url = {https://thescipub.com/abstract/jcssp.2007.130.133},
abstract = {Remote Sensing (RS) provides images over large areas such as provincial or country level. During the last 20 years, it plays a vital role for developing many complex applications. However, RS image includes data noises due to influence of haze or cloud especially in the rainy season. It is thus necessary to remove the noise to recover the real ground variations of information studied. Local Maximum Fitting (LMF) is a combined procedure, which helps to remove the noisy data. When dealing with sufficiently large and such complex processing with RS data, single computers time processing extends to unacceptable limits. Such as, to remove the noise from RS image with 146 bands, 38 rows and 37 columns which mean 146 x 38 x 37= 205276 pixels, the LMF procedure requires 26 minutes approximately. So, 1000 x 1000 Remote Sensing Image with 146 bands is required approximately two weeks. It is necessary to reduce the time constraint and make the LMF process executable in a suitable time limit. This study deals with the design and implementation of a distributed LMF procedure. Especially, inside the LMF procedure, a consecutive amount of pixels (pixels in a column) is processed for each row. This behavior is used in this study to make the LMF parallel. For processing the RS image (146 bands, 38 rows and 37 columns), the execution time reduces to 16.13 minutes by adding distributed computing to the program (37 columns distributed to 3 computers).},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}