Evaluation of a combined wavelet and a combined principal component analysis classification system for BCG diagnostic problem

Heart disease is one of the main factor causing death in the developed countries. Over several decades, variety of electronic and computer technology have been developed to assist clinical practices for cardiac performance monitoring and heart disease diagnosis. Among these methods, Ballistocardiography (BCG) has an interesting feature that no electrodes are needed to be attached to the body during the measurement. Thus, it is provides a potential application to asses the patients heart condition in the home. In this paper, a comparison is made for two neural networks based BCG signal classification models. One system uses a principal component analysis (PCA) method, and the other a discrete wavelet transform, to reduce the input dimensionality. It is indicated that the combined wavelet transform and neural network has a more reliable performance than the combined PCA and neural network system. Moreover, the wavelet transform requires no prior knowledge of the statistical distribution of data samples and the computation complexity and training time are reduced.

Classification of jinjiang oysters Crassostrea rivularis (Gould, 1861) from China, based on morphology and phylogenetic analysis

The jinjiang oyster Crassostrea rivularis [Gould, 1861. Descriptions of Shells collected in the North Pacific Exploring Expedition under Captains Ringgold and Rodgers. Proc. Boston Soc. Nat. Hist. 8 (April) 33-40] is one of the most important and best-known oysters in China. Based on the color of its flesh, two forms of C rivularis are recognized and referred to as the "white meat" and 11 red meat" oysters. The classification of white and red forms of this species has been a subject of confusion and debate in China. To clarify the taxonomic status of the two forms of C. rivularis, we collected and analyzed oysters from five locations along China's coast using both morphological characters and DNA sequences from mitochondrial 16S rRNA and cytochrome oxidase 1, and the nuclear 28S rRNA genes. Oysters were classified as white or red forms according to their morphological characteristics and then subjected to DNA sequencing. Both morphological and DNA sequence data suggest that the red and white oysters are two separate species. Phylogenetic analysis of DNA sequences obtained in this study and existing sequences of reference species show that the red oyster is the same species as C. ariakensis Wakiya [1929. Japanese food oysters. Jpn. J. Zool. 2, 359-367.], albeit the red oysters from north and south China are genetically distinctive. The white oyster is the same species as a newly described species from Hong Kong, C. hongkongensis Lam and Morton [2003. Mitochondrial DNA and identification of a new species of Crassostrea (Bivalvia: Ostreidae) cultured for centuries in the Pearl River Delta, Hong Kong, China. Aqua. 228, 1-13]. Although the name C. rivularis has seniority over C. ariakensis and C. hongkongensis, the original description of Ostrea rivularis by Gould [1861] does not fit shell characteristics of either the red or the white oysters. We propose that the name of C. rivularis Gould [1861] should be suspended, the red oyster should take the name C. ariakensis, and the white oyster should take the name C. hongkongensis. (C) 2004 Elsevier B.V. All rights reserved.

Classification of common oysters from North China

Oysters are commonly found on rocky shores along China's northern coast, although there is considerable confusion as to what species they are. To determine the taxonomic status of these oysters, we collected specimens from nine locations north of the Yangtze River and conducted genetic identification using DNA sequences. Fragments from three genes, mitochondrial 165 rRNA, mitochondria! cytochrome oxidase I (COI), and nuclear 285 rRNA, were sequenced in six oysters from each of the nine sites. Phylogenetic analysis of all three gene fragments clearly demonstrated that the small oysters commonly found on intertidal rocks in north China are Crassostrea gigas (Thunberg, 1793), not C. plicatula (the zhe oyster) as widely assumed. Their small size and irregular shell characteristics are reflections of the stressful intertidal environment they live in and not reliable characters for classification. Our study confirms that the oysters from Weifang, referred to as Jinjiang oysters or C. rivularis (Gould, 1861), are C. ariakensis (Wakiya, 1929). We found no evidence for the existence of C. talienwhanensis (Crosse, 1862) and other Crassostrea species in north China. Our study highlights the need for reclassifying oysters of China with molecular data.

Molecular systematics of pikas (genus Ochotona) inferred from mitochondrial DNA sequences

The phylogenetic relationships among worldwide species of genus Ochotona were investigated by sequencing mitochondrial cytochrome b and ND4 genes. Parsimony and neighbor-joining analyses of the sequence data yielded congruent results that strongly indicated three major clusters: the shrub-steppe group, the northern group, and the mountain group. The subgeneric classification of Ochotona species needs to be revised because each of the two subgenera in the present classification contains species from the mountain group. To solve this taxonomic problem so that each taxon is monophyletic, i.e., represents a natural clade, Ochotona could be divided into three subgenera, one for the shrub-steppe species, a second for the northern species, and a third for the mountain species. The inferred tree suggests that the differentiation of this genus in the Palearctic Region was closely related to the gradual uplifting of the Tibet (Qinghai-Xizang) Plateau, as hypothesized previously, and that vicariance might have played a major role in the differentiation of this genus on the Plateau, On the other hand, the North American species, O. princeps, is most likely a dispersal event, which might have happened during the Pliocene through the opening of the Bering Strait. The phylogenetic relationships within the shrub-steppe group are worth noting in that instead of a monophyletic shrub-dwelling group, shrub dwellers and steppe dwellers are intermingled with each other. Moreover, the sequence divergence within the sister tars of one steppe? dweller and one shrub dweller is very low. These findings support the hypothesis that pikes have entered the steppe environment several times and that morphological similarities within steppe dwellers were due to convergent evolution. (C) 2000 Academic Press.

旋转机械全息序列相似性匹配故障诊断方法

针对全息诊断分辨率低影响旋转机械故障诊断质量和自动化水平的问题,将时间序列相似性匹配的基本概念和方法引入故障诊断应用中,结合全息诊断信息融合分析旋转机械振动全貌的思想,定义了全息序列及其相似性度量模型,用类时间轴上的多维序列表征转子系统振动全貌,进而利用采用近似三角不等式与B+树结合剪枝策略的全息序列相似性匹配算法实现故障诊断。实验结果表明,该方法能够实现高质量的故障自动分类识别。

一个多元逐步回归的二叉树分类器的设计与实现

作者设计并实现了一个基于多变元逐步回归的二叉树分类器.在树结构和特征子集的选择中采用了穷举法,比有限制条件的选择更合理更优化.用 FORTRAN 语言实现的“遍历”二叉树,充分利用了 FORTRAN 处理可调数组的能力,并采取适当技巧,从而最大限度地利用了计算机内存.该通用分类器,可用来对任何具有统计数据的模式进行分类.在对白血球的分类中,取得了五类97%,六类92.2%的高识别率.

Distance Metric Between 3D Models and 3D Images for Recognition and Classification

Similarity measurements between 3D objects and 2D images are useful for the tasks of object recognition and classification. We distinguish between two types of similarity metrics: metrics computed in image-space (image metrics) and metrics computed in transformation-space (transformation metrics). Existing methods typically use image and the nearest view of the object. Example for such a measure is the Euclidean distance between feature points in the image and corresponding points in the nearest view. (Computing this measure is equivalent to solving the exterior orientation calibration problem.) In this paper we introduce a different type of metrics: transformation metrics. These metrics penalize for the deformatoins applied to the object to produce the observed image. We present a transformation metric that optimally penalizes for "affine deformations" under weak-perspective. A closed-form solution, together with the nearest view according to this metric, are derived. The metric is shown to be equivalent to the Euclidean image metric, in the sense that they bound each other from both above and below. For Euclidean image metric we offier a sub-optimal closed-form solution and an iterative scheme to compute the exact solution.

Some Extensions of the K-Means Algorithm for Image Segmentation and Pattern Classification

In this paper we present some extensions to the k-means algorithm for vector quantization that permit its efficient use in image segmentation and pattern classification tasks. It is shown that by introducing state variables that correspond to certain statistics of the dynamic behavior of the algorithm, it is possible to find the representative centers fo the lower dimensional maniforlds that define the boundaries between classes, for clouds of multi-dimensional, mult-class data; this permits one, for example, to find class boundaries directly from sparse data (e.g., in image segmentation tasks) or to efficiently place centers for pattern classification (e.g., with local Gaussian classifiers). The same state variables can be used to define algorithms for determining adaptively the optimal number of centers for clouds of data with space-varying density. Some examples of the applicatin of these extensions are also given.

Gait Dynamics for Recognition and Classification

This paper describes a representation of the dynamics of human walking action for the purpose of person identification and classification by gait appearance. Our gait representation is based on simple features such as moments extracted from video silhouettes of human walking motion. We claim that our gait dynamics representation is rich enough for the task of recognition and classification. The use of our feature representation is demonstrated in the task of person recognition from video sequences of orthogonal views of people walking. We demonstrate the accuracy of recognition on gait video sequences collected over different days and times, and under varying lighting environments. In addition, preliminary results are shown on gender classification using our gait dynamics features.

An Accelerated Chow and Liu Algorithm: Fitting Tree Distributions to High Dimensional Sparse Data

Chow and Liu introduced an algorithm for fitting a multivariate distribution with a tree (i.e. a density model that assumes that there are only pairwise dependencies between variables) and that the graph of these dependencies is a spanning tree. The original algorithm is quadratic in the dimesion of the domain, and linear in the number of data points that define the target distribution $P$. This paper shows that for sparse, discrete data, fitting a tree distribution can be done in time and memory that is jointly subquadratic in the number of variables and the size of the data set. The new algorithm, called the acCL algorithm, takes advantage of the sparsity of the data to accelerate the computation of pairwise marginals and the sorting of the resulting mutual informations, achieving speed ups of up to 2-3 orders of magnitude in the experiments.