自适应全变分图像去噪模型及其快速求解*

在联合冲击滤波器和非线性各向异性扩散滤波器对含噪图像做预处理的基础上,利用边缘检测算子选取自适应参数,构建能同时兼顾图像平滑去噪与边缘保留的自适应全变分模型,并基于Bregman迭代正则化方法设计了其快速迭代求解算法.实验结果表明,自适应去噪模型及其求解算法在快速去除噪声的同时保留了图像的边缘轮廓和纹理等细节信息,得到的复原图像在客观评价标准和主观视觉效果方面均有所提高.     

基于多薄板样条的多视角非刚性配准算法EI北大核心CSCD

为解决多视角配准中带有低频非刚性形变的深度数据容易产生累积误差、重叠区域未对齐等问题,提出一种基于多薄板样条的多视角非刚性配准算法.首先通过局部迭代最近点刚性配准算法得到重叠视角深度数据之间的对应点;然后基于多薄板样条的全局优化能量公式为每个视角求解一个薄板样条变换,使所有对应点之间距离的平方和最小;最后将优化后的薄板样条变换应用于每个视角的深度数据.通过在优化模型中引入初始点位置约束,该算法能使配准后的数据尽可能保持初始形状.为了加快求解速度,迭代地求解每个薄板样条变换,并且在优化过程中增量式地引入径向基函数.实验室结果表明,文中算法有较高的精度和效率,能够有效地减少累积误差并且提升重叠区域的对齐效果.     

基于多薄板样条的多视角非刚性配准算法

为解决多视角配准中带有低频非刚性形变的深度数据容易产生累积误差、重叠区域未对齐等问题,提出一种基于多薄板样条的多视角非刚性配准算法.首先通过局部迭代最近点刚性配准算法得到重叠视角深度数据之间的对应点;然后基于多薄板样条的全局优化能量公式为每个视角求解一个薄板样条变换,使所有对应点之间距离的平方和最小;最后将优化后的薄板样条变换应用于每个视角的深度数据.通过在优化模型中引入初始点位置约束,该算法能使配准后的数据尽可能保持初始形状.为了加快求解速度,迭代地求解每个薄板样条变换,并且在优化过程中增量式地引入径向基函数.实验室结果表明,文中算法有较高的精度和效率,能够有效地减少累积误差并且提升重叠区域的对齐效果.     

联合LBS和Snake的3D人体外形和运动跟踪方法

为了解决基于多目视频轮廓信息的3D人体外形和运动跟踪问题,提出一种联合线性混合蒙皮和Snake变形模型的算法框架.首先建立人物对象的蒙皮模型,以每一帧多目同步视频的轮廓作为输入,采用一种基于剪影轮廓的可视外壳重建算法,使得作为3D特征的可视外壳保持了局部细节且更加光滑;并使用关节型迭代最近点算法进行匹配以捕获出每一帧骨架子空间下的人物3D外形及运动;再一次使用当前帧的多目轮廓信息,让Snake内外力共同作用于人物网格模型上的顶点,使之自由地趋近于目标对象.使用带ground-truth的合成数据进行对比实验的结果表明,该方法因同时使用3D误差约束和2D误差约束,提高了跟踪精度.     

一种高效的移动对象伴随模式挖掘算法

从时空维度中寻找轨迹相似、时间相近的对象集合,即挖掘移动对象的伴随模式,在基于地理位置的用户行为分析中被广泛使用.然而现有移动对象相似性挖掘算法难以处理时间连续、空间离散、时空相关并且数据量大的时空数据.针对此类数据,设计基于滑动窗口、Apriori性质和贪心选择策略的宽度优先搜索算法,对移动对象伴随模式挖掘问题进行求解.同时结合基于哈希的迭代剪枝算法和基于摘要信息的剪枝算法,设计两层剪枝算法以去除冗余的中间结果.在真实数据上的实验结果表明,与仅使用哈希迭代或摘要信息的剪枝算法相比,该算法的剪枝效率较高,并且能够稳定去除99%以上的冗余数据.     

基于轮廓分割的形状匹配新方法

提出了基于轮廓分割的形状描述方法,用来进行形状匹配.首先,使用离散曲线演化将形状轮廓简化成具有N个顶点的多边形,并通过去除其中的凹点得到多边形凸点的集合;然后,对由凸点形成的轮廓片段提取角度和曲率特征,得到形状描述子;最后通过匈牙利算法进行轮廓片段之间的距离矩阵的最小代价和计算,从而得到两个形状之间的相似度.基于MPEG-7图像库上的实验证明了本文方法能很好地反映形状的特征,具有较好的匹配效果.     

复杂形状区域的一种笔划分解算法及其应用

本文在传统的复杂形状区域分解原理基础上，设计并实现了一种“笔画式”的分解算法。算法能将诸如轮廓汉字一类由带状子区域重叠构成的复杂形状区划，按带状子区域进行完整的分解，文末经出了运用该算法对曲线轮廓汉字进行笔画分解的实验数据。     

基于top-hat变换与形状特征的蛋白点检测

针对凝胶图像中蛋白质点检测存在弱蛋白质点漏检和重叠蛋白质点难分离的问题,提出了一种基于top-hat变换与形状特征的弱重叠蛋白质点检测算法。采用top-hat变换算法增强弱蛋白质点区域;采用标记控制分水岭法进行粗检测,提取蛋白质点的初始轮廓;根据蛋白质形状特征,自适应设定阈值提取蛋白质点形状标记,并利用提取的标记计算形状距离图;采用基于形状距离的分水岭方法,分离重叠蛋白质点。通过不同类型真实凝胶图像的蛋白质点检测实验,结果表明,该算法具有较高的检测精度和重叠蛋白质点分离率,而且对质量不好的凝胶图像也有较好的检测效果。     

以多尺度三角形为特征的快速形状匹配

为了减少形状匹配阶段的计算量并保持匹配精度,提出一种结合多尺度三角形特征的形状描述子,利用形状整体特征进行粗匹配并使用实时匹配方法完成匹配过程.首先通过高斯演化获得多尺度下的形状轮廓并用不同尺度上的轮廓点组成特征三角形;然后采用三角形面积和特征角来描述轮廓信息;最后用形状面积率对候选轮廓进行筛选,通过计算不同形状间描述子的相似度进行匹配.在不同形状数据集上进行实验的结果表明,该方法有较好的匹配结果和较少的匹配耗时,能够快速准确地描述形状的局部及整体特征,在实际应用中具有优势.     

基于改进多尺度乘积LoG算子的仿射不变形状匹配算法

目标在成像过程中发生的几何变形多数情况下可用仿射变换来描述。据此,提出一种利用角点进行仿射不变形状匹配的算法。首先引入多尺度乘积LoG(MPLoG)算子检测轮廓角点,并根据角点间距自适应地提取轮廓特征点,从而获取形状关键特征;为解决目标的仿射变形问题,采用Grassmann流形Gr(2,n)来表征和度量两形状之间的相似度;最后通过迭代式序列移位匹配算法来克服Grassmann流形对起始点的依赖并完成形状的匹配。对形状数据进行仿真实验的结果表明,所提算法能够有效地实现形状检索和识别,并对噪声有较强的鲁棒性。     

Incremental Labelling of Voronoi Vertices for Shape Reconstruction

We present an incremental Voronoi vertex labelling algorithm for approximating contours, medial axes and dominant points (high curvature points) from 2D point sets. Though there exist many number of algorithms for reconstructing curves, medial axes or dominant points, a unified framework capable of approximating all the three in one place from points is missing in the literature. Our algorithm estimates the normals at each sample point through poles (farthest Voronoi vertices of a sample point) and uses the estimated normals and the corresponding tangents to determine the spatial locations (inner or outer) of the Voronoi vertices with respect to the original curve. The vertex classification helps to construct a piece‐wise linear approximation to the object boundary. We provide a theoretical analysis of the algorithm for points non‐uniformly (ε‐sampling) sampled from simple, closed, concave and smooth curves. The proposed framework has been thoroughly evaluated for its usefulness using various test data. Results indicate that even sparsely and non‐uniformly sampled curves with outliers or collection of curves are faithfully reconstructed by the proposed algorithm.     

基于空间邻近的点目标聚类方法

空间聚类是空间数据挖掘和知识发现领域的主要研究方向之一,但点目标空间分布密度的不均匀、分布形状的多样化,以及"多桥"链接问题的存在,使得基于距离和密度的聚类算法不能高效且有效地识别聚集性高的点目标。提出了基于空间邻近的点目标聚类方法,通过Voronoi建模识别点目标间的空间邻近关系,并以Voronoi势力范围来定义相似度准则,最终构建树结构以实现点目标的聚集模式识别。实验将所提算法与K-means、具有噪声的基于密度的聚类(DBSCAN)算法进行比较分析,结果表明算法能够发现密度不均且任意形状分布的点目标集群,同时准确划分"桥"链接的簇,适用于空间点目标异质分布下的聚集模式识别。     

Estimation of atmospheric light based on gaussian distribution

Existing defogging algorithms use a small number of sample points to estimate the atmospheric light, which leads to poor defogging effect. To solve this problem, a novel Gaussian distribution based algorithm for atmospheric light estimation is proposed. The algorithm has the following features: it uses a brightness threshold to select the candidate points to increase the number of initial samples; it uses clustering algorithms to merge the point clusters for increasing the samples included in the candidate point cluster; it uses a proportional threshold to filter out unreasonable point clusters; it regards each candidate point cluster as a single light source and calculates their influence on surrounding pixels with a Gaussian-distribution-based model; and it uses an atmospheric light map (instead of a constant value) to restore the image. The experimental results suggest that the defogging results produced by the proposed algorithm look more natural than the original algorithm under subjective vision and the objective image quality evaluation indicators are also excellent.

     

Continuous scatterplots

Scatterplots are well established means of visualizing discrete data values with two data variables as a collection of discrete points. We aim at generalizing the concept of scatterplots to the visualization of spatially continuous input data by a continuous and dense plot. An example of a continuous input field is data defined on an n-D spatial grid with respective interpolation or reconstruction of in-between values. We propose a rigorous, accurate, and generic mathematical model of continuous scatterplots that considers an arbitrary density defined on an input field on an n-D domain and that maps this density to m-D scatterplots. Special cases are derived from this generic model and discussed in detail: scatterplots where the n-D spatial domain and the m-D data attribute domain have identical dimension, 1-D scatterplots as a way to define continuous histograms, and 2-D scatterplots of data on 3-D spatial grids. We show how continuous histograms are related to traditional discrete histograms and to the histograms of isosurface statistics. Based on the mathematical model of continuous scatterplots, respective visualization algorithms are derived, in particular for 2-D scatterplots of data from 3-D tetrahedral grids. For several visualization tasks, we show the applicability of continuous scatterplots. Since continuous scatterplots do not only sample data at grid points but interpolate data values within cells, a dense and complete visualization of the data set is achieved that scales well with increasing data set size. Especially for irregular grids with varying cell size, improved results are obtained when compared to conventional scatterplots. Therefore, continuous scatterplots are a suitable extension of a statistics visualization technique to be applied to typical data from scientific computation.     

基于高斯分布的大气光估计算法

针对现有去雾算法在估计大气光向量时,所采用的方法包含的大气光候选点数量较少,导致估计结果在统计意义上误差较大这一问题,提出了基于高斯分布的大气光估计算法。该算法首先使用阈值划分的方式选取候选点以增加初始样本点数量;然后引入聚类算法对原算法所得光源点簇进行合并以提高单个点簇所含样本点个数;同时,使用比例阈值过滤掉不合理的点簇,并将各点簇视为单独光源,单独计算其对周围像素的影响,其影响通过二维高斯分布函数进行建模;最后使用大气光图取代全局大气光复原图像。实验结果表明, 相对于原算法, 使用高斯分布大气光图复原的结果在主观视觉上看起来更加自然,且其客观图像质量评价指标也得到了提高。     

Rounding Voronoi diagram

Computational geometry classically assumes real-number arithmetic which does not exist in actual computers. A solution consists in using integer coordinates for data and exact arithmetic for computations. This approach implies that if the results of an algorithm are the input of another, these results must be rounded to match this hypothesis of integer coordinates. In this paper, we treat the case of two-dimensional Voronoi diagrams and are interested in rounding the Voronoi vertices to grid points while interesting properties of the Voronoi diagram are preserved. These properties are the planarity of the embedding and the convexity of the cells. We give a condition on the grid size to ensure that rounding to the nearest grid point preserves the properties. We also present heuristics to round vertices (not to the nearest grid point) and preserve these properties.     

基于密度峰值和近邻优化的聚类算法

针对密度峰值算法在选取聚类中心时的时间复杂度过高,需要人工选择截断距离并且处理流形数据时有可能出现多个密度峰值,导致聚类准确率下降等问题,提出一种新的密度峰值聚类算法,从聚类中心选择、离群点筛选、数据点分配三方面进行讨论和分析,并给出相应的聚类算法。在聚类中心的选择上采取KNN的思想计算数据点的密度,离群点的筛选和剪枝以及数据点分配则利用Voronoi图的性质,结合数据点的分布特征进行处理,并在最后应用层次聚类的思想以合并相似类簇,提高聚类准确率。实验结果表明:所提算法与实验对比算法相比较,具有较好的聚类效果和准确性。     

The Perception of Correlation in Scatterplots

We present a rigorous way to evaluate the visual perception of correlation in scatterplots, based on classical psychophysical methods originally developed for simple properties such as brightness. Although scatterplots are graphically complex, the quantity they convey is relatively simple. As such, it may be possible to assess the perception of correlation in a similar way. Scatterplots were each of 5.0° extent, containing 100 points with a bivariate normal distribution. Means were 0.5 of the range of the points, and standard deviations 0.2 of this range. Precision was determined via an adaptive algorithm to find the just noticeable differences (jnds) in correlation, i.e., the difference between two side‐by‐side scatterplots that could be discriminated 75% of the time. Accuracy was measured by direct estimation, using reference scatterplots with fixed upper and lower values, with a test scatterplot adjusted so that its correlation appeared to be halfway between these. This process was recursively applied to yield several further estimates. Results of the discrimination tests show jnd(r) = k (1/b – r), where r is the Pearson correlation, and parameters 0 < k, b < 1. Integration yields a subjective estimate of correlation g(r) = ln(1 – br) / ln(1 – b). The values of b found via discrimination closely match those found via direct estimation. As such, it appears that the perception of correlation in a scatterplot is completely described by two related performance curves, specified by two easily‐measured parameters.     

基于场景局部特征的多曝光图像融合

针对现有多曝光图像融合算法得到的图像质量不高以及算法效率低的问题,提出了基于场景局部特征的多曝光图像融合算法。首先,将不同曝光量的图像序列划分为规则的图像块,并且相邻的图像块有一定像素的重叠区域。对于静态场景,根据图像的局部方差、局部可视性以及局部显著性特征这三个指标计算每一个图像块的权重值;对于动态场景,除了应用前面所述的三个局部特征指标外,还需要将局部相似性指标用于动态场景融合过程中以去除运动物体导致的鬼影现象。其次,利用加权求和的方法得到最佳的图像块。最后,将输出的图像块进行融合,并且将图像块重叠区域的像素求平均,从而得到最终的融合结果。选取12组不同自然场景的曝光序列,从主观和客观两方面与现有的基于像素和基于特征的7种算法进行了分析和比较。实验结果表明：无论在静态场景还是动态场景的测试中,所提算法都保留了更多的场景信息,获得了令人满意的视觉效果,同时该算法还保持了较高的计算效率。     

有向传感器网络覆盖增强研究

为提高视频传感器网络的感知覆盖率,基于有向传感器感知模型,提出一种利用Voronoi图的视频传感器网络覆盖增强算法。该算法采用质心替代节点扇形感知区域并构造Voronoi图,通过调整节点感知方向对代替扇形感知区域的质心进行均匀分布,以消除网络中感知重叠区和盲区,提高整个有向传感器网络覆盖率。仿真结果表明,该算法能够有效提高网络覆盖率并能快速收敛。