Image smoothing with generalized random walks: Algorithm and applications

A novel generalized random walks model based algorithm for image smoothing is presented. Unlike previous image smoothing methods, the proposed method performs image smoothing in a global weighted way based on graph notation, which can preserve important features and edges as much as possible. Based on the new random walks model, input image information and user defined smoothing scale information are projected to a graph, our method calculates the probability that a random walker starting at each pixel node position will first reach one of the pre-defined terminal node to achieve image smoothing, which goes to solving a system of linear equations, the system can be solved efficiently by lots of methods. Theoretical analysis and experimental results are reported to illustrate the usefulness and potential applicability of our algorithm on various computer vision fields, including image enhancement, edge detection, image decomposition, high dynamic range (HDR) image tone mapping and other applications.     

彩色图像色度距离权值的图论分割算法

提出利用色度距离特征权重的图论分割算法,对彩色图像进行区域分割分析。利用图论和HSI模型,解决自然灾害图像的分割问题。针对复杂的自然图像,将图像像素转换为图论中的节点,构造基于像素点HSI模型的带权无向图;构建带权无向图的图论分割权函数及分割准则,形成区域相似度判别方法;结合实际分割需求,对图论分割后的离散区域进行二次吸收与合并运算,获取连续兴趣区域;对分割的结果与其他算法进行了比较与分析。     

基于匹配与平差的景象镶嵌方法

在概括介绍消附相邻景象辐射差异常用算法的基础上,为有效消除相邻景象间几何位置的差异,提出了一种将影象匹配与平差理论相结合的影象镶嵌新算法,该方法是在镶嵌影象的重叠部分进行基于特征的影象匹配,即首先获取一序列同名点,且这些同名点的匹配精度在一个象元以内;然后用正形多项式模拟这些同名点间的几何位置差异,再按最小二乘法原理对右边影象进行平差改正,以实现两影象空间位置上的无缝连接。实验结果表明,庐镶嵌方法具有良好的效果。     

基于模糊连接度的图像分割及算法

提出了一种基于模糊连接度图像分割的方法,在模糊连接度分割的基础上增加了最优路径(即与种子点的所有路径中连接度最大的路径)上各点相对于种子点的属性相似度的检验,使之能在待分割对象边界比较模糊的情况下取得理想的分割结果.同时提出了一种基于图像扫描机制的算法,它以种子点为中心,逐个计算邻居点相对于种子点的模糊连接度,该算法充分利用模糊连接度和属性相似度的性质,能简单、快速地找到两点间的最优路径.实验结果表明,该方法快速、有效地提高了图像分割的质量.     

使用超像素分割与图割的网状遮挡物检测算法

针对由于摄影角度受限,一些自然图像被铁丝网、栅栏、外墙玻璃接缝等网状遮挡物所遮挡的问题,提出了一种用于修复此类图像的网状遮挡物检测算法。对于现有算法使用单像素颜色特征和固定形状特征造成对颜色和形状不均的网状遮挡物检测效果不佳的弊端,首先将图像进行超像素分割,引入颜色与纹理直方图的联合特征来描述超像素块,将基于像素分类问题转换成基于超像素的分类问题,抑制了局部颜色变化造成的误分类;然后,使用图割算法将超像素块进行分类,使网状结构能够沿着光滑的边缘进行延伸,不受固定的形状限制,提高了对异形网状结构的检测准确率,并且不依赖Farid等提出的算法（FARID M S,MAHMOOD A,GRANGETTO M.Image de-fencing framework with hybrid inpainting algorithm.Signal,Image and Video Processing,2016,10（7）：1193-1201）所需的人工输入;其次使用新的联合特征训练支持向量机（SVM）分类器并对所有未被分类的超像素块进行分类,得到准确网状遮挡物掩膜;最后,使用SAIST算法对图像进行修复。实验中,获得的网状遮挡物掩膜比Farid等提出的算法所得到的保留了更多的细节,在修复算法不变的同时显著提升了图像修复效果。在使用相同网状遮挡物掩膜的情况下,使用SAIST算法修复得到的图片在峰值信噪比（PSNR）和结构相似性（SSIM）上分别比Farid等提出算法提高了3.06和0.02。新的掩膜检测算法联合SAIST修复算法的总体修复效果对比Farid等提出算法及Liu等提出的算法（LIU Y Y,BELKINA T,HAYS J H,et al.Image de-fencing.Proceedings of the 2008 IEEE Conference on Computer Vision and Pattern Recognition.Washington,DC：IEEE Computer Society,2008：1-8）有了明显提升。实验结果表明,所提算法提升了网状遮挡物的检测准确性,得到了效果更好的去除网状遮挡物的图像。     

Hyperspectral anomaly detection based on uniformly partitioned pixel

The objective of this paper is to develop an algorithm to detect anomaly in a hyperspectral image. The algorithm is based on a subspace model that is derived statistically. The anomaly detector is defined as the Mahalanobis distance of a residual from a pixel that is partitioned uniformly. The high correlation among adjacent components of the pixel is exploited by partitioning the pixel uniformly to improve anomaly detection. The residual is obtained by partialling out the main background from the pixel by predicting a linear combination of each partition of the pixel with a linear combination of the random variables representing the main background. Experimental results show that the anomaly detector outperforms conventional anomaly detectors.     

A graph-based framework for sub-pixel image segmentation

Many image segmentation methods utilize graph structures for representing images, where the flexibility and generality of the abstract structure is beneficial. By using a fuzzy object representation, i.e., allowing partial belongingness of elements to image objects, the unavoidable loss of information when representing continuous structures by finite sets is significantly reduced, enabling feature estimates with sub-pixel precision.This work presents a framework for object representation based on fuzzy segmented graphs. Interpreting the edges as one-dimensional paths between the vertices of a graph, we extend the notion of a graph cut to that of a located cut, i.e., a cut with sub-edge precision. We describe a method for computing a located cut from a fuzzy segmentation of graph vertices. Further, the notion of vertex coverage segmentation is proposed as a graph theoretic equivalent to pixel coverage segmentations and a method for computing such a segmentation from a located cut is given. Utilizing the proposed framework, we demonstrate improved precision of area measurements of synthetic two-dimensional objects. We emphasize that although the experiments presented here are performed on two-dimensional images, the proposed framework is defined for general graphs and thus applicable to images of any dimension.     

一种有效的指纹图像方向滤波增强算法 *

方向滤波是沿着指纹纹线方向滤波的方法。一种方向滤波算法的有效性主要依赖于指纹图像方向估计的准确性和滤波模板构造的合理性。首先利用对低质量指纹图像鲁棒性较高的掩膜法估计点方向 ,并将点方向转换为块方向 ;然后使用八个方向的平滑滤波模板和锐化滤波模板 ,对指纹图像滤波进行增强 ;最后对增强后的指纹图像二值化。通过对 FVC2000指纹数据库 DB2中的指纹图像作增强处理 ,表明该算法增强效果较好。     

基于水动力学、分数阶微分及Steger算法的线状目标提取

目的 线状目标的检测具有非常广泛的应用领域,如车道线、道路及裂缝的检测等,而裂缝是其中最难检测的线状目标。为避免直接提取线状目标时图像分割难的问题,以裂缝和车道线为例,提出了一种新的跟踪线状目标中线的算法。方法 对图像进行高斯平滑,用一种新的分数阶微分模板增强图像中的模糊及微细线状目标;基于Steger算法提出一种提取线状目标中心线特征点的算法,避免了提取整体目标的困难;根据水动力学思想将裂隙看成溪流,通过最大熵阈值处理后,先进行特征点的连接,再基于线段之间的距离及夹角进行线段之间的连接（溪流之间的融合）。结果 对300幅裂缝图像及4种类别的其他线状目标图像进行试验,并与距离变换、最大熵阈值法+细线化Otsu阈值分割+细线化、谷底边界检测等类似算法进行比较分析,本文算法检测出的线状目标的连续性好、漏检（大间隙少）和误检（毛刺及多余线段少）率均较低。结论 本文算法能够在复杂的线状目标图像中准确快速地提取目标的中心线,一定程度上改善了复杂线状目标图像分割难的问题。     

一种基于散乱数据插值的网格图象变形方法

提出一种基于特征点运动分解和散乱灰度数据插值的网格图象变形算法,以改进传统的两步扫描网格变形法在扫描顺序和变形效果上的不足。将原始图象的象素坐标一次性映射至目标图象,再对映射后得到的散乱坐标点的灰度进行散乱数据插值以恢复目标图象的象素信息。为了提高灰度映射的效率,引入一种基于Delaunay三角剖分的三角线性插值的方法来处理大规模散乱数据的插值。最后通过实例证明该算法的变形效果较两步扫描网格变形法有显著提高。     

基于仿射不变约束与快速EKF滤波的航拍图像稳像

考虑到航拍机载成像平台抖动严重、视频稳像匹配环节精度不一致的特点以及航拍图像稳像技术快速、准确的要求,提出了一种结合仿射不变约束与快速扩展卡尔曼(Extend Kalman Filter,EKF)滤波的图像稳像算法。该算法首先以视频参考帧中的角点量作为特征点,通过Harris检测器选择出稳定角点;然后对待配准点构建Delaunay三角网进行初始匹配,提出利用仿射不变约束方法筛选出精确匹配点;最后利用快速EKF运动滤波方法实时估计和修正噪声的统计特性,从而解决摄像机扫描运动中存在的抖动问题。在对大量分辨率为640×480pixel的航拍图像的仿真实验中,可通过仿射不变约束实现精确的模型估计,采用的快速运动补偿方法在补偿过程中耗时为5.054ms,比传统的运动补偿方法节约了69.5%的时间。实验结果表明,该算法能够实时稳定航拍视频帧间的抖动现象,并能有效跟随场景的真实扫描。     

基于页面对象的Web应用测试用例生成方法

针对Web应用测试用例生成过程中导航图规模过大以及存在冗余测试路径的问题,提出了一种基于Selenium页面对象设计模式和图遍历算法的Web应用测试用例生成方法。首先,通过将原始页面对象进行分类,以导航页面对象类为节点、导航方法为迁移边构建页面对象导航图;其次,结合图的最短路径算法提出了一种页面对象图算法（POGA）来遍历导航图以生成测试路径集;最后,提取测试路径,利用Faker生成模拟数据,进一步生成可以直接执行的测试用例。实验结果表明：与爬取Web应用生成导航图的规模相比,该方法约简率约为89%;与基于状态迁移生成Web应用测试用例的方法相比,该方法减小了冗余和不可行路径的数量,并进一步提高了页面对象的复用率和测试用例的可维护性。     

高效的一遍扫描式连通区域标记算法

二值图像的连通区域标记算法是图像处理的一个基本问题。为了提高算法的效率,以Suzuki等人提出的多遍扫描算法为基础,提出了一种快速的一遍扫描连通域标记算法。算法通过对图像做一次正向扫描,先计算出每个当前像素所在邻域内的最小标号,再利用一个递推过程,查找该连通域中具有较小标号的结点,将被更新结点所在连通分支连接到该结点,以保证等价信息不损失。同时,用最小标号更新递推查找路径上结点的临时标号,以减小分支的深度。通过对连接表的更新使每个结点获得最终标号。算法不需要动态数据结构和递归过程的支持,需要的存储空间较小,算法比原算法速度提高了近2倍,也快于近期提出的一些基于游程的算法。     

基于直线特征约束网格变形的航拍图像拼接

针对常用航拍图像拼接算法在处理存在视差的复杂图像时会出现鬼影、失真、不自然的问题,在APAP(as-projective-as-possible)算法的基础上,添加全局相似性和直线结构保护约束,提出一种基于直线特征约束网格变形的航拍图像拼接方法.首先,在图像重叠区域检测点、直线特征,并估计单应性扭曲;然后,使用网格将图像划分成多个局部图像块,建立网格优化模型,根据网格顶点坐标集定义一个包含图像扭曲不同特征的总能量函数,在APAP算法提供的局部单应性保证重叠区域对齐的前提下,对非重叠区域借鉴NISwGSP算法的全局相似性约束思想,并辅以直线结构约束提高拼接自然度;最后,在稀疏线性系统中求解能量误差最小化问题,得到最优网格顶点集,指导网格变形并完成航拍图像拼接.实验结果表明,所提出的变形方法能够减少重叠区域鬼影和非重叠区域失真问题,相比AutoStitch、APAP、AANAP、SPHP等经典算法拼接效果更自然,更能适应大视角的航拍图像拼接任务.     

面向对象粗糙信任攻击威胁感知模型

基于面向对象的信任攻击图,提出了一种复杂信任环境系统信任攻击威胁感知模型;该模型描述了信任主体对象属性间的所有攻击关系。通过引入粗糙图理论,将面向对象粗糙信任攻击图中具有相同攻击效果的攻击方法,以及在攻击关系中具有相同重要性的信任主体对象划入同一等价类,基于这些等价类,只要获取有限的几条特征攻击路径就能够搜索整个攻击策略空间,从而解决了全面把握攻击动向和限制路径规模之间的矛盾。通过定义路径相似度,采用蚁群算法在论域信任攻击图中搜索到达攻击目标的特征路径,在这些特征路径中找出给目标节点带来的最大威胁的攻击路径。试验证明该方法能够快速定位被攻击的信任主体对象及攻击方式,在各种特征攻击路径中准确找到其所在位置。     

A clustering method for concurrent photos obtained from multiple cameras using max-flow network model

With the popularization of digital cameras, the use of several cameras by group photographers at the same event is becoming common. Photographers can share their contents and even take pictures of each other. So it is becoming important to manage concurrent photos from multiple cameras in order to classify many accumulated photos into proper clusters. In this paper, we propose a novel photo clustering method based on the max-flow network algorithm, and we visualize a network graph for cluster verification. To apply our algorithm, input concurrent photos are used to create an edge-weighted graph structure. In order to transform the photo clustering problem into a graph partition one, first we need to construct an Augmented Concurrent photo Graph (ACG) and then rewrite our original problem in terms of the graph partition one using the min-cut max-flow network model. The previous methods dealt with photo clustering as a 1-D problem using a linear partition. But we consider clustering for concurrent group photos as a 2-D partition based on other users’ photo contents. Each photo is used to create a node and similarities between photos are used to create the edge weights (capacities) of the network. We partition the network into two subgraphs according to the min-cut, which represents the weakest edge connections between the photos. Using repeated graph partitions for each subgraph (sub-network), we can obtain suitable subgraphs corresponding to photo clusters. The graph construction or partition can be adjusted according to user preferences in order to obtain the intended results.     

An edge detection algorithm using multi-state adalines

An edge detection algorithm using multi-state adaptive linear neurons (ADALINES) is presented. Although the tri-state ADALINE is only considered in this work, general multi-state input vectors with extreme values are shown to be linearly separable from the rest of the vectors with the same dimension. The input state of each ADALINE is defined using the local mean in a predefined mask. In addition to the binary input states ± 1, the 0 input state is introduced for controlling the noise effect. If the input pattern matches one of the predefined edge patterns, the corresponding pixel is detected as an edge pixel. Experimental results are shown where the proposed detector is compared with both the Canny and LOG edge detectors.     

航拍胶片注释信息自动解译算法研究

航拍胶片注释信息记录着航拍过程中飞机的姿态参数及相机的工作参数,其正确解译对后期的图像处理尤为重要。本文介绍了航拍胶片注释信息解译的主要步骤,包括注释信息块的定位、阈值分割、标识符分割和标识符解译,重点研究了字符的阈值分割处理方法,提出了基于CASDA与Niblack相结合的阈值分割算法。实验表明,本文算法具有较好的可操作性和适应性,能够有效地对航拍胶片注释信息进行自动解译。