Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mona Mahmoudi

dblp:04/3623 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2012
0000-0002-1607-9329ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 4 · 4 first-authorArtificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
3D vision · 100%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
range image processing
0.112012
Sparse Representations for Range Data Restoration · IEEE Trans. Image Process. 2012
Image and video processing › image restoration
image denoising
0.112012
Sparse Representations for Range Data Restoration · IEEE Trans. Image Process. 2012
Image and video processing › image restoration › image denoising
sparse representation based denoising
0.112012
Sparse Representations for Range Data Restoration · IEEE Trans. Image Process. 2012
Computer vision › 3D vision
3d shape analysis
0.112010
A Gromov-Hausdorff Framework with Diffusion Geometry for Topologically-Robust Non-rigid Shape Matching · Int. J. Comput. Vis. 2010
Computer vision › 3D vision › shape matching
non-rigid shape matching
0.112010
A Gromov-Hausdorff Framework with Diffusion Geometry for Topologically-Robust Non-rigid Shape Matching · Int. J. Comput. Vis. 2010

Methods — techniques the papers use, named apart from their topics

sparse representation · 0.3dictionary learning · 0.3gromov-hausdorff distance · 0.1diffusion geometry · 0.1
YearPublicationVenuePosition
2012 Sparse Representations for Range Data Restoration
abstract
In this paper, the problem of denoising and occlusion restoration of 3-D range data based on dictionary learning and sparse representation methods is explored. We apply these techniques after converting the noisy 3-D surface into one or more images. We present experimental results on the proposed approaches.
Mona Mahmoudi, Guillermo Sapiro
IEEE Trans. Image Process.1
2010 A Gromov-Hausdorff Framework with Diffusion Geometry for Topologically-Robust Non-rigid Shape Matching
Alexander M. Bronstein, Michael M. Bronstein, Ron Kimmel, Mona Mahmoudi, Guillermo Sapiro
Int. J. Comput. Vis.4
2009 Three-dimensional point cloud recognition via distributions of geometric distances
Mona Mahmoudi, Guillermo Sapiro
Graph. Model.1
2008 On the estimation of geodesic paths on sampled manifolds under random projections
abstract
In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in high- dimensional Euclidean spaces. We show that geodesic paths approximations from nearest neighbors Euclidean distances are well-preserved by Gaussian projections and we characterize the distribution of geodesic lengths in the reduced dimensional point cloud. A stylized application to a real-world data set of human faces is presented to validate our theoretical findings.
Mona Mahmoudi, Pierre Vandergheynst, Matteo Sorci
ICIP1
2005 Fast image and video denoising via nonlocal means of similar neighborhoods
abstract
In this letter, improvements to the nonlocal means image denoising method introduced by Buades et al. are presented. The original nonlocal means method replaces a noisy pixel by the weighted average of pixels with related surrounding neighborhoods. While producing state-of-the-art denoising results, this method is computationally impractical. In order to accelerate the algorithm, we introduce filters that eliminate unrelated neighborhoods from the weighted average. These filters are based on local average gray values and gradients, preclassifying neighborhoods and thereby reducing the original quadratic complexity to a linear one and reducing the influence of less-related areas in the denoising of a given pixel. We present the underlying framework and experimental results for gray level and color images as well as for video.
Mona Mahmoudi, Guillermo Sapiro
IEEE Signal Process. Lett.1