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

Mohammad Mahdi Omati

dblp:340/7891 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2026
0000-0001-7036-3470ORCID · reported

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

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
1 paper
Learning paradigms · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms › semi-supervised learning
graph-based semi-supervised learning
1.012026
Exact Combinatorial Multi-Class Graph Cuts for Semi-Supervised Learning · AAAI 2026
Machine learning › Learning paradigms
semi-supervised learning
1.012026
Exact Combinatorial Multi-Class Graph Cuts for Semi-Supervised Learning · AAAI 2026
Mathematical optimization
combinatorial optimization
1.012026
Exact Combinatorial Multi-Class Graph Cuts for Semi-Supervised Learning · AAAI 2026

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

minorization-maximization · 2.0network-flow algorithms · 1.0network flow algorithm · 1.0
YearPublicationVenuePosition
2026 Exact Combinatorial Multi-Class Graph Cuts for Semi-Supervised Learning
abstract
Semi-supervised learning (SSL) on graphs is critical in applications where labeled data are scarce and costly, yet existing graph-based methods often degrade under extreme label sparsity or class imbalance, yielding trivial or unstable solutions. We introduce \textbf{CombCut}, the first exact combinatorial optimization framework for multi-class graph-based semi-supervised learning that operates directly on binary one-hot assignments, without any convex relaxation or heuristic volume constraints. By employing a minorization–maximization (MM) scheme, CombCut transforms each step into a structured linear assignment problem solved efficiently via network-flow algorithms. Total unimodularity guarantees integral iterates, and our theoretical analysis establishes both monotonic ascent of the true discrete objective and convergence of every limit point to a Karush–Kuhn–Tucker (KKT) stationary solution of the original combinatorial problem. Our approach requires no hyperparameter tuning and scales near-linearly in the number of vertices. Empirical evaluation on MNIST, Fashion-MNIST, and CIFAR-10 with as few as 1–5 labels per class shows that CombCut excels in worst-case labeling scenarios, significantly outperforming state-of-the-art graph-SSL baselines and yielding more stable and accurate label propagation under severe supervision constraints.
Mohammad Mahdi Omati, Yasin Salajeghe, Mahshad Moradi, Arash Amini
AAAI1
2026 Joint design of transmit waveform and receive filter via ADMM-SFRS
Mohammad Mahdi Omati, Seyed Mohammad Karbasi, Arash Amini
Signal Process.1
2025 Two non-convex optimization approaches for joint transmit waveform and receive filter design
Mohammad Mahdi Omati, Seyed Mohammad Karbasi, Arash Amini
Signal Process.1
2023 Building Height Reconstruction Based on Propagator and Generalized Maximum Entropy-TomoSAR
abstract
In recent years, the synthetic aperture radar tomography (TomoSAR) technique is becoming an increasingly hot research topic in the three-dimensional (3D) reconstruction of the structure of urban buildings. The robustness of the many advanced non-parametric spectral estimation methods in use is based on a high number of observations. This letter aims to evaluate the ability of the five non-parametric estimator techniques, including propagator, generalized maximum entropy (GME), minimum norm (MN), singular value decomposition (SVD), and capon in the separation of scattering contributions with a small number of SAR images. The performance comparison of the employed algorithms is carried out on the simulated and real datasets. The study results show that the novel high-resolution propagator and generalized maximum entropy estimators, respectively, based on the partitioning and extrapolation of the covariance matrix, can discriminate the number of scatterers in one azimuth-range resolution and satisfactorily prevent the appearance of undesirable sidelobes. The experimental results on real SAR images acquired by the TerraSAR-X satellite show the proposed propagator spectral estimation can significantly improve the 3D building reconstruction in the urban environment. Also, the estimated height of the scatters using the propagator technique is similar to the data obtained from ground observations.
Mohammad Mahdi Omati, Mohammad Hasan Bastani
IEEE Geosci. Remote. Sens. Lett.1