We study the problem of recovering the approximate three-dimensional shape of an object when knowledge about the object is available. The application of knowledge-based methods to image processing tasks will help over...
详细信息
We study the problem of recovering the approximate three-dimensional shape of an object when knowledge about the object is available. The application of knowledge-based methods to image processing tasks will help overcome problems which arise from processing images using a pixel-based approach. We show that by applying domain specific knowledge, we can fully automate the derivation of the approximate shape of an object. Further, this approach can yield specific advantages over existing approaches, both in terms of computation and processing results. This is a powerful paradigm that will have applications in object recognition, robotic navigation, and domain specific scene understanding.
We propose the use of a Markov random field model for handwritten word recognition. The main advantage of Markov random field models is that they provide flexible and natural models for the interaction between spatial...
详细信息
ISBN:
(纸本)0780342534
We propose the use of a Markov random field model for handwritten word recognition. The main advantage of Markov random field models is that they provide flexible and natural models for the interaction between spatially related random variables in their neighborhood systems via clique functions. In our scheme, Gabor filters are adopted for feature extraction. A fuzzy neighborhood system is proposed and fuzzy matching measurements are developed to cope with the variability of handwritten word shapes. A relaxation labeling algorithm is used to maximize the global compatibilities of Markov random fields. The influence of neighborhood sizes and the iteration number on recognition rates of the system is investigated. Our initial experiments have shown encouraging results.
It is well known that a linearly separable set of classes is ideal for a pattern recognition task. The majority of pattern recognition research has been devoted to achieve linear separability of classes by nonlinear i...
详细信息
It is well known that a linearly separable set of classes is ideal for a pattern recognition task. The majority of pattern recognition research has been devoted to achieve linear separability of classes by nonlinear input-output mapping. We develop a novel idea of class label separation by projecting each element of the feature vector onto a manifold. The functional characteristics of the manifold associated with each feature type are learnt iteratively from the class label distribution under an optimization criterion. This process attempts to transform an n-dimensional nonlinearly separable feature classification task to an n-dimensional linearly separable problem. The burden of classifying features that are associated with multiple class labels is handled by projections of other discriminating features. This enables fast learning of the classification task by the second stage network which accepts the projected output as its input. If the classification task is modified by an addition of a feature element, the system requires iterative learning of the manifold associated with this new unit only and does not require learning of the whole set of features as seen in conventional neural networks. This iterative knowledge aggregation permits ease of fine tuning and selection of an optimal set of parameters for a given task. The above concept is demonstrated on a set of classification tasks.
A feature-based approach to tracking rigid and non-rigid facial motion is described. Feature points are characterised using Gabor wavelets and can be individually tracked by phase-based displacement estimation. In ord...
详细信息
ISBN:
(纸本)3540626603
A feature-based approach to tracking rigid and non-rigid facial motion is described. Feature points are characterised using Gabor wavelets and can be individually tracked by phase-based displacement estimation. In order to achieve robust tracking a flexible shape model is used to impose global constraints upon the local feature points and to constrain the tracker. While there are many applications in facial analysis, the approach can be used for tracking other textured objects.
A novel method for 2D shape recognition is proposed. The method employs as a dissimilarity measure the degree of morphing between a test shape and a reference shape. A physics-based approach substantiates the degree o...
详细信息
A novel method for 2D shape recognition is proposed. The method employs as a dissimilarity measure the degree of morphing between a test shape and a reference shape. A physics-based approach substantiates the degree of morphing as a deformation energy and casts the problem as an energy minimization problem. The method operates upon key segmentation points that are provided by an appropriate segmentation algorithm. The recognition paradigm is invariant to translation, rotation, and scaling. It can handle both convex and non-convex shapes. The proposed system exhibits robust recognition behavior and real-time performance in a series of experiments. The experiments also highlight the ability of the method to recognize deformable shapes.
A rigorous framework is presented for the design of nonlinear digital and analog filters. The approach followed is based on a Generalized Fock (GF) space framework developed by the Principal Investigator and T.A.W. Dw...
详细信息
A rigorous framework is presented for the design of nonlinear digital and analog filters. The approach followed is based on a Generalized Fock (GF) space framework developed by the Principal Investigator and T.A.W. Dwyer, III. A GF space is a reproducing kernel Hilbert space of discrete or continuous Volterra series with a problem-dependent weighted inner product. The optimal nonlinear filter structure is obtained by an orthogonal projection of the desired filter into the subspace spanned by the representers of interpolating, smoothing, and other design constraint functionals in the appropriate GF space. One of the attractive features of this approach is that the solutions to the filter design problem appear naturally as feedforward (FIR) or recurrent (IIR) artificial neural networks. These results are derived for a GF space F(E/sup N/) on a finite-dimensional Euclidian space E/sup N/. Generalization to functional FIR and IIR nonlinear filters follows immediately from replacing F(E/sup N/) by F(L/sub 2/(I)), where L/sub 2/(I) is the space of square integrable functions on an interval I of the real line.
This paper presents a real-time system for pedestrian tracking in sequences of grayscale images acquired by a stationary CCD camera. The objective is to integrate this system with a pedestrian control scheme for inter...
详细信息
This paper presents a real-time system for pedestrian tracking in sequences of grayscale images acquired by a stationary CCD camera. The objective is to integrate this system with a pedestrian control scheme for intersections. The system outputs the spatio-temporal coordinates of each pedestrian during the period the pedestrian is in the scene. Processing is done at three levels: raw images, blobs, and pedestrians. Our method models pedestrians as rectangular patches with a certain dynamic behavior. Kalman filtering is used to estimate pedestrian parameters. The system was implemented on a Datacube MaxVideo 20 equipped with a Datacube Max860 and was able to achieve a peak performance of over 20 frames per second. Experimental results based on indoor and outdoor scenes demonstrated the system's robustness under many difficult situations such as partial and full occlusions of pedestrians.
We propose a new technique, based on self-organization, for localizing salient contours in an image, with applications to, for instance, object and character recognition, stereopsis and motion tracking. A neuronal net...
详细信息
We propose a new technique, based on self-organization, for localizing salient contours in an image, with applications to, for instance, object and character recognition, stereopsis and motion tracking. A neuronal network which is isomorphic to the template/initial contour is created. This network acts as an active contour, which, using self-organization, undergoes deformation in an attempt to cling on to the nearest salient contour in the test image. The application areas of the model proposed are similar to "snake", but distinct from it both in the underlying mathematics and implementation. The new technique is illustrated with some examples.
We present some novel schemes for (i) pulse coding for invariant representation of shape; and (ii) a neural architecture for recognizing the encoded shape. The proposed shape encoder utilizes the properties of complex...
详细信息
We present some novel schemes for (i) pulse coding for invariant representation of shape; and (ii) a neural architecture for recognizing the encoded shape. The proposed shape encoder utilizes the properties of complex logarithmic mapping (CLM) which transforms rotation and scaling (in its domain) to shifts (in its range). In order to handle this shift, in an attempt to provide increased speed of operation, the encoder converts the CLM output to a sequence of pulses. These pulses are fed to a novel multilayered neural recognizer which (i) invokes template matching with a distinct architecture; and (ii) achieves robustness (to noise and shape deformation) by virtue of its overlapping strategy for code classification. The proposed encoder-recognizer system, which is hardware implementable by a high-speed electronic switching circuit, and can add new shapes on-line to the existing ones, is illustrated by examples.
We present a framework for matching and recognition of planar shapes based on a method from computer graphics based animation, called "shape metamorphosis". In our approach, the "degree of morphing"...
详细信息
We present a framework for matching and recognition of planar shapes based on a method from computer graphics based animation, called "shape metamorphosis". In our approach, the "degree of morphing" between two shapes is employed as a dissimilarity measure. A physics-based energy minimization approach is used for optimally computing the "degree of morphing". This measure is shown to have metric properties and invariance to translation, rotation, scaling and mirror symmetry. Experimentations in the recognition of planar shapes, hand-drawn figures, and online cursive words indicate the robustness of the recognition paradigm.
暂无评论