Last update: July 27, 2005
Publications by Benjamin Kimia et al. :
BibTeX references
Christopher M. Cyr, Benjamin B. Kimia
International Journal of Computer Vision (IJCV),
April 2004, Volume 57, Issue 1, pp. 5-22
This paper describes a view-based method for recognizing 3D objects from 2D images. We employ an aspect-graph structure, where the aspects are not based on the singularities of visual mapping but are instead formed using a notion of similarity between views. Specifically, the viewing sphere is endowed with a metric of dis-similarity for each pair of views and the problem of aspect generation is viewed as a "segmentation" of the viewing sphere into homogeneous regions. The viewing sphere is sampled at regular (5 degree) intervals and an iterative procedure is used to combine views using the metric into aspects with a prototype representing each aspect, in a "region-growing" regime which stands in contrast to the usual "edge detection" styles to computing the aspect graph. The aspect growth is constrained such that two aspects of an object remain distinct under the given similarity metric. Once the database of 3D objects is organized as a set of aspects and prototypes for these aspects for each object, unknown views of database objects are compared with the prototypes and the results are ordered by similarity. We use two similarity metrics for shape, one based on curve matching and the other based on matching shock graphs, which for a database of 64 objects and unknown views of objects for the database give (90.3%, 74.2%, 59.7%) and (95.2%, 69.0%, 57.5%), respectively, for the top three matches; identification based on the top three matches is 98% and 100%, respectively. The result of indexing unknown views of objects not in the database also produce intuitive matches. We also develop a hierarchical indexing scheme the goal of which is to prune unlikely objects at an early stage to improve the efficiency of indexing, resulting in savings of 35% at the top level and of 55% at the next level, cumulatively.
Keywords: 3D object recognition, aspect-graph, view-based recognition, shape similarity, characteristic views.
Benjamin B. Kimia, Ilana Frankel, Ana-Maria Popescu
International Journal of Computer Vision (IJCV),
August - October 2003, Volume 54, Issue 1-3, pp. 159-182
Special Issue: Special Issue on Computational Vision at Brown University
In this paper we address the curve completion problem, e.g., the geometric continuation of boundaries of objects which are temporarily interrupted by occlusion. Also known as the gap completion or shape completion problem, this problem is a significant element of perceptual grouping of edge elements and has been approached by using cubic splines or biarcs which minimize total curvature squared (elastica), as motivated by a physical analogy. Our approach is motivated by railroad design methods of the early 1900's which connect two rail segments by "transition curves", and by the work of Knuth on mathematical typography. We propose that in using an energy minimizing solution completion curves should not penalize curvature as in elastica but curvature variation. The minimization of total curvature variation leads to an Euler Spiral solution, a curve whose curvature varies linearly with arclength. We reduce the construction of this curve from a pair of points and tangents at these points to solving a nonlinear system of equations involving Fresnel Integrals, whose solution relies on optimization from a suitable initial condition constrained to satisfy given boundary conditions. Since the choice of an appropriate initial curve is critical in this optimization, we analytically derive an optimal solution in the class of biarc curves, which is then used as the initial curve. The resulting interpolations yield intuitive interpolation across gaps and occlusions, and are extensible, in contrast to the scale-invariant version of elastica. In addition, Euler Spiral segments can be used in other applications of curve completions, e.g., modeling boundary segments between curvature extrema or modeling skeletal branch geometry.
Thomas B. Sebastian, Philip N. Klein & Benjamin B. Kimia
ECCV'02 (7th European Conference on Computer Vision),
Copenhagen, Denmark
Volume 3, pp. 731-746, May 2002.
Lecture Notes in Computer Science, no. 2351, Springer.
Anders Heyden, Gunnar Sparr, Mads Nielsen, Peter Johansen (Eds.)
Tek, Huseyin and Benjamin B. Kimia
Journal of Mathematical Imaging and Vision, volume 14, number 3, pp. 211-223, 2001.
This paper proposes a smoothing technique for shape based on a perturbation analysis of the underlying medial axis, and by iteratively removing skeletal branches. While medial axis regularization usually aims at dealing with its sensitivity in the context of applications such as recognition, we use it here to smooth shape. The approach overcomes a basic drawback with current smoothing techniques, namely, the rounding of perceptually salient corners. The key idea is that the instability of the skeleton under a family of deformations can be dealt with via a symmetry transform which is applied to all related symmetry branches so as to effect an appropriate change in the shape. This leads to the notion of a splice transform which removes a branch coupled with simultaneous changes in the skeleton. In contrast to point-based pruning techniques which use local salience and which cannot construct coarse-scale corners, our approach constructs and preserves coarse-scale curvature extrema, leading to a "scale-discrete scale-space" for shape. The approach is also applicable to the smoothing of incomplete shapes represented as a set of curve segments.
Keywords: Smoothing, medial axis, symmetry set, pruning medial axis, coarse-scale corners.
Philip N. Klein, Thomas B. Sebastian & Benjamin B. Kimia
Proceedings of the Twelfth Annual Symposium on
Discrete Algorithms (SODA),
January 7-9, 2001, Washington, DC, USA. ACM/SIAM, pp. 781-790.
F.
F. Leymarie & B. B. Kimia
ISMM'00, June 2000, Palo Alto, CA, USA
in "Math. Morphology & its Applications to Image & Signal
Processing",
J. Goutsias, L. Vincent & D. Bloomberg, ed.,
Kluwer Academic, Computational Imaging & Vision series, v.18, 2000,
pp.351-360.
Hüseyin Tek and Benjamin B. Kimia
International Journal of Computer Vision (IJCV),
August - October 2003, Volume 54, Issue 1-3, pp. 35-81
Special Issue: Special Issue on Computational Vision at Brown University
This paper presents an approach for computing the symmetries (skeletons) of an edge map consisting of a collection of curve segments. This approach is a combination of analytic computations in the style of computational geometry and discrete propagations on a grid in the style of the numerical solutions of PDE's. Specifically, waves from each of the initial curve segments are initialized and propagated as a discrete wavefront along discrete directions. In addition, to avoid error built up due to the discrete nature of propagation, shockwaves are detected and explicitly propagated along a secondary dynamic grid. The propagation of shockwaves, integrated with the propagation of the wavefront along discrete directions, leads to an exact simulation of propagation by the Eikonal equation. The resulting symmetries are simply the collection of shockwaves formed in this process which can be manipulated locally, exactly, and efficiently under local changes in an edge map (gap completion, removal of spurious elements, etc). The ability to express grouping operations in the language of symmetry maps makes it an appropriate intermediate representation between low-level edge maps and high level object hypotheses.
Keywords: shape, medial axis, symmetry set, shock detection, perceptual
organization.
The in vivo investigation of joint kinematics in normal and injured
wrist requires the segmentation of carpal bones from 3D (CT) images,
and their registration over time. The non-uniformity of bone tissue,
ranging from dense cortical bone to textured spongy bone, the irregular
shape of closely packed carpal bones, small inter-bone spaces compared
to the resolution of CT images, along with the presence of blood
vessels, and the inherent blurring of CT imaging render the
segmentation of carpal bones a challenging task. We review the
performance of statistical classification, deformable models (active
contours), region growing, region competition, and morphological
operations for this application. We then propose a model which combines
several of these approaches in a unified framework. Specifically, our
approach is to use a curve evolution implementation of region growing
from initialized seeds, where growth is modulated by a
skeletally-mediated competition between neighboring regions. The
inter-seed skeleton, which we interpret as the predicted boundary of
collision between two regions, is used to couple the growth of seeds
and to mediate long-range competition between them. The implementation
requires subpixel representations of each growing region as well as the
inter-region skeleton. This method combines the advantages of active
contour models, region growing, and both local and global region
competition methods. We demonstrate the effectiveness of this approach
for our application where many of the difficulties presented above are
overcome as illustrated by synthetic and real examples. Since this
segmentation method does not rely on domain-specific knowledge, it
should be applicable to a range of other medical imaging segmentation
tasks.
Page created & maintained by Frederic F. Leymarie,
2000-5
Comments, suggestions, etc., mail to: ffl at gold dot
ac dot uk