Research on Web Service-Based Image Processing for Mobile Commerce

Article Preview

Abstract:

The resource limitation of mobile commerce systems cause the problem that the existing image processing software based on the centralized computing mode had difficulty in running in mobile commerce systems. This paper gives a solution for the problem by adopting web service-based image processing approach. The solution reduces the resource consumption of mobile commerce systems by distributing image processing tasks to service providers, service registry centers and service requesters. Furthermore, a web service discovery algorithm called WBSD is presented. Service providers adopt the WBSD to provide efficient services and increase image processing speed. Compared with traditional methods of image processing, Web service-based image processing method has the advantages of loose coupling and component oriented and can take full advantage of the computing resources in heterogeneous network. Thus web service-based image processing approach can effectively solve the resource bottle-neck that traditional image processing software had.

You might also be interested in these eBooks

Info:

Periodical:

Key Engineering Materials (Volumes 439-440)

Pages:

117-122

Citation:

Online since:

June 2010

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2010 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Ying-yuan Xiao, Hua Zhang. SHTM: A Semantic Hierarchy Transaction Model for Web Services. 2008 IEEE Asia-Pacific Services Computing Conference[C], Yilan, Taiwan (2008).

DOI: 10.1109/apscc.2008.16

Google Scholar

[2] Yu xiaopeng, Meng bo. The research on web-based 3D commodity 11th International Conference on Industrial Engineering and Engineering Management (2005).

Google Scholar

[3] Yu xiaogao, Yu xiaopeng. A new k-nearest neighbor searching algorithm based on angular similarity. ICMLC, (2008).

DOI: 10.1109/icmlc.2008.4620693

Google Scholar

[4] Yu xiaopeng, Yu xiaogao. Distributed k-nearest Neighbor Search based on angular similarity. FSKD, (2008).

Google Scholar

[5] Mark Allen Weiss. Data Structures and Algorithm Analysis in C [M]. USA: Prentice Hall, (2005).

Google Scholar

[6] W3C, 2003, Web Services and Service Oriented Architecture; http: /www. w3. org/2003/Talks/ 1211-xml2003-wssoa.

Google Scholar

[7] Nebert, D., 2004, Global Spatial Data Infrastructure Cookbook, Version2, http: /www. gsdi. org /docs2004/ Cookbook/cookbookV2. 0. pdf.

Google Scholar

[8] Yang, C., D. W. Wong, R.X. Yang, M. Kafatos, and Q. Li. Performance-improving techniques in web-based GIS. International Journal of Geographical Information Science Vol. 19(3), pp.319-342.

DOI: 10.1080/13658810412331280202

Google Scholar

[9] Yu xiaogao. The research on association rules algorithm based on minimum item supports. WiCOM, (2008).

Google Scholar

[10] Yu xiaopeng, Yu xiaogao. An adaptive algorithm for P2P k-nearest neighbor search in high dimensions. ICCA, (2007).

DOI: 10.1109/icca.2007.4376739

Google Scholar