- Michael Kass, Andrew Witkin, and Demetri Terzopoulos. Snakes: Active
- Michel Goemans and David Williamson, Improved approximation algorithms for
- L. B. Lucy, An iterative technique for the rectification of observed
- Andrew Witkin, Scale-space filtering, 1984. Introduces (with J.
- Hiroaki Sakoe and Seibi Chiba, Dynamic programming algorithm optimization
- L Page, S Brin, The PageRank citation ranking: Bringing order to the web,
- R. Hartley, A More Symmetrical Fourier Analysis Applied to Transmission
- J-B. Lasserre, Global optimization with polynomials and the problem of
- K. J. Arrow, L. Hurwicz and H. Uzawa, Studies in linear and non-linear
- D Pieper, The kinematics of manipulators under computer control, 1968.
- E. Schrödinger. Sur la théorie relativiste de l’électron et
- Max Wertheimer, Untersuchungen zur lehre der gestalt, 1923. Lays the
- Lars Onsager, Crystal statistics. I. A two-dimensional model with an
- Ken Perlin, An Image Synthesizer, 1985. Perlin noise is an (approximately)
- S. Kaczmarz, Angenäherte Auflösung von Systemen linearer Gleichungen,
- Hopf, The partial differential equation ut + uux = µ uxx, 1950. Cole, On a
- Stéphane Mallat, A theory for multiresolution signal decomposition: the
- R Cook, Stochastic sampling in computer graphics, 1986. Introduces the
- H. Blum, A transformation for extracting new descriptors of shape, 1967.
- Tibor Radó, Uber den Begriff der Riemannschen Flache, 1925. Shows that all
- R. Tyrrell Rockafellar, Monotone Operators and the Proximal Point
- Jon Claerbout and Francis Muir, Robust Modeling with Erratic Data, 1973.
- Peter Burt and Ted Adelson, The Laplacian Pyramid as a Compact Image Code,
- AL Hodgkin, AF Huxley, A quantitative description of membrane current and
- M Kass, A Witkin. Analyzing oriented patterns, 1987. Defines the structure
- S. Amari, Differential geometrical methods in statistics, 1985. Defines
- George Chaikin, An algorithm for high speed curve generation, 1974. The
- Johann Radon, About the determination of functions from their integral
- Henry Wilbraham, On a certain periodic function, 1848. Discovered the
- Albert Einstein, Über die von der molekularkinetischen Theorie der Wärme
- L. M. Bregman, The relaxation method of finding the common points of
- H. Helmholtz, Über Integrale der hydrodynamischen Gleichungen, welcher der
- L. Vietoris, Über den höheren Zusammenhang kompakter Räume und eine Klasse
- J. Barnes, P. Hut, A hierarchical O(N log N) force-calculation algorithm,
- B. D. Lucas and T. Kanade, An iterative image registration technique with
- Klaus Wagner, Über eine Eigenschaft der ebenen Komplexe, 1937. State the
- Bui Tuong Phong, Illumination for computer generated pictures, 1975. Phong
- J.L. Walsh, A closed set of normal orthogonal functions, 1923. Defines the
- John Tsitsiklis, Efficient algorithms for globally optimal trajectories,
- R. J. McCann, A convexity principle for interacting gases, 1998.
- Hilbert, Über die stetige Abbildung einer Linie auf ein Flächenstück,
- R. Gordon, R Bender, GT Herman, Algebraic reconstruction techniques (ART)
- G. Reeb, Sur les points singuliers d’une forme de Pfaff complètement
- K. Levenberg, A Method for the Solution of Certain Non-Linear Problems in
- W. Fenchel, On conjugate convex functions, 1949. The Legendre-Fenchel
- William Thomson and Peter Guthrie Tait, Treatise on Natural Philosophy,
- Pietro Perona and Jitendra Malik, Scale-space and edge detection using
- E. Weiszfeld, Sur le point pour lequel la somme des distances de n points
- V. Jarník, M. Kössler, On minimal graphs containing n given points, 1934.
- J. P. Boyle and R. L. Dykstra, A method for finding projections onto the
- A. Brandt, Multi-Level Adaptive Solutions to Boundary-Value Problems,
- Matthias Eck, Tony DeRose, Tom Duchamp, Hugues Hoppe, Michael Lounsbery,
- J. B. Kruskal, On the shortest spanning subtree of a graph and the
- Jan Koenderink, The structure of images, 1984. Introduces (with A. Witkin)
- R.L. Harder and R.N. Desmarais, Interpolation using surface splines, 1972.
- Teofilio Gonzalez, Clustering to minimize the maximum intercluster
- James Blinn, A Generalization of Algebraic Surface Drawing, 1982. «
- David Immel, Michael Cohen, Donald Greenberg, A radiosity method for non-
- J. Bertrand, Théorème relatif au mouvement d’un point attiré vers un
- A. J. Lotka, Contribution to the Theory of Periodic Reaction, 1910.
- Yurri Nesterov, A method for solving a convex programming problem with
- William Lorensen, Harvey Cline, Marching Cubes: A high resolution 3D
- D. Marr and E. Hildreth, Theory of edge detection, 1980. Laid out the
- Norbert Wiener, Extrapolation, Interpolation, and Smoothing of Stationary
- David Gale and Lloyd Shapley, College Admissions and the Stability of
- R. Leibler and S. Kullback, On information and sufficiency, 1951. KL
- Jean-Jacques Moreau, Proximité et dualité dans un espace hilbertien, 1965.
- Sarah Frisken Gibson, Using distance maps for accurate surface
- L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification
- C Huygens, Horologium Oscillatorium sive de motu pendulorum ad horologia
- J. Duchon, Splines minimizing rotation invariant semi-norms in Sobolev
- Robin Sibson, A vector identity for the Dirichlet tesselation, 1980.
- Boris Teodorovich Poljak, Some methods of speeding up the convergence of
- Jont B. Allen, Short Time Spectral Analysis, Synthesis, and Modification
- JA. Criminisi ; P. Perez ; K. Toyama, Region filling and object removal by
- K. Wagner, Bemerkungen zum Vierfarbenproblem, 1936. Any pair of planar
- Tony F. Chan, Luminita A. Vese, Active Contours Without Edges, 2001. The
- B.K.P. Horn and B.G. Schunck, Determining optical flow, 1981. Computes
- W. Givens, Computation of Plane Unitary Rotations Transforming a General
- L. Greengard and V. Rokhlin, A Fast Algorithm for Particle Simulations,
- Maurice G. Cox, The Numerical Evaluation of B-Splines, 1972. Introduced
- D.G Krige, A statistical approach to some mine valuations and allied
- S. Osher and J. A. Sethian, Fronts propagating with curvature-dependent
- Poljak heavy ball and Nesterov methods speed up gradient descent by
- Y. LeCun, B. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. Hubbard,
- Chris Harris, Mike Stephens, A combined corner and edge detector, 1988.
- Emmy Noether, Ableitung der Elementarteilertheorie aus der Gruppentheorie,
- Stephen Warshall, A theorem on Boolean matrices, 1962. Robert Floyd,
- Scott Shaobing Chen, David L. Donoho, and Michael A. Saunders, Atomic
- J. Canny, A computational approach to edge detection, 1986. The most well
- Marguerite Frank and Philip Wolfe, An algorithm for quadratic programming,
- Jianbo Shi and Jitendra Malik, Normalized Cuts and Image Segmentation,
- E. Catmull, J. Clark, Recursively generated B-spline surfaces on arbitrary
- B Cabral, L Leedom, Imaging Vector Fields Using Line Integral Convolution,
- Calyampudi Radhakrishna Rao, Information and the accuracy attainable in
- R. Keys, Cubic convolution interpolation for digital image processing,
- R Sinkhorn, A relationship between arbitrary positive matrices and doubly
- R Hardy, Multiquadric equations of topography and other irregular
- E. Hellinger, Neue Begründung der Theorie quadratischer Formen von
- Michael S. Floater, Mean value coordinates, 2003. The first construction
- Evelyn Fix, Joseph Hodges, Discriminatory analysis, nonparametric
- Mark Kac, Can you heat the shape of a drum?, 1966. Non isometric shapes
- Patrick Perez, Michel Gangnet, Andrew Blake, Poisson Image Editing, 2003.
- Gaetano Kanizsa, Subjective Contours, 1976. Revitalized the study of
- H Edelsbrunner, D Kirkpatrick, R Seidel, On the shape of a set of points
- R. Hamming, Error detecting and error correcting codes, 1950. Introduces
- R. Penrose, The role of aesthetics in pure and applied mathematical
- Corinna Cortes, Vladimir Vapnik, Support-vector networks, 1995. Defines a
- Teuvo Kohonen, Self-Organized Formation of Topologically Correct Feature
- J. B. Tenenbaum, V. de Silva, J. C. Langford, A Global Geometric Framework
- David G. Kirkpatrick and Raimund Seidel, The ultimate planar convex hull
- Nash, John, Equilibrium points in n-person games, 1950. Nash equilibrium
- Hugues Hoppe, Progressive meshes, 1996. One of the most popular mesh
- Nira Dyn, David Levin, John A. Gregory, A 4-point interpolatory
- David Broomhead, David Lowe, Multivariable Functional Interpolation and
- John Hammersley, Percolation processes, 1957. Percolation on a square
- P. L. Lions and B. Mercier, Splitting Algorithms for the Sum of Two
- W. Kermack, A. McKendrick, Contributions to the mathematical theory of
- B. Boser, I. Guyon, V. Vapnik, A Training Algorithm for Optimal Margin
- David G. Lowe, Distinctive Image Features from Scale-Invariant Keypoints,
- Courant, R.; Friedrichs, K.; Lewy, H., Über die partiellen
- Nina Amenta, Marshall Bern, Manolis Kamvysselis, A New Voronoi-Based
- Yurii Nesterov, Arkadii Nemirovskii, Interior-Point Polynomial Algorithms
- Loup Verlet, Computer Experiments on Classical Fluids. I. Thermodynamical
- Richard von Mises and Hilda Geiringer, Praktische Verfahren der
- Zachi Karni, Craig Gotsman, Spectral Compression of Mesh Geometry, 2000.
- Stuart Lloyd, Least squares quantization in PCM, 1982. Continuous
- Gaston Julia, Mémoire sur l’iteration des fonctions rationnelles, 1918.
- James Sethian, A Fast Marching Level Set Method for Monotonically
- Lance Williams, Pyramidal parametrics, 1983. Introduces the idea of mip-
- P. Viola, M. Jones, Rapid Object Detection using a Boosted Cascade of
- Volker Strassen, Gaussian Elimination is not Optimal, 1969. Strassen
- Ron Kimmel, James Sethian, Computing geodesic paths on manifolds, 1998.
- S. Wolfram, Statistical mechanics of cellular automata, 1983. Studies
- Fritz John, Extremum problems with inequalities as subsidiary conditions,
- R.E. Kalman, A New Approach to Linear Filtering and Prediction Problems,
- Herbert Federer, Curvature measures, 1959. The co-area formula expresses
- P. Chew, Guaranteed-quality mesh generation for curved surfaces, 1993.
- Narendra Karmarkar, A New Polynomial Time Algorithm for Linear
- Samuel Burer, Renato Monteiro, A Nonlinear Programming Algorithm for
- Benoit Mandelbrot, Fractal aspects of the iteration of z→λz(1-z) for
- Kostadin Dabov, Alessandro Foi, Vladimir Katkovnik, Karen Egiazarian,
- David Cox, The regression analysis of binary sequences, 1958. Introduces
- G. H. Golub, Christian Reinsch, Singular value decomposition and least
- S Varadhan, On the behavior of the fundamental solution of the heat
- Naum Z. Shor, Utilization of the operation of space dilatation in the
- MacAdam, Visual sensitivities to color differences in daylight, 1942.
- James Kajiya, The rendering equation, 1986. Describe conservation of light
- Derose, T.; Kass, M.; Truong, T., Subdivision surfaces in character
- Isaac Newton, De analysi per aequationes numero terminorum infinitas,
- S. Bernstein, Démonstration du théorème de Weierstrass fondée sur le
- Martin Gardner, Mathematical Games - The fantastic combinations of John
- Prim, R. C, Shortest connection networks And some generalizations, 1957.
- Aleksandr Lyapunov, The general problem of the stability of motion, 1892.
- Robert May, Simple mathematical models with very complicated dynamics,
- Henri Gouraud, Continuous shading of curved surfaces, 1971. Gouraud
- Jean-Jacques Moreau, Proximité et dualité dans un espace hilbertien, 1965.
- David Mumford, Jayant Shah, Optimal Approximations by Piecewise Smooth
- Gilbert Strang, The Discrete Cosine Transform, 1999. Reviews the various
- Charles Loop, Smooth Subdivision Surfaces Based on Triangles, 1987. One of
- Carl de Boor, On calculating with B-splines, 1971. Introduced (with Cox)
- H Robbins, S Monro, A Stochastic Approximation Method, 1951. Early
- Tibshirani, Robert, Regression Shrinkage and Selection via the lasso,
- M Crandall, P-L Lions, Viscosity solutions of Hamilton-Jacobi equations,
- William Thomas Tutte, How to draw a graph, 1963. Shows how to embed a
- P. Besl and N.D. McKay, A Method for Registration of 3-D Shapes, 1992.
- F Cucker, S Smale, The Mathematics of Emergence, 2007. Defines the
- Jos Stam, Stable fluids, 1999. Arguably the most influential paper in PDEs
- Sweldens, The lifting scheme: A construction of second generation
- Cooley, James W.; Tukey, John W., An algorithm for the machine calculation
- Jordan, Kinderlehrer, Otto, The Variational Formulation of the Fokker-
- Alfréd Haar, Zur Theorie der orthogonalen Funktionensysteme, 1910. The
- Frank Rosenblatt, The Perceptron-a perceiving and recognizing automaton,
- I.F. Gorodnitsky, B.D. Rao, Sparse signal reconstruction from limited data
- P-S. de Laplace , Sur les naissances, les mariages et les morts à Paris,
- Thomas Bayes, An Essay towards solving a Problem in the Doctrine of
- S. Linnainmaa, The representation of the cumulative rounding error of an
- Alan Turing, The Chemical Basis of Morphogenesis, 1952. Showed that
- L Rudin, S Osher, E Fatemi, Nonlinear total variation based noise removal
- Vladimir Marchenko and Leonid Pastur, Distribution of eigenvalues for some
- George Dantzig, Origins of the simplex method, 1987. Dantzig invented the
- G Monge, Mémoire sur la théorie des déblais et des remblais, 1776. Defines
- Joseph Fourier, Théorie analytique de la chaleur, 1822. Introduces sines
- Mikhail Gromov, Groups of Polynomial growth and Expanding Maps, 1981.
- Paul Erdős, Alfréd Rényi, On Random Graphs, 1959. Defines the basic model
- Wilfred K. Hastings, Monte Carlo Sampling Methods Using Markov Chains and
- L. Kantorovich, On translocation of masses, 1942. “Nobel” Prize in
- Eugene Wigner, Characteristic Vectors of Bordered Matrices with Infinite
- Andrew Berry, The Accuracy of the Gaussian Approximation to the Sum of
- Yann Brenier, Polar factorization and monotone rearrangement of
- I. Daubechies, Orthonormal bases of compactly supported wavelets, 1988.
- E. Wigner, On the Quantum Correction for Thermodynamic Equilibrium, 1932.
- M Elad, JL Starck, P Querre, DL Donoho, Simultaneous cartoon and texture
- D Shepard, A two-dimensional interpolation function for irregularly-spaced
- Patrick Combettes and Valérie Wajs, 2003. Showed that Iterative Soft
- D. Hilbert, Ueber die gerade Linie als kürzeste Verbindung zweier Punkte,
- J. Mairal, F. Bach, J. Ponce, G. Sapiro, Online dictionary learning for
- J. V. Neumann, Zur Theorie der Gesellschaftsspiele, 1928. Proved the
- O. Perron, Zur Theorie der Matrices, 1907. Perron-Frobenius theorem
- J. Bernoulli, Supplementum defectus Geometriae Cartesianae circa
- Y. Chen and G. Medioni, Object modelling by registration of multiple range
- A. Efros and T. Leung, Texture Synthesis by Non-parametric Sampling, 1999.
- Javier Portilla, Vasily Strela, Martin Wainwright, Eero Simoncelli, Image
- Stephen Smale, A classification of immersions of the two-sphere, 1958.
- U. Pinkall, K. Polthier, Computing discrete minimal surfaces and their
- B. Boser, I. Guyon, V. Vapnik, A Training Algorithm for Optimal Margin
- C Dwork, F McSherry, K Nissim, A Smith, Calibrating noise to sensitivity
- J. Crank, P. Nicolson, A practical method for numerical evaluation of
- E. Candes, J. Romberg, T. Tao, Robust uncertainty principles: Exact signal
- R.J. Woodham, Photometric method for determining surface orientation from
- Claude Shannon, A Mathematical Theory of Communication, 1948. Defines,
- P. J. Huber, Robust estimation of a location parameter, 1964. Introduced
- W. Zhou, A.C. Bovik, H.R. Sheikh, E.P. Simoncelli, Image quality
- A.P. Dempster, N.M. Laird, D.B. Rubin, Maximum Likelihood from Incomplete
- S. Farsiu, M.D. Robinson, M. Elad, P. Milanfar, Fast and robust multiframe
- David Donoho, Iain Johnstone, Ideal spatial adaptation by wavelet
- L. Lovasz and B. Szegedy. Limits of dense graph sequences, 2006. Graphons
- A. Nadas, Least squares and maximum likelihood estimation of rigid motion.
- Richard Karp, Reducibility Among Combinatorial Problems, 1972. Proved 21
- Georg Frobenius, Über Matrizen aus positiven Elementen, 1908. Perron-
- Csiszár, I. A class of measures of informativity of observation channels,
- Cindy Grimm, John Hughes, Modeling surfaces of arbitrary topology using
- S. Ulam, J. Von Neuman, Statistical methods in neutron diffusion, 1947.
- A. Legendre, Nouvelles méthodes pour la détermination des orbites des
- P. Tseng, On linear convergence of iterative methods for the variational
- D. Arthur, S. Vassilvitskii, k-means++: the advantages of careful seeding,
- J.L. Starck, E. Candès, D. Donoho, The curvelet transform for image
- C Gordon, DL Webb, S Wolpert, One cannot hear the shape of a drum, 1992.
- Tin Kam Ho, Random decision forests, 1995. One of the most used method for
- E. Pitman, Sufficient statistics and intrinsic accuracy, 1936. Introduces
- O. Macchi, The coincidence approach to stochastic point processes, 1975.
- D. Donoho, Compressed sensing, 2004. Introduced (jointly with Candes,
- J. Ville, Théorie et Applications de la Notion de Signal Analytique, 1948.
- @mariotelfig, R. Nowak, An EM algorithm for wavelet-based image
- Garrett Birkhoff, Extensions of Jentzsch’s theorem, Trans. Amer. Math.
- J. Hammersley, The zeros of a random polynomial, 1956. Zeros of random
- H. M. Markowitz, The elimination form of the inverse and its application
- E P Simoncelli, W T Freeman, E H Adelson and D J Heeger. Shiftable Multi-
- R. M. Starr, Quasi-equilibria in markets with non-convex preferences,1969.
- Grace Wahba, Spline models for observational data, 1990. The reference
- M. Wainwright, E. Simoncelli, Scale Mixtures of Gaussians and the
- P. E. Hart, N. J. Nilsson, B. Raphael, A Formal Basis for the Heuristic
- C. Runge, Über die numerische Auflösung von Differentialgleichungen, 1895.
- J. de Leeuw, Applications of convex analysis to multidimensional scaling,
- G. Dziuk, Finite elements for the Beltrami operator on arbitrary surfaces,
- B. Gnedenko, Sur la distribution limite du terme maximum d’une série
- A. Hyvarinen, Fast and robust fixed-point algorithms for independent
- K. Pearson, On Lines and Planes of Closest Fit to Systems of Points in
- John Tukey, Exploratory data analysis, 1977. Introduced robust statistics
- J. B. MacQueen, Some Methods for classification and Analysis of
- D. Gabor, Theory of Communication, 1946. Introduced dictionaries of atoms
- A. Tarski, A décision method for elementary algebra and geometry, 1951.
- Leonid Levin, Universal search problems, 1973. Introduced with Cook the
- R.W. Floyd, L. Steinberg, An adaptive algorithm for spatial grey scale,
- David Taubman, High performance scalable image compression with EBCOT,
- R. C. Prim, Shortest connection networks and some generalizations, 1957. A
- H. Zou, T. Hastie, Regularization and variable selection via the elastic
- A.S. Lewis. Active sets, nonsmoothness, and sensitivity, 2002. Partial
- C. Stein, A bound for the error in the normal approximation to the
- D. Lee et S. Seung, Learning the parts of objects by non-negative matrix
- A. Barron, Universal Approximation Bounds for Superpositions of a
- W. B. Johnson and J. Lindenstrauss, Extensions of Lipschitz maps into a
- Wilhelm Wirtinger, Zur formalen Theorie der Funktionen von mehr komplexen
- Maiorov&Pinkus, Lower bounds for approximation by MLP NN, 1999. Constructs
- Pierre Comon, Independent component analysis, a new concept?, 1994. Gives
- Joukowsky, N.E., Über die Konturen der Tragflächen der Drachenflieger,
- Stephen Cook, The Complexity of Theorem Proving Procedures, 1971.
- Luigi Ambrosio, Nicola Gigli, Giuseppe Savare, Gradient Flows In Metric
- B. Olshausen, D. Field, Emergence of simple-cell receptive field
- J. von Neumann, On rings of operators, 1949. Iterative projections do
- E. W. Dijkstra, A note on two problems in connexion with graphs, 1959.
- H. Vogel, A better way to construct the sunflower head, 1979. Describe
- Geman, S.; Geman, D. Stochastic Relaxation, Gibbs Distributions, and the
- G. Beylkin, R. Coifman, V. Rokhlin, Fast wavelet transforms and numerical
- J. Morlet and A. Grossmann, Decomposition of Hardy functions into square
- Arnold Kaufmann, L’imagination artificielle, 1969. According to
- Daubechies, M. Defrise, C. De Mol, An iterative thresholding algorithm for
- A. Lenstra; H. Lenstra, L. Lovász, Factoring polynomials with rational
- C. Berrou, A. Glavieux, P. Thitimajshima, Near Shannon Limit Error-
- Lev M. Bregman, The relaxation method of finding the common points of
- V.N. Vapnik, A.J. Chervonenkis, On the uniform convergence of relative
- B. Delaunay, Sur la sphère vide, 1934. Introduces the concept of Delaunay
- C. Tomasi and R. Manduchi, Bilateral Filtering for Gray and Color Images,
- J. B. Kruskal, On the shortest spanning subtree of a graph and the
- A. Buades, B. Coll, J-M. Morel, A review of image denoising algorithms,
- Hermann Minkowski, Geometrie der Zahlen, 1896. The Brunn-Minkowski
- Immo Kerner, Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von
- E. W. Dijkstra, A note on two problems in connexion with graphs, 1959.
- R. Hartley, A More Symmetrical Fourier Analysis Applied to Transmission
- R. Fisher and L. Tippett, Limiting forms of the frequency distribution of
- J-B. Lasserre, Global optimization with polynomials and the problem of
- N. Ahmed, T. Natarajan, K. R. Rao, Discrete Cosine Transform, 1974. The
- G. Cybenko, Approximations by superpositions of sigmoidal functions, 1989.
- Marcelo Bertalmio, Guillermo Sapiro, Vincent Caselles et Coloma Ballester,
- Robert Cook, Stochastic sampling in computer graphics, 1986. Introduces
- E.J. Candès and D. L. Donoho. New tight frames of curvelets and optimal
- J Burgers, A mathematical model illustrating the theory of turbulence,
- P Burt and T Adelson, The Laplacian Pyramid as a Compact Image Code, 1983.
- D. Hilbert, Über die stetige Abbildung einer Linie auf ein Flächenstück,
- J. Portilla and E. Simoncelli. A Parametric Texture Model based on Joint
- CA Curcio, KR Sloan Jr, O Packer, AE Hendrickson, RE Kalina, Distribution
- R. Tarjan, Dynamic trees as search trees via Euler tours, applied to the
- D. Huffman, A Method for the Construction of Minimum-Redundancy Codes,
- Stephen Smale, On gradient dynamical systems, 1961. The Morse-Smale
- Bruno Galerne, Yann Gousseau and Jean-Michel Morel, Random Phase Textures:
- M. Aharon, M. Elad, A. Bruckstein, K-SVD: An Algorithm for Designing
- Keinosuke Fukunaga, L. Hostetler, The Estimation of the Gradient of a
- Paul De Casteljau, Courbes à pôles, 1959. De Casteljau’s algorithm defines
- Joachim Weickert, Coherence-enhancing diffusion filtering, 1999.
- M. Turk and A. Pentland, Face recognition using eigenfaces, 1991. Uses
- Michael Kass, Andrew Witkin, and Demetri Terzopoulos. Snakes: Active
- M Goemans and D Williamson, Improved approximation algorithms for maximum
- L. B. Lucy, An iterative technique for the rectification of observed
- Hiroaki Sakoe and Seibi Chiba, Dynamic programming algorithm optimization
- C. Shannon, 1949, Communication in the presence of noise. States the
- K. J. Arrow, L. Hurwicz, H. Uzawa, Studies in linear and non-linear
- Max Wertheimer, Untersuchungen zur lehre der gestalt, 1923. Lays the
- Ken Perlin, An Image Synthesizer, 1985. Perlin noise is an (approximately)
- Hubel, D. H.; Wiesel, T. N., Receptive fields, binocular interaction and
- E. Hopf, The partial differential equation u_t + uu_x = µu_xx, 1950.The
- Stéphane Mallat, A theory for multiresolution signal decomposition: the
- H. Blum, A transformation for extracting new descriptors of shape, 1967.
- R. Tyrrell Rockafellar, Monotone Operators and the Proximal Point
- Jon Claerbout and Francis Muir, Robust Modeling with Erratic Data, 1973.
- Michael Kass and Andrew Witkin. Analyzing oriented patterns. Computer
- S. Amari, Differential geometrical methods in statistics, 1985. Defines
- George Chaikin, An algorithm for high speed curve generation, 1974. The
- Henry Wilbraham, On a certain periodic function, 1848. Discovered the
- E. Schrödinger. Sur la théorie relativiste de l’électron et
- L. M. Bregman, The relaxation method of finding the common points of
- H. Helmholtz, Über Integrale der hydrodynamischen Gleichungen, welcher der
- G. Reeb, Sur les points singuliers d’une forme de Pfaff complètement
- E. Catmull, J. Clark, Recursively generated B-spline surfaces on arbitrary
- Jianbo Shi and Jitendra Malik, Normalized Cuts and Image Segmentation,
- L. Vietoris, Über den höheren Zusammenhang kompakter Räume und eine Klasse
- J. Barnes, P. Hut, A hierarchical O(n log n) force-calculation algorithm,
- Gaetano Kanizsa, Subjective Contours, 1976. Revitalized the study of
- Calyampudi R. Rao, Information and the accuracy attainable in the
- B. D. Lucas and T. Kanade, An iterative image registration technique with
- Mark Kac, Can you heat the shape of a drum? 1966. Non isometric shapes can
- Klaus Wagner, Über eine Eigenschaft der ebenen Komplexe, 1937. State the
- M. J. Beckmann, A continuous model of transportation, 1952. Introduces a
- Jont B. Allen, Short Time Spectral Analysis, Synthesis, and Modification
- Herbert Edelsbrunner, David Kirkpatrick, Raimund Seidel, On the shape of a
- Bui Tuong Phong, Illumination for computer generated pictures, 1975. Phong
- J.L. Walsh, A closed set of normal orthogonal functions, 1923. Defines the
- William Lorensen, Harvey Cline, Marching Cubes: A high resolution 3D
- S. Osher and J. A. Sethian, Fronts propagating with curvature-dependent
- D. Marr and E. Hildreth, Theory of edge detection, 1980. Laid out the
- R. Leibler and S. Kullback, On information and sufficiency, 1951. KL
- Evelyn Fix, Joseph Hodges, Discriminatory analysis, nonparametric
- David Gale and Lloyd Shapley, College Admissions and the Stability of
- J. P. Boyle and R. L. Dykstra, A method for finding projections onto the
- Tibor Radó, Uber den Begriff der Riemannschen Flache, 1925. Shows that all
- Jean-Jacques Moreau, Proximité et dualité dans un espace hilbertien, 1965.
- Nash, John, Equilibrium points in n-person games, 1950. Nash equilibrium
- Klaus Wagner, Bemerkungen zum Vierfarbenproblem, 1936. Later improved by
- L. Greengard and V. Rokhlin, A Fast Algorithm for Particle Simulations,
- B.K.P. Horn and B.G. Schunck, Determining optical flow, 1981. Computes
- Richard Sinkhorn, A relationship between arbitrary positive matrices and
- Matthias Eck, Tony DeRose, Tom Duchamp, Hugues Hoppe, Michael Lounsbery,
- R. J. McCann, A convexity principle for interacting gases, 1998.
- J. B. Tenenbaum, V. de Silva, J. C. Langford, A Global Geometric Framework
- J. B. Kruskal, On the shortest spanning subtree of a graph and the
- R.L. Harder and R.N. Desmarais, Interpolation using surface splines, 1972.
- Emmy Noether, Ableitung der Elementarteilertheorie aus der Gruppentheorie,
- P. L. Lions and B. Mercier, Splitting Algorithms for the Sum of Two
- Teofilio Gonzalez, Clustering to minimize the maximum intercluster
- Nira Dyn, David Levin, John A. Gregory, A 4-point interpolatory
- Robin Sibson, A vector identity for the Dirichlet tesselation, 1980.
- Yurri Nesterov, A method for solving a convex programming problem with
- Hugues Hoppe, Progressive meshes, 1996. It is one of the most popular mesh
- Martial Agueh and Guillaume Carlier, Barycenters in the Wasserstein Space,
- L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification
- MacAdam, Visual sensitivities to color differences in daylight, 1942.
- Henri Gouraud, Continuous shading of curved surfaces, 1971. Gouraud
- David Immel, Michael Cohen, Donald Greenberg, A radiosity method for non-
- Y. LeCun, B. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. Hubbard,
- Herbert Federer, Curvature measures, 1959. The co-area formula expresses
- James Blinn, A Generalization of Algebraic Surface Drawing, 1982. «
- Prim, R. C, Shortest connection networks And some generalizations, 1957.
- Shepard, Donald, A two-dimensional interpolation function for irregularly-
- Charles Loop, Smooth Subdivision Surfaces Based on Triangles, 1987. One of
- Jean-Jacques Moreau, Proximité et dualité dans un espace hilbertien, 1965.
- Stuart Lloyd, Least squares quantization in PCM, 1982. Continuous
- Paul Chew, Guaranteed-quality mesh generation for curved surfaces, 1993.
- Stephen Warshall, A theorem on Boolean matrices, 1962. Robert Floyd,
- Scott Shaobing Chen, David L. Donoho, and Michael A. Saunders, Atomic
- M. Frank and P. Wolfe, An algorithm for quadratic programming, 1956. F-W
- Michael S. Floater, Mean value coordinates, 2003. The first construction
- Nina Amenta, Marshall Bern, Manolis Kamvysselis, A New Voronoi-Based
- Yurii Nesterov, Arkadii Nemirovskii, Interior-Point Polynomial Algorithms
- Corinna Cortes, Vladimir Vapnik, Support-vector networks, 1995. Defines a
- Herbert Robbins, Sutton Monro, A Stochastic Approximation Method, 1951.
- Tibshirani, Robert, Regression Shrinkage and Selection via the lasso,
- David Cox, The regression analysis of binary sequences, 1958. Introduces
- Sathamangalam Varadhan, On the behavior of the fundamental solution of the
- Gilbert Strang, The Discrete Cosine Transform, 1999. Review the various
- Ron Kimmel, James Sethian, Computing geodesic paths on manifolds, 1998.
- James Kajiya, The rendering equation, 1986. Describes conservation of
- Isaac Newton, De analysi per aequationes numero terminorum infinitas,
- Terence Tao, Van Vu, Random matrices: Universality of local eigenvalue
- Gaston Julia, Mémoire sur l’iteration des fonctions rationnelles, 1918.
- Vera Kublanovskaya, On some algorithms for the solution of the complete
- James Sethian, A Fast Marching Level Set Method for Monotonically
- Michael Crandall, Pierre-Louis Lions, Viscosity solutions of Hamilton-
- William Thomas Tutte, How to draw a graph, 1963. Shows how to embed a
- Mikhail Gromov, Groups of Polynomial growth and Expanding Maps, 1981.
- Felipe Cucker, Steve Smale, The Mathematics of Emergence, 2007. Simplest
- Jos Stam, Stable fluids, 1999. Arguably the most influential paper in PDEs
- Wim Sweldens, The lifting scheme: A construction of second generation
- Cooley, James W.; Tukey, John W., An algorithm for the machine calculation
- Richard Jordan, David Kinderlehrer, Felix Otto, The Variational
- Alfréd Haar, Zur Theorie der orthogonalen Funktionensysteme, 1910. The
- Frank Rosenblatt, The Perceptron-a perceiving and recognizing automaton,
- Linnainmaa, Seppo, The representation of the cumulative rounding error of
- Alan Turing, The Chemical Basis of Morphogenesis, 1952. Showed that
- Leonid Rudin, Stanley Osher, Emad Fatemi, Nonlinear total variation based
- Vladimir Marchenko and Leonid Pastur, Distribution of eigenvalues for some
- George Dantzig, Origins of the simplex method, 1987. Dantzig invented the
- Yann Brenier, Polar factorization and monotone rearrangement of
- Gaspard Monge, Mémoire sur la théorie des déblais et des remblais, 1776.
- Joseph Fourier, Théorie analytique de la chaleur, 1822. Introduces sines
- Paul Erdős, Alfréd Rényi, On Random Graphs, 1959. Defines the basic model
- Wilfred Hastings, Monte Carlo Sampling Methods Using Markov Chains and
- Leonid Kantorovich, On translocation of masses, 1942. Nobel Prize in
- Eugene Wigner, Characteristic Vectors of Bordered Matrices with Infinite
- Andrew Berry, The Accuracy of the Gaussian Approximation to the Sum of
- Ingrid Daubechies, Orthonormal bases of compactly supported wavelets,
- Claude Shannon, A Mathematical Theory of Communication, 1948. Defines,