On generating solid models of mechanical parts through fuzzy clustering

A fuzzy self-tuning controller based on fuzzy clustering algorithmis proposed in the paper. First of all, the adaptive fuzzy clustering algorithm is presented to confirm the structure of fuzzy model. The Kalman filtering method is used to confirm parameters of fuzzy model. On the basis of the proposed method, the parameters of the controller can be automatically adjusted. To demonstrate the performance of the proposed method, simulation on the nonlinear system is performed. The results show that this method provides effective and accurate control.

Statistical as well as adaptive clustering approaches are being currently used for both segmentation and vector quantization of medical images. However, a comparative evaluation of both approaches has rarely been done to identify the efficacy of such approaches to specific applications, for example, image segmentation and vector quantization. The rate distortion functions of three clustering algorithms, namely, the statistical based deterministic annealing, the adaptive fuzzy leader clustering algorithm, and LBG, have been computed for vector quantization using multi-scale vectors in the wavelet domain. Such comparative evaluation serves as a guide for proper selection of clustering algorithms for global codebook generation in vector quantization and for image segmentation.

The silicon content of molten iron is a key index to reveal the thermal state in the blast furnace (BF). To improve the quality of molten iron, it is important to obtain silicon content online accurately. However, owing to the harsh environment in BF hearth, it is difficult to realize the online measurement of the silicon content of molten iron. To handle this problem, a novel soft sensoring method based on adaptive stacked polymorphic model is proposed. First, an adaptive uncertain fuzzy clustering algorithm (AUFC) is utilized to obtain the distribution characteristics and reduce the complexity of the process data, thereby the training samples are divided into several sub-classes. Second, the adaptive weight echo state network (AW-ESN) and time difference AW-ESN (TD-AWESN) are proposed to establish polymorphic models. Inspired by the stacking strategy, sub-models based on stacked polymorphic model are designed, which can effectively solve the time-varying and the strong nonlinear problems in the BF ironmaking process. Third, to avoid model degradation caused by the changes of working conditions, an ensemble strategy is adopted to combine the predicted results of multiple sub-models. The experimental results in an industrial BF show that the soft sensor based on an adaptive polymorphic model can reach the required prediction accuracy and provide reliable silicon content.

Cluster analysis is an unsupervised most important research topics in the field of pattern recognition. Fuzzy clustering from the sample to the category of uncertainty description, it is possible to more objectively reflect the real world. Traditional fuzzy clustering algorithm can not achieve the optimal allocation of the number of clusters is calculated automatically. In this paper, by adopting the idea of hierarchical clustering, one can automatically and efficiently determine the optimal number of clusters of new adaptive fuzzy c-means clustering algorithm-A-FCM algorithm. Numerical experiments show that the other through a variety of validity function to determine the number of clusters of adaptive fuzzy clustering algorithm, the better the performance of the method.

This paper considers the segmentation of range image measurements into surface patches which are either plane or curved and which are described formally by a function. After a formal description of the segmentation, we present and compare three methods suited for plane and curved patch segmentation and show the results of experiments conducted for testing their practical behaviour. The two first methods use the classical approach of region growing whereas the third method is based on a relaxation process. This original and last method exhibits simplicity and low computational complexity. Thanks to its parallel nature, it can be considered as a good candidate for range image segmentation in real-time applications.

This paper addresses the problem of incremental and on-line learning of indoor dynamic environments by mobile robots. The proposed method further improves the Enhanced Adaptive Fuzzy Clustering (EAFC) algorithm for segment detection by using probabilistic techniques. In this study, the environment boundaries is extracted by the AFC algorithm and the probabilistic technique is used to estimate and update the state of dynamic objects in the mobile robot workplace. The method has been implemented and tested in a Pioneer II mobile robot.

A technique to generate a photorealistic three-dimensional (3D) image and color-textured model using a dedicated optical digitizer is presented. The proposed technique is started with the range and texture image acquisition from different viewpoints, followed by the registration and integration of multiple range images to get a complete and nonredundant point cloud that represents a real-life object. The accuracy of the range image and the precision of correspondence between the range image and texture image are guaranteed by sensor system calibration. Based on the point cloud, a geometric model is established by considering the connectivity of adjacent range image points. In order to enhance the photorealistic effect, we suggest a texture blending technique that utilizes a composite-weight strategy to blend the texture images within the overlapped region. This technique allows more efficient removal of the artifacts existing in the registered texture image, leading to a 3D image with photorealistic quality and color-texture modeling. Experimental results are also presented to testify to the validity of the proposed method.

Multi-view range image registration is a significant and challenging problem for 3D modeling. This paper presents a reference shape based multi-view range image registration algorithm. First, a set of Rotational Projection Statistics (RoPS) features are extracted from the input range images. Next, the reference shape is initialized by selecting a range image from the input. The reference shape is then iteratively updated by registering itself with the remaining range images. The registration between the reference shape and any range image is completed by RoPS feature matching. Finally, all input range images are registered according to their corresponding reference shapes. A number of experiments were performed to test the performance of our algorithm. The experimental results show that the reference shape based algorithm can perform multi-view registration on a mixed set of unordered range images corresponding to several different objects. It is also very accurate and efficient. It outperformed the state-of-the-arts including the spanning tree based and connected graph based algorithms.

An adaptive range image coding algorithm for the geometry compression of large-scale 3D point clouds (LS3DPCs) is proposed in this work. A terrestrial laser scanner generates an LS3DPC by measuring the radial distances of objects in a real world scene, which can be mapped into a range image. In general, the range image exhibits different characteristics from an ordinary luminance or color image, and thus the conventional image coding techniques are not suitable for the range image coding. We propose a hybrid range image coding algorithm, which predicts the radial distance of each pixel using previously encoded neighbors adaptively in one of three coordinate domains: range image domain, height image domain, and 3D domain. We first partition an input range image into blocks of various sizes. For each block, we apply multiple prediction modes in the three domains and compute their rate-distortion costs. Then, we perform the prediction of all pixels using the optimal mode and encode the resulting prediction residuals. Experimental results show that the proposed algorithm provides significantly better compression performance on various range images than the conventional image or video coding techniques

Based on the spherical harmonics representation of image formation, we derive a new photometric metric for evaluating the correctness of a given rigid transformation aligning two overlapping range images captured under unknown, distant, and general illumination. We estimate the surrounding illumination and albedo values of points of the two range images from the point correspondences induced by the input transformation. We then synthesize the color of both range images using albedo values transferred using the point correspondences to compute the photometric reprojection error. This way allows us to accurately register two range images by finding the transformation that minimizes the photometric reprojection error. We also propose a practical method using the proposed photometric metric to register pairs of range images devoid of salient geometric features, captured under unknown lighting. Our method uses a hypothesize-and-test strategy to search for the transformation that minimizes our photometric metric. Transformation candidates are efficiently generated by employing the spherical representation of each range image. Experimental results using both synthetic and real data demonstrate the usefulness of the proposed metric.

Time-of-flight range imaging cameras measure distance to objects in their field of view, but are prone to error when objects move. At least three raw frames are required to obtain one range image, and the standard method is to read out raw frames into separate sets and process to find one range image per set. Motion during the acquisition of a set causes error in the corresponding range image. In this paper, the problem of motion is addressed by regarding the raw data from each pixel as a noisy time series, and using the Kalman filter to efficiently perform time-series analysis. The proposed method adapts to the effects of transverse motion, measuring a sharp range image at each raw frame. The error in the proposed method is less than the traditional approach in 80% of tests, with no detected increase in the STD due to noise. In the qualitative experimental results, the visible blur is reduced.

Despite the ubiquitous use of range images in various computer vision applications, little has been investigated about the size variation of the local geometric structures captured in the range images. In this paper, we show that, through canonical geometric scale-space analysis, this geometric scale-variability embedded in a range image can be exploited as a rich source of discriminative information regarding the captured geometry. We extend previous work on geometric scale-space analysis of 3D models to analyze the scale-variability of a range image and to detect scale-dependent 3D features – geometric features with their inherent scales. We derive novel local 3D shape descriptors that encode the local shape information within the inherent support region of each feature. We show that the resulting set of scale-dependent local shape descriptors can be used in an efficient hierarchical registration algorithm for aligning range images with the same global scale. We also show that local 3D shape descriptors invariant to the scale variation can be derived and used to align range images with significantly different global scales. Finally, we demonstrate that the scale-dependent/invariant local 3D shape descriptors can even be used to fully automatically register multiple sets of range images with varying global scales corresponding to multiple objects.KeywordsGeodesic DistanceShape DescriptorRange ImageRegistration AlgorithmAutomatic RegistrationThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Computer vision researchers have been frustrated in their attempts to automatically derive depth information from conventional two-dimensional intensity images. Research on shape from texture, shape from shading, and shape from focus is still in a laboratory stage and had not seen much use in commercial machine vision systems. A range image or a depth map contains explicit information about the distance from the sensor to the object surfaces within the field of view in the scene. Information about surface geometry which is important for, say, three-dimensional object recognition is more easily extracted from 2 1/2 D range images than from 2D intensity images. As a result, both active sensors such as laser range finders and passive techniques such as multi-camera stereo vision are being increasingly utilized by vision researchers to solve a variety of problems. This book contains chapters written by distinguished computer vision researchers covering the following areas: Overview of 3D Vision Range Sensing Geometric Processing Object Recognition Navigation Inspection Multisensor Fusion A workshop report, written by the editors, also appears in the book. It summarizes the state of the art and proposes future research directions in range image sensing, processing, interpretation, and applications. The book also contains an extensive, up-to-date bibliography on the above topics. This book provides a unique perspective on the problem of three-dimensional sensing and processing; it is the only comprehensive collection of papers devoted to range images. Both academic researchers interested in research issues in 3D vision and industrial engineers in search of solutions to particular problems will find this a useful reference book.

An on-line 3D registration system is introduced to reconstruct a 3D model using a hand-held stereo camera. Multi-view range images, which are obtained from the hand-held stereo camera, are registered into a reference coordinate system simultaneously. For the coarse registration of a range image, we use the transformation of its previous frame and the centroid of foreground range images. After refining the coarse registration using a geometric feature matching technique, we use a modified KLT (Kanade-Lucas-Tomasi) tracker to match photometric features to enhance registration accuracy. We modify the KLT tracker to facilitate searching of correspondence from the results of the geometric registration. If a range image fails to register, we adjust the orientation of the camera while viewing a graphical user interaction system. After enough range images are registered, they are integrated into a 3D model in offline. Experimental results show that the proposed method can be used to reconstruct 3D models fast and accurately.

This paper presents two novel algorithms for estimating the (local and global) motion in a series of range images based on a polynomial expansion. The use of polynomial expansion has been quite successful in estimating optical flow in 2D imagery, but has not been used extensively in 3D or range imagery. In both methods, each range image is approximated by applying a high-order polynomial expansion to local neighborhoods within the range image. In the local motion algorithm, these approximations are then used to derive the translation or displacement estimation within the local neighborhoods from frame to frame within the series of range images (also known as range image flow). An iterative method for computing the local translations is presented. In the global motion algorithm, a global motion model framework is utilized to compute a global motion estimation based on the polynomial expansion of the range images. We evaluate the algorithms on several real-world range image sequences with promising results.