Mathematical Modeling of Distributed Image Processing Algorithms
نویسندگان
چکیده
منابع مشابه
Distributed source separation algorithms for hyperspectral image processing
This paper describes a new algorithm for feature extraction on hyperspectral images based on blind source separation (BSS) and distributed processing. I use Independent Component Analysis (ICA), a particular case of BSS, where, given a linear mixture of statistical independent sources, the goal is to recover these components by producing the unmixing matrix. In the multispectral/hyperspectral i...
متن کاملParallel and Distributed Algorithms for High Speed Image Processing
Many image processing tasks exhibit a high degree of data locality and parallelism and map quite readily to specialized massively parallel computing hardware. However, as distributed memory machines are becoming a viable and economical parallel computing resource, it is important to understand how to use these environments for parallel image processing as well. In this paper we discuss our impl...
متن کاملMathematical models in image processing
Image processing is a particularization of signal processing of which Electrical Engineering is, maybe, the major contributor. Image processing is completely pervaded by more or less complex mathematical tools aimed at solving problems related to image reconstruction and restoration, boundary extraction, shape modeling, segmentation, registration, etc. For performing these tasks, mathematical t...
متن کاملFeasibility of detecting and localizing radioactive source using image processing and computational geometry algorithms
We consider the problem of finding the localization of radioactive source by using data from a digital camera. In other words, the camera could help us to detect the direction of radioactive rays radiation. Therefore, the outcome could be used to command a robot to move toward the true direction to achieve the source. The process of camera data is performed by using image processing and computa...
متن کاملA Mathematical Modeling of Pure, Recursive Algorithms
This paper follows previous work on the Formal Language of Recursion FLR and develops intensional (algorithmic) semantics for it: the intension of a term t on a structure A is a recursor, a set–theoretic object which represents the (abstract, recursive) algorithm defined by t on A. Main results are the soundness of the reduction calculus of FLR (which models faithful, algorithm–preserving compi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2013
ISSN: 2158-107X,2156-5570
DOI: 10.14569/specialissue.2013.030306