A novel fuzzy clustering algorithm for the analysis of axillary lymph node tissue sections

Recently Fourier Transform Infrared (FTIR) spectroscopic imaging has been used as a tool to detect the changes in cellular composition that may reflect the onset of a disease. This approach has been investigated as a mean of monitoring the change of the biochemical composition of cells and providing a diagnostic tool for various human cancers and other diseases. The discrimination between different types of tissue based upon spectroscopic data is often achieved using various multivariate clustering techniques. However, the number of clusters is a common unknown feature for the clustering methods, such as hierarchical cluster analysis, k-means and fuzzy c-means. In this study, we apply a FCM based clustering algorithm to obtain the best number of clusters as given by the minimum validity index value. This often results in an excessive number of clusters being created due to the complexity of this biochemical system. A novel method to automatically merge clusters was developed to try to address this problem. Three lymph node tissue sections were examined to evaluate our new method. These results showed that this approach can merge the clusters which have similar biochemistry. Consequently, the overall algorithm automatically identifies clusters that accurately match the main tissue types that are independently determined by the clinician.     

Networks for sorting multitonic sequences

Lee and Batcher have designed networks that efficiently merge k separately provided sorted sequences of known lengths totalling n. We show that the design is still possible, and in fact easier to describe, if we do not make use of the lengths, or even the directions of monotonicity, of the individual sequences—the sequences can be provided in a single undelimited concatenation of length n. The depth of the simplest resulting network to sort sequences that are “k-tonic” and of length n is , generalizing Batcher's 1968 results for the extreme values of k (k=2 corresponding to merging, and k=n/2 corresponding to general sorting).The exposition is self-contained and can serve even as an introduction to sorting networks and Batcher's results.     

Image segmentation towards new image representation methods

Very low bit-rate video coding has recently become one of the most important areas of image communication and a large variety of applications have already been identified. Since conventional approaches are reaching a saturation point, in terms of coding efficiency, a new generation of video coding techniques, aiming at a deeper “understanding” of the image, is being studied. In this context, image analysis, particularly the identification of objects or regions in images (segmentation), is a very important step. This paper describes a segmentation algorithm based on split and merge. Images are first simplified using mathematical morphology operators, which eliminate perceptually less relevant details. The simplified image is then split according to a quad tree structure and the resulting regions are finally merged in three steps: merge, elimination of small regions and control of the number of regions.     

行为优化提升软件配置管理

软件配置管理包括对代码、文档、数据等的管理,其优劣受限于项目成员的实际操作。开发人员对于工作区如何使用;成员之间的代码是不是可以及时更新与同步;怎样使用分支,如何进行变更合并,才能减少物理空间浪费和事件延迟。这些问题在实际的项目开发中往往被忽视,亦或团队并没有对成员行为作细节的规范,因而许多软件项目出现了工期推迟或代码质量不高等问题。为此提出了一系列管理措施,通过优化软件配置管理规范项目各成员的行为,以保证高效的软件配置管理的实施。     

用Word邮件合并功能套打固定格式的毕业证书

邮件合并是Word提供的一种非常重要的实用功能,如能巧妙应用将大大减轻工作量。本文通过毕业证书的套打,根据Word邮件合并功能和Excel函数域功能,以解决问题的思路为顺序,论述了毕业证书套打设计工作的方法和步骤,详细介绍了邮件合并的使用,对实现批量打印非常有用。     

基于分水岭和区域合并的图像分割算法*

提出一种应用分水岭与区域合并相结合的图像分割算法.本方法首先利用数学形态学分水岭算法对图像进行分割,然后对分割后的图像进行相似区域合并,以减少分水岭方法产生的过分割现象,从而得到较好的分割效果.     

基于HDFS的小文件存储与读取优化策略

本文对HDFS分布式文件系统进行了深入的研究,在HDFS中以流式的方式访问大文件时效率很高但是对海量小文件的存取效率比较低. 本文针对这个问题提出了一个基于关系数据库的小文件合并策略,首先为每个用户建立一个用户文件,其次当用户上传小文件时把文件的元数据信息存入到关系数据库中并将文件追加写入到用户文件中,最后用户读取小文件时通过元数据信息直接以流式方式进行读取. 此外当用户读取小于一个文件块大小的文件时还采取了数据节点负载均衡策略,直接由存储数据的DataNode传送给客户端从而减轻主服务器压力提高文件传送效率. 实验结果表明通过此方案很好地解决了HDFS对大量小文件存取支持不足的缺点,提高了HDFS文件系统对海量小文件的读写性能,此方案适用于具有海量小文件的云存储系统,可以降低NameNode内存消耗提高文件读写效率.     

基于小波神经网络信息融合的板材拉深故障诊断研究

总结了板材拉深试冲时的综合故障及原因,应用小波技术加混合式数据融合方法,将数据级、特征级和决策级融合通过神经网络方法综合在一起,对板材拉深试冲时的缺陷进行智能诊断,描述了小波神经网络的建模过程,探讨了通过多源互补信息减少故障诊断系统不确定性的优化方法,并给出了诊断结果。     

基于样本密度和分类误差率的增量学习矢量量化算法研究

作为一种简单而成熟的分类方法, K最近邻(K nearest neighbor, KNN)算法在数据挖掘、模式识别等领域获得了广泛的应用, 但仍存在计算量大、高空间消耗、运行时间长等问题. 针对这些问题, 本文在增量学习型矢量量化(Incremental learning vector quantization, ILVQ)的单层竞争学习基础上, 融合样本密度和分类误差率的邻域思想, 提出了一种新的增量学习型矢量量化方法, 通过竞争学习策略对代表点邻域实现自适应增删、合并、分裂等操作, 快速获取原始数据集的原型集, 进而在保障分类精度基础上, 达到对大规模数据的高压缩效应. 此外, 对传统近邻分类算法进行了改进, 将原型近邻集的样本密度和分类误差率纳入到近邻判决准则中. 所提出算法通过单遍扫描学习训练集可快速生成有效的代表原型集, 具有较好的通用性. 实验结果表明, 该方法同其他算法相比较, 不仅可以保持甚至提高分类的准确性和压缩比, 且具有快速分类的优势.     

快速二维中值滤波算法及其FPGA硬件设计

针对数字图像噪声抑制过程中去噪性能要求较高、处理速度要求较快的问题,以常规中值滤波算法为基础,提出用归并插入排序算法来实现5×5快速中值滤波器的方案。通过对滤波窗口中行列像素点以及对角线上的像素点的归并插入排序,得到窗口的中值,在Xilinx的ISE10.0软件开发环境下成功完成该算法硬件设计。相比常规算法,该方案简单易行、运算速度快,能够满足实时性的要求,易在现场可编程门阵列（FPGA ）上实现,为实时性要求较高的图像去噪领域提供了可靠的技术支持。