一种基于图像矢量量化压缩的数据隐藏方法

根据码书中所有码字之间的最近邻关系,采用最近邻方法标记码书使得所有码字与其最近邻码字的标记值不同。在此基础上,运用I/矩阵运算可在矢量量化压缩图像的每n=2m个码字索引中有选择地最多修改m2」个从而嵌入m比特数据。计算机上的仿真实验结果表明：该方法不仅具有较大的嵌入容量,而且具有较好的隐蔽性,可用于矢量量化压缩图像中的信息隐藏。     

一种新的基于遗传算法的动态聚类算法

为了在聚类数不明确的情况下实现聚类分析,提出一种新的结合最近邻聚类和遗传算法的动态聚类算法.新算法包括两个阶段:第一阶段用最近邻聚类算法根据最近邻方法把最相似的实例分到同一个簇中并根据一些相似性或相异性度量过滤掉噪声数据从而得到初始聚类集,第二阶段是遗传优化阶段,利用动态聚类评估函数,动态地合并初始聚类集,从而获得接近最优的解.最后对算法进行了实验仿真,实验结果表明方法在事先不知道聚类数的情况下能够有效地进行聚类.     

Log-polar height maps for multiple range image registration

We propose a method for coarse registration of multiple range images that uses a log-polar height map (LPHM) as the key for establishing correspondence. The LPHM is a local height map orthogonally mapped on the tangent plane with the log-polar coordinate system. The input range images are roughly represented by signed distance field (SDF) samples. For each SDF sample, an LPHM is generated and is converted to an invariant feature vector. Point correspondence is established by a nearest neighbor search in feature space. The RANSAC algorithm is applied on the corresponding point pairs between each pair of range images, and the pairwise registration of input range images is determined by the extracted inlier point pairs. Finally, the global registration is determined by constructing a view tree, which is the spanning tree that maximizes the total number of inlier point pairs. The result of coarse registration is used as the initial state of the fine registration and modeling. The proposed method was tested on multiple real range image datasets.     

DECODE: a new method for discovering clusters of different densities in spatial data

When clusters with different densities and noise lie in a spatial point set, the major obstacle to classifying these data is the determination of the thresholds for classification, which may form a series of bins for allocating each point to different clusters. Much of the previous work has adopted a model-based approach, but is either incapable of estimating the thresholds in an automatic way, or limited to only two point processes, i.e. noise and clusters with the same density. In this paper, we present a new density-based cluster method (DECODE), in which a spatial data set is presumed to consist of different point processes and clusters with different densities belong to different point processes. DECODE is based upon a reversible jump Markov Chain Monte Carlo (MCMC) strategy and divided into three steps. The first step is to map each point in the data to its mth nearest distance, which is referred to as the distance between a point and its mth nearest neighbor. In the second step, classification thresholds are determined via a reversible jump MCMC strategy. In the third step, clusters are formed by spatially connecting the points whose mth nearest distances fall into a particular bin defined by the thresholds. Four experiments, including two simulated data sets and two seismic data sets, are used to evaluate the algorithm. Results on simulated data show that our approach is capable of discovering the clusters automatically. Results on seismic data suggest that the clustered earthquakes, identified by DECODE, either imply the epicenters of forthcoming strong earthquakes or indicate the areas with the most intensive seismicity, this is consistent with the tectonic states and estimated stress distribution in the associated areas. The comparison between DECODE and other state-of-the-art methods, such as DBSCAN, OPTICS and Wavelet Cluster, illustrates the contribution of our approach: although DECODE can be computationally expensive, it is capable of identifying the number of point processes and simultaneously estimating the classification thresholds with little prior knowledge.     

融合多重实例关系的无监督跨模态哈希检索

大多数跨模态哈希检索方法仅使用余弦相似度进行特征匹配,计算方式过于单一,没有考虑到实例的关系对于性能的影响.为此,提出一种基于多重实例关系图推理的方法,通过构造相似度矩阵,建立全局和局部的实例关系图,充分挖掘实例之间的细粒度关系.在多重实例关系图的基础上进行相似度推理,首先分别进行图像模态和文本模态关系图内部的推理,然后将模态内的关系映射到实例图中进行推理,最后执行实例图内部的推理.此外,为了适应图像和文本两种模态的特点,使用分步训练策略训练神经网络.在MIRFlickr和NUS-WIDE数据集上实验表明,提出的方法在mAP指标上具有很明显的优势,在Top-k-Precision曲线上也获得良好的效果.这也说明所提方法对实例关系进行深入挖掘,从而显著地提升检索性能.     

一种基于降维密度聚类的船舶异常轨迹识别方法

目的 有效分析和探索海洋船舶时空轨迹行为模式,提高船舶轨迹聚类的效率与质量,更好地检测真实船舶的异常行为。方法 针对当前船舶轨迹数据研究中存在的对多维特征信息利用不足、检测效率不高、检测精度较差等问题,提出一种精确度高、能自主识别分析多维特征的船舶异常轨迹识别方法。首先利用随机森林分类器评估多维特征重要性,构建轨迹特征的最优组合;然后提出一种降维密度聚类方法,将T–分布随机邻域嵌入(T–SNE)和自适应密度聚类(DBSCAN)模型结合,通过构建特征选择层和无监督聚类层实现对数据元素非线性关系的高效提取以及对聚类参数的智能选择;最后根据聚类结果构建类簇特征向量,计算距离阈值判别轨迹相似度,实现轨迹异常检测模型的构建。结果 以UCI数据集为例,降维密度聚类方法对4、13、30、64维特征数据集的F1分数能达到0.9 048、0.9 534、0.8 218、0.6 627,多个聚类指标均优于DBSCAN、K–Means等常见聚类算法的。结论 研究结果表明,降维密度聚类方法能有效提取数据多维特征结构,实现聚类参数自适应,弥补密度聚类中参数难以确定的问题,有效实现对多种类型船舶轨迹异常的识别。     

基于K-近邻算法的物料含水率测量标准装置设计

目的 针对烘箱法耗时长且不适用于生产现场的问题,围绕短时干燥法设计物料含水率测量标准装置。方法 装置主要包括移动底盘、箱体、水分分析仪、可充电电源、配电板、工业触屏电脑以及上位机软件。建立基于K-近邻（K-Nearest Neighbor）算法的物料含水率预测模型,并通过实验获得预测结果与烘箱法测量结果之间的修正关系。以抽取自卷烟厂的烟草样品为例,对装置进行测量实验。结果 当设置测量时间为30min时,含水率测量结果的扩展不确定度低于0.5%。结论 该装置可代替烘箱法对物料含水率进行监控,也可以用于在线水分仪的原位校准。     

基于混合搜索算法的贴片机贴装过程优化

贴片机是PCB组装生产线中的瓶颈设备,提高其贴装效率对整个生产线有重要意义;针对该设备的生产效率优化问题,提出了由最近邻算法和分散搜索算法组成的混合算法;本算法将使用最近邻算法求解元器件的拾取贴装顺序并通过将其引入到分散搜索的框架中求解喂料器分配问题,使两个子问题的求解过程相互结合,从而更好完成贴装效率的优化;仿真结果表明,在大多数情况下该算法都能够在取得优于原有最近邻算法的效果;说明该算法能够更好的提高贴片机的贴装效率.     

Fast k most similar neighbor classifier for mixed data (tree k-MSN)

The k nearest neighbor (k-NN) classifier has been a widely used nonparametric technique in Pattern Recognition, because of its simplicity and good performance. In order to decide the class of a new prototype, the k-NN classifier performs an exhaustive comparison between the prototype to classify and the prototypes in the training set T. However, when T is large, the exhaustive comparison is expensive. For this reason, many fast k-NN classifiers have been developed, some of them are based on a tree structure, which is created during a preprocessing phase using the prototypes in T. Then, in a search phase, the tree is traversed to find the nearest neighbor. The speed up is obtained, while the exploration of some parts of the tree is avoided using pruning rules which are usually based on the triangle inequality. However, in soft sciences as Medicine, Geology, Sociology, etc., the prototypes are usually described by numerical and categorical attributes (mixed data), and sometimes the comparison function for computing the similarity between prototypes does not satisfy metric properties. Therefore, in this work an approximate fast k most similar neighbor classifier, for mixed data and similarity functions that do not satisfy metric properties, based on a tree structure (Tree k-MSN) is proposed. Some experiments with synthetic and real data are presented.