A Parallel Online Learning Algorithm for Anisotropic Digital Image Restoration

Authors

  • Bharti Patel Department of Computer Science, Shri Shankracharya Technical Campus (SSGI-SSCET), Bhilai, Chattisgarh, India
  • Rajesh Tiwari Department of Computer Science, Shri Shankracharya Technical Campus (SSGI-SSCET), Bhilai, Chattisgarh, India

DOI:

https://doi.org/10.37591/rtpc.v2i1.314

Abstract

Previously, in the computational scenarios where the training data has already been made available for the learning algorithm, the kernel based algorithm such as support vector machines have made significant advances in the machine learning field. Though there has been little advancement made in learning scenario at online settings to facilitate the various real-time applications at the user end. In this study we discussed the issues with the online learning and propose a dynamic learning approach to facilitate the digital image restoration to overcome the online learning due to limited bandwidth and latency problem and thus consequently process the information in real time while on it is on route towards the receiver’s end. The algorithm distributes the batch jobs with respect to the cache miss rate and regressively simulates to adjust with the network latency. This association is effective in reproducing the lost or corrupted information over the network and help not only in retrieving the data but to process the jobs in a dynamic networked environment.

Keywords: On-line learning and relative loss bounds, bandwidth, latency, multi-processing

 

Cite this Article:
Bharti Patel, Rajesh Tiwari. A Parallel Online Learning Algorithm for Anisotropic Digital Image Restoration. Recent Trends in Parallel Computing. 2015; 2(1): 21–26p.

References

Bennett KP, Mangasarian OL. Robust Linear Programming Discrimination of Two Linearly Inseparable Sets. Optim. Method Softw. 1992; 1: 23–34p.

Cauwenberghs G, Poggio T. Incremental and Decremental Support Vector Machine Learning. In: Leen TK, Dietterich TG, Tresp V. Ed. Advances in Neural Information Processing Systems. MIT Press. 2001; 13: 409–415p.

Csat´o L, Opper M. Sparse Representation for Gaussian Process Models. In: Leen TK, Dietterich TG, Tresp V. Ed. Advances in Neural Information Processing Systems. MIT Press. 2001; 13: 444–450p.

Friedman J, Hastie T, Tibshirani R. Additive Logistic Regression: A Statistical View of Boosting. Technical Report, Stanford University, Dept. of Statistics, 1998.

Gentile C. A New Approximate Maximal Margin Classification Algorithm. In: Leen TK, Dietterich TG, Tresp V. Ed. Advances in Neural Information Processing Systems. MIT Press. 2001; 13: 500–506p.

Graepel T, Herbrich R, Williamson RC. From Margin to Sparsity. In: Leen TK, Dietterich TG, Tresp V. Ed. Advances in Neural Information Processing Systems. MIT Press. 2001; 13: 210–216p.

Guo Y, Bartlett P, Smola A, et al. Norm-Based Regularization of Boosting. Submitted to J. Mach. Learn. Res. 2001.

Herbster M. Learning Additive Models Online with Fast Evaluating Kernels. In Proc. 14th Annual Conf. on Computational Learning Theory (COLT). Springer. 2001; 444–460p.

Perona P, Malik J. Scale-Space and Edge Detection Using Anisotropic Diffusion. IEEE Trans. Pattern Anal. Machine Intell. Jul 1990; 12(7): 629–639p.

Rai A. Online Learning Algorithm for Multi-Kernel Balancing of Computational Work Load. Journal of Web Engineering & Technology. 2014; 1(2).

Downloads

Published

2015-03-19

Issue

Vol. 2 No. 1 (2015)

Section

Research Articles

License

Declaration and Copyright Transfer Form

(to be completed by authors)

I/ We, the undersigned author(s) of the submitted manuscript, hereby declare, that the above manuscript which is submitted for publication in the STM Journals(s), is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.

  • I/We will not withdraw the manuscript after 1 week of submission as I have read the Author Guidelines and will adhere to the guidelines.
  • I/We Author(s ) have niether given nor will give this manuscript elsewhere for publishing after submitting in STM Journal(s).
  • I/ We have read the original version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship.
  •  I/We also agree to the authorship of the article in the following order:

Author’s name                                    

 

1. ________________

2. ________________

3. ________________

4. ________________

 

We  Author(s) tick this box and would request you to consider it as our signature as we agree to the terms of this Copyright Notice, which will apply to this submission if and when it is published by this journal.