Results 11  20
of
185
Hybrid Image Segmentation Using Watersheds and Fast Region Merging
 IEEE transactions on Image Processing
, 1998
"... Abstract—A hybrid multidimensional image segmentation algorithm is proposed, which combines edge and regionbased techniques through the morphological algorithm of watersheds. An edgepreserving statistical noise reduction approach is used as a preprocessing stage in order to compute an accurate est ..."
Abstract

Cited by 88 (1 self)
 Add to MetaCart
Abstract—A hybrid multidimensional image segmentation algorithm is proposed, which combines edge and regionbased techniques through the morphological algorithm of watersheds. An edgepreserving statistical noise reduction approach is used as a preprocessing stage in order to compute an accurate estimate of the image gradient. Then, an initial partitioning of the image into primitive regions is produced by applying the watershed transform on the image gradient magnitude. This initial segmentation is the input to a computationally efficient hierarchical (bottomup) region merging process that produces the final segmentation. The latter process uses the region adjacency graph (RAG) representation of the image regions. At each step, the most similar pair of regions is determined (minimum cost RAG edge), the regions are merged and the RAG is updated. Traditionally, the above is implemented by storing all RAG edges in a priority queue. We propose a significantly faster algorithm, which additionally maintains the socalled nearest neighbor graph, due to which the priority queue size and processing time are drastically reduced. The final segmentation provides, due to the RAG, onepixel wide, closed, and accurately localized contours/surfaces. Experimental results obtained with twodimensional/threedimensional (2D/3D) magnetic resonance images are presented. Index Terms — Image segmentation, nearest neighbor region merging, noise reduction, watershed transform. I.
Edge Detection Techniques  An Overview
 INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND IMAGE ANALYSIS
, 1998
"... In computer vision and image processing, edge detection concerns the localization of significant variations of the grey level image and the identification of the physical phenomena that originated them. This information is very useful for applications in 3D reconstruction, motion, recognition, image ..."
Abstract

Cited by 81 (2 self)
 Add to MetaCart
In computer vision and image processing, edge detection concerns the localization of significant variations of the grey level image and the identification of the physical phenomena that originated them. This information is very useful for applications in 3D reconstruction, motion, recognition, image enhancement and restoration, image registration, image compression, and so on. Usually, edge detection requires smoothing and differentiation of the image. Differentiation is an illconditioned problem and smoothing results in a loss of information. It is difficult to design a general edge detection algorithm which performs well in many contexts and captures the requirements of subsequent processing stages. Consequently, over the history of digital image processing a variety of edge detectors have been devised which differ in their mathematical and algorithmic properties. This paper is an account of the current state of our understanding of edge detection. We propose an overview of research...
ScaleInvariant Shape Features for Recognition of Object Categories
 Proc. IEEE Int’l Conf. Computer Vision and Pattern Recognition
, 2004
"... We introduce a new class of distinguished regions based on detecting the most salient convex local arrangements of contours in the image. The regions are used in a similar way to the local interest points extracted from graylevel images, but they capture shape rather than texture. Local convexity i ..."
Abstract

Cited by 67 (15 self)
 Add to MetaCart
We introduce a new class of distinguished regions based on detecting the most salient convex local arrangements of contours in the image. The regions are used in a similar way to the local interest points extracted from graylevel images, but they capture shape rather than texture. Local convexity is characterized by measuring the extent to which the detected image contours support circle or arclike local structures at each position and scale in the image. Our saliency measure combines two cost functions defined on the tangential edges near the circle: a tangentialgradient energy term, and an entropy term that ensures local support from a wide range of angular positions around the circle. The detected regions are invariant to scale changes and rotations, and robust against clutter, occlusions and spurious edge detections. Experimental results show very good performance for both shape matching and recognition of object categories. 1.
An Algorithmic Overview of Surface Registration . . .
 MEDICAL IMAGE ANALYSIS
, 2000
"... This paper presents a literature survey of automatic 3D surface registration techniques emphasizing the mathematical and algorithmic underpinnings of the subject. The relevance of surface registration to medical imaging is that there is much useful anatomical information in the form of collected ..."
Abstract

Cited by 58 (1 self)
 Add to MetaCart
This paper presents a literature survey of automatic 3D surface registration techniques emphasizing the mathematical and algorithmic underpinnings of the subject. The relevance of surface registration to medical imaging is that there is much useful anatomical information in the form of collected surface points which originate from complimentary modalities and which must be reconciled. Surface registration
Measurement and Integration of 3D Structures by Tracking Edge Lines
, 1992
"... This paper describes techniques for dynamically modeling the 2D appearance and 3D geometry of a scene by integrating information from a moving camera. These techniques are illustrated by the design of a system which constructs a geometric description of a scene from the motion of a camera mounted ..."
Abstract

Cited by 54 (6 self)
 Add to MetaCart
This paper describes techniques for dynamically modeling the 2D appearance and 3D geometry of a scene by integrating information from a moving camera. These techniques are illustrated by the design of a system which constructs a geometric description of a scene from the motion of a camera mounted on a robot arm. A framework
Regularized laplacian zero crossings as optimal edge integrators
 International Journal of Computer Vision
, 2001
"... We view the fundamental edge integration problem for object segmentation in a geometric variational framework. First we show that the classical zerocrossings of the image Laplacian edge detector as suggested by Marr and Hildreth, inherently provides optimal edgeintegration with regard to a very na ..."
Abstract

Cited by 48 (4 self)
 Add to MetaCart
We view the fundamental edge integration problem for object segmentation in a geometric variational framework. First we show that the classical zerocrossings of the image Laplacian edge detector as suggested by Marr and Hildreth, inherently provides optimal edgeintegration with regard to a very natural geometric functional. This functional accumulates the inner product between the normal to the edge and the gray level imagegradient along the edge. We use this observation to derive new and highly accurate active contours based on this functional and regularized by previously proposed geodesic active contour geometric variational models. 1.
Are Edges Incomplete?
"... . We address the problem of computing a generalpurpose early visual representation that satisfies two criteria. 1) Explicitness: To be more useful than the original pixel array, the representation must take a significant step toward making important image structure explicit. 2) Completeness: To sup ..."
Abstract

Cited by 47 (1 self)
 Add to MetaCart
. We address the problem of computing a generalpurpose early visual representation that satisfies two criteria. 1) Explicitness: To be more useful than the original pixel array, the representation must take a significant step toward making important image structure explicit. 2) Completeness: To support a diverse set of highlevel tasks, the representation must not discard information of potential perceptual relevance. The most prevalent representation in image processing and computer vision that satisfies the completeness criterion is the wavelet code. In this paper, we propose a very different code which represents the location of each edge and the magnitude and blur scale of the underlying intensity change. By making edge structure explicit, we argue that this representation better satisfies the first criterion than do wavelet codes. To address the second criterion, we study the question of how much visual information is lost in the representation. We report a novel method for inver...
Logical/Linear Operators for Image Curves
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1995
"... We propose a language for designing image measurement operators suitable for early vision. We refer to them as logical/linear (L/L) operators, since they unify aspects of linear operator theory and boolean logic. A family of these operators appropriate for measuring the loworder differential struct ..."
Abstract

Cited by 46 (7 self)
 Add to MetaCart
We propose a language for designing image measurement operators suitable for early vision. We refer to them as logical/linear (L/L) operators, since they unify aspects of linear operator theory and boolean logic. A family of these operators appropriate for measuring the loworder differential structure of image curves is developed. These L/L operators are derived by decomposing a linear model into logical components to ensure that certain structural preconditions for the existence of an image curve are upheld. Tangential conditions guarantee continuity, while normal conditions select and categorize contrast profiles. The resulting operators allow for coarse measurement of curvilinear differential structure (orientation and curvature) while successfully segregating edge and linelike features. By thus reducing the incidence of falsepositive responses, these operators are a substantial improvement over (thresholded) linear operators which attempt to resolve the same class of features. ...
Edge Detection by Helmholtz Principle
 Journal of Mathematical Imaging and Vision
, 2001
"... . We apply to edge detection a recently introduced method for computing geometric structures in a digital image, without any a priori information. According to a basic principle of perception due to Helmholtz, an observed geometric structure is perceptually \meaningful" if its number of occurences ..."
Abstract

Cited by 46 (13 self)
 Add to MetaCart
. We apply to edge detection a recently introduced method for computing geometric structures in a digital image, without any a priori information. According to a basic principle of perception due to Helmholtz, an observed geometric structure is perceptually \meaningful" if its number of occurences would be very small in a random situation: in this context, geometric structures are characterized as large deviations from randomness. This leads us to dene and compute edges and boundaries (closed edges) in an image by a parameterfree method. Maximal detectable boundaries and edges are dened, computed, and the results compared with the ones obtained by classical algorithms. Keywords: image analysis, perception, Helmholtz principle, edge detection, large deviations 1. Introduction In statistical methods for image analysis, one of the main problems is the choice of an adequate prior. For example, in the Bayesian model (Geman and Geman, 1984), given an observation \obs", the aim is to ...