High frequency geometric detail manipulation and editing for point-sampled surfaces

In this paper, based on the new definition of high frequency geometric detail for point-sampled surfaces, a new approach for detail manipulation and a detail-preserving editing framework are proposed. Geometric detail scaling and enhancement can always produce fantastic effects by directly manipulating the geometric details of the underlying geometry. Detail-preserving editing is capable of preserving geometric details during the shape deformation of point-sampled model. For efficient editing, the point set of the model is first clustered by a mean shift scheme, according to its anisotropic geometric features and each cluster is abstracted as a simplification sample point (SSP). Our editing operation is implemented by manipulating the SSP first and then diffusing the deformation to all sample points on the underlying geometry. As a postprocessing step, a new up-sampling and relaxation procedure is proposed to refine the deformed model. The effectiveness of the proposed method is demonstrated by several examples.     

GPU-based rendering of point-sampled water surfaces

Particle-based simulations are widely used to simulate fluids. We present a real-time rendering method for the results of particle-based simulations of water. Traditional approaches to visualize the results of particle-based simulations construct water surfaces that are usually represented by polygons. To construct water surfaces from the results of particle-based simulations, a density function is assigned to each particle and a density field is computed by accumulating the values of the density functions of all particles. However, the computation of the density field is time consuming. To address this problem, we propose an efficient calculation of density field using a graphics processing unit (GPU). We present a rendering method for water surfaces sampled by points. The use of the GPU permits efficient simulation of optical effects, such as refraction, reflection, and caustics.     

A quasi-Monte Carlo method for computing areas of point-sampled surfaces

A novel and efficient quasi-Monte Carlo method for computing the area of a point-sampled surface with associated surface normal for each point is presented. Our method operates directly on the point cloud without any surface reconstruction procedure. Using the Cauchy-Crofton formula, the area of the point-sampled surface is calculated by counting the number of intersection points between the point cloud and a set of uniformly distributed lines generated with low-discrepancy sequences. Based on a clustering technique, we also propose an effective algorithm for computing the intersection points of a line with the point-sampled surface. By testing on a number of point-based models, experiments suggest that our method is more robust and more efficient than those conventional approaches based on surface reconstruction.     

基于Mean shift算法的煤岩分界识别

提出了一种基于Mean shift算法的煤岩分界识别方案。首先介绍了Mean shift算法原理,通过关联图像的像素位置向量和灰度值构建了一个空间联合域;然后给出了适用于煤岩图像分割的带宽参数选择方法,以去除虚假孤立区域和杂散边界;最后利用煤岩图像的人造边界和真实边界进行仿真,结果表明Mean shift算法较K-means算法能更准确地获得煤岩分界线。     

Mean shift based gradient vector flow for image segmentation

In recent years, gradient vector flow (GVF) based algorithms have been successfully used to segment a variety of 2-D and 3-D imagery. However, due to the compromise of internal and external energy forces within the resulting partial differential equations, these methods may lead to biased segmentation results. In this paper, we propose MSGVF, a mean shift based GVF segmentation algorithm that can successfully locate the correct borders. MSGVF is developed so that when the contour reaches equilibrium, the various forces resulting from the different energy terms are balanced. In addition, the smoothness constraint of image pixels is kept so that over- or under-segmentation can be reduced. Experimental results on publicly accessible datasets of dermoscopic and optic disc images demonstrate that the proposed method effectively detects the borders of the objects of interest.     

基于Mean shift的核窗宽自适应目标跟踪新算法

针对传统均值漂移算法(Mean shift)中核函数直方图对目标特征描述较弱、跟踪过程中核函数带宽的保持不变的缺点,提出了一种新的核函数带宽可变的Mean shift跟踪算法.在特定的色彩空间中,统计落入各区间的像素个数.并对各区间像素的位置建立高斯分布模型,采用二阶空间直方图实现目标建模,强化目标特征描述提高了跟踪的鲁棒性;结合边缘检测与角点检测选取目标特征点估算目标仿射模型确定伸缩尺度.适应目标多自由度变化下的跟踪.实验结果证明,该算法比原有算法跟踪效果更加准确和可靠.     

基于Mean shift和轨迹预测的目标跟踪算法

针对目标跟踪过程中出现的定位偏差问题,提出了Mean shift和轨迹预测相结合的运动目标跟踪算法.该算法首先根据目标已知位置信息采用最小二乘法拟合运动轨迹并得到预测位置,然后利用Mean shift算法得到目标最终位置.通过计算搜索误差判断是否发生严重遮挡情况,并给出相应处理策略.进行了一系列实验,验证了算法的有效性,并将实验结果与其他算法比较,表明该算法有效地提高了快速运动目标跟踪的精度,具有较强的鲁棒性.     

Defining, contouring, and visualizing scalar functions on point-sampled surfaces

This paper addresses the definition, contouring, and visualization of scalar functions on unorganized point sets, which are sampled from a surface in 3D space; the proposed framework builds on moving least-squares techniques and implicit modeling. Given a scalar function f:P→R, defined on a point set P, the idea behind our approach is to exploit the local connectivity structure of the k-nearest neighbor graph of P and mimic the contouring of scalar functions defined on triangle meshes. Moving least-squares and implicit modeling techniques are used to extend f from P to the surface M underlying P. To this end, we compute an analytical approximation of f that allows us to provide an exact differential analysis of , draw its iso-contours, visualize its behavior on and around M, and approximate its critical points. We also compare moving least-squares and implicit techniques for the definition of the scalar function underlying f and discuss their numerical stability and approximation accuracy. Finally, the proposed framework is a starting point to extend those processing techniques that build on the analysis of scalar functions on 2-manifold surfaces to point sets.     

基于均值漂移与粒子滤波的手势跟踪算法研究

基于视觉的手势跟踪技术在虚拟现实、人机交互、视觉监控等领域均有着广阔的应用。本文主要研究用于人机交互的手势跟踪,以颜色特征作为目标的表征方式,并结合MeanShift均值移住提出了一种基于颜色直方图的粒子滤波跟踪方法。仿真实验结果表明,本文研究的方法效果较好,能准确的对序列图中的手势进行跟踪。     

Two-stage image denoising by principal component analysis with local pixel grouping

This paper presents an efficient image denoising scheme by using principal component analysis (PCA) with local pixel grouping (LPG). For a better preservation of image local structures, a pixel and its nearest neighbors are modeled as a vector variable, whose training samples are selected from the local window by using block matching based LPG. Such an LPG procedure guarantees that only the sample blocks with similar contents are used in the local statistics calculation for PCA transform estimation, so that the image local features can be well preserved after coefficient shrinkage in the PCA domain to remove the noise. The LPG-PCA denoising procedure is iterated one more time to further improve the denoising performance, and the noise level is adaptively adjusted in the second stage. Experimental results on benchmark test images demonstrate that the LPG-PCA method achieves very competitive denoising performance, especially in image fine structure preservation, compared with state-of-the-art denoising algorithms.     

基于目标模型自适应更新的mean shift跟踪算法

本文提出一种自动更新mean shift跟踪模型的算法。该算法采用Kalman滤波对跟踪系统下一帧的目标模型进行预测,通过对滤波残余误差样本的假设检验,提出一种更新机制。实验结果表明,跟踪系统可以在目标被遮挡或形状改变的情况下,有效地更新目标模型,实现实时目标跟踪。     

Nonlinear Mean Shift over Riemannian Manifolds

The original mean shift algorithm is widely applied for nonparametric clustering in vector spaces. In this paper we generalize it to data points lying on Riemannian manifolds. This allows us to extend mean shift based clustering and filtering techniques to a large class of frequently occurring non-vector spaces in vision. We present an exact algorithm and prove its convergence properties as opposed to previous work which approximates the mean shift vector. The computational details of our algorithm are presented for frequently occurring classes of manifolds such as matrix Lie groups, Grassmann manifolds, essential matrices and symmetric positive definite matrices. Applications of the mean shift over these manifolds are shown.     

Real-time hand tracking using a mean shift embedded particle filter

Particle filtering and mean shift (MS) are two successful approaches to visual tracking. Both have their respective strengths and weaknesses. In this paper, we propose to integrate advantages of the two approaches for improved tracking. By incorporating the MS optimization into particle filtering to move particles to local peaks in the likelihood, the proposed mean shift embedded particle filter (MSEPF) improves the sampling efficiency considerably. Our work is conducted in the context of developing a hand control interface for a robotic wheelchair. We realize real-time hand tracking in dynamic environments of the wheelchair using MSEPF. Extensive experimental results demonstrate that MSEPF outperforms the MS tracker and the conventional particle filter in hand tracking. Our approach produces reliable tracking while effectively handling rapid motion and distraction with roughly 85% fewer particles. We also present a simple method for dynamic gesture recognition. The hand control interface based on the proposed algorithms works well in dynamic environments of the wheelchair.     

Sparse non-linear denoising: Generalization performance and pattern reproducibility in functional MRI

We investigate sparse non-linear denoising of functional brain images by kernel principal component analysis (kernel PCA). The main challenge is the mapping of denoised feature space points back into input space, also referred to as “the pre-image problem”. Since the feature space mapping is typically not bijective, pre-image estimation is inherently illposed. In many applications, including functional magnetic resonance imaging (fMRI) data which is the application used for illustration in the present work, it is of interest to denoise a sparse signal. To meet this objective we investigate sparse pre-image reconstruction by Lasso regularization. We find that sparse estimation provides better brain state decoding accuracy and a more reproducible pre-image. These two important metrics are combined in an evaluation framework which allow us to optimize both the degree of sparsity and the non-linearity of the kernel embedding. The latter result provides evidence of signal manifold non-linearity in the specific fMRI case study.     

动态成像条件下基于SURF和Mean shift的运动目标高精度检测

针对动态成像条件下运动目标检测的难点问题,提出了一种将SURF特征和Mean shift图像分割相结合的高精度运动目标检测方法.首先利用SURF特征进行图像配准,以补偿背景图像的运动漂移;然后利用差分求积二值化和形态学滤波方法检测出运动目标区域;最后结合Mean shift图像分割方法实现运动目标的精确检测.通过一系列实拍视频的运动目标检测实验验证了此算法的有效性和可行性.实验结果表明,此方法能精确检测出动态成像条件下所形成的动态背景中的运动目标,而且具有良好的鲁棒性和抗噪能力,对于光照条件和亮度变化等不利因素也有较强的适应能力.     

基于数据融合技术的图像均值滤波算法

在分析传统图像均值滤波算法的特性基础上,提出了一种新的均值滤波方法--多窗口均值融合滤波算法.该算法以每一个像素点为中心选取多个不同尺寸的窗口,将各窗口的均值进行融合处理后作为中心点的滤波输出.实验结果表明,本算法对于低信噪比图像具有较好的滤波效果,优于传统的和一些改进的均值滤波算法.     

A note on the convergence of the mean shift

Mean shift is an effective iterative algorithm widely used in computer vision community. However, to our knowledge, its convergence, a key aspect of any iterative algorithm, has not been rigorously proved up to now. In this paper, by further imposing some commonly acceptable conditions, its convergence is proved.     

基于均值漂移和边缘检测的轮廓跟踪算法

实时的轮廓跟踪算法可以为视频监控系统提供物体的轮廓信息以供对物体类别、物体行为等进行识别.提出一种基于均值漂移和边缘检测的轮廓跟踪算法.方法中,首先利用均值漂移算法跟踪得到目标物体的中心位置,同时用高斯统计模型进行背景更新,从前景图像和背景图像中分别得到具有相同位置和大小的前景矩形区域和背景矩形区域,然后用背景分割的方法得到目标物体区域,再对目标物体区域进行边缘检测就得到了目标物体的轮廓,进而实现了对目标物体的轮廓跟踪.实验表明,可以实时、准确、稳定地对目标物体进行轮廓跟踪.     

基于分块背景更新的均值飘移跟踪算法

为提高融合背景信息均值飘移跟踪算法中的背景模型更新效率,提出基于分块背景更新的改进算法。将目标周围的背景区域划分成4块,分别以此4个子块的颜色直方图作为区域特征描述符进行计算,利用巴氏系数选择性地更新相似性较低的3个区域。在构建目标候选模型时,利用目标物体空间信息赋予候选目标区域像素点相应的距离权重。对整块背景信息更新策略和加权更新背景信息策略进行比较,比较结果表明,该算法具有更高的迭代收敛效率和更强的抗背景干扰能力。     

带宽自适应的人体运动跟踪均值漂移算法

传统Mean shift算法带宽固定的问题,导致了人体逐渐远离或者逐渐靠近摄像头运动时跟踪效果不好甚至失败.考虑到人体运动目标特征提取后的二值图像中,头部区域的图像呈圆形形状,并且可以用Hough变换检测出圆半径的大小.本文提出根据Hough变换检测出的圆半径在人体视频图像序列中的缩放比例,对带宽进行相应调整的算法.实验和分析表明本算法有很好的准确性和鲁棒性.