November 21, 2011 -
Recognizing the achievements of its members is an important part of the
mission of the IEEE. Each year, following a rigorous evaluation procedure,
the IEEE Fellow Committee recommends a select group of recipients for one
of the Association’s most prestigious honors, elevation to IEEE Fellow.
I have just been informed
that the IEEE Board of Directors, at its November 2011 meeting, elevated me
to IEEE Fellow,
effective 1 January 2012, with the following citation:
"for contributions to sparsity-and-redundancy in image processing".
November 10, 2011 - In 1991, while still serving in the
Israeli air-force, I found by a complete coincidence the seminal
papers by Shmuel Peleg and his students on Super-Resolution (SR).
It seems that ever-since then, this topic keeps pulling and influencing me:
(i) My PhD research with Prof. Arie Feuer (1993-1996) was focused on SR; (ii) During my work
in HP-Labs Israel, I collaborated with Prof. Yacov Hel-Or, (1999) to propose a way to boost
scanners using SR; (iii) During my post-doc at Stanford, I worked closely with
Prof. Peyman Milanfar and Sina Farisu on robustifying SR reconstruction.
In 2004, after my post-doc, I sincerely believed that there is nothing else
that could be done in this field - I was so wrong. IN 2006, while working on
video denoising with Matan Protter, we found out that our insights in this work
could be adapted to SR, and, for the first time, we could
propose a solution that does not rely on exact motion estimation. This led to
new group of papers on super-resolution, with a breakthrough that we are so proud of.
What next? commercialization of this technology is on our minds, and several
future improvements. Today I gave a lecture to "final" employees, telling the above
story of 25 years of activity on super-resolution, and my part in it
(the slides can be found HERE).
July 20, 2011 - SPARS11 (Edinburgh, June 2011)
is behind us now. It has been a great opportunity for meeting our
community and hearing of the recent developments in the fields of compressed-sensing
and sparse approximation. This event exposed a new path of work on the "analysis model"
for sparse representations. Remi Gribonval's keynote talk, Sangnam Nam's lecture,
the lecture by Mehrdad Yaghoobi, and mine, all discussed various facets of this
fascinating new understanding of sparse represntations. This work is one of the main
outcomes of the EU (FET) SMALL project (members in this project are Remi Gribonval,
Mike Davies, Pierre Vandergheynst, Mark Plumbley, and myself). The slides of my talk
on this model and a dicitonary leanring algorithm for it can be found
HERE.
 |
October 3, 2010 - In February 2009, Freddy Bruckstein,
David Donoho, and I published a paper in SIAM-Review
(SIAM Rev. 51[1]: 34-81, March 2009) on sparse represnetations,
|
covering this topic from initial theoretical ideas, and all the way to
applications in image processing.
Few weeks ago we have been notified that
"this article has been identified by Thomson Reuters Essential Science Indicators
as a featured Fast-Breaking Paper in the field of Mathematics, which means
it is one of the most-cited papers in this discipline published during the
past two years". Information about this article and the story behind
it are now featured in
Thomson Reuters ScienceWatch.
 |
September 14, 2010 - My new book, titled
"Sparse and Redundant Representations:
From Theory to Applications in Signal and Image Processing",
(Springer) is now available.
This book provides a reader-friendly and comprehensive view of the field of
sparse approxmation, and its impact to image processing. The book offers a systematic and ordered
exposure to the theoretical foundations of this field, the numerical aspects of the
involved algorithms, and the signal and image processing applications that benefit from
these advancements. |
Originally written to serve as a text-book for a graduate engineering course, this book is
an easy entry-point for inetrested readers, and for others
already active in this area. See
Amazon for more
details. A Matlab package that reproduces the book's figures
and contains most of the discussed algorithms
is available HERE.
| | |
