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

Kishore Bubna

dblp:04/5302 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2000
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author

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
Geometric modeling and processing · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
robust estimation
0.011999
Estimating Model Parameters and Boundaries By Minimizing a Joint, Robust Objective Function · CVPR 1999
Mathematical optimization › statistical estimation
m-estimators
0.011999
Estimating Model Parameters and Boundaries By Minimizing a Joint, Robust Objective Function · CVPR 1999
Mathematical optimization
robust statistics
0.011999
Estimating Model Parameters and Boundaries By Minimizing a Joint, Robust Objective Function · CVPR 1999
Geometric modeling and processing
model selection
0.011998
Model Selection and Surface Merging in Reconstruction Algorithms · ICCV 1998
Geometric modeling and processing › shape modeling › shape editing › mesh editing
surface merging
0.011998
Model Selection and Surface Merging in Reconstruction Algorithms · ICCV 1998
Geometric modeling and processing
surface reconstruction
0.011998
Model Selection and Surface Merging in Reconstruction Algorithms · ICCV 1998
Computer vision › 3D vision
geometric constraints
0.011996
Geometric constraints and stereo disparity computation · Int. J. Comput. Vis. 1996
Computer vision › 3D vision › stereo vision
stereo matching
0.011996
Geometric constraints and stereo disparity computation · Int. J. Comput. Vis. 1996
Computer vision › 3D vision
stereo vision
0.011996
Geometric constraints and stereo disparity computation · Int. J. Comput. Vis. 1996

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

robust objective function · 0.0domain bounding m-estimator · 0.0bootstrapped criteria · 0.0bayesian criteria · 0.0akaike criterion · 0.0
YearPublicationVenuePosition
2000 Model Selection Techniques and Merging Rules for Range Data Segmentation Algorithms
Kishore Bubna, Charles V. Stewart
Comput. Vis. Image Underst.1
1999 Estimating Model Parameters and Boundaries By Minimizing a Joint, Robust Objective Function
abstract
Many problems in computer vision require estimation of both model parameters and boundaries, which limits the usefulness of standard estimation techniques from statistics. Example problems include surface reconstruction from range data, estimation of parametric motion models, fitting circular or elliptic arcs to edgel data, and many others. This paper introduces a new estimation technique, called the "Domain Bounding M-Estimator", which is a generalization of ordinary M-estimators combining error measures on model parameters and boundaries in a joint, robust objective function. Minimization of the objective function given a rough initialization yields simultaneous estimates of parameters and boundaries. The DBM-Estimator has been applied to estimating line segments, surfaces, and the symmetry transformation between two edgel chains. It is unaffected by outliers and prevents boundary estimates from crossing even small magnitude discontinuities.
Charles V. Stewart, Kishore Bubna, A. G. Amitha Perera
CVPR2
1998 Model Selection and Surface Merging in Reconstruction Algorithms
abstract
The problem of model selection is relevant to many areas of computer vision. Model selection criteria have been used in the vision literature and many more have been proposed in statistics, but the relative strengths of these criteria have not been analyzed in vision. More importantly, suitable extensions to these criteria must be made to solve problems unique to computer vision. Using the problem of surface reconstruction as our context, we analyze existing criteria using simulations and sensor data, introduce new criteria from statistics, develop novel criteria capable of handling unknown error distributions and outliers, and extend model selection criteria to apply to the surface merging problem. The new surface merging rules improve upon previous results, and work well even at small step heights (h=3/spl sigma/) and crease discontinuities. Our results show that a Bayesian criteria and its bootstrapped variant perform the best, although for time-sensitive applications, a variant of the Akaike criterion may be a better choice. Unfortunately, none of the criteria work reliably for small region sizes, implying that model selection and surface merging should be avoided unless the region size is sufficiently large.
Kishore Bubna, Charles V. Stewart
ICCV1
1996 Geometric constraints and stereo disparity computation
Charles V. Stewart, Robin Y. Flatland, Kishore Bubna
Int. J. Comput. Vis.3