基于颜色直方图及双树复小波变换（DTCWT）的昆虫图像识别

为了给生产单位害虫管理的普通技术人员提供简便易操作的昆虫鉴别方法, 本文提出了一种新颖的基于图像颜色及纹理特征的昆虫图像识别方法。鳞翅目昆虫翅面图像经过预处理, 确定目标区域, 再进行特征提取。首先将彩色图像从三原色(red-green-blue, RGB)空间转换至色调饱和值（HSV）空间并提取有效区域内的色度、饱和度直方图特征, 然后经图像位置校准, 提取灰度图的双树复小波变换（DTCWT）特征; 匹配首先计算两颜色直方图特征向量之间的相关性, 将相关性大于阈值的样本再进一步用DTCWT特征匹配; DTCWT匹配通过计算Canberra距离实现, 从通过第一层颜色匹配的样本中取出最近邻作为最终匹配类别。算法在包含100类鳞翅目昆虫的图像库中进行试验验证, 取得了76%的识别率, 其中前翅识别率则达92%, 同时取得了理想的时间性能。试验结果证明了本文方法的有效性。     

基于PET医学图像边缘检测算法的研究

目的:边缘检测在图像处理中至关重要,可被广泛应用于目标区域识别、区域形状检测、图像分割等图像分析领域。边缘是图像中不平稳现象和不规则结构的重要表现,往往携带着图像中的大量信息,并给出图像轮廓。在医学图像三维显示技术中,为了更精确的临床判别需要得到单像素的清晰轮廓,因此我们提出一种新的边缘检测算法。方法:在传统的小波边缘检测的基础上,提出了一种新的边缘算法,即基于小波极大值边缘检测算法,应用模糊算法构造相应的隶属函数,再对得到的极大值进一步筛选。结果:将该算法应用到医学图像中,最终可以得到较清楚的单像素边缘轮廓,实验结果证明了该算法的可行性。结论:运用这种算法处理过的医学图像边缘锐化更好,更清晰,能够为肿瘤的早期识别提供依据,满足医学影像识别的需要。     

基于颜色名和OpponentSIFT特征的鳞翅目昆虫图像识别

【目的】本研究旨在探索使用先进的计算机视觉技术实现对昆虫图像的自动分类方法。【方法】通过预处理对采集的昆虫标本图像去除背景,获得昆虫图像的前景蒙板,并由蒙板确定的轮廓计算出前景图像的最小包围盒,剪切出由最小包围盒确定的前景有效区域,然后对剪切得到的图像进行特征提取。首先提取颜色名特征,把原来的RGB（Red-Green-Blue）图像的像素值映射到11种颜色名空间,其值表示RGB值属于该颜色名的概率,每个颜色名平面划分成3×3像素大小的网格,用每格的概率均值作为网格中心点的描述子,最后用空阈金字塔直方图统计的方式形成颜色名视觉词袋特征;其次提取OpponentSIFT(Opponent Scale Invariant Feature Transform)特征,首先把RGB图像变换到对立色空间,对该空间每通道提取SIFT特征,最后用空域池化和直方图统计方法形成OpponentSIFT视觉词袋。将两种词袋特征串接后得到该昆虫图像的特征向量。使用昆虫图像样本训练集提取到的特征向量训练SVM（Support Vector Machine）分类器,使用这些训练得到的分类器即可实现对鳞翅目昆虫的分类识别。【结果】该方法在包含10种576个样本的昆虫图像数据库中进行了测试,取得了100%的识别正确率。【结论】试验结果证明基于颜色名和OpponentSIFT特征可以有效实现对鳞翅目昆虫图像的识别。     

超声图像处理中Snake模型研究

Snake模型是一种基于高层信息的有效目标轮廓提取算法,其优点是作用过程及最后结果的目标轮廓是一条完整的曲线,从而引起广泛的关注。鉴于医学超声图像的信噪比较低,用经典的边缘提取算法无法得到较好的结果,因此人们将Snake模型进行了各种各样的改进,并且越来越多地将它运用到医学超声图像处理中来。本文对乳腺超声图像进行阈值分割、形态滤波等一系列预处理后,将改进的Snake模型对乳腺超声图像进行肿瘤的边缘提取,得到了比较好的结果。     

基于动态方向梯度矢量流模型的脑肿瘤图像分割

目的:针对GVF Snake模型算法收敛容易陷入局部极小值及对初始轮廓位置敏感等缺点,提出一种动态方向梯度矢量流模型(DDGVF),使其更适合医学图像的分割。方法:利用主动轮廓模型的提取和跟踪特定区域内目标轮廓的方法,将其应用于医学图像如CT、MRI和超声图像的处理,以获取特定器官及组织的轮廓。结果:动态方向梯度矢量流场(DDGVF)能够较好地提取出脑肿瘤图像。结论:利用该方法能够较好地分割提取出脑肿瘤图像的肿瘤病变区域,为进一步对其纹理和形状等特征进行描述和分析提供了可靠的依据。     

基于Snake模型的医学图像分割

基于Snake模型的图像分割技术是近年来图像处理领域的研究热点之一。Snake模型承载上层先验知识并融合了图像的底层特征,针对医学图像的特殊性,能有效地应用于医学图像的分割中。本文对各种基于Snake模型的改进算法和进化模型进行了研究,并重点梳理了最新的研究成果,以利于把握基于Snake模型的医学图像分割方法的脉络和发展方向。     

磁共振肿瘤矩特征信息研究

目的:采用MR脑肿瘤图像分割与矩方法进行结合,以获取特定器官及组织的轮廓。方法:对MR脑肿瘤图像进行分割,并对分割的结果进行矩描述。通过分析当前常用的医学图像分割方法,采用了一种基于形变模型的医学图像分割方法,并按照相应的理论算法模型和实现步骤对医学图像进行了处理,最后用Visual C 6.0编程,并对MR脑肿瘤图像进行分割实验。结果:从切割的图形中可以看出,本分割方法分割边界清晰,总体不确定性较小,利用矩技术所提取的图像特征在基于内容的图像检索中是有效的。结论:本分割方法切实可行,分割效果较好,为进一步的MR脑肿瘤图像分析和研究提供了一种有效工具。     

基于VTK的医学图像三维可视化系统

医学图像的三维可视化可以通过可视化工具包（VTK）提供的API实现。VTK是医学图像可视化的开法工具包,它把可视化的算法封装起来,利用简单的代码生成所需图形。基于VTK的医学图像三维可视化系统阐述了如何借助VTKAPI读入二维医学图像序列、操作二维图像、重建三维图像以及进行三维图像可视化的全套方案,为临床医生的诊断、治疗提供了有益的途径。     

基于多孔小波融合的PET/CT 图像增强及其评价

目的:为解决融合图像视觉效果增强与量化信息损失之间的矛盾,本文提出一种基于非降采样的多孔小波(àtrous wavelet)分解的PET/CT图像融合方法,使得融合图像既有利于肿瘤诊断又能用于放疗靶区勾画和放射性定量分析。方法:对PET和CT图像分别进行多孔小波分解,以包含肿瘤目标的适当大小的感兴趣区域的清晰度为目标函数,采用Nelder-Mead算法对PET和CT图像高频分解系数之比进行优化获得最终的融合系数,使融合图像充分增加解剖学信息的同时又尽量保持PET图像原有的局部和整体灰度信息。结果:融合图像质量评价表明,本文方法能将有价值的PET功能信息与精确的CT解剖信息结合在一起,并克服传统小波融合损失图像量化信息的不足。结论:基于多孔小波融合的PET/CT图像既能用于肿瘤诊断,又能同时用于肿瘤学放射性计算和适形放疗计划制定等量化研究。     

基于知识的颅内出血（ICH）三维医学图像分割方法

本文描述一种基于知识的三维医学图像自动分割方法,用于进行人体颅内出血(Intracranial Hemorrhage,ICH)的分割和分析。首先,数字化CT胶片,并自动对数字化后的胶片按照有无异常分类。然后,阀值结合模糊C均值聚类算法将图像分类成多个具有统一亮度的区域。最后,在先验知识以及预定义的规则的基础上,借助基于知识的专家系统将各个区域标记为背景、钙化点、血肿、颅骨、脑干。     

Local fractal dimension based ECG arrhythmia classification

We propose a local fractal dimension based nearest neighbor classifier for ECG based classification of arrhythmia. Local fractal dimension (LFD) at each sample point of the ECG waveform is taken as the feature. A nearest neighbor algorithm in the feature space is used to find the class of the test ECG beat. The nearest neighbor is found based on the RR-interval-information-biased Euclidean distance, proposed in the current work. Based on the two algorithms used for estimating the LFD, two classification algorithms are validated in the current work, viz. variance based fractal dimension estimation based nearest neighbor classifier and power spectral density based fractal dimension estimation based nearest neighbor classifier. Their performances are evaluated based on various figures of merit. MIT-BIH (Massachusetts Institute of Technology - Boston’s Beth Israel Hospital) Arrhythmia dataset has been used to validate the algorithms. Along with showing good performance against all the figures of merit, the proposed algorithms also proved to be patient independent in the sense that the performance is good even when the test ECG signal is from a patient whose ECG is not present in the training ECG dataset.     

集成改进KNN算法预测蛋白质亚细胞定位

基于Adaboost算法对多个相似性比对K最近邻(K-nearest neighbor,KNN)分类器集成实现蛋白质的亚细胞定位预测。相似性比对KNN算法分别以氨基酸组成、二肽、伪氨基酸组成为蛋白序列特征,在KNN的决策阶段使用Blast比对决定蛋白质的亚细胞定位。在Jackknife检验下,Adaboost集成分类算法提取3种蛋白序列特征,3种特征在数据集CH317和Gram1253的最高预测成功率分别为92.4%和93.1%。结果表明Adaboost集成改进KNN分类预测方法是一种有效的蛋白质亚细胞定位预测方法。     

Possibility Study of Scale Invariant Feature Transform (SIFT) Algorithm Application to Spine Magnetic Resonance Imaging

The purpose of this study is an application of scale invariant feature transform (SIFT) algorithm to stitch the cervical-thoracic-lumbar (C-T-L) spine magnetic resonance (MR) images to provide a view of the entire spine in a single image. All MR images were acquired with fast spin echo (FSE) pulse sequence using two MR scanners (1.5 T and 3.0 T). The stitching procedures for each part of spine MR image were performed and implemented on a graphic user interface (GUI) configuration. Moreover, the stitching process is performed in two categories; manual point-to-point (mPTP) selection that performed by user specified corresponding matching points, and automated point-to-point (aPTP) selection that performed by SIFT algorithm. The stitched images using SIFT algorithm showed fine registered results and quantitatively acquired values also indicated little errors compared with commercially mounted stitching algorithm in MRI systems. Our study presented a preliminary validation of the SIFT algorithm application to MRI spine images, and the results indicated that the proposed approach can be performed well for the improvement of diagnosis. We believe that our approach can be helpful for the clinical application and extension of other medical imaging modalities for image stitching.     

Using an Improved SIFT Algorithm and Fuzzy Closed-Loop Control Strategy for Object Recognition in Cluttered Scenes

Partial occlusions, large pose variations, and extreme ambient illumination conditions generally cause the performance degradation of object recognition systems. Therefore, this paper presents a novel approach for fast and robust object recognition in cluttered scenes based on an improved scale invariant feature transform (SIFT) algorithm and a fuzzy closed-loop control method. First, a fast SIFT algorithm is proposed by classifying SIFT features into several clusters based on several attributes computed from the sub-orientation histogram (SOH), in the feature matching phase only features that share nearly the same corresponding attributes are compared. Second, a feature matching step is performed following a prioritized order based on the scale factor, which is calculated between the object image and the target object image, guaranteeing robust feature matching. Finally, a fuzzy closed-loop control strategy is applied to increase the accuracy of the object recognition and is essential for autonomous object manipulation process. Compared to the original SIFT algorithm for object recognition, the result of the proposed method shows that the number of SIFT features extracted from an object has a significant increase, and the computing speed of the object recognition processes increases by more than 40%. The experimental results confirmed that the proposed method performs effectively and accurately in cluttered scenes.     

Classifying G-protein coupled receptors with support vector machines

MOTIVATION: The enormous amount of protein sequence data uncovered by genome research has increased the demand for computer software that can automate the recognition of new proteins. We discuss the relative merits of various automated methods for recognizing G-Protein Coupled Receptors (GPCRs), a superfamily of cell membrane proteins. GPCRs are found in a wide range of organisms and are central to a cellular signalling network that regulates many basic physiological processes. They are the focus of a significant amount of current pharmaceutical research because they play a key role in many diseases. However, their tertiary structures remain largely unsolved. The methods described in this paper use only primary sequence information to make their predictions. We compare a simple nearest neighbor approach (BLAST), methods based on multiple alignments generated by a statistical profile Hidden Markov Model (HMM), and methods, including Support Vector Machines (SVMs), that transform protein sequences into fixed-length feature vectors. RESULTS: The last is the most computationally expensive method, but our experiments show that, for those interested in annotation-quality classification, the results are worth the effort. In two-fold cross-validation experiments testing recognition of GPCR subfamilies that bind a specific ligand (such as a histamine molecule), the errors per sequence at the Minimum Error Point (MEP) were 13.7% for multi-class SVMs, 17.1% for our SVMtree method of hierarchical multi-class SVM classification, 25.5% for BLAST, 30% for profile HMMs, and 49% for classification based on nearest neighbor feature vector Kernel Nearest Neighbor (kernNN). The percentage of true positives recognized before the first false positive was 65% for both SVM methods, 13% for BLAST, 5% for profile HMMs and 4% for kernNN.     

植物空间分布格局中邻体距离的概率分布模型及参数估计

最近邻体法是一类有效的植物空间分布格局分析方法,邻体距离的概率分布模型用于描述邻体距离的统计特征,属于常用的最近邻体法之一。然而,聚集分布格局中邻体距离(个体到个体)的概率分布模型表达式复杂,参数估计的计算量大。根据该模型期望和方差的特性,提出了一种简化的参数估计方法,并利用遗传算法来实现参数优化,结果表明遗传算法可以有效地估计的该模型的两个参数。同时,利用该模型拟合了加拿大南温哥华岛3个寒温带树种的空间分布数据,结果显示:该概率分布模型可以很好地拟合美国花旗松(P.menziesii)和西部铁杉(T.heterophylla)的邻体距离分布,但由于西北红柏(T.plicata)存在高度聚集的团簇分布,拟合结果不理想;美国花旗松在样地中近似随机分布,空间聚集参数对空间尺度的依赖性不强,但西北红柏和西部铁杉空间聚集参数具有尺度依赖性,随邻体距离阶数增加而变大。最后,讨论了该模型以及参数估计方法的优势和限制。     

Accurate prediction of enzyme subfamily class using an adaptive fuzzy k-nearest neighbor method

Amphiphilic pseudo-amino acid composition (Am-Pse-AAC) with extra sequence-order information is a useful feature for representing enzymes. This study first utilizes the k-nearest neighbor (k-NN) rule to analyze the distribution of enzymes in the Am-Pse-AAC feature space. This analysis indicates the distributions of multiple classes of enzymes are highly overlapped. To cope with the overlap problem, this study proposes an efficient non-parametric classifier for predicting enzyme subfamily class using an adaptive fuzzy r-nearest neighbor (AFK-NN) method, where k and a fuzzy strength parameter m are adaptively specified. The fuzzy membership values of a query sample Q are dynamically determined according to the position of Q and its weighted distances to the k nearest neighbors. Using the same enzymes of the oxidoreductases family for comparisons, the prediction accuracy of AFK-NN is 76.6%, which is better than those of Support Vector Machine (73.6%), the decision tree method C5.0 (75.4%) and the existing covariant-discriminate algorithm (70.6%) using a jackknife test. To evaluate the generalization ability of AFK-NN, the datasets for all six families of entirely sequenced enzymes are established from the newly updated SWISS-PROT and ENZYME database. The accuracy of AFK-NN on the new large-scale dataset of oxidoreductases family is 83.3%, and the mean accuracy of the six families is 92.1%.     

Prediction of tyrosine sulfation with mRMR feature selection and analysis

Protein tyrosine sulfation is a ubiquitous post-translational modification (PTM) of secreted and transmembrane proteins that pass through the Golgi apparatus. In this study, we developed a new method for protein tyrosine sulfation prediction based on a nearest neighbor algorithm with the maximum relevance minimum redundancy (mRMR) method followed by incremental feature selection (IFS). We incorporated features of sequence conservation, residual disorder, and amino acid factor, 229 features in total, to predict tyrosine sulfation sites. From these 229 features, 145 features were selected and deemed as the optimized features for the prediction. The prediction model achieved a prediction accuracy of 90.01% using the optimal 145-feature set. Feature analysis showed that conservation, disorder, and physicochemical/biochemical properties of amino acids all contributed to the sulfation process. Site-specific feature analysis showed that the features derived from its surrounding sites contributed profoundly to sulfation site determination in addition to features derived from the sulfation site itself. The detailed feature analysis in this paper might help understand more of the sulfation mechanism and guide the related experimental validation.     

On the computation of the tertiary structure of globular proteins

A method is presented to compute the approximate locations of α carbon atoms of proteins using experimentally obtainable information. This information consists of distances between nearest neighbor α carbon atoms, locations of SS bonds, primary sequence of amino acids as reflected by hydrophobic and hydrophylic residues and the assumption of globularity. The method permits the reconstruction of structure similar to the real ones, and is readily extendable to compute structures more accurately by incorporating additional information.