Genetic algorithms for symbolic clustering

This paper introduces a novel methodology for clustering of symbolic objects by making use of Genetic Algorithms (GAs). GAs are a family of computational models inspired by evolution. These algorithms encode potential solutions to specific problems on simple chromosome-like data structures and apply recombination operators to these structures so as to preserve critical information. A new type of representation for chromosome structure is presented here along with a new method for mutation. The efficacy of the proposed method is examined by application to numeric data of known number of classes and also to assertion type of symbolic objects drawn from the domain of fat oil, microcomputers, microprocessors and botany. The validity of the clusters obtained is examined.     

An object-oriented product database using ROSE

A product database for a design and manufacturing enterprise serves as a repository for the data needed to manufacture a product. This paper discusses how an object-oriented persistent object manager named ROSE, under development at Rensselaer, has been used in the Rensselaer CIM program to develop a STEP/PDES-compliant product database for its research test bed. In so doing, it provides an overview of the requirements for a product database system in an integrated design and manufacturing facility, and it discusses how the chosen system meets these requirements.     

Nonlinear filtering structure for image smoothing in mixed-noise environments

This paper introduces a new nonlinear filtering structure for filtering image data that have been corrupted by both impulsive and nonimpulsive additive noise. Like other nonlinear filters, the proposed filtering structure uses order-statistic operations to remove the effects of the impulsive noise. Unlike other filters, however, nonimpulsive noise is smoothed by using a maximum a posteriori estimation criterion. The prior model for the image is a novel Markov random-field model that models image edges so that they are accurately estimated while additive Gaussian noise is smoothed. The Markov random-field-based prior is chosen such that the filter has desirable analytical and computational properties. The estimate of the signal value is obtained at the unique minimum of the a posteriori log likelihood function. This function is convex so that the output of the filter can be easily computed by using either digital or analog computational methods. The effects of the various parameters of the model will be discussed, and the choice of the predetection order statistic filter will also be examined. Example outputs under various noise conditions will be given.     

Combined-Stage Sintering Model

By focusing on the similarities between the three stages of sintering, a single equation is derived that quantifies sintering as a continuous process from beginning to end. The microstructure is characterized by two separate parameters representing geometry and scale. The dimensionless geometry parameter, denoted T, comprises five scaling factors that relate specific microstructural featuers (e.g., surface curvature) to the scale (grain diameter). Calculations of T from experimental data show (a) agreement with computer simulations of initial-stage sintering, (b) the effect of surface diffusion on T, and (c) changes in T with microstructural evolution during sintering. Application of the model to the design of firing schedules and the study of microstructural geometry effects on sintering is discussed.     

3D model retrieval using principal plane analysis and dynamic programming

Three dimensional models play an important role in many applications; the problem is how to select the appropriate models from a 3D database rapidly and accurately. In recent years, a variety of shape representations, statistical methods, and geometric algorithms have been proposed for matching 3D shapes or models. In this paper, we propose a 3D shape representation scheme based on a combination of principal plane analysis and dynamic programming. The proposed 3D shape representation scheme consists of three steps. First, a 3D model is transformed into a 2D image by projecting the vertices of the model onto its principal plane. Second, the convex hall of the 2D shape of the model is further segmented into multiple disjoint triangles using dynamic programming. Finally, for each triangle, a projection score histogram and moments are extracted as the feature vectors for similarity searching. Experimental results showed the robustness of the proposed scheme, which resists translation, rotation, scaling, noise, and destructive attacks. The proposed 3D model retrieval method performs fairly well in retrieving models having similar characteristics from a database of 3D models.     

语音帧间相关信息对基于HMM系统识别精度的影响

本文探讨经短时信号处理后的语音信号帧间相关信息对基于隐马尔可夫模型（ＨＭＭ）的语音识别系统识虽精度的影响，鉴于ＨＭＭ的输出独立假设导致语音帧间相关信息的损失，本文提出了一种描述帧间相关信息的统计模型－马尔可夫链（ＭＣＭ）用来弥补ＨＭＭ在这方面的缺陷；经非特定人和多话者孤立字实验表明，用ＭＣＭ作为ＨＭＭ的辅助模型，可将原有ＨＭＭ系统的识别率提高约１～６个百分点。