Efficient computation of the Hutchinson metric between digitized images
暂无分享,去创建一个
[1] Lyman P. Hurd,et al. Fractal image compression , 1993 .
[2] Michel Barlaud,et al. Image coding using wavelet transform , 1992, IEEE Trans. Image Process..
[3] J. Stark. A neural network to compute the Hutchinson metric in fractal image processing , 1991, IEEE Trans. Neural Networks.
[4] Nicolas Dutil. Construction of Fractal Objects with Iterated Function Systems , 2000 .
[5] M. Barnsley,et al. Iterated function systems and the global construction of fractals , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.
[6] John J. Hopfield,et al. Simple 'neural' optimization networks: An A/D converter, signal decision circuit, and a linear programming circuit , 1986 .
[7] Jonathan Brandt,et al. An Algorithm for the Computation of the Hutchinson Distance , 1991, Inf. Process. Lett..
[8] S. G. Hoggar. Mathematics for computer graphics , 1993, Cambridge tracts in theoretical computer science.
[9] Jerome M. Shapiro,et al. Embedded image coding using zerotrees of wavelet coefficients , 1993, IEEE Trans. Signal Process..
[10] Thomas Kaijser. Computing the Kantorovich Distance for Images , 2004, Journal of Mathematical Imaging and Vision.
[11] Jelena Kovacevic,et al. Wavelets and Subband Coding , 2013, Prentice Hall Signal Processing Series.
[12] T. J. Stonham,et al. Guide to pattern recognition using random-access memories , 1979 .
[13] Jaroslav Stark. Iterated Function Systems as neural networks , 1991, Neural Networks.
[14] Michael F. Barnsley,et al. Fractals everywhere, 2nd Edition , 1993 .
[15] Y. Fisher. Fractal image compression: theory and application , 1995 .