Allen R. Tannenbaum
Stony Brook University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Allen R. Tannenbaum.
IEEE Transactions on Image Processing | 2008
Shawn Lankton; Allen R. Tannenbaum
In this paper, we propose a natural framework that allows any region-based segmentation energy to be re-formulated in a local way. We consider local rather than global image statistics and evolve a contour based on local information. Localized contours are capable of segmenting objects with heterogeneous feature profiles that would be difficult to capture correctly using a standard global method. The presented technique is versatile enough to be used with any global region-based active contour energy and instill in it the benefits of localization. We describe this framework and demonstrate the localization of three well-known energies in order to illustrate how our framework can be applied to any energy. We then compare each localized energy to its global counterpart to show the improvements that can be achieved. Next, an in-depth study of the behaviors of these energies in response to the degree of localization is given. Finally, we show results on challenging images to illustrate the robust and accurate segmentations that are possible with this new class of active contour models.
IEEE Transactions on Automatic Control | 1985
Pramod P. Khargonekar; Kameshwar Poolla; Allen R. Tannenbaum
This paper considers the use and design of linear periodic time-varying controllers for the feedback control of linear time-invariant discrete-time plants. We will show that for a large class of robustness problems, periodic compensators are superior to time-invariant ones. We will give explicit design techniques which can be easily implemented. In the context of periodic controllers, we also consider the strong and simultaneous stabilization problems. Finally, we show that for the problem of weighted sensitivity minimization for linear time-invariant plants, time-varying controllers offer no advantage over the time-invariant ones.
international conference on computer vision | 1995
Satyanad Kichenassamy; Arun Kumar; Peter J. Olver; Allen R. Tannenbaum; Anthony J. Yezzi
In this paper, we analyze the geometric active contour models discussed previously from a curve evolution point of view and propose some modifications based on gradient flows relative to certain new feature-based Riemannian metrics. This leads to a novel snake paradigm in which the feature of interest may be considered to lie at the bottom of a potential well. Thus the snake is attracted very naturally and efficiently to the desired feature. Moreover, we consider some 3-D active surface models based on these ideas.<<ETX>>
IEEE Transactions on Medical Imaging | 1997
Anthony J. Yezzi; Satyanad Kichenassamy; Arun Kumar; Peter J. Olver; Allen R. Tannenbaum
We employ the new geometric active contour models, previously formulated, for edge detection and segmentation of magnetic resonance imaging (MRI), computed tomography (CT), and ultrasound medical imagery. Our method is based on defining feature-based metrics on a given image which in turn leads to a novel snake paradigm in which the feature of interest may be considered to lie at the bottom of a potential well. Thus, the snake is attracted very quickly and efficiently to the desired feature.
International Journal of Computer Vision | 1995
Benjamin B. Kimia; Allen R. Tannenbaum; Steven W. Zucker
We undertake to develop a general theory of two-dimensional shape by elucidating several principles which any such theory should meet. The principles are organized around two basic intuitions: first, if a boundary were changed only slightly, then, in general, its shape would change only slightly. This leads us to propose an operational theory of shape based on incremental contour deformations. The second intuition is that not all contours are shapes, but rather only those that can enclose “physical” material. A theory of contour deformation is derived from these principles, based on abstract conservation principles and Hamilton-Jacobi theory. These principles are based on the work of Sethian (1985a, c), the Osher-Sethian (1988), level set formulation the classical shock theory of Lax (1971; 1973), as well as curve evolution theory for a curve evolving as a function of the curvature and the relation to geometric smoothing of Gage-Hamilton-Grayson (1986; 1989). The result is a characterization of the computational elements of shape: deformations, parts, bends, and seeds, which show where to place the components of a shape. The theory unifies many of the diverse aspects of shapes, and leads to a space of shapes (the reaction/diffusion space), which places shapes within a neighborhood of “similar” ones. Such similarity relationships underlie descriptions suitable for recognition.
IEEE Transactions on Image Processing | 1996
Yu-Li You; Wenyuan Xu; Allen R. Tannenbaum; Mostafa Kaveh
In this paper, we analyze the behavior of the anisotropic diffusion model of Perona and Malik (1990). The main idea is to express the anisotropic diffusion equation as coming from a certain optimization problem, so its behavior can be analyzed based on the shape of the corresponding energy surface. We show that anisotropic diffusion is the steepest descent method for solving an energy minimization problem. It is demonstrated that an anisotropic diffusion is well posed when there exists a unique global minimum for the energy functional and that the ill posedness of a certain anisotropic diffusion is caused by the fact that its energy functional has an infinite number of global minima that are dense in the image space. We give a sufficient condition for an anisotropic diffusion to be well posed and a sufficient and necessary condition for it to be ill posed due to the dense global minima. The mechanism of smoothing and edge enhancement of anisotropic diffusion is illustrated through a particular orthogonal decomposition of the diffusion operator into two parts: one that diffuses tangentially to the edges and therefore acts as an anisotropic smoothing operator, and the other that flows normally to the edges and thus acts as an enhancement operator.
Archive for Rational Mechanics and Analysis | 1996
Satyanad Kichenassamy; Arun Kumar; Peter J. Olver; Allen R. Tannenbaum; Anthony J. Yezzi
In this paper, we analyze geometric active contour models from a curve evolution point of view and propose some modifications based on gradient flows relative to certain new feature-based Riemannian metrics. This leads to a novel edge-detection paradigm in which the feature of interest may be considered to lie at the bottom of a potential well. Thus an edge-seeking curve is attracted very naturally and efficiently to the desired feature. Comparison with the Allen-Cahn model clarifies some of the choices made in these models, and suggests inhomogeneous models which may in return be useful in phase transitions. We also consider some 3-dimensional active surface models based on these ideas. The justification of this model rests on the careful study of the viscosity solutions of evolution equations derived from a level-set approach.
Systems & Control Letters | 1991
Bassam Bamieh; J. Boyd Pearson; Bruce A. Francis; Allen R. Tannenbaum
A lifting technique is developed for periodic linear systems and applied to the H∞ and H2 sampled-data control problems.
IEEE Transactions on Visualization and Computer Graphics | 2000
Steven Haker; Sigurd Angenent; Allen R. Tannenbaum; Ron Kikinis; Guillermo Sapiro; Michael Halle
We give an explicit method for mapping any simply connected surface onto the sphere in a manner which preserves angles. This technique relies on certain conformal mappings from differential geometry. Our method provides a new way to automatically assign texture coordinates to complex undulating surfaces. We demonstrate a finite element method that can be used to apply our mapping technique to a triangulated geometric description of a surface.
International Journal of Computer Vision | 1993
Guillermo Sapiro; Allen R. Tannenbaum
A newaffine invariant scale-space for planar curves is presented in this work. The scale-space is obtained from the solution of a novel nonlinear curve evolution equation which admits affine invariant solutions. This flow was proved to be the affine analogue of the well knownEuclidean shortening flow. The evolution also satisfies properties such ascausality, which makes it useful in defining a scale-space. Using an efficient numerical algorithm for curve evolution, this continuous affine flow is implemented, and examples are presented. The affine-invariant progressive smoothing property of the evolution equation is demonstrated as well.