Bi-dimensional empirical mode decomposition (BEMD) algorithm based on particle swarm optimization-fractal interpolation
- 25 Downloads
The performance of interpolation algorithm used in bi-dimensional empirical mode decomposition directly affects its popularization and application. Therefore, the research on interpolation algorithm is more reasonable, accurate and fast. So far, in the interpolation algorithm adopted by the bi-dimensional empirical mode decomposition, an adaptive interpolation algorithm can be proposed according to the image characteristics. In view of this, this paper proposes an image interpolation algorithm based on the particle swarm and fractal. Its procedure includes: to analyze the given image by using the fractal brown function, to pick up the feature quantity from the image, and then to operate the adaptive image interpolation in terms of the obtained feature quantity. The parameters involved in the interpolation process are optimized by particle swarm optimization algorithm, and the optimal parameters are obtained, which can solve the problem of low efficiency and low precision of interpolation algorithm used in bi-dimensional empirical mode decomposition. It solves the problem that the image cannot be decomposed to obtain accurate and reliable bi-dimensional intrinsic modal function, and realize the fast decomposition of the image. It lays the foundation for the further popularization and application of the bi-dimensional empirical mode decomposition algorithm.
KeywordsFractal Particle swarm optimization Bi-dimensional empirical mode decomposition Optimization Image interpolation
This work is supported by National Science Foundation Project of P. R. China (No. 61701188).
- 1.Akima H, Gebhardt A, Petzoldt T (2013) “akima: interpolation of irregularly spaced data,” R package version 0.5–11, URL http://CRAN.R-project.org/package=akima
- 7.Clerc M (2010) Particle swarm optimization. Wiley, Hoboken, pp 321–389Google Scholar
- 9.Falconer K, Fractal geometry: mathematical foundations and applications. Hoboken: Wiley, 2004, pp. 109–139Google Scholar
- 10.Falconer K (2012) Fractals: theory and applications in engineering: theory and applications in engineering. Springer Science & Business Media, Berlin, pp 201–289Google Scholar
- 11.Goldberg DE (2013) The design of innovation: lessons from and for competent genetic algorithms. Springer Science & Business Media, Berlin, pp 138–165Google Scholar
- 15.Ke Y, Sukthankar R (2004) PCA-SIFT: A more distinctive representation for local image descriptors. Proceedings of the 2004 IEEE Computer Society Conference on. IEEE, USA, p 506–513Google Scholar
- 16.Lei D, Xiaolin H, Feng L (2011) Support vector machines-based method for restraining end effects of B-spline empirical mode decomposition. J Vib Meas Diagn 31(3): 344–347. 3: 1–19Google Scholar
- 20.Liu Z, Wang H, Peng S (2004) Texture segmentation using directional empirical mode decomposition. In: Proc. ICIP'04, USA, p 279–282Google Scholar
- 23.Panichella A, Dit B, Oliveto R (2013) How to effectively use topic models for software engineering tasks? An approach based on genetic algorithms. In: Proceedings of the 2013 International Conference on Software Engineering, USA, p 522–531Google Scholar
- 26.Sastry K, Goldberg DE, Kendall G (2014) Genetic algorithms. Springer US, Berlin, pp 93–117Google Scholar
- 28.Steeb WH (2014) The nonlinear workbook: chaos, fractals, cellular automata, genetic algorithms, gene expression programming, support vector machine, wavelets, hidden Markov models, fuzzy logic with C++, Java and SymbolicC++ programs. World Scientific Publishing Co Inc, Singapore, pp 307–334CrossRefGoogle Scholar