Demo Data from EDBT 2026 / reviewers in the wild / expert
Omri Hirsch
dblp:393/2715
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 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.
| Computer graphics and multimedia
1 paper |
Image and video processing · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video processing › image registration
groupwise registration |
0.9 | 1 | 2025 | FastJAM: a Fast Joint Alignment Model for Images · NeurIPS 2025 |
Image and video processing
image matching |
0.9 | 1 | 2025 | FastJAM: a Fast Joint Alignment Model for Images · NeurIPS 2025 |
Image and video processing
image registration |
0.9 | 1 | 2025 | FastJAM: a Fast Joint Alignment Model for Images · NeurIPS 2025 |
Methods — techniques the papers use, named apart from their topics
non-parametric clustering · 0.9inverse-compositional loss · 0.9graph neural network · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | FastJAM: a Fast Joint Alignment Model for ImagesabstractJoint Alignment (JA) of images aims to align a collection of images into a unified coordinate frame, such that semantically-similar features appear at corresponding spatial locations. Most existing approaches often require long training times, large-capacity models,
and extensive hyperparameter tuning. We introduce FastJAM, a rapid, graph-based method that drastically reduces the computational complexity of joint alignment tasks. FastJAM leverages pairwise matches computed by an off-the-shelf image matcher, together with a rapid nonparametric clustering, to construct a graph representing intra- and inter-image keypoint relations.
A graph neural network propagates and aggregates these correspondences, efficiently predicting per-image homography parameters via image-level pooling. Utilizing an inverse-compositional loss, that eliminates the need
for a regularization term over the predicted transformations (and thus
also obviates the hyperparameter tuning associated with such terms), FastJAM performs image JA quickly and effectively. Experimental results on several benchmarks demonstrate that FastJAM achieves results better than existing modern JA methods in terms of alignment quality, while reducing computation time from hours or minutes to mere seconds. Our code is available at our project webpage, https://bgu-cs-vil.github.io/FastJAM/. Omri Hirsch, Ron Shapira Weber, Shira Ifergane, Oren Freifeld |
NeurIPS | 1 |