Demo Data from EDBT 2026 / reviewers in the wild / expert
Gopa Ganguly
dblp:49/2646
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial 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
1 paper |
3D vision · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › 3D vision
3d scene understanding |
0.0 | 1 | 1994 | The Robust Sequential Estimator: A General Approach and its Application to Surface Organization in Range Data · IEEE Trans. Pattern Anal. Mach. Intell. 1994 |
Computer vision › 3D vision › geometric estimation › geometric model fitting
robust surface fitting |
0.0 | 1 | 1994 | The Robust Sequential Estimator: A General Approach and its Application to Surface Organization in Range Data · IEEE Trans. Pattern Anal. Mach. Intell. 1994 |
Methods — techniques the papers use, named apart from their topics
sequential least-squares · 0.0robust sequential estimation · 0.0akaike information criterion · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | The Robust Sequential Estimator: A General Approach and its Application to Surface Organization in Range DataabstractPresents an autonomous, statistically robust, sequential function approximation approach to simultaneous parameterization and organization of (possibly partially occluded) surfaces in noisy, outlier-ridden (not Gaussian), functional range data. At the core of this approach is the Robust Sequential Estimator, a robust extension to the method of sequential least squares. Unlike most existing surface characterization techniques, the authors' method generates complete surface hypotheses in parameter space. Given a noisy depth map of an unknown 3-D scene, the algorithm first selects appropriate seed points representing possible surfaces. For each nonredundant seed it chooses the best approximating model from a given set of competing models using a modified Akaike Information Criterion. With this best model, each surface is expanded from its seed over the entire image, and this step is repeated for all seeds. Those points which appear to be outliers with respect to the model in growth are not included in the (possibly disconnected) surface. Point regions are deleted from each newly grown surface in the prune stage. Noise, outliers, or coincidental surface alignment may cause some points to appear to belong to more than one surface. These ambiguities are resolved by a weighted voting scheme within a 5/spl times/5 decision window centered around the ambiguous point. The isolated point regions left after the resolve stage are removed and any missing points in the data are filled by the surface having a majority consensus in an 8-neighborhood.> Kim L. Boyer, Muhammad J. Mirza, Gopa Ganguly |
IEEE Trans. Pattern Anal. Mach. Intell. | 3 |