Mathematics of digital images: Creation, compression, restoration, recognition

Mathematics of Digital Images: Creation, Compression, Restoration, Recognition

Volumn 9780521780292, Issue , 2009, Pages 1-854

  Van Hoggar, S G ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL ENCODING; COMPUTER SCIENTISTS; DIGITAL IMAGE; DIGITAL REVOLUTION; EDUCATION AND RESEARCHES; SHANNON;

RESTORATION;

EID: 84923592061     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511810787     Document Type: Book

References (366)

1. Aggarval, J. K. and Cai, Q. (1999), Human motion analysis, a review, Computer Vision and Image Understanding 73, 428–440.
2. Ahmed, N., Natarajan, T. and Rao, K. R. (1974), Discrete Cosine Transform, IEEE Trans. on Computers 23, 90–93.
3. Anson, L. A. (1993) Fractal Image Compression, Byte Magazine, October 1993.
4. Avnir, D. and Pfeifer, P. (1983), Fractal dimension in chemistry, Nouv. J. Chim. 7, 71–72.
5. Baldi, P. and Hornik, K. (1999), Neural networks and principal component analysis: learning from examples without local minima, Neural Networks 2, 53–58.
6. Baldock, R. and Graham, J. (2000), Image Processing and Analysis, a Practical Approach, Oxford University Press.
7. Bankman, I. N., ed. (2000), Handbook of Medical Image Processing, Academic Press.
8. Barnsley, M. F. (1992) Fractals Everywhere, 2nd edn., Academic Press.
9. Barnsley, M. F. and Hurd, L. P. (1994), Fractal Image Compression, A. K. Peters.
10. Barnsley, M. F. and Sloan, A. D. (1988), A better way to compress images, Byte Magazine, January 1988.
11. Barron, A., Rissanen, J. and Yu, B. (1998), The minimum description length principle in coding and modelling, IEEE Trans. on Information Theory, 44, 2743–2760.
12. Becker, S. (1992), An Information-Theoretic Unsupervised Learning Algorithm for Neural Networks, Ph.D. Thesis, University of Toronto, Department of Computer Science.
13. Becker, S. and Hinton, G. E. (1992), A self-organizing neural network that discovers surfaces in random-dot stereograms, Nature (London) 355, 161–163.
14. Becker, S. (1993), Learning mixture models of spatial coherence, Neural Computation 5, 267–277.
15. Beer, P. and Roy, A. E. (eds.) (1990), Fractals in Astronomy. Special issue of Vistas in Astronomy, Vol. 33 Part 3/4.
16. Behnke, S. (2003), Hierarchical Neural Networks for Image Interpretation, Springer Lecture Notes in Computer Science, 2766.
17. Bell, A. J. and Sejnowski, T. J. (1995), An information-maximization approach to blind separation and blind deconvolution, Neural Computation 7, 1129–1159.
18. Berger, T. (1971), Rate Distortion Theory, Prentice-Hall.
19. Berlekamp, E. (1974), Key Papers in the Development of Coding Theory, IEEE Press.
20. Berrou, C. and Glavieux, A. (1996), Near optimum error correcting coding and decoding: turbo-codes. IEEE Trans. on Communications 44, 1261–1271.
21. Berrou, C., Glavieux, A. and Thitimajshima, P. (1993), Near Shannon limit error-correcting coding and decoding: turbo-codes. In Proceedings of the IEEE International Conference on Communications.
22. Bertram, M. (2004), Biorthogonal loop-subdivision wavelets. Computing 72, 29–39.
23. Bertram, M., Duchaineau, M. A., Hamann, B. and Joy, K. I. (2000), Bicubic subdivision-surface wavelets for large-scale isosurface representation and visualization, IEEE Proc. Visualization 2000, 389–396, 579.
24. Bertram, M., (2004), Generalized B-spline subdivision-surface wavelets for geometry compression. IEEE Trans. on Visualization and Computer Graphics 10, 326–338.
25. Besag, J. (1974), Spatial interaction and the statistical analysis of lattice systems, J. R. Statist. Soc. B 32, 192–236.
26. Besag, J. (1986), On the statistical analysis of dirty pictures, J. R. Statist. Soc. B 48, 259–302.
27. Besag, J. (2000), Markov Chain Monte Carlo for Statistical Inference, Working Paper No. 9, Centre for Statistics and Social Sciences, University of Washington, USA.
28. Bézier, P. (1966) Définition numérique des courbes et surfaces I, Automatisme, 11, 625–632 (also 12 (1967), 17–21).
29. Bézier, P. (1972) Numerical Control: Mathematics and Applications, Wiley. Translated from original French text by A. R. Forrest.
30. Birkhoff, G. and MacLane, S. (1963) A Survey of Modern Algebra, 3rd edn. Macmillan.
31. Bishop, C. M. (1995), Neural Networks for Pattern Recognition, Oxford University Press.
32. Blahut, R. E. (1972), Computation of channel capacity and rate distortion functions, IEEE Trans. on Information Theory, IT-18, 460–473.
33. Blahut, R. E. (1987), Principles and Practice of Information Theory, Addison-Wesley.
34. Born, M. and Wolf, E. (1999), Principles of Optics (7th edn.), Cambridge University Press.
35. Bose, R. C. and Ray-Chaudhuri, D. K. (1960), On a class of error correcting binary group codes, Information & Control 3, 68–79.
36. Boss, R. D. and Jacobs, E. W. (1991) Studies of Iterated Transform Image Compression, and Its Application to Colour and DTED, Technical Report 1468, Naval Ocean Systems Center, San Diego, CA.
37. Bracewell, R. N. (1986), The Fourier Transform and Its Applications, McGraw-Hill.
38. Briggs, W. L. and Henson, Van E. (1995), The DFT: An Owner’s Manual for the Discrete Fourier Transform, SIAM.
39. Brigham, E. O. (1988), The Fast Fourier Transform and Its Applications, Prentice-Hall.
40. Brislawn, C. M. (1995) Fingerprints go digital, Notices of the AMS 42, 1278–1283.
41. Brivio, P. A. and Marini, D. (1993) A fractal method for digital elevation model construction and its application to a mountain region, Computer Graphics Forum 12, 297–309.
42. Bruce, V., Green, P. R. and Georgeson, M. A. (1996), Visual Perception, Psychology Press.
43. Burrough, P. A. (1981), Fractal dimension of landscapes and other environmental data, Nature (London), 294, 204–242.
44. Burt, P. J. and Adelson, E. H. (1983), The Laplacian pyramid as a compact image code, IEEE Trans. Comm. 31, 532–540.
45. Canny, J. (1986), A computational approach to edge-detection. IEEE Trans. on Pattern Analysis and Machine Intelligence PAMI-8, 679–698.
46. Capocelli, R. M., Giancarlo, R. and Taneja, I. J. (1986), Bounds on the redundancy of Huffman codes, IEEE Trans. on Information Theory, IT-32, 854–857.
47. Castleman, K. R. (1996), Digital Image Processing, Prentice-Hall.
48. Catmull, E. and Clark, J. (1978) Recursively generated B-spline surfaces on arbitrary topological meshes. Computer-Aided Design 10(6), 350–355.
49. Chaikin, G. M. (1974) An algorithm for high speed curve generation, Computer Graphics & Image Processing 3(4), 346–349.
50. Chaitin, G. J. (1966), On the length of programs for computing finite binary sequences, J. ACM 13, 547–569.
51. Chaitin, G. J. (1975), A theory of program size formally identical to information theory, J. ACM 22, 329–340.
52. Clarke, R. J. (1981), On the relation between the Karhunen–Loève and cosine transforms, IEE Proceedings Part F: Commun. Radar, Signal Processing 128, 359–360.
53. Conway, J. H. and Sloane, N. J. A. (1988), Sphere Packings, Lattices, and Groups, Springer-Verlag.
54. Cooley, J. W. and Tukey, J. W. (1965), An algorithm for the machine calculation of complex Fourier series. Math. of Comp. 19, 297–301.
55. Cootes, T. F., Taylor, C. J., Cooper, D. H. and Graham, J. (1995), Active shape models–their training and application, Computer Vision and Image Understanding 61, 38–59.
56. Cover, T. M. and Thomas, J. S. (1991), Elements of Information Theory, Wiley Interscience.
57. Cox, M. G. (1972) The numerical evaluation of B-splines. J. Inst. Maths. Applics. 10, 134–149.
58. Coxeter, H. S. M. (1973) Regular Polytopes. 2nd edn. Collier-Macmillan, New York, 1963; 3rd edn., Dover, New York, 1973.
59. Coxeter, H. S. M. (1974) Regular Complex Polytopes. Cambridge University Press.
60. Coxeter, H. S. M. (1987) (Co-editor) M. C. Escher: Art and Science. Proceedings of the International Congress on M. C. Escher, Rome, 1985. 2nd edn. Elsevier Science Publishing.
61. Critchlow, K. (1976) Islamic Patterns. An Analytical and Cosmological Approach. Schocken Books, Thames & Hudson.
62. Culik, K. and Kari, J. (1993), Image compression using weighted finite automata. Computers and Graphics 17, 305–313.
63. Cunningham, P., Carney, J. and Jacob, S. (2000), Stability problems with artificial neural networks and the ensemble solution, Artificial Intelligence in Medicine 20, 217–225.
64. da Silva, A. B., Sampson, D. G. and Ghanbari, M. (1996), A successive approximation vector quantizer for wavelet transform image coding, IEEE Trans. on Image Processing 5, 299–310.
65. Darrel, T. and Pentland, A. (1995), Cooperative robust estimation using layers of support, IEEE Trans. Pattern Analysis and Machine Intelligence 17, 474–487.
66. Daubechies, I. (1988) Orthonormal bases of compactly supported wavelets, Comm. Pure and Applied Math. 41, 909–996.
67. Daubechies, I. (1992) Ten Lectures on Wavelets, SIAM.
68. Daugman, J. (1985), Uncertainty relation for resolution in space, spatial frequency, and orientation optimised by two-dimensional visual cortex filters, J. Opt. Soc. Amer. 2, 1160–1169.
69. Davies, E. R. (1997), Machine Vision: Theory, Algorithms, Practicalities. Academic Press.
70. Davies, R. H., Coores, T. F., Twining, C. J. and Taylor, C. J. (2001), An information theoretic approach to statistical shape modelling. Proc. British Machine Vision Conference 2001. BMVA.
71. Davisson, L. D. and Pursley, M. B. (1975), A direct proof of the coding theorem for discrete sources with memory, IEEE Trans. on Information theory, IT-21, 310–317.
72. de Boor, C. (1972) On calculating with B-splines, J. Approx. Theory 6 (1), 50–62.
73. Deans, S. R. (1981), Hough Transform from the Radon Transform, IEEE Trans. on Pattern Analysis and Imaging, PAMI-3, 185–188.
74. Deans, S. R. (1993), The Radon Transform and Some of Its Applications, Krieger.
75. Denison, D. G. T., Mallick, B. K. and Smith, A. F. M. (1998), Automatic Bayesian curve fitting, J. R. Statist. Soc. 60, 333–350.
76. Denisova, N. V. (2004), Bayesian reconstruction in SPECT with entropy prior and iterative statistical regularization, IEEE Trans. on Nuclear Science 51, 136–141.
77. Devaney, B. (1989) The Harmony Guide to Colourful Machine Knitting. Lyric Books, Hodder & Stoughton.
78. Diamantaris, K. I. and Kung, S. Y. (1996), Principal Component Neural Networks, Wiley-Intersience.
79. Ding, W. and Liu, B. (1996), Tomographic image sequence reconstruction by edge-preserving interslice MAP methods, IEEE Trans. Image Processing 5, 178–183.
80. Djamdji, A., Bijaoui, A. and Manière, R. (1993a), Geometrical registration of images: the multiscale approach, Photogramm. Eng. & Remote Sensing 59, 645–653.
81. Djamdji, A., (1993b), Geometrical registration of remotely sensed images with the use of the wavelet transform, SPIE Int. Symposium on Optical Engineering and Phototonics, Orlando, Vol. 1938, 412–422.
82. Djurle, E. & Bäck, A. (1961), Some measurements of the effect of air turbulence on photographic images, J. Opt. Soc. of Amer. 51, 1029–1030.
83. Dobkin, D. P. (1988) Computational geometry–then and now. In Theoretical Foundations of Computer-Graphics and CAD, NATO ASI series F40 (R. A. Earnshaw, Ed.). Springer-Verlag.
84. Dong, Y. and Carin, L. (2003), Rate-distortion analysis of discrete-HMM pose estimation via multiaspect scattering data, IEEE Trans. on Pattern Analysis and Machine Intelligence 25, 872–883.
85. Doo, D. W. H. and Sabin, M. (1978) Behaviour of recursive division surfaces near extraordinary points, Computer-Aided Design 10(6), 356–360.
86. Draper, B. A. and Baek, K. (2000), Unsupervised learning of biologically plausible object recognition strategies, Springer Lecture Notes in Computer Science 1811, 238–247.
87. Dryden, I. L. and Mardia, K. V. (1998), Statistical Shape Analysis, John Wiley.
88. Eck, M., DeRose, T., Duchamp, T., Hoppe, H., Lounsbery, J. M. and Stuetzle, W. (1995), Multiresolution analysis of arbitrary meshes. Proceedings of SIGGRAPH ’95, 173–182. ACM Press.
89. Edelman, S., Intrator, N. and Jacobson, J. S. (2002), Unsupervised learning of visual structure, Springer Lecture Notes in Computer Science 2525, 629–642.
90. Edmonds, J. and Karp, R. M. (1972), Theoretical improvements in algorithmic efficiency for network flows, J. ACM 19, 248–264.
91. Eels, J. and Lemaire, L. (1988), Another report on harmonic maps. Bull. London Math. Soc. 20, 385–524.
92. Elias, P. (1955), Coding for noisy channels, IRE Convention Record 4, 37–47.
93. Escher, M. C. (1989) Escher on Escher–Exploring the Infinite, Meulenhoff International, Harry N. Abrams Inc.
94. Even, S. (1973), Algorithmic Combinatorics, Macmillan.
95. Falconer, K. J. (1997), Techniques in Fractal Geometry, Wiley.
96. Farin, G. (2002) (5th edn.) Curves and Surfaces for CAGD. Academic Press.
97. Fausett, L. (1994), Fundamentals of Neural Networks, Prentice-Hall.
98. Feder, J. (1989), Fractals, Plenum Press.
99. Feller, W. (1968), An Introduction to Probability Theory and Its Applications, Vol. 2, John Wiley.
100. Ferrari, P. A., Frigessi, A. and Gonsaga de Sa, P. (1995), Fast approximate maximum a posteriori restoration of multicolour images, J. R. Statist. Soc. B 57, 485–500.
101. Field, R. (1988) Geometric Patterns from Roman Mosaics. Tarquin Publications.
102. Fisher, Y. (1995), ed., Fractal Image Compression, Springer-Verlag.
103. Ford, L. R. and Fulkerson, D. R. (1962), Flows in Networks, Princeton University Press.
104. Forsey, D. and Bartels, R. (1988), Tensor products and hierarchical fitting, in Curves and Surfaces in Computer Vision and Graphics II, Proc. SPIE, Vol. 1610, pp. 88–96.
105. Freeman, W. T., Pasztor, E. C. and Thouis, R. J. (2002), Example based super-resolution. IEEE Computer Graphics and Applications 22, 56–65.
106. Frey, B. J. (1998) Graphical Models for Machine Learning and Computation. MIT Press.
107. Frey, B. J. and MacKay, D. J. C. (1998), A revolution: belief propagation in graphs with cycles. Advances in Neural Information Processing Systems 10. MIT Press.
108. Fua, P. and Hanson, A. J. (1991), An optimisation framework for feature extraction, Machine Vision Applications 4, 59–87.
109. Fukushima, K. (1999), Self-organization of shift-invariant receptive fields, Neural Networks 12, 791–801.
110. Fukushima, K. (2000), Active and Adaptive Vision: Neural Network Models, Springer Lecture Notes in Computer Science 1811, 623–634.
111. Gabor, D. (1946), Theory of Communications, J. IEE, 93, 429–457.
112. Gallager, R. G. (1963), Low Density Parity Check Codes, Monograph, MIT Press.
113. Gallager, R. G. (1978) Variations on a theme by Huffman, IEEE Trans. on Information Theory, 24, 668–674.
114. Gallant, S. I. (1990), Perceptron-based learning algorithms, IEEE Trans. on Neural Networks, 1, 179–191.
115. García, J. A., Fdez-Valdivia, J., Fdez-Vidal, X. R. and Rodriguez-Sánchez, R. (2003), On the concept of best achievable compression ratio for lossy image coding, Pattern Recognition 36, 2377–2394.
116. Gardner, G. G., Keating, D., Williamson, T. H. and Elliot, A. T. (1996), Automatic detection of diabetic retinopathy using an artificial neural network: a screening tool. British J. Ophthalmology 30, 940–944.
117. Gelman, A. (1996), Inference and monitoring convergence, in Markov Chain Monte Carlo in Practice (Gilks, W. R., Richardson, S. and Spiegelhalter, D. J., eds.) Chapman & Hall.
118. Geman, D. and Geman, S. (1984), Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images, IEEE Trans. on Pattern Analysis and Machine Intelligence 6, 721–741.
119. Gersho, A. and Gray, R. M. (1992), Vector Quantization and Signal Compression, Kluwer.
120. Giacinto, G., Roli, F. and Bruzzone, L. (2000), Combination of neural and statistical algorithms for supervised classification of remote-sensing images, Pattern Recognition Letters 21, 385–397.
121. Gilks, W. R., Richardson, S. and Spiegelhalter, D. J. (1997), Markov Chain Monte Carlo in Practice, Chapman & Hall.
122. Golub, G. H. and van Loan, C. F. (1996), Matrix Computations, Johns Hopkins University Press.
123. Gonzalez, R. C. and Woods, R. E. (1993), Digital Image Processing, Addison-Wesley.
124. Gray, R. M. (1990) Source Coding Theory, Kluwer.
125. Gray, R. M., Kieffer, J. C. and Linde, Y. (1980), Locally optimal block quantizer design, Information & Control 45, 178–198.
126. Green, P. J. (1995), Reversible jump Markov chain Monte Carlo computation and Bayesian model determination, Biometrika 82, 711–732.
127. Green, P. J. (1996), MCMC in image analysis, in Markov Chain Monte Carlo in Practice, (Gilks, W. R., Richardson, S. and Spiegelhalter, D. J., eds.) Chapman & Hall.
128. Grenander, U. and Szegö, G. (1958), Toeplitz Forms and Their Applications, University of California Press.
129. Grieg, D. M., Porteous, B. T. and Seheult, A. H. (1989), Exact maximum a posteriori estimation for binary images, J. R. Statist. Soc. B 51, 271–279.
130. Grossman, A. and Morlet, J. (1984), Decomposition of Hardy functions into square-integrable wavelets of constant shape, SIAM J. Appl. Math. 15, 723–736.
131. Grünbaum, B. and Shephard, G. C. (1987) Tilings and Patterns. Freeman.
132. Haar, A. (1955) Zur Theorie der orthogonalen Funktionen-System, Inaugural Dissertation, Math. Annalen 5, 17–31
133. Häggström, O. (2002), Finite Markov Chains and Algorithmic Applications, Cambridge University Press.
134. Hammer, B. and Villmann, T. (2002), Generalised relevance learning vector quantization, Neural Networks 15, 1059–1068.
135. Hammersley, J. M. and Handscomb, D. C. (1964), Monte Carlo Methods, Chapman & Hall.
136. Hamming, R. V. (1950), Error detecting and error-correcting codes, Bell Sys. Tech. J. 29, 147–160.
137. Hansen, M. and Yu, B. (2000), Wavelet thresholding via MDL for natural images, IEEE Trans. on Information Theory 46, 1778–1788.
138. Haritopoulos, M., Yin, H. and Allinson, N. M. (2002), Image denoising using SOM-based nonlinear independent component analysis, Neural Networks 15, 1085–1098.
139. Hartley, R. V. L. (1928), Transmission of information, Bell Sys. Tech. Journal 7, 617.
140. Hastings, W. K. (1970) Monte Carlo sampling methods using Markov chains, and their applications, Biometrika 57, 97–109.
141. Hayashi, Y., Setiono, R. and Yoshida, K. (2000), A comparison between two neural network rule extraction techniques for the diagnosis of hepatobiliary disorders, Artificial Intelligence in Medicine 20, 205–216.
142. Haykin, S. (1994), Neural Networks: a Comprehensive Foundation, Macmillan.
143. Hebb, D. (1949), The Organization of Behaviour, Wiley.
144. Heckbert, P. S. (1989) Fundamentals of Texture Mapping and Image Warping. Rept. UCB/CSD 89/516. Computer Science Division, University of California, Berkeley.
145. Heegard, C. and Wicker, S. B. (1998), Turbo Coding, Kluwer International Series in Engineering and Computer Science, vol. 476.
146. Heideman, M., Johnson, D. and Burrus, C. (1985), Gauss and the history of the fast Fourier transform. Arch. Hist. Exact Sciences 34, 265–277.
147. Helstrom, C. W. (1967), Image restoration by the method of least squares, J. Opt. Soc. Amer. 57, 297–303.
148. Hennie, F. C. and Stearns, R. E. (1966), Two-tape simulation of multitape turing machines, J. ACM 13, 533–546.
149. Hocquenghem, P. A. (1959), Codes correcteurs d’erreurs, Chiffres 2, 147–156.
150. Hoggar, S. G. (1992), Mathematics for Computer Graphics, Cambridge University Press.
151. Hoggar, S. G., Martinelli, M. J. and Bennett, D. (1998), Fractal dimension and equine bone, Proceedings of 16th Eurographics UK Conference, 191–198.
152. Hoppe, H., DeRose, T., Duchamp, T., Halstead, M., Jin, H., McDonald, J., Schweizer, J. and Stuetzle, W. (1994), Piecewise smooth surface reconstruction, Proceedings of SIGGRAPH 94, 295–302, ACM Press.
153. Hotelling, H. (1933), Analysis of a complex of statistical variables into principal components, J. Educ. Psychol. 24, 417–441, 498–520.
154. Hough, P. (1962), Method and Means for Recognizing Complex Patterns, US Patent 3069654. United States Patent Office.
155. Hubbard, B. B. (1996), The World According to Wavelets, A. K. Peters.
156. Huffman, D. A. (1952), A method for the construction of minimum redundancy codes, Proc. IRE 40(9), 1098–1101.
157. Hufnagel, R. E. and Stanley, N. R. (1964), Modulation transfer function associated with image transmission through turbulent media, J. Optical Soc. of America 54, 52–62.
158. Hutchinson, J. E. (1981), Fractals and self similarity. Indiana University Mathematics J. 30, 713–747.
159. Ibrahim, A. and Azimi-Sadjadi, M. R. (1996), A fast learning algorithm for Gabor transformation. IEEE Trans. on Image Processing 5, 171–175.
160. Jackson, J. E. (1991), A User’s Guide to Principal Components. Wiley.
161. Jackson, J. I., Meyer, C. H., Nishimura, D. G., and Macovski, A. (1991), Selection of a convolution function for Fourier inversion using gridding, IEEE Trans. on Medical Imaging 10, 473–478.
162. Jacobs, E.W., Boss, R. D. and Fisher, Y. (1990), Fractal-Based Compression II. Technical report 1362. Naval Ocean Systems Centre, San Diego, CA, June 1990.
163. Jacquin, A. (1989), A Fractal Theory of Iterated Markov Operators with Applications to Digital Image Coding, Ph.D. Thesis, Georgia Institute of Technology.
164. Jaffard, S., Meyer, I. and Ryan, R. D. (2001), Wavelets: Tools for Science and Technology, SIAM.
165. Jaynes, C., Riseman, E. and Hanson, A. (2003), Recognition and reconstruction of buildings from multiple aerial images, Computer Vision & Image Understanding 90, 68–98.
166. Jepson, A. and Mann, R. (1999). Qualitative probabilities for image interpretation. Proc. IEEE ICCV.
167. Jaynes, E. T. (1982), On the rationale of maximum entropy methods, Proc. IEEE 70, 939–952.
168. Johnson, V. E. (1994), A model for segmentation and analysis of noisy images, J. Amer. Stat. Assoc. 89, 230–241.
169. Jollife, I. T. (1986), Principal Component Analysis, Springer-Verlag.
170. Justesen, J. (1972), A class of constructive asymptotically good algebraic codes, IEEE Trans. on Info. Theory, IT-18, 652–656.
171. Kabashima, Y. and Saad, D. (1998), Belief propagation vs. TAP for decoding corrupted messages, Europhys. Lett. 44, 668.
172. Kabashima, Y. (2004), Statistical mechanics of low density parity check codes. J. Phys. A 37, R1.
173. Kalos, M. H. and Whitlock, P. A. (1986), Monte Carlo Methods, Vol. I, Wiley.
174. Kaye, B. H. (1989), A Random Walk through Fractal Dimensions, VCH Publishers.
175. Keating, D., Mutlukan, E., Evans, A., McGarvie, J. and Damato, B. (1993), A backpropagation network for the classification of visual field data. Phys. Med. Biol. 38, 1263–1270.
176. Kershner, R. (1939), The number of circles covering a set, Amer. J. Math. 61, 665–671.
177. Kinderman, R. and Snell, J. L. (1980), Markov Random Fields and Their Applications, AMS.
178. Kittler, J. and Föglein, J. (1984), Contractual decision rules for objects in lattice configurations. Proc. 7th Int. Conf. on Pattern Recognition, Montreal 1984, 270–272.
179. Knuth, D. (1981), Seminumerical Algorithms, Addison-Wesley.
180. Kobbelt, L. P., Vorsatz, J., Labsik, U. and Seidel, H.-P. (1999), A shrink wrapping approach to remeshing polygonal surfaces, Computer Graphics 18, Proceedings of Eurographics ’99, Blackwell Publishers, 119–129.
181. Kohonen, T. (1982), Self-Organizing formation of topologically correct feature maps, Biological Cybernetics 43, 59–69.
182. Kohonen, T. (1988), Learning vector quantisation, Neural Networks 1 (Supplement 1), 303.
183. Kohonen, T. (2001), Self-Organizing Maps, 3rd edn., Springer.
184. Kohonen, T. and Somervuo, P. (2002), How to make large self-organizing maps for nonvectorial data, Neural Networks 15, 945–952.
185. Kolmogorov, A. N. (1956a), Foundations of Probability, Chelsea Publishing Company.
186. Kolmogorov, A. N. (1956b), On the Shannon theory of information transmission in the case of continuous signals, IRE Transactions on Information Theory IT-2, 102–108.
187. Kolmogorov, A. N. (1965), Three approaches to the quantitative definition of information, Problems of Information & Transmission 1, 4–7.
188. Kolmogorov, A. N. (1968), Logical basis for information theory and probability theory, IEEE Trans. on Information Theory, 14, 662–664.
189. Koornwinder, T. H. (ed.) (1993) Wavelets: an Elementary Treatment of Theory and Applications, World Scientific.
190. Kossentini, F., Chung, W. C. and Smith, M. J. T. (1996), Conditional entropy-constrained residual VQ with application to image coding, IEEE Trans. on Image Processing 5, 311–320.
191. Kotz, S. and Johnson, N. L. (1985), Encyclopedia of Statistical Sciences, Vol. 5, Wiley.
192. Lamar, M. V., Bhuiyan, M. S. and Iwata, A. (2000), T-CombNET–a Neural Network Dedicated to Hand Gesture Recognition, Springer Lecture Notes in Computer Science 1811, 613–622.
193. Lane, J. M. and Riesenfeld, R. F. (1980) A theoretical development for the computer generation and display of piecewise polynomial surfaces, IEEE Trans. on Pattern Analysis and Machine Intelligence 2, 35–46.
194. Leavers, V. (1992), Shape Detection in Computer Vision Using the Hough Transform, Springer-Verlag.
195. Leclerc, Y. G. (1989), Constructing simple stable descriptions for image partitioning, J. Computer Vision 3, 73–102.
196. Ledermann, W. and Vajda, S. (1982), Handbook of Applicable Mathematics IV: Analysis. Wiley.
197. Lee, C.-C. and Laroia, R. (2000), Trellis-based scalar vector quantization of sources with memory, IEEE Trans. on Information Theory, IT-46, 153–170.
198. Leherte, L., Glasgow, J., Baxter, K., Steeg, E. and Fortier, S. (1997), Analysis of 3-D protein images, J. AI Research 7, 125–159.
199. Leonard, T. and Hsu, J. S. J. (1999), Bayesian Methods, Cambridge University Press.
200. Levine, R. F. (2001), Clinical problems, computational solutions, Cancer 91 (2001), 1595–1602.
201. Levinson, S. E. and Shepp, L., eds. (1991) Image Models and Their Speech Model Cousins, IMA Vol. 80 on Mathematics and Its Applications, Springer.
202. Levitt, T. S., Hedgcock, M. W. Jr., Dye, J. W., Johnston, S. E., Shadle, V. M. and Vosky, D. (1993), Bayesian inference for model-based segmentation of computed radiographs of the hand, Artificial Intelligence in Medicine 5, 365–387.
203. Lidl, R. and Niederreiter, H. (1986), Introduction to Finite Fields and Their Applications, Cambridge University Press.
204. Lin, S. and Costello, D. J. (1983), Error Control Coding, Prentice-Hall.
205. Linde, Y., Buzo, A. and Gray, R. M. (1980), An algorithm for vector quantizer design, IEEE Trans. on Communications, Com-28, 84–95.
206. Lindeberg, T. and Li, M.-X. (1997), Segmentation and classification of edges using minimum description length approximation and complementary junction clues, Computer Vision & Image Understanding 67, 88–98.
207. Linsker, R. (1988), Self-organization in a perceptual network, Computer 21, 105–117.
208. Linsker, R. (1992), Local synaptic learning rules suffice to maximize mutual information in a linear network, Neural Computation 4, 691–702.
209. Linsker, R. (1993), Deriving receptive fields using an optimum encoding criterion. In Advances in Neural Information Processing Systems 5 (Cowan, J. D., Hanson, S. J. and Giles, C. L., eds.), 953–960, Morgan Kaufmann.
210. Linsker, R. (1997), A local learning rule that enables information maximisation for arbitrary input distributions, Neural Computation 9, 1661–1665.
211. Lipschutz, S. (1981), Probability, Schaum’s Outline Series, McGraw-Hill.
212. Lloyd, E. (1984a), Handbook of Applicable Mathematics II: Probability, Wiley.
213. Lloyd, E. (1984b), Handbook of Applicable Mathematics VI: Statistics, Part A, Wiley.
214. Lloyd, E. (1984c), Handbook of Applicable Mathematics VI: Statistics, Part B, Wiley.
215. Lloyd, S. P. (1957), Least Squares Quantization in PCMs, Bell Telephone Laboratories Paper, Murray Hill, NJ.
216. Lockwood, E. H. and Macmillan, R. H. (1978), Geometric Symmetry, Cambridge University Press.
217. Loop, C. T. (1987) Smooth Subdivision Surfaces Based on Triangles. Master’s thesis, Department of Mathematics, University of Utah.
218. Lounsbery, J. M. (1994), Multiresolution Analysis for Surfaces of Arbitrary Topological Type. Ph.D. thesis, University of Washington.
219. Lounsbery, J. M., DeRose, T. D. and Warren, J. (1997) Multiresolution analysis for surfaces of arbitrary topological type, ACM Trans. on Graphics 16(1), 34–73.
220. Lovasz, L. (1979), On the Shannon capacity of a graph, IEEE Trans. on Information Theory, IT-25, 1–7.
221. Lu, J., Healy, D. M. and Weaver, J. B. (1994), Contrast enhancement of medical images using multiscale edge representation, Optical Engineering 33, 2151–2161.
222. Lu, L. and Pearlman, W. A. (2005), Conditional entropy-constrained tree-structured vector quantization with applications to sources with memory, IEEE Trans. on Information Theory, to appear.
223. Lu, N. (1997), Fractal Imaging, Academic Press.
224. MacGillavry, C. H. (1976), Symmetry Aspects of M. C. Escher’s Periodic Drawings, 2nd edn., International Union of Crystallography, Bohn, Scheltema & Holkema.
225. MacKay, D. J. C. and Neal, R. M. (1997), Near Shannon performance of low density parity check codes. Electronics Letters 33, 457–458.
226. MacQueen, J. (1967), Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Vol. 1, 281–297. University of California Press.
227. Mallat, S. G. (1999), A Wavelet Tour of Signal Processing, Academic Press.
228. Mallat, S. G. and Zhong, S. (1992), Wavelet transform maxima and multiscale edges. In Wavelets and their Applications, (Ruskai, M. B., Beylkin, G. M., Coifman, R., Daubechies, I., Mallat, S., Meyer, Y. and Raphael, L., eds.), 67–109. Jones & Bartlett.
229. Manber, U. (1989), Introduction to Algorithms, Addison-Wesley.
230. Mandelbrot, B. (1983), The Fractal Geometry of Nature. Freeman.
231. Mann, W. B. and Binford, T. O. (1992), An example of 3D interpretation of images using Bayesian networks, Proc. DARPA Image Understanding Workshop, 193–801.
232. Marr, D. (1982), Vision, Freeman.
233. Marr, D. and Hildreth, E.(1980), Theory of edge-detection, Proc. R. Soc. London, B 207, 187–217.
234. Martinelli, M. J. (1999), Morphometric Analyses of Bone and Cartilage of the Equine Metacarpophalangeal Joint, Ph.D. Thesis, Faculty of Veterinary Medicine, University of Glasgow.
235. Marven, C. and Ewers, G. (1996), A Simple Approach to Digital Signal Processing, Wiley.
236. Matej, S. and Lewitt, R. M. (2001), 3D-FRP: direct Fourier reconstruction with Fourier reprojection for fully 3-D PET, IEEE Trans. on Nuclear Science 48, 1378–1385.
237. Matej, S., Fessler, J. A. and Kazantsev, I. G. (2004), Iterative tomographic image reconstruction using Fourier-based forward and back-projectors, IEEE Trans. on Medical Imaging 23, 401–412.
238. Maxwell, E. A. (1962), An Analytical Calculus, Vol. IV, Cambridge University Press.
239. Maybank, S. J. and Fraile, R. (2000), Minimum description length method for facet matching, International J. Pattern Recognition & Artificial Intelligence, 14, 919–927.
240. Mayraz, G. and Hinton, G. E. (2002), Recognizing hand written digits by using hierarchical products of experts. IEEE Trans. on Pattern Analysis and Machine Intelligence 24, 189–197.
241. McColl, J. H. (1997), Probability, Edward Arnold.
242. McCulloch, W. S. and Pitts, W. (1943), A logical calculus of the ideas immanent in nervous activity, Bull. of Math. Biophysics 5, 115–133.
243. McEliece, R. J. (1983) The Theory of Information and Coding (Encyclopedia of Mathematics Vol. 3), Addison-Wesley.
244. McEleice, R. J. and Yaldireiu, M. (2003), Belief propogation on partially ordered sets. In Mathematical Systems Theory in Biology, Communications, Computing and Finance, (Gillian, D. S. and Rosenthal, J., eds.), IMA vol. 134, Springer.
245. McGregor, D. R., Fryer, R. J., Cockshott, P. and Murray, P. (1996), Fast fractal compression, Dr Dobb’s J. 21, no. 243, January 1996.
246. McGregor, J. and Watt, A. (1984) The Art of Microcomputer Graphics. Addison-Wesley.
247. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H. and Teller, E. (1953), Equations of state calculations by fast computing machines, J. Chem. Phys. 21, 1087–1092.
248. Meyer, P. L. (1970), Introductory Probability and Statistical Applications, Addison-Wesley. Minsky, M. L. and Papert, S. A. (1969, expanded edn. 1988), Perceptrons, MIT Press.
249. Mohsenian, X., Shahri, H. and Nasrabadi, N. M. (1996), Scalar–vector quantization of medical images, IEEE Trans. on Image Processing 5, 387–392.
250. Montesinos, J. M. (1987) Classical Tessellations and Three-Manifolds. Springer-Verlag.
251. Moore, D. J. (2003) Calculus: a First Course. Moodiesburn Publishers.
252. Mumford, D., Zhu, S.-C. and Wu, Y. (1997), Minmax entropy principle and its application to texture modeling, Neural Computation 9, 1627–1650.
253. Murphy, I. S. (1993), Advanced Calculus, Arklay Publishers.
254. Murray, J. D. and van Ruyper, W. (1996), Graphics File Formats, O’Reilly Associates.
255. Nikkilä, J., Toronen, P., Kaski, S., Venna, J., Castren, E. and Wong, G. (2002), Analysis and visualization of gene expression data using self-organizing maps, Neural Networks 15, 953–966.
256. Niquist, H. (1924), Certain factors affecting telegraph speed, Bell Systems Technical Journal 3, p. 324.
257. Niven, I. and Zuckerman, H. S. (1980), An Introduction to the Theory of Numbers. (4th edn.) Wiley.
258. Obrador, P., Caso, G. and Jay Kuo, C.-C. (1995) A fractal-based method for textured image compression, SPIE 2418, 36–47.
259. Oja, E. (1982), A simplified neuron model as a principal component analyser, Int. J. of Neural Systems 1, 61–68.
260. Oja, E. (1992), Self-organising maps and computer vision, in Neural Networks for Perception (H. Wechslar, ed.), Vol. 1, 368–385. Academic Press.
261. O’Sullivan, J. D. (1985), A fast sinc function gridding algorithm for Fourier inversion in computer tomography, IEEE Trans. on Medical Imaging MI-4, 200–207.
262. Papadopoulos, A., Fotiadis, D. I. and Likas, A. (2002), An automatic microcalcification detection system based on a hybrid neural network classifier, Artificial Intelligence in Medicine 25, 149–167.
263. Park, S. and Aggraval, J. K. (2003), Recognition of two-person interactions using a hierarchical Bayesian network. ACM SIGMM International Workshop on Video Surveillance, 65–76. ACM Press.
264. Patterson, J. W., Hoggar, S. G. and Logie, J. L. (1991) Inverse displacement mapping. Computer Graphics Forum 10 (1991), 129–139.
265. Pearl, J. (1997), Probabilistic Reasoning in Intelligent Systems, Morgan Kaufman.
266. Pearson, K. (1900), On a criterion that a system of deviations from the probable in the case of a correlated system of variables is such that it can be reasonably supposed to have arisen in random sampling, Phil. Mag. 50, 157.
267. Pearson, K. (1901), On lines and planes of closest fit to systems of points in space, Phil. Mag. (6) 2, 559–572.
268. Peitgen, H.-O., Henriques, J. M. and Penedo, L. F. (eds.) (1991), Fractals in the Fundamental and Applied Sciences (Proc. 1st IFIP Conference), North-Holland.
269. Peitgen, H.-O., Jürgens, H. and Saupe, D. (1992), Chaos and Fractals, Springer-Verlag.
270. Penrose, J. (1999), The Emperor’s New Mind, Oxford Paperbacks, Oxford University Press.
271. Pentland, A. (1989), Part segmentation for object recognition, Neural Computation 1, 82–91.
272. Perlmutter, K. O., Perlmutter, S. M., Gray, R. M., Olshen, R. A. and Oehler K. L. (1996), Bayes risk weighted vector quantization with posterior estimation for image compression and classification, IEEE Trans. on Image Processing 5, 347–360.
273. Petronero, L. and Posati, E. (eds.) (1986), Fractals in Physics, Elsevier.
274. Petrou, M. and Bosdogianni, P. (2000), Image Processing–the Fundamentals, Wiley.
275. Phillips, F. C. (1971), Introduction to Crystallography, Oliver & Boyd.
276. Porncharoensin, H. (2002), LVQ and Kohonen nets as human, for comparing ASM generated faces, M.Sc. Thesis, Department of Mathematics, University of Glasgow.
277. Pretzel, O. (1992), Error-Correcting Codes and Finite Fields, Oxford University Press.
278. Propp, J. G. and Wilson, B. M. (1996), Exact sampling with coupled Markov chains and applications to statistical mechanics, Random Structures & Algorithms 9, 223–252.
279. Rao, R. P. and Pearlman, W. A. (1991), On entropy of pyramid structures, IEEE Trans. on Information Theory 37, 407–413.
280. Rao, T. R. N. and Fujiwara, E. (1989), Error-Control Coding for Computer Systems. Prentice-Hall.
281. Reed, I. S. and Solomon, G. (1960), Polynomial codes over certain finite fields, J. Soc. Indus. Appl. Maths. 8, 300–304.
282. Richardson, L. F. (1961) The problem of contiguity: an appendix of statistics of deadly quarrels. General Systems Yearbook 6, 139–187. Reprinted in: Collected Papers of Lewis Fry Richardson (I. Sutherland, ed.) (1993), Vol. 2, Cambridge University Press.
283. Ripley, B. D. (1987), Stochastic Simulation, Wiley.
284. Ripley, B. D. (1996), Pattern Recognition and Neural Networks, Cambridge University Press.
285. Rissanen, J. (1978), Modelling by shortest data description, Automatica 14, 465–471.
286. Rissanen, J. (1983), A universal prior for integers and estimation by minimum description length, Ann. Stat. 11, 416–431.
287. Rissanen, J. (2000), MDL denoising, IEEE Trans. on Information Theory 46, 2537–2543.
288. Roberts, G. O. (1996), Markov chain concepts related to sampling algorithms, in Markov Chain Monte Carlo in Practice (Gilks, W. R., Richardson, S. and Spiegelhalter, D. J., eds.), Chapman & Hall.
289. Rojas, R. (1996), Neural Networks, Springer.
290. Rosandich, R. G. (1997), Intelligent Visual Inspection, Chapman & Hall.
291. Rosenblatt, F. (1958), The perceptron, a probabilistic model for information storage and organization, Psychological Review 65, 386–408.
292. Rosenblatt, F. (1962), Principles of Neurodynamics, Spartan Press.
293. Rossi, M., Vicenzi, R. and Zorzi, M. (2004), Accurate analysis of TCP on channels with memory and finite round-trip delay, IEEE Trans. on Wireless Communications 3, 627–640.
294. Rubinstein, R. Y. (1981), Simulation and the Monte Carlo Method, Wiley.
295. Rumelhart, D. E., Hinton, G. E. and Williams, R. J. (1986), Learning representations by back-propagating errors. Nature 323, 533–536.
296. Rusmeviechientong, P. and Van Roy, B. (2001), An analysis of belief propagation on the turbo decoding graph with gaussian densities, IEEE Trans. on Information Theory, 47, 745–765.
297. Russ, J. (1995), The Image Processing Handbook, CRC Press.
298. Sanger, T. D. (1989), Optimal unsupervised learning in a single-layer feedforward neural network, Neural Networks 2, 459–473.
299. Sayood, K., Gibson, J. D. and Rost, M. C. (1984), An algorithm for uniform vector quantizer design, IEEE Trans. on Information Theory, IT-30, 805–815.
300. Schalkoff, R. (1992) Pattern Recognition, John Wiley.
301. Schattschneider, D. and Walker, W. (1982) M. C. Escher Kaleidocycles. Tarquin Publications.
302. Schroeder, M. R. (1991) Fractals, Chaos, Power Laws, Freeman.
303. Schwarzenberger, R. L. E. (1980) N-Dimensional Crystallography, Research Notes in Mathematics, Pitman.
304. Serpico, S. B. and Roli, F. (1995), Classification of multi-sensor remote-sensing images by structured neural networks, IEEE Trans. on Geoscience and Remote Sensing 33, 562–578.
305. Sedarat, H. and Nishimura, D. G. (2000), On the optimality of the gridding construction algorithm, IEEE Trans. on Medical Imaging 19, 306–317.
306. Seul, M., O’Gorman, L. and Sammon, M. J. (2000), Practical Algorithms for Image Analysis, Cambridge University Press.
307. Shannon, C. E. (1948) A mathematical theory of communication, Bell Systems Tech. J. 27, 379–423 and 623–656.
308. Shannon, C. E. (1949), Communication in the presence of noise, Proc. IRE 37, 10–21.
309. Shannon, C. E. (1956), The zero-error capacity of a noisy channel, IRE Trans. on Information Theory, IT-2, 8–19.
310. Sharkey, A. J. C. (ed.) (1999), Combining Artificial Neural Networks, Springer.
311. Slepian, D. (1974) Key Papers in the Development of Information Theory, IEEE Press.
312. Sloane, N. J. A. and MacWilliams, F. J. (1977), The Theory of Error-Correcting Codes, North-Holland.
313. Sloane, N. J. A. and Wyner, A. D., eds. (1993), Collected Papers of Claude Elwood Shannon, IEEE Press.
314. Smith, P., Drummond, T. and Cipolla, R. (2000), Segmentation of multiple motions by edge tracking between two frames, Proc. Brit. Machine Vision. Conf. 2000, 342–351.
315. Sneddon, I. N. (1961), Special Functions of Mathematical Physics and Chemistry, Longman.
316. Solomonov, R. J. (1964), A formal theory of inductive inference, Inform. & Control 7, 1–22, 224–254.
317. Souafi-Bensafi, S., Parizeau, M., LeBourgeois, F. and Emptoz, H. (2002), Bayesian networks classifiers applied to documents, Proc. 16th International Conference on Pattern Recognition, 483–486.
318. Sourlas, N. (1989), Citebase–the statistical mechanics of turbocodes, Nature 339, 693–694.
319. Spiegel, M. R. and Wrede, R. C. (2002), Calculus, Schaum’s Outline Series, McGraw-Hill.
320. Spiegel, M. R., Schiller, J. J. and Srinivasan, R. A. (2000), Probability and Statistics, Schaum’s Outline Series, McGraw-Hill.
321. Spiegelhalter, D. J., Best, N. G., Gilks, W. R. and Inskip, H. (1996), Hepatitis B: a case study in MCMC methods, in Gilks, W. R., Richardson, S. and Spiegelhalter, D. J., Markov Chain Monte Carlo in Practice, Chapman & Hall.
322. Starck, J.-L., Murtagh, F. and Bijaoui, A. (2000) Image Processing and Data Analysis: the Multiscale Approach. Cambridge University Press.
323. Stephens, R. S. (1991), Probabilistic approach to the Hough transform, Image Vision Comput. 9, 66–71.
324. Stollnitz, E. J., DeRose, A. D. and Salesin, D. H. (1996), Wavelets for Computer Graphics, Morgan Kaufmann.
325. Strang, G. and Nguyen, T. (1997), Wavelets and Filter Banks, Wellesley-Cambridge Press.
326. Sugiyama, Y., Kasahara, M., Hirasawa, S. and Namekawa, T. (1975), A method for solving key equation for decoding Goppa codes, Inform. & Control 27, 87–99.
327. Sweldens, W. (1996), The lifting scheme: a custom-design construction of biorthogonal wavelets, Applied and Computational Harmonic Analysis 3, 186–200.
328. Swokowski, E. W. (2000), Calculus, Brooks Cole.
329. Takeshita, O. Y. and Costello, D. J. (2000), New deterministic interleaver designs for turbo codes, IEEE Trans. Info. Theory, 46, 1988–2006.
330. Tang, D. S. (1991), Information theory and early information processing. In Self-organization, Emerging Properties, and Learning (A. Babloyantz ed.), 113–125. NATO ASI series B: Physics Vol. 260. Plenum Press.
331. Tezmol, A., Sari-Sarraf, H., Mitra, S., Long, R. and Gururajan, A. (2002), Customized Hough transform for robust segmentation of cervical vertebrae from X-ray images, Proc. 5th IEEE Southwest Symposium on Image Analysis and Interpretation, IEEE Computer Society.
332. Thodberg, H. H. and Olafsdottir, H. (2003), Adding curvature to minimum description length models. Proc. British Machine Vision Conference 2003. BMVA.
333. Tierney, L. (1994), Markov chains for exploring posterior distributions, Ann. Statist. 22, 1701–1762.
334. Tierney, L. (1996), Introduction to general state-space Markov chain theory, in Gilks, W. R., Richardson, S. and Spiegelhalter, D. J. (1997), Markov Chain Monte Carlo in Practice, Chapman & Hall.
335. Turcotte, D. L. (1992), Fractals and Chaos in Geology and Geophysics, Cambridge University Press.
336. Turing, A. M. (1936), On computable numbers with an application to the Entscheidungsproblem, Proc. London Math. Soc. (2) 42, 230–265.
337. Turk, G. and Levoy, M. (1994), Zippered polygon meshes from range images. Proceedings of SIGGRAPH ’94, 311–318. ACM Press.
338. Ulichney, R. (1987) Digital Halftoning. MIT Press.
339. Van Hulle, M. M. (2002), Kernel-based topographic map formation achieved with an information-theoretic approach, Neural Networks 15, 1029–1039.
340. Van Loan, C. (1992), Computational Framework for the Fast Fourier Transform, SIAM.
341. Verdú, S. and McLaughlin, S. W. (eds.) (2000), Information Theory: 50 Years of Discovery, IEEE Press.
342. Vines, G. and Hayes, M. H. (1994) IFS image coding using an orthonormal basis. ISCAS 1994, 621–624.
343. Vitanyi, P. M. B. and Li, M. (2000), Minimum description length, induction, Bayesianism, and Kolmogorov complexity, IEEE Trans. Information Theory, 46, 446–464.
344. Voss, R. F. (1988) Fractals in nature: from characterisation to simulation. In The Science of Fractal Images. (Peitgen, H.-O. and Saupe, D., eds.), Springer-Verlag.
345. Vranic, D. V. and Saupe, D. (2001a), 3D shape descriptor based on 3D Fourier-transform, in Proc. EURASIP Conference on Digital Signal Processing for Multimedia Communications and Services (ECMCS 2001) (K. Fazekas, ed.), Budapest, Hungary, 2001, 271–274.
346. Vranic, D. V. (2001b) A feature vector approach for retrival of 3D objects in the context of MPEG-7, in Proceedings of the International Conference on Augmented Virtual Environments and Three-dimensional Imaging (ICAV3D 2001) (V. Giagourta and M. G. Strinzis, eds.), Mykonos, Greece, 2001 pp. 37–40.
347. Walder, C. J. and Lovell, B. C. (2003), Face and object recognition using colour vector quantisation, In Proc. of Workshop on Signal Processing and its Applications, (V. Chandra, ed.), Brisbane, Australia, 2002.
348. Walker, J. S. (1988), Fourier Analysis, Oxford University Press.
349. Wallace, C. S. and Boulton, D. M. (1968), An information measure for classification, Computer J. 11, 185–195.
350. Wallace, G. (1991), The JPEG still picture compression standard, Comm. ACM 34, No 4, 31–44.
351. Watson, B, ed. (1993), Digital Images and Human Vision, MIT Press.
352. Watt, A. and Policarpo, F. (1998), The Computer Image, Addison-Wesley.
353. Wegmann, B. and Zetzsche, C. (1996), Feature-specific vector quantization of images, IEEE Trans. on Image Processing 5, 274–288.
354. Welch, T. A. (1984), A technique for high performance data compression, IEEE Computer 17, 8–20.
355. Welsh, D. J. A. (1988), Codes and Cryptography, Oxford University Press.
356. West, B. J. and Goldberger, A. L. (1987), Physiology in Fractal Dimensions, Amer. Sci. 75, 354–365.
357. Wilson, H. R. and Bergen, J. R. (1979), A four mechanism model for spatial vision. Vision Research 19, 19–32.
358. Winkler, G. (1991), Image Analysis, Random Fields and Dynamic Monte Carlo Methods, Springer-Verlag.
359. Witten, I. H., Moffatt, A. and Bell, T. C. (1994), Managing Megabytes, Van Nostrand Reinhold.
360. Wyner, A. and Ziv, J. (1971) Bounds on the rate distortion function for stationary sources with memory, IEEE Trans. on Information Theory, IT-17, 508–513.
361. Xu, L. and Oja, E. (1993), Randomized Hough Transform (RHT): basic mechanisms, algorithms, and computational complexities, Computer Vision and Image Understanding 57, 131–154.
362. Yamada, Y., Tazaki, S. and Gray, R. M. (1980), Asymptotic performance of block quantizers with a difference distortion measure, IEEE Trans. on Information Theory IT-26, 6–14.
363. Yarbro, J. W. (2001), Introductory remarks to the conference on prognostic factors and staging in cancer management, Cancer 91, 1593–1594.
364. Zemel, R. S. and Hinton, G. E. (1995), Learning population codes by minimising description length, Neural Computation 7, 549–564.
365. Ziv, J. and Lempel, A. (1977) A universal algorithm for sequential data compression, IEEE Trans. on Information Theory, IT-23, 337–343.
366. Ziv, J. (1978) Compression of individual sequences via variable rate coding, IEEE Trans. on Information Theory, IT-24, 530–536.