Demo Data from VLDB 2026 / reviewers in the wild / expert
Suguna Pappu
dblp:06/1409
· DBLP profile ↗
4ranked-venue papers
1as first author
0since 2021 · last 1998
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
1 paper |
3D vision · 100% | |
| Computer graphics and multimedia
2 papers |
Geometric modeling and processing · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision › feature matching
correspondence problem |
0.0 | 1 | 1995 | A Framework for Non-rigid Matching and Correspondence · NIPS 1995 |
Computer vision › 3D vision › shape matching
non-rigid shape matching |
0.0 | 1 | 1995 | A Framework for Non-rigid Matching and Correspondence · NIPS 1995 |
Geometric modeling and processing
point set registration |
0.0 | 1 | 1994 | New Algorithms for 2D and 3D Point Matching: Pose Estimation and Correspondence · NIPS 1994 |
Mathematical optimization › variational inference
mean field approximation |
0.0 | 1 | 1994 | New Algorithms for 2D and 3D Point Matching: Pose Estimation and Correspondence · NIPS 1994 |
Geometric modeling and processing
shape matching |
0.0 | 1 | 1995 | A Framework for Non-rigid Matching and Correspondence · NIPS 1995 |
Methods — techniques the papers use, named apart from their topics
non-rigid matching · 0.0deterministic annealing · 0.0EM-like dynamics · 0.0mean-field theory · 0.0mean field theory · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | New algorithms for 2D and 3D point matching: pose estimation and correspondenceabstractA fundamental open problem in computer vision—determining pose and correspondence between two sets of points in space—is solved with a novel, fast, robust and easily implementable algorithm. The technique works on noisy 2D or 3D point sets that may be of unequal sizes and may differ by non-rigid transformations. Using a combination of optimization techniques such as deterministic annealing and the softassign, which have recently emerged out of the recurrent neural network/statistical physics framework, analog objective functions describing the problems are minimized. Over thirty thousand experiments, on randomly generated points sets with varying amounts of noise and missing and spurious points, and on hand-written character sets demonstrate the robustness of the algorithm. Steven Gold, Anand Rangarajan 0001, Chien-Ping Lu, Suguna Pappu, Eric Mjolsness |
Pattern Recognit. | 4 |
| 1997 | A robust point-matching algorithm for autoradiograph alignmentabstractWe present a novel method for the geometric alignment of autoradiographs of the brain. The method is based on finding the spatial mapping and the one-to-one correspondences (or homologies) between point features extracted from the images and rejecting non-homologies as outliers. In this way, we attempt to account for the local, natural and artifactual differences between the autoradiograph slices. We have used the resulting automated algorithm on a set of left prefrontal cortex autoradiograph slices, specifically demonstrated its ability to perform point outlier rejection, validated its robustness property using synthetically generated spatial mappings and provided an anecdotal visual comparison with the well-known iterated closest-point (ICP) algorithm. Visualization of a stack of aligned left prefrontal cortex autoradiograph slices is also provided. Anand Rangarajan 0001, Haili Chui, Eric Mjolsness, Suguna Pappu, Lila Davachi, Patricia S. Goldman-Rakic, James S. Duncan |
Medical Image Anal. | 4 |
| 1995 | A Framework for Non-rigid Matching and Correspondence
Suguna Pappu, Steven Gold, Anand Rangarajan 0001 |
NIPS | 1 |
| 1994 | New Algorithms for 2D and 3D Point Matching: Pose Estimation and CorrespondenceabstractA fundamental open problem in computer vision-determining pose and correspondence between two sets of points in space(cid:173) is solved with a novel, robust and easily implementable algorithm. The technique works on noisy point sets that may be of unequal sizes and may differ by non-rigid transformations. A 2D varia(cid:173) tion calculates the pose between point sets related by an affine transformation-translation, rotation, scale and shear. A 3D to 3D variation calculates translation and rotation. An objective describ(cid:173) ing the problem is derived from Mean field theory. The objective is minimized with clocked (EM-like) dynamics. Experiments with both handwritten and synthetic data provide empirical evidence for the method. Steven Gold, Chien-Ping Lu, Anand Rangarajan 0001, Suguna Pappu, Eric Mjolsness |
NIPS | 4 |