Michael Elad

Last updated
Michael Elad
Elad2017.jpg
Born (1963-12-10) 10 December 1963 (age 60)
NationalityIsrael
Alma mater Technion
Known for Sparse Representations, K-SVD, Image Super-Resolution, Diffusion Models
Scientific career
Fields Engineering, Computer Science, Mathematics, Statistics
Institutions Technion
Stanford University
Doctoral advisor Arie Feuer
Doctoral students Michal Aharon, Ron Rubinstein, Matan protter, Joseph Shtok, Idan ram, Raja Giryes, Tomer Peleg, Amir Adler, Javier Turek, Boaz Ophir, Yaniv Romano, Jeremias Sulam, Vardan Papyan, Yael yankelevsky, Yehuda Dar, Dror Simon, Alona Golts, Aviad Aberdam, Gregory Vaksman, Bahjat Kawar

Michael Elad (born December 10, 1963) is a professor of Computer Science at the Technion - Israel Institute of Technology. His work includes fundamental contributions in the field of sparse representations, and deployment of these ideas to algorithms and applications in signal processing, image processing and machine learning.

Contents

Academic career

Elad holds a B.Sc. (1986), M.Sc. (1988) and D.Sc. (1997) in electrical engineering from the Technion - Israel Institute of Technology. His M.Sc., under the guidance of Prof. David Malah, focused on video compression algorithms; and his D.Sc. on super-resolution algorithms for image sequences, guided by Prof. Arie Feuer.

After several years (1997–2001) in industrial research in Hewlett-Packard Lab Israel and in Jigami, Michael took a research associate position at Stanford University from 2001 to 2003, working closely with Prof. Gene Golub (CS-Stanford), Prof. Peyman Milanfar (EE-UCSC) and Prof. David L. Donoho (Statistics-Stanford).

In 2003, Elad assumed a tenure-track faculty position in the Technion's computer science department. He was tenured and promoted to associate professorship in 2007, and promoted to full-professorship in 2010. The following is a list of is editorial activities during his academic career:

Research

Michael Elad works in the fields of signal processing, image processing and machine learning, specializing in particular on inverse problems, sparse representations and generative AI. Prof. Elad has authored hundreds of technical publications in these fields, many of which have led to exceptional impact. Among these, he is the creator of the K-SVD algorithm, [1] together with Michal Aharon and Bruckstein, and he is also the author of the 2010 book [2] "Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing".

In 2017, Prof. Elad and Yaniv Romano (his PhD student) created a specialized MOOC on sparse representation theory, given under edX.

In 2015-2018 Prof. Elad headed the Rothschild-Technion Program for Excellence. This is a flagship undergraduate program at the Technion, meant for exceptional students with emphasis on tailored and challenging study tracks for each of the ~50 students enrolled, along with an exposure to research.

Awards and recognition

Elad was the recipient of the 2008 and 2015 Henri Taub Prize for academic excellence, the 2010 Hershel-Rich prize for innovation, and the 2017 Yanai prize for excellence in teaching. His 2009 SIAM Review paper [3] with Donoho and Bruckstein received the SIAG Imaging-Science Prize in 2014. Michael is an IEEE Fellow since 2012 (for contributions to sparsity and redundancy in image processing) and he was named a SIAM Fellow in 2018 [4] (for contributions to the theory and development of sparse representations and their applications to signal and image processing). He was awarded the prestigious ERC advanced grant during the years 2013-2018. Prof. Elad is the recipient of three IEEE awards in 2018: (i) The IEEE Signal Processing Society (SPS) Technical Achievement Award for contributions to sparsity-based signal processing; (ii) The IEEE SPS Sustained Impact Paper Award for his K-SVD paper mentioned above; and (iii) The SPS best paper award for his paper on the Analysis K-SVD. [5] Prof. Elad received the Rothschild Prize in Engineering for 2024 [6] . In the same year he was also elected as a member of the Israel Academy of Sciences and Humanities.

Related Research Articles

<span class="mw-page-title-main">Robert G. Gallager</span> American electrical engineer (born 1931)

Robert Gray Gallager is an American electrical engineer known for his work on information theory and communications networks.

<span class="mw-page-title-main">Ron Kimmel</span>

Ron Kimmel is a professor of Computer Science and Electrical and Computer Engineering at the Technion Israel Institute of Technology. He holds a D.Sc. degree in electrical engineering (1995) from the Technion, and was a post-doc at UC Berkeley and Berkeley Labs, and a visiting professor at Stanford University. He has worked in various areas of image and shape analysis in computer vision, image processing, and computer graphics. Kimmel's interest in recent years has been non-rigid shape processing and analysis, medical imaging, computational biometry, deep learning, numerical optimization of problems with a geometric flavor, and applications of metric and differential geometry. Kimmel is an author of two books, an editor of one, and an author of numerous articles. He is the founder of the Geometric Image Processing Lab, and a founder and advisor of several successful image processing and analysis companies.

<span class="mw-page-title-main">Abraham Lempel</span> Israeli computer scientist (1936–2023)

Abraham Lempel was an Israeli computer scientist and one of the fathers of the LZ family of lossless data compression algorithms.

<span class="mw-page-title-main">Matching pursuit</span> Multidimensional data algorithm

Matching pursuit (MP) is a sparse approximation algorithm which finds the "best matching" projections of multidimensional data onto the span of an over-complete dictionary . The basic idea is to approximately represent a signal from Hilbert space as a weighted sum of finitely many functions taken from . An approximation with atoms has the form

Compressed sensing is a signal processing technique for efficiently acquiring and reconstructing a signal, by finding solutions to underdetermined linear systems. This is based on the principle that, through optimization, the sparsity of a signal can be exploited to recover it from far fewer samples than required by the Nyquist–Shannon sampling theorem. There are two conditions under which recovery is possible. The first one is sparsity, which requires the signal to be sparse in some domain. The second one is incoherence, which is applied through the isometric property, which is sufficient for sparse signals. Compressed sensing has applications in, for example, MRI where the incoherence condition is typically satisfied.

<span class="mw-page-title-main">Martin Vetterli</span> Swiss engineering academic, president of the École polytechnique fédérale de Lausanne

Martin Vetterli was president of École polytechnique fédérale de Lausanne (EPFL) in Switzerland, succeeding Patrick Aebischer. He's a professor of engineering and was formerly the president of the National Research Council of the Swiss National Science Foundation.

Sparse approximation theory deals with sparse solutions for systems of linear equations. Techniques for finding these solutions and exploiting them in applications have found wide use in image processing, signal processing, machine learning, medical imaging, and more.

In mathematics, more specifically in linear algebra, the spark of a matrix is the smallest integer such that there exists a set of columns in which are linearly dependent. If all the columns are linearly independent, is usually defined to be 1 more than the number of rows. The concept of matrix spark finds applications in error-correction codes, compressive sensing, and matroid theory, and provides a simple criterion for maximal sparsity of solutions to a system of linear equations.

Ali H. Sayed is the dean of engineering at EPFL, where he teaches and conducts research on Adaptation, Learning, Statistical Signal Processing, and Signal Processing for Communications. He is the Director of the EPFL Adaptive Systems Laboratory. He has authored several books on estimation and filtering theories, including the textbook Adaptive Filters, published by Wiley & Sons in 2008. Professor Sayed received the degrees of Engineer and Master of Science in Electrical Engineering from the University of Sao Paulo, Brazil, in 1987 and 1989, respectively, and the Doctor of Philosophy degree in electrical engineering from Stanford University in 1992.

In linear algebra, the coherence or mutual coherence of a matrix A is defined as the maximum absolute value of the cross-correlations between the columns of A.

Lee Swindlehurst is an electrical engineer who has made contributions in sensor array signal processing for radar and wireless communications, detection and estimation theory, and system identification, and has received many awards in these areas. He is currently a Professor of Electrical Engineering and Computer Science at the University of California at Irvine.

Professor Shlomo Shamai (Shitz) (Hebrew: שלמה שמאי (שיץ) ‏) is a distinguished professor at the Department of Electrical engineering at the Technion − Israel Institute of Technology. Professor Shamai is an information theorist and winner of the 2011 Shannon Award.

In applied mathematics, k-SVD is a dictionary learning algorithm for creating a dictionary for sparse representations, via a singular value decomposition approach. k-SVD is a generalization of the k-means clustering method, and it works by iteratively alternating between sparse coding the input data based on the current dictionary, and updating the atoms in the dictionary to better fit the data. It is structurally related to the expectation–maximization (EM) algorithm. k-SVD can be found widely in use in applications such as image processing, audio processing, biology, and document analysis.

Sparse dictionary learning is a representation learning method which aims at finding a sparse representation of the input data in the form of a linear combination of basic elements as well as those basic elements themselves. These elements are called atoms and they compose a dictionary. Atoms in the dictionary are not required to be orthogonal, and they may be an over-complete spanning set. This problem setup also allows the dimensionality of the signals being represented to be higher than the one of the signals being observed. The above two properties lead to having seemingly redundant atoms that allow multiple representations of the same signal but also provide an improvement in sparsity and flexibility of the representation.

<span class="mw-page-title-main">Ümit Çatalyürek</span>

Ümit V. Çatalyürek is a professor of computer science at the Georgia Institute of Technology, and Adjunct Professor in department of Biomedical Informatics at the Ohio State University. He is known for his work on graph analytics, parallel algorithms for scientific applications, data-intensive computing, and large scale genomic and biomedical applications. He was the director of the High Performance Computing Lab at the Ohio State University. He was named Fellow of the Institute of Electrical and Electronics Engineers (IEEE) in 2016 for contributions to combinatorial scientific computing and parallel computing.

<span class="mw-page-title-main">Moeness Amin</span> Egyptian-American professor and engineer

Moeness G. Amin is an Egyptian-American professor and engineer. Amin is the director of the Center for Advanced Communications and a professor in the Department of Electrical and Computer Engineering at Villanova University.

<span class="mw-page-title-main">Yonina Eldar</span> Israeli academic and engineer

Yonina C. Eldar is an Israeli professor of electrical engineering at the Weizmann Institute of Science, known for her pioneering work on sub-Nyquist sampling.

Namrata Vaswani is an Indian-American electrical engineer known for her research in compressed sensing, robust principal component analysis, signal processing, statistical learning theory, and computer vision. She is a Joseph and Elizabeth Anderlik Professor in Electrical and Computer Engineering at Iowa State University, and a professor of mathematics at Iowa State.

<span class="mw-page-title-main">Mario A. T. Figueiredo</span> Portuguese engineer, academic

Mário A. T. Figueiredo is a Portuguese engineer, academic, and researcher. He is an IST Distinguished Professor and holds the Feedzai chair of machine learning at IST, University of Lisbon.

Michal Aharon is an Israeli computer scientist known for her research on sparse dictionary learning, image denoising, and the K-SVD algorithm in machine learning. She is a researcher on advertisement ranking for Yahoo! in Haifa.

References

  1. Aharon, M.; Elad, M.; Bruckstein, A.M. (2006), "The K-SVD: An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation" (PDF), IEEE Transactions on Signal Processing, 11 (54): 4311–4322, Bibcode:2006ITSP...54.4311A, doi:10.1109/TSP.2006.881199, S2CID   7477309 .
  2. Elad, Michael (2010), Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing, ISBN   978-1441970107 .
  3. Bruckstein, A.M.; Donoho, D.L.; Elad, M. (2009), "From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images" (PDF), SIAM Review, 2 (51): 34–81, Bibcode:2009SIAMR..51...34B, CiteSeerX   10.1.1.102.4697 , doi:10.1137/060657704 .
  4. "SIAM Announces Class of 2018 Fellows", SIAM News, March 29, 2018
  5. Rubinstein, R.; peleg, T.; Elad, M. (2013), "Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model" (PDF), IEEE Transactions on Signal Processing, 61 (3): 661, Bibcode:2013ITSP...61..661R, CiteSeerX   10.1.1.295.4488 , doi:10.1109/TSP.2012.2226445, S2CID   15495804 .
  6. The Rothschild Prize