An efficient algorithm is presented to label the connected components in an array representation of 2D images. A new data structure is suggested to maintain the equivalence table that makes use of a modified version o...
详细信息
ISBN:
(纸本)0769510620
An efficient algorithm is presented to label the connected components in an array representation of 2D images. A new data structure is suggested to maintain the equivalence table that makes use of a modified version of union-find algorithms. The operations supported by the equivalence table enable aggressive reuse of labels and (lower) bound the size of the table to [N/2]+1 for an N/spl times/N image. It is also shown that the maintenance of the table has an overall linear amortized cost.
In this paper a new technique for partitioning a non-rigid body (human body), when it is in affine motion is presented. The technique is based on finding the contour in the "modified difference frame". These...
详细信息
In this paper a new technique for partitioning a non-rigid body (human body), when it is in affine motion is presented. The technique is based on finding the contour in the "modified difference frame". These contours can then be used in identifying the regions of interest. Results show that the technique eliminates a lot of stationary regions and thus can reduce the amount of computational time required for the processing of the image. It reduces significantly the total bit rate required for transmission. It also provides an algorithm for contour tracing using extended boundary concept and contour compression by contour merging.
Emerging trends in computer design attempt to include specific solutions for handling images also in general-purpose computers, because of the current spread of multimedia, imageprocessing and computergraphics appli...
详细信息
ISBN:
(纸本)0818691948
Emerging trends in computer design attempt to include specific solutions for handling images also in general-purpose computers, because of the current spread of multimedia, imageprocessing and computergraphics applications. In this context, this paper proposes hardware pre-fetching techniques specific for caching images: the main issue we state is that most algorithms working opt images exhibit a 2D spatial locality that is not taken into account in current cache organization and data access strategies. To this aim we propose an adaptive local pre-fetching for the image data type;this technique, mirroring the two-dimensional spatial locality of imageprocessing algorithms, results to be more efficient than other approaches, such as sequential pre-fetching and adaptive pre-fetching. Performance is evaluated on different classes of imageprocessing algorithms, namely raster-scan and propagative algorithms, common in computervision and multimedia applications.
A unified framework is presented for representation and reasoning over qualitative spatial relations. The approach builds on our earlier formalism for handling topological relations (B. El-Geresy, 1997; B. El-Geresy a...
详细信息
A unified framework is presented for representation and reasoning over qualitative spatial relations. The approach builds on our earlier formalism for handling topological relations (B. El-Geresy, 1997; B. El-Geresy and A. Abdelmoty, 1997). It is shown how the formalism proposed is expressive enough to represent different types of relations in the orientation space, namely, extrinsic and intrinsic and to proximity relations. The approach proposed is applicable to objects of different types and can be used to reason over different space resolutions and granularities of relations. The main advantages of this work is that it offers a unified platform for handling different relations in the qualitative space which is a step towards developing general spatial reasoning engines for large spatial databases.
Given a database D of three dimensional (3D) objects and a target object Q, the similarity search problem (also known as good-match retrieval) is defined as finding the objects D in D that approximately match Q, possi...
详细信息
Given a database D of three dimensional (3D) objects and a target object Q, the similarity search problem (also known as good-match retrieval) is defined as finding the objects D in D that approximately match Q, possibly in the presence of rotation, translation, node insert, delete and relabeling in D or Q. This type of query arises in many AI applications. We study the similarity search problem and a class of related queries. We present a computervision based technique called geometric hashing for processing these queries. Experimental results on a database of 3D molecules obtained from the National Cancer Institute indicate the good performance of the presented technique.
Generalized Hermite polynomials in two variables are employed for the reconstruction of images from a knowledge of their zero crossing contours. The problem of reconstruction of signals as functions of two variables i...
详细信息
ISBN:
(纸本)0818688211
Generalized Hermite polynomials in two variables are employed for the reconstruction of images from a knowledge of their zero crossing contours. The problem of reconstruction of signals as functions of two variables is not a mere extension of that of a single variable. This is a consequence of the fact that the spatial and spectral characteristics of two-variable functions are quite distinct from what one can expect from their separate projections on to the coordinate axes. One of the results of the paper is that we cannot guarantee uniqueness in reconstruction unless we impose certain constraints on, for instance, space-bandwidth products/ratios in the x/spl omega//sub x/, y/spl omega//sub y/ directions, of the unknown image. Further, a distinguishing feature of the proposed approach is that the standard assumption of bandlimitedness is not invoked. The proposed framework is believed to provide a more unified procedure for signal reconstruction (of uni- and multi-dimensional signals) from partial information than most of the results of the literature. For lack of space, only the main analytical and computational results are presented.
In this paper we present a new approach to robust 3D rigid body motion estimation and scene structure recovery using an epipolar corridor. In comparison to traditional two stage approaches we do not rely on independen...
详细信息
ISBN:
(纸本)0819424358
In this paper we present a new approach to robust 3D rigid body motion estimation and scene structure recovery using an epipolar corridor. In comparison to traditional two stage approaches we do not rely on independent establishment of feature point correspondences and subsequent computation of 3D motion parameters, but iteratively feed the motion parameters back to the point correspondence estimator, restricting the search space to an epipolar corridor. As the iterations proceed we narrow the width of the corridor and reach a stable solution with all point correspondences obeying the epipolar line constraint. The Least Median of Squares (LMedS) estimator is integrated into the 3D motion parameter estimation framework to deal with the multi-motion problem. The position of the feature points along the epipolar line finally leads to structure recovery from motion. Experimental results using real and synthetic image sequence data show the ability of the approach to robustly estimate three-dimensional motion parameters.
We present a few applications of the neural active contour model described by Venkatesh Rishikesh (see International conference on Neural Networks (ICNN-97), Houston, Texas, USA, 1997). The model, which is a neural ne...
详细信息
We present a few applications of the neural active contour model described by Venkatesh Rishikesh (see International conference on Neural Networks (ICNN-97), Houston, Texas, USA, 1997). The model, which is a neural network based on the principles of self-organization, exploits the principles of spatial isomorphism and self-organization in order to create flexible contours for characterizing shapes in images. We illustrate the versatility of the model by presenting its applications to the problems of boundary extraction, stereo vision, biomedical image analysis and digital image libraries. Only the essential ideas are described.
The authors propose an orthogonal polynomial based color texture model for color texture segmentation. The proposed model is based on a complete set of difference operators which are easily configurable from a set of ...
详细信息
The authors propose an orthogonal polynomial based color texture model for color texture segmentation. The proposed model is based on a complete set of difference operators which are easily configurable from a set of orthogonal polynomials. The operators are employed to represent a color image region as a linear combination of the operator's responses towards texture and noise. A simple statistical design of experiments paradigm is used for separating out the responses towards color texture from the responses towards noise. A local descriptor for color texture called cpronum is computed by encoding only the significant responses towards texture. Finally a global descriptor for color texture called cprospectrum is obtained by measuring the frequency of occurrences of the cpronums in the color image. The usage of the proposed color texture representation scheme is highlighted in unsupervised color texture segmentation.
Road networks are important features of satellite imagery. The main contribution of the present road detection method consists of an effective enhancement technique and an efficient segmentation technique that removes...
详细信息
暂无评论