EDBT 2026 Demo / reviewers in the wild / expert
Ari D. Gross
dblp:80/5930
· DBLP profile ↗
15ranked-venue papers
12as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 14 · 11 first-authorGraphics, computer vision, multimedia, augmented reality and games · 5 · 4 first-authorSystems, architecture and hardware · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 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
6 papers |
3D vision · 58% Segmentation and scene understanding · 42% | |
| Computer graphics and multimedia
4 papers |
Geometric modeling and processing · 64% Computational photography and imaging · 36% |
Topics — the 8 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computer vision › Segmentation and scene understanding › perceptual grouping
contour grouping |
0.1 | 1 | 2007 | Contour Grouping Based on Local Symmetry · ICCV 2007 |
Computer vision › 3D vision › object modeling › geometric modeling
generalized cylinder recovery |
0.0 | 2 | 1996 | Recovery of SHGCs From a Single Intensity View · IEEE Trans. Pattern Anal. Mach. Intell. 1996 An algorithm to recover generalized cylinders from a single intensity view · ICRA 1990 |
Computer vision › 3D vision
shape from shading |
0.0 | 1 | 1996 | Recovery of SHGCs From a Single Intensity View · IEEE Trans. Pattern Anal. Mach. Intell. 1996 |
Computer vision › 3D vision › 3d shape reconstruction › shape from x
shape from contour |
0.0 | 1 | 1994 | Toward Object-Based Heuristics · IEEE Trans. Pattern Anal. Mach. Intell. 1994 |
Computer vision › 3D vision › 3d shape analysis
symmetry analysis |
0.0 | 1 | 1994 | Analyzing skewed symmetries · Int. J. Comput. Vis. 1994 |
Computer vision › 3D vision
3d shape reconstruction |
0.0 | 2 | 1994 | An algorithm to recover generalized cylinders from a single intensity view · ICRA 1990 Toward Object-Based Heuristics · IEEE Trans. Pattern Anal. Mach. Intell. 1994 |
Geometric modeling and processing › shape analysis
symmetry detection |
0.0 | 1 | 1991 | SYMAN: a symmetry analyzer · CVPR 1991 |
Computer vision › 3D vision
3d shape analysis |
0.0 | 1 | 1991 | SYMAN: a symmetry analyzer · CVPR 1991 |
Methods — techniques the papers use, named apart from their topics
particle filter · 0.1markov chain monte carlo · 0.1reflectance-based constraints · 0.0orthographic projection · 0.0local tangent-based algorithm · 0.0global analytic solution · 0.0contour constraints · 0.0contour analysis · 0.0orthogonal basis constraint · 0.0nonaccidental alignment · 0.0monocular intensity analysis · 0.0gaussian curvature analysis · 0.0simulation · 0.0minimization · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Contour Grouping Based on Local SymmetryabstractThe paper deals with grouping of edges to contours of shapes using only local symmetry and continuity. Shape skeletons are used to generate the search space for a version of the Markov Chain Monte Carlo approach utilizing particle filters to find the most likely skeleton. Intuitively this means that grouping of edge segments is performed by walking along the skeleton. The particle search, which is an adapted version of a successful algorithm in robot mapping, is assisted by a reference model of a shape, which is expressed as the sequence of sample points and radii of maximal skeleton disks. This model is sufficiently flexible to represent non-rigid deformations, but restrictive enough to perform well on real, noisy image data. The order of skeleton points (and their corresponding segments) found by the particles defines the grouping. Nagesh Adluru, Longin Jan Latecki, Rolf Lakämper, Thomas Young, Xiang Bai, Ari D. Gross |
ICCV | 6 |
| 2002 | Special issue: Shape Representation and Similarity for Image Databases
Longin Jan Latecki, Robert Melter, Ari D. Gross |
Pattern Recognit. | 3 |
| 1999 | Digitizations preserving shape
Antonio Giraldo, Ari D. Gross, Longin Jan Latecki |
Pattern Recognit. | 2 |
| 1999 | Digital geometric methods in document image analysis
Ari D. Gross, Longin Jan Latecki |
Pattern Recognit. | 1 |
| 1998 | Digital Geometric Methods in Image Analysis and Compression
Ari D. Gross, Longin Jan Latecki |
ACCV (1) | 1 |
| 1997 | A Realistic Digitization Model of Straight Lines
Ari D. Gross, Longin Jan Latecki |
Comput. Vis. Image Underst. | 1 |
| 1996 | Modelling digital straight linesabstractWe present a realistic mathematical model of a digitized edge which handles both blurring and arbitrary thresholding. We show that a thresholded digital image of a blurred half-plane obtained for some unknown threshold value is equal to the image of a perfectly focused half-plane with the same slope obtained by object boundary quantisation. This result implies that recovering the slope of a blurred half-plane, given its image obtained for some unknown threshold value, reduces to recovering the slope of a perfectly focused half-plane under object boundary quantization. Therefore, the previous results and algorithms for the recovery of straight lines, which mainly assumed object boundary quantization, are also valid if we assume this more realistic digitization model. Ari D. Gross, Longin Jan Latecki |
ICPR | 1 |
| 1996 | Recovery of SHGCs From a Single Intensity ViewabstractGeneralized cylinders are a flexible, loosely-defined class of parametric shapes capable of modeling many real-world objects. Straight homogeneous generalized cylinders are an important subclass of generalized cylinders, whose cross-sections are scaled versions of a reference curve. Although there has been considerable research into recovering the shape of SHGCs from their contour, this work has almost exclusively involved methods that couple contour and heuristic constraints. A rigorous approach to the problem of recovering solid parametric shape from a single intensity view should involve at least two stages: (1) deriving the contour constraints, and (2) determining if additional image constraints, e.g., intensity, can be used to uniquely determine the 3D object shape. In this paper, the authors follow the approach just described. This methodology is also important for the recovery of object classes like tubes, where contour and heuristic constraints are shown to be insufficient for shape recovery. First, the authors prove that SHGC contours generated under orthography have exactly two degrees of freedom. Next, the authors show that the remaining free parameters can be resolved using reflectance-based constraints, without knowledge of the number of light sources, their positions, intensities, the amount of ambient light; or the surface albedo. Finally, the reflectance-based recovery algorithm is demonstrated on both synthetic and real SHGC images. Ari D. Gross, Terrance E. Boult |
IEEE Trans. Pattern Anal. Mach. Intell. | 1 |
| 1995 | Digitizations Preserving Topological and Differential Geometric Properties
Ari D. Gross, Longin Jan Latecki |
Comput. Vis. Image Underst. | 1 |
| 1994 | Analyzing skewed symmetries
Ari D. Gross, Terrance E. Boult |
Int. J. Comput. Vis. | 1 |
| 1994 | Toward Object-Based HeuristicsabstractRecovering the 3-D shape of an object from its 2-D image contour is an important problem in computer vision. In this correspondence, the author motivates and develops two object-based heuristics. The structured nature of objects is the motivation for the nonaccidental alignment criterion: parallel coordinate axes within the object's bounding contour correspond to object-centered coordinate axes. The regularity and symmetry inherent in many man-made objects is the motivation for the orthogonal basis constraint. An oblique set of coordinate axes in the image is presumed to be the projection of an orthogonal set of 3-D coordinate axes in the scene. These object-based heuristics are used to recover shape in both real and synthetic images.> Ari D. Gross |
IEEE Trans. Pattern Anal. Mach. Intell. | 1 |
| 1991 | SYMAN: a symmetry analyzerabstractA description is given of the construction of a symmetry analyzer. Examples using SYMAN on both real and synthetic images are shown. SYMAN's combination of both global and local methods is discussed. The derivation of a global analytic solution for the skew axes when the degree of skew symmetry is known is described. A local tangent-based algorithm which has advantages over previous methods is presented.> Ari D. Gross, Terrance E. Boult |
CVPR | 1 |
| 1990 | An algorithm to recover generalized cylinders from a single intensity viewabstractA general method is presented for recovering straight homogeneous generalized cylinders from monocular intensity images. In this method, it is assumed that the generalized cylinder being recovered has purely diffuse reflectance and that the diffuse reflectance coefficient is constant. It is demonstrated that contour information alone is insufficient to recover a straight homogeneous generalized cylinder uniquely. It is shown that the sign and magnitude of the Gaussian curvature at a point vary among members of a contour-equivalent class. The contour image fails to constrain two parameters of the underlying generalized cylinder, the 3D axis tilt and translation. A method for ruling straight homogeneous generalized cylinder images is described. Once the rulings of the image have been recovered, all parameters derivable from contour alone can be recovered, all parameters derivable from contour alone can be recovered. To recover the two remaining parameters (modulo scale) not constrained by image contour, additional information must be incorporated into the recovery process, e.g. intensity information. A method for recovering the tilt of the object using the ruled contour image and intensity values along extremal cross-section curves is derived, along with a method for recovering the location of the object's 3D axis from intensity values along meridians of the surface. The methods outlined constitute an algorithm for recovering all the shape parameters (modulo scale).> Ari D. Gross, Terrance E. Boult |
ICRA | 1 |
| 1989 | Straight homogeneous generalized cylinders: analysis of reflectance properties and a necessary condition for class membershipabstractConsideration is given to two membership tests for straight homogeneous generalized cylinders to determine if an object in the image is a member of the shape class. It is shown that contour information alone is insufficient to recover a straight homogeneous generalized cylinder uniquely. It is then shown that the sign and magnitude of the Gaussian curvature at a point vary among members of a contour-equivalent class. Next, a method of ruling straight homogeneous generalized cylinder images is developed. This ruling of the surface serves two functions. First, the ruling algorithm provides a heuristic test of whether or not the image is consistent with that of a straight homogeneous generalized cylinder. Secondly, the ruling makes explicit certain parameters of the underlying straight homogeneous generalized cylinder that the authors use in their second membership test. The second membership test is an intensity-based method which assumes that the surface has geodesics and that the albedo is constant. The method compares intensity values at corresponding meridian points along cross-sectional geodesics.> Ari D. Gross, Terrance E. Boult |
SMC | 1 |
| 1988 | Error Of Fit Measures For Recovering Parametric SolidsabstractParametric models of objects are becoming increasingly more impor- tant in computer vision. In the past few years, a number of researchers have investigated the recovery of a class of parametric models by the minimization of an error of fit measure. The measures used have typ- ically been chosen in an ad hoc fashion. This paper looks at how these measures affect the performance of a recovery system. This research can be divided into two parts. The first studies the biases of the po- tential error-of-fit measures with respect to the parameters recovered and examines the cross-sectional shape of their respective error of fit surfaces. This study is done in simulation by holding all but one pa- rameter constant. The second part of the research compares two of the better error of fit measures by using them in a recovery system. Both the number of iterations and the quality of the reconstruction are considered. Ari D. Gross, Terrance E. Boult |
ICCV | 1 |