基于图割及均值漂移的合成孔径雷达图像强散射目标分割

针对合成孔径雷达(SAR)图像的特点及标准图割分割算法计算量较大等问题,提出了一种基于图割及均值漂移(Mean Shift)的高效的SAR图像强散射目标分割方法。该方法利用均值漂移算法对SAR图像进行预处理,将原图像表示为基于过分割区域的图结构;然后,以这些过分割图像区域为节点建立区域邻接图,运用图割分割算法得到SAR强散射目标的分割结果。与标准图割算法中以单像素为节点构建邻接图相比,参与图割算法的节点和边的数目减少了两个数量级,计算效率大幅提高。另外,根据SAR图像中目标的强散射特性,自动定义终端节点,减少了人工交互量。实验表明,该方法充分利用均值漂移及图割的优点,能够在背景杂波的干扰下有效地提取SAR强散射目标。     

一种改进的基于图割的立体匹配算法

为了提高立体匹配算法的精确度,提出了一种结合图割与Mean Shift图像分割的立体匹配算法。首先用Mean Shift算法对参考图像进行图像分割,得到分割后的标记图,然后将分割信息结合到图割算法的能量函数中,最后用改进的能量函数和图割算法得出致密的视差图。实验结果表明,提出的算法具有更高的精确度和更好的边缘特征。     

改进的基于Parzen窗算法的SAR图像目标检测

传统的Parzen窗检测算法假设目标占整个背景中较小的一部分,将SAR图像中的所有像素用于估计杂波概率密度函数,容易造成检测阈值的增大从而对不太明显的SAR图像舰船目标产生漏检。对此,提出了一种改进的Parzen窗检测算法,该算法通过自适应地设置目标窗口,将潜在的目标从检测图像中剔除,对剔除后的杂波背景采用Parzen窗进行非参数化的杂波模型估计,进而确定检测阈值,完成目标的检测。相比传统的Parzen窗检测算法,提出的SAR图像舰船目标检测算法减少了漏检数量,改善了检测性能。实测SAR图像的检测结果表明了该方法的有效性。     

基于改进遗传算法的不规则图形排样

针对大规模零件和布料优化排样问题,研究遗传算法在智能排样中的应用及其在智能优化排样中的优缺点。以传统遗传算法优化排样为基础,提出一种改进的基于遗传算法的优化排样算法,利用图形间的相似度对图形群体进行分类,降低遗传算法的时间复杂度。实验结果证明,该方法在时间复杂度上优于传统的遗传算法优化排样,适用于大规模的图形排样系统。     

新型电路版图布局布线算法设计

调研了电路自动布局布线技术的国内外研究现状,在此基础上设计了一种面向中等规模电路布局布线算法,主要用于大型版图设计软件的模块测试环节,为用户提供各模块初步的布线布局结果,方便用户高效查找并修正错误点,填补了我国在相关领域的空白.建立了超图模型并转换为图模型,改进了Stoer-Wagner算法并利用该算法和Fiduccia-Mattheyses算法对图进行了基于最小割理论的划分,从而构建出一棵划分树.在这棵树的基础上设计了一种二元相对移动算法来确定各个电路元件的位置,大大降低了布局拥挤度,提高了美观度,对于数百元件的电路均能在0.5s内得出布局结果.基于A*算法在多个方面做了改进,提高了布线速度,对于线路数1000以下的元件能在0.1 s～60 s内得出结果,实现了100％ 布通率以及均匀的布局布线效果.     

Using adjacency matrices to lay out larger small-world networks

Many networks exhibit small-world properties. The structure of a small-world network is characterized by short average path lengths and high clustering coefficients. Few graph layout methods capture this structure well which limits their effectiveness and the utility of the visualization itself. Here we present an extension to our novel graphTPP layout method for laying out small-world networks using only their topological properties rather than their node attributes. The Watts–Strogatz model is used to generate a variety of graphs with a small-world network structure. Community detection algorithms are used to generate six different clusterings of the data. These clusterings, the adjacency matrix and edgelist are loaded into graphTPP and, through user interaction combined with linear projections of the adjacency matrix, graphTPP is able to produce a layout which visually separates these clusters. These layouts are compared to the layouts of two force-based techniques. graphTPP is able to clearly separate each of the communities into a spatially distinct area and the edge relationships between the clusters show the strength of their relationship. As a secondary contribution, an edge-grouping algorithm for graphTPP is demonstrated as a means to reduce visual clutter in the layout and reinforce the display of the strength of the relationship between two communities.     

An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages

This study proposes an improved genetic algorithm to derive solutions for multi-floor facility layouts that are to have inner structure walls and passages. The proposed algorithm models the multi-floor layout of facilities on gene structures. These gene structures consist of a five-segmented chromosome. Improved solutions are produced by employing genetic operations known as selection, crossover, inversion, mutation, and refinement of these genes for successive generations. All relationships between the facilities, passages, and lifts are represented as an adjacency graph. The shortest path and distance between two facilities is calculated using Dijkstra's algorithm of the graph theory. Comparative testing shows that the proposed algorithm performs better than other existing algorithm for the multi-floor facility layout design. Finally, the proposed algorithm is applied to the multi-deck compartment layout problem of the ship with the computational result compared with the multi-deck compartment layout of the actual ship.     

类属图密集近邻搜索的视觉跟踪算法研究

提出一种基于密集近邻搜索的视觉跟踪算法,能够有效应对目标跟踪过程中出现的形变和遮挡问题.基于马尔科夫随机场建立图像分割模型,提取出目标部件,建立目标部件的类属图矩阵;通过搜索类属图矩阵中的密集近邻,得到相邻帧之间目标部件的匹配关系;通过匹配关系得到跟踪目标位置概率图,确定目标跟踪位置.实验结果表明:本文提出的方法相比其他同类方法效果更好.     

基于改进的JSEG算法的图像分割

针对JSEG算法在图像分割中出现的明显过分割现象,提出一种基于边缘信息的JSEG[1]改进方法。该方法首先将图像的颜色空间转换为LUV颜色空间,用PGF（Peer Group Filtering）[2]算法对图像进行平滑去噪,用分裂算法确定图像的类数,用GLA（Generalized Lloyd Algorithm）[3]算法完成量化,生成＂类图＂。然后计算每个像素的J值,并利用Canny算子检测的边缘信息,对J值进行修正,计算每个像素的局部相似程度,并在不同的尺寸下构建J图像,这样就能反映出最有可能的边界位置。最后在J图像上进行种子区域增长,直到获得最终的分割结果。实验结果表明该方法可以有效地改善JSEG算法在图像分割中存在的过分割现象。     

遥感图像分割中的信息割算法

提出了一种改进的信息割（MIC）算法。首先证明了信息割（IC）模型与Cauchy-Schwarz cut（CScut）等价,并通过图谱方法给出IC目标函数优化问题的最优解;其次利用 图像中像素点间的灰度和空间关联性,在IC算法的基础上提出一种MIC算法,该算法首次使用联合灰度信息和空间位置信息的Parzen窗函数来估计概率密度函数,降低了图像中灰度 变化对图像分割的影响。加噪合成图像及遥感图像分割实验结果表明MIC算法较IC算法具有更好的抗噪性能,且与图谱方法相比计算复杂度显著降低。     

Customizing a Fisheye View Algorithm to Preserve the Mental Map

Frequently, large knowledge bases are represented by graphs. Many visualization tools allow users or other applications to interact with and adjust the layouts of these graphs. One layout adjustment problem is that of showing more detail without eliding parts of the graph. Approaches based on a fisheye lens paradigm seem well suited to this task. However, many of these techniques are non-trivial to implement and their distortion techniques often cannot be altered to suit different graph layouts. When distorting a graph layout, it is often desirable to preserve various properties of the original graph in an adjusted view. Pertinent properties may include straightness of lines, graph topology, orthogonalities and proximities. However, it is normally not possible to preserve all of the original properties of the graph layout. The type of layout and its application should be considered when deciding which properties to preserve or distort. This paper describes a fisheye view algorithm which can be customized to suit various different graph layouts. In contrast to other methods, the user can select which properties of the original graph layout to preserve in an adjusted view. The technique is demonstrated through its application to visualizing structures in large software systems.     

一种基于自适应背景杂波模型的宽幅SAR图像CFAR舰船检测算法

利用海洋宽幅SAR图像进行大范围海域舰船检测在海洋监视、军事侦察等方面具有重要应用。由于海况的复杂性,宽幅SAR图像背景杂波特性随海域不同而变化。采用双参数CFAR检测算法和基于K分布CFAR检测算法在处理宽幅SAR图像时,由于在待检测的所有区域采用同种背景杂波模型,导致使用的杂波模型在不适应区域失配,使CFAR检测性能下降。针对这个问题,提出了一种基于自适应背景杂波模型的CFAR宽幅SAR图像舰船检测算法,该算法通过背景窗口的多尺度统计方差判断目标所处的杂波环境,自适应选择对应的背景杂波分布模型,最后根据已知的恒虚警率及选择的杂波概率密度函数进行CFAR检测。对20多幅宽幅SAR图像进行了试验,实验结果表明:该算法在检测精度上有明显的改善。     

图文互斥版面中文字阅读顺序的确定

图文互斥版面中确定文字的阅读顺序是排版及版面理解过程中的一个难点。尤其是中文等东方文字特有的分栏串文互斥,其空间关系的复杂性使得阅读顺序存在歧义。针对此问题,建立新的版面布局模型,并引入新的版面对象PMRegion。给出了版面逐层快速分解构造版面对象和基于有序树的阅读顺序确定算法。已成功运用于专业中日文排版系统,取得了满意的效果,并对更深入研究文档图像理解具有十分重要的理论和实践意义。     

An improved genetic algorithm for facility layout problems having inner structure walls and passages

This study proposes an improved genetic algorithm (GA) to derive solutions for facility layouts that are to have inner walls and passages. The proposed algorithm models the layout of facilities on gene structures. These gene structures consist of a four-segmented chromosome. Improved solutions are produced by employing genetic operations known as selection, crossover, inversion, mutation, and refinement of these genes for successive generations. All relationships between the facilities and passages are represented as an adjacency graph. The shortest path and distance between two facilities is calculated using Dijkstra's algorithm of graph theory. Comparative testing shows that the proposed algorithm performs better than other existing algorithms for the optimal facility layout design. Finally, the proposed algorithm is applied to ship compartment layout problems with the computational results compared with an actual ship compartment layout.Scope and purposeFacility layout problems (FLPs) concerning space layout optimization have been investigated in depth by researchers in many fields, such as industrial engineering, management science, and architecture, and various algorithms have been proposed to solve FLPs. However, these algorithms for the FLP cannot consider inner structure walls and passages within the block plan (or available area). They are also limited to a rectangular boundary shape of the block plan. Therefore, these algorithms could not be directly applied to problems having the curved boundary shape such as ship compartment layout, and an innovative algorithm which can treat such problems is needed. In this study, an improved genetic algorithm (GA) is proposed for solving problems having the inner structure walls and passages within an available area of a curved boundary. A comparative test of the proposed algorithm was performed to evaluate its efficiency. Finally, the proposed algorithm is applied to ship compartment layout problems with the computational results compared with an actual ship compartment layout. From the comparative test and the preliminary applications made to the ship's compartment layout, we demonstrate that the proposed algorithm has the ability to solve the FLPs having the inner structure walls and passages within the available area of the curved boundary.     

基于谱图小波变换的图像压缩编码方法

针对小波变换图像压缩编码方法在高压缩比下得到的重构图像质量往往较差的问题,提出了一种基于谱图小波变换的编码方法.该方法首先将图像转化成图,利用谱图小波变换分解图得到谱图小波系数,这些系数的能量随着尺度的增加而衰减,然后根据谱图小波系数的特性对SPECK算法进行改进,最后对谱图小波系数进行量化,利用改进的SPECK算法对量化后的系数进行压缩编码,并在图像数据量压缩的同时从稀疏系数中恢复原始图像.实验结果表明,该编码方法对自然图像的压缩具有高效性,相比小波变换的压缩方法,重建图像的PSNR有所提高且变化平稳,与此同时还得到更大的压缩比.     

Patch layout from feature graphs

The structuring of surface meshes is a labor intensive task in reverse engineering. For example, in CAD, scanned triangle meshes must be divided into characteristic/uniform patches to enable conversion into high-level spline surfaces. Typical industrial techniques, like rolling ball blends, are very labor intensive.We provide a novel, robust and quick algorithm for the automatic generation of a patch layout based on a topology consistent feature graph. The graph separates the surface along feature lines into functional and geometric building blocks. Our algorithm then thickens the edges of the feature graph and forms new regions with low varying curvature. Further, these new regions-so-called fillets and node patches-will have highly smooth boundary curves, making the algorithm an ideal preprocessor for a subsequent spline fitting algorithm.     

GM‐PHD Filter with State‐Dependent Clutter

In traditional filtering methods, clutter is often assumed to obey a uniform distribution over the entire monitoring area. For many sensors, however, clutter may concentrate in target‐containing regions. Under this condition, the performance of the traditional multi‐target tracking filter can be degraded. In an effort to solve this problem, this paper proposes an improved algorithm based on a Gaussian Mixture probability hypothesis density (GM‐PHD) filter to deal with state‐dependent clutter. First, the relationship between state and clutter is modeled using the uniform distribution centered on the target state. Then, the clutter intensity is calculated according to the distribution of clutter in the whole monitoring area and is used to update the filter. The simulation results show that the improved filter can track targets’ trajectories more effectively in an environment of state‐dependent clutter than the standard GM‐PHD filter.     

基于MMPHDF的多机动目标联合检测、跟踪与分类算法

针对场景中存在新目标出现、旧目标消失(即目标数目变化)和密集杂波的复杂情形,利用多模型概率假设密度滤波器(MMPHDF)在多机动目标联合检测与跟踪上的优势,加入类别辅助信息,提出了一种多机动目标联合检测、跟踪与分类算法.该算法的基本思想是在MMPHDF中用属性向量扩展单目标状态向量,用位置和属性的组合测量似然函数代替单目标位置及杂波位置测量似然函数,提高了不同类目标与杂波测量间的鉴别能力,从而改善了目标数目及状态的估计精度;在更新目标状态后,对目标属性信息进行更新,更为精确的目标数目及状态估计又保证了目标分类性能.本文给出了该算法的粒子实现方法.仿真结果验证了上述结论.     

改进点线特征的双目视觉SLAM算法

针对点线特征SLAM算法在图像局部密集区域提取大量相似线特征、同一直线上的线段过度分割等弊端,提出一种改进点线特征的双目视觉SLAM算法(ISSLAM)。在预处理阶段,利用梯度密度滤波器剔除图像中特征密集区域,降低了线特征的误匹配率加速了特征提取过程;然后,在LSD算法的基础上,利用线段合并机制,将同一直线上由于过度分割而产生的断线重新合并,提高了特征提取的精度;在闭环检测阶段,通过融入线特征的扩展词袋模型,增加了图像相似度计算时的判别依据,提高了闭环检测的精度。ISSLAM算法通过增加筛选与合并机制以及扩展的词袋模型,优化特征提取,提高特征匹配的效率及精度,提高算法性能。最后,以EuRoc公共数据集为实验对象,证明了算法的有效性。     

一种改进的基于图论的图像分割方法

由于传统基于图论的图像分割方法是基于像素级别的,随着像素的增多,其应用也受到了限制,因此,提出一种改进的图像分割方法。该图像分割方法利用Dijkstra算法,将图像的像素点聚集形成超像素;应用Kruskal算法,得到最小生成树,确定并删除最小生成树的不一致边,完成图像分割。实验结果表明,改进方法分割的区域内部特征具有较好的均匀性和一致性。