Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
20066.7k citationsMichael Elad et al.IEEE Transactions on Signal Processingprofile →
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
20063.7k citationsMichael Elad et al.IEEE Transactions on Image Processingprofile →
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
20031.9k citationsDavid L. Donoho, Michael Eladprofile →
This map shows the geographic impact of Michael Elad's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michael Elad with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Elad more than expected).
This network shows the impact of papers produced by Michael Elad. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michael Elad. The network helps show where Michael Elad may publish in the future.
Co-authorship network of co-authors of Michael Elad
This figure shows the co-authorship network connecting the top 25 collaborators of Michael Elad.
A scholar is included among the top collaborators of Michael Elad based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Michael Elad. Michael Elad is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Ophir, Boaz, Michael Elad, Nancy Bertin, & Mark D. Plumbley. (2011). Sequential minimal eigenvalues - an approach to analysis dictionary learning. HAL (Le Centre pour la Communication Scientifique Directe). 1465–1469.37 indexed citations
8.
Ben‐Haim, Zvika, Yonina C. Eldar, & Michael Elad. (2009). Near-Oracle Performance of Basis Pursuit under Random Noise. arXiv (Cornell University).8 indexed citations
Starck, Jean‐Luc, Y. Moudden, J. Bobin, Michael Elad, & David L. Donoho. (2005). Morphological component analysis. Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE. 5914. 59140Q–59140Q.82 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.