Welcome to the InfoSci Platform
Reference Hub3
A Fastest Patchwise Histogram Construction Algorithm based on Cloud-Computing Architecture

A Fastest Patchwise Histogram Construction Algorithm based on Cloud-Computing Architecture

Chung-Chih Cheng, Fan-Chieh Cheng, Po-Hsiung Lin, Wen-Tzeng Huang, Shih-Chia Huang
Copyright: © 2017 |Volume: 14 |Issue: 1 |Pages: 12
ISSN: 1545-7362|EISSN: 1546-5004|EISBN13: 9781522511113|DOI: 10.4018/IJWSR.2017010101
Cite Article Cite Article

MLA

Cheng, Chung-Chih, et al. "A Fastest Patchwise Histogram Construction Algorithm based on Cloud-Computing Architecture." IJWSR vol.14, no.1 2017: pp.1-12. http://doi.org/10.4018/IJWSR.2017010101

APA

Cheng, C., Cheng, F., Lin, P., Huang, W., & Huang, S. (2017). A Fastest Patchwise Histogram Construction Algorithm based on Cloud-Computing Architecture. International Journal of Web Services Research (IJWSR), 14(1), 1-12. http://doi.org/10.4018/IJWSR.2017010101

Chicago

Cheng, Chung-Chih, et al. "A Fastest Patchwise Histogram Construction Algorithm based on Cloud-Computing Architecture," International Journal of Web Services Research (IJWSR) 14, no.1: 1-12. http://doi.org/10.4018/IJWSR.2017010101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The histogram in each patch of the input image is a useful feature applied for various development of image processing techniques. However, if the size of the input image is very large, the histogram construction of each patch in the image becomes very time-consuming. For applications involving the processing of several very large images, this paper proposes a superior patchwise histogram construction algorithm based on cloud-computing architecture that is faster than similar state-of-the-art approaches. Through the modern communication network, the computation cost can be easily shared to construct several patchwise histograms at the same time. The proposed algorithm is the fastest solution in the field as well as applicable to various data processing procedures related to probability distribution. Experimental results show that the proposed algorithm has the best performance compared to other related algorithms.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.