3D pose estimation from 2D image data is a fundamental problem in computervision. In this paper, a pose estimation method based on planar-curved features on the surface of an object is presented. this method is linea...
详细信息
ISBN:
(纸本)081867282X
3D pose estimation from 2D image data is a fundamental problem in computervision. In this paper, a pose estimation method based on planar-curved features on the surface of an object is presented. this method is linear and generally applicable to any high degree (/spl ges/2) planar-curved features. So far, the 3D pose estimation methods presented in the literature are based either on point/line features or quadratic-curved features. the methods based on point and line features have to solve the correspondence problem. As there are so many edge points and line segments in an image, to establish the correspondences of these primitives between images is very difficult and time consuming in practice. the methods based on quadratic-curved features have to solve non-linear equations which normally result in many pseudo solutions. To eliminate these extra solutions and choose the right solution is very difficult. Our method is advantageous in these aspects.
We describe a color-based identification system for 3D objects. Given a set of models with known attributes, and a scene containing one or more of these objects, the system identifies which objects are apparent in the...
详细信息
We describe a color-based identification system for 3D objects. Given a set of models with known attributes, and a scene containing one or more of these objects, the system identifies which objects are apparent in the scene. An important aspect of the system is that it integrates the use of curvature and spectral (color) attributes. Furthermore, the system employs sets of intensify images obtained through an inexpensive acquisition setup consisting of a single CCD camera and a set of three color filters. Surface signatures extracted from the scene, through color photometric stereo, are the main features employed for matching and identification. the system has been tested with excellent results on 95 observed-surfaces and 77 objects, appearing in 7 synthetic scenes and 14 real scenes.
Grey level co-occurrence features are one of the most powerful feature sets available for texture analysis. However, the moving window commonly employed to define the statistical scale at which the co-occurrence matri...
详细信息
Grey level co-occurrence features are one of the most powerful feature sets available for texture analysis. However, the moving window commonly employed to define the statistical scale at which the co-occurrence matrix is obtained assumes spatial stationarity of the underlying random field. this assumption is inappropriate in the case of natural images and may result in the mixing of different structures at various positions that can yield misleading features, affecting any subsequent analysis or classification. To minimise this problem, we present a method for obtaining co-occurrence features from the irregular tessellation of an image. Such tessellation is considered to be the result of a filtering or pre-segmentation step guaranteeing a certain degree of homogeneity within each tessellation element, and thus offering a more optimal statistical scale at each location in the image. Experimental results and a comparison between features obtained from various irregular and square tessellation elements in a set of natural texture images are presented. they show that features obtained with our method have a similar behaviour to those generated from a traditional square window.
Due to the complexity in structure and the various distortions (translation, rotation, shifting, and deformation) in different writing styles of Handwritten chinese Characters(HCCs), it is more suitable to use a struc...
详细信息
Due to the complexity in structure and the various distortions (translation, rotation, shifting, and deformation) in different writing styles of Handwritten chinese Characters(HCCs), it is more suitable to use a structural matching algorithm for computerrecognition of HCC. Relaxation matching is a powerful technique which can tolerate considerable distortion. However, most relaxation techniques so far developed for Handwritten chinese Character recognition (HCCR) are based on a probabilistic relaxation scheme. In this paper, based on local constraint of relaxation labelling and optimization theory, we apply a new relaxation matching technique to handwritten character recognition. From the properties of the compatibility constraints, several rules are devised to guide the design of the compatibility function, which plays an important role in the relaxation process. By parallel use of local contextual information of geometric relaxationship among strokes of two characters, the ambiguity between them can be relaxed iteratively to achieve optimal consistent matching.
Cham and Clarke proposed three schemes which eliminate the need of transmitting DC coefficients by estimating them from the AC component in transform image coding. Images thus generated however have inherent errors wh...
详细信息
Cham and Clarke proposed three schemes which eliminate the need of transmitting DC coefficients by estimating them from the AC component in transform image coding. Images thus generated however have inherent errors which degraded the image visual quality. In this paper, we propose a new iteration method which estimates DC coefficients from the AC component and a small portion of DC coefficients. Experiments show that an image coded using the JPEG scheme can be represented using only 10% of its DC coefficients with no or only small visible degradation in image quality. As a result about 4% to 12% more bit reduction can be achieved than the original JPEG scheme.
In order for mobile robots to interact effectively with people they will have to recognize faces. We describe a robot system that finds people, approaches them and then recognizes them. the system uses a variety of te...
详细信息
In order for mobile robots to interact effectively with people they will have to recognize faces. We describe a robot system that finds people, approaches them and then recognizes them. the system uses a variety of techniques: color vision is used to find people; vision and sonar sensors are used to approach them; a template-based patternrecognition algorithm is used to isolate the face; and a neural network is used to recognize the face. All of these processes are controlled using an intelligent robot architecture that sequences and monitors the robot's actions. We present the results of many experimental runs using an actual mobile robot finding and recognizing up to six different people.
In this paper, a learning model for an autonomous vision multi-layer architecture, called KYDON, is presented modeled and analyzed. this learning model uses a birth and death approach to derive the relationships among...
详细信息
In this paper, a learning model for an autonomous vision multi-layer architecture, called KYDON, is presented modeled and analyzed. this learning model uses a birth and death approach to derive the relationships among the parameters used in the learning characteristic function. In addition the two critical (deletion and saturation) points on the learning curve are evaluated. these points represent two extreme states on the learning process. the KYDON architecture consists of 'k' layers of array processors. the lowest layers consist of lower-level processing layers, and the rest consist of higher-level processing layers. the interconnectivity of the PEs in each array is based on a full hexagonal mesh structure. KYDON uses graph models to represent and process the knowledge, extracted from the image. the knowledge base of KYDON is distributed among its PE's.
GENET has been shown to be efficient and effective on certain hard or large constraint satisfaction problems. Although GENET has been enhanced to handle also the atmost and illegal constraints in addition to binary co...
详细信息
GENET has been shown to be efficient and effective on certain hard or large constraint satisfaction problems. Although GENET has been enhanced to handle also the atmost and illegal constraints in addition to binary constraints, it is deficient in handling non binary constraints in general. We present E-GENET, an extended GENET. E-GENET features a convergence and learning procedure similar to that of GENET and a generic representation scheme for general constraints, which range from disjunctive constraints to non linear constraints to symbolic constraints. We have implemented an efficient prototype of E-GENET for single processor machines. Benchmarking results confirms the efficiency and flexibility of E-GENET. Our implementation also compares well against CHIP, PROCLANN, and GENET.
Smart sensors that perform retina-like functions in the analog optical domain using optically cascaded smart-pixel array is being developed for performing operations. It shows that each element of the smart-pixel arra...
详细信息
ISBN:
(纸本)0780314700
Smart sensors that perform retina-like functions in the analog optical domain using optically cascaded smart-pixel array is being developed for performing operations. It shows that each element of the smart-pixel array has a detector pair laid out with 'doughnut' and 'doughnut-hole' geometries. A microlens forms a demagnified image of a 'neighborhood' of the input pattern on the detector pair, and the smart pixel circuitry produces an optical output that is a function of the contrast between the central region of the neighborhood and the surrounding region. the same general scheme can be used to further process the image formed by the optical outputs of the smart-pixel array. A different computation, such as oriented edge detection, is implemented by appropriately modifying the detector geometries.
the four main characteristic architectures for low-level image processing are the square processor array (SPA) or mesh, the linear processor array (LPA) or scanning array, the pipeline (PL) and the pyramid (PYR). In t...
详细信息
the four main characteristic architectures for low-level image processing are the square processor array (SPA) or mesh, the linear processor array (LPA) or scanning array, the pipeline (PL) and the pyramid (PYR). In this paper a theoretical study is presented which leads from a taxonomy of low-level image processing operations and a theoretical model of a nearest neighbour connected processor to the combinations of 7 possibilities to exchange parallel for sequential solutions when designing an architecture. the implementation of two "standard" image processing routines on the theoretical processor, skeletonization of a binary image and shading correction in a greyvalue image, while making the design decisions in line withthe solutions commonly found in the four characteristic architectures, showed that linear processor arrays when properly designed, seem to offer the best speed/efficiency combination even for processing images at video speed.
暂无评论