基于几何与图像混合绘制中的快速WARP变换算法研究

基于几何与图像的混合绘制中，3D Warp算法以严格的数学变换为基础，从而能够保证准确的投影关系，但该算法在实时绘制阶段需进行大量的数学运算，故其时间复杂度较高，该文提出了一种新的快速Warp变换算法，算法以3D Warp算法为基础，采用了崭新的投影过程，从而使时间复杂度较3D Warp算法有较大幅度的下降（降低约7．51倍）。同时，该算法是一种流水结构，能够有效利用现有的加速硬件，而无需改变图形硬件的体系结构。     

费歇算法在彩色图像分割中的应用

费歇算法是一种优良的线性判决方法，适用于很多分类场合。本文简要介绍了费歇算法的原理，结合实例说明了利用费歇算法分割彩色图像的方法和步骤。分割结果表明，费歇算法能有效地对彩色图像进行分割，取得比较好的效果。     

基于等周算法的图像分割

采用一种基于图论的等周算法对图像的分割进行了研究。首先利用等周算法对静止图像进行分割,并与边缘检测和区域检测的两种分割方法进行结果比较;接着利用等周算法并结合数学形态学处理对图像序列的分割进行了研究。实验结果表明：等周算法不仅可用于静止图像的分割,也可应用于图像序列的分割。基于等周算法可获取更为精确的分割结果,是一种快速的图论分割方法。并且结合形态学处理可对低对比度的目标获取好的分割结果。     

Texture Repairing by Unified Low Rank Optimization

In this paper, we show how to harness both low-rank and sparse structures in regular or near-regular textures for image completion. Our method is based on a unified formulation for both random and contiguous corruption. In addition to the low rank property of texture, the algorithm also uses the sparse assumption of the natural image: because the natural image is piecewise smooth, it is sparse in certain transformed domain (such as Fourier or wavelet transform). We combine low-rank and sparsity properties of the texture image together in the proposed algorithm. Our algorithm based on convex optimization can automatically and correctly repair the global structure of a corrupted texture, even without precise information about the regions to be completed. This algorithm integrates texture rectification and repairing into one optimization problem. Through extensive simulations, we show our method can complete and repair textures corrupted by errors with both random and contiguous supports better than existing low-rank matrix recovery methods. Our method demonstrates significant advantage over local patch based texture synthesis techniques in dealing with large corruption, non-uniform texture, and large perspective deformation.     

基于SOM神经网和K-均值算法的图像分割

提出了一种基于SOM神经网络和K-均值的图像分割算法。SOM网络将多维数据映射到低维规则网格中,可以有效地用于大型数据的挖掘;而K-均值是一种动态聚类算法,适用于中小型数据的聚类。文中算法利用SOM网络将具有相似特征的象素S点映射到一个2-D神经网上,再根据神经元间的相似性,利用K-均值算法将神经元聚类。文中将该算法用于彩色图像的分割,并给出了经SOM神经网初聚类后,不同K值下神经元聚类对图像分割的结果及与单纯K-均值分割图像进行对比。     

Efficient Graph-Based Image Segmentation

This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the algorithm to image segmentation using two different kinds of local neighborhoods in constructing the graph, and illustrate the results with both real and synthetic images. The algorithm runs in time nearly linear in the number of graph edges and is also fast in practice. An important characteristic of the method is its ability to preserve detail in low-variability image regions while ignoring detail in high-variability regions.     

聚类分析在彩色图像量化中的应用

聚类分析是数据挖掘领域中的一个重要研究方向。它在统计数据分析、模式识别、图像处理等领域有着广泛的应用。迄今为止,人们已经提出了许多用于彩色图像量化的聚类算法。在以往的算法中,由于普遍存在着对初始聚类中心选取的盲目性或极端性,故使重建图像的整体层次与局部细节之间的矛盾未得到较好的解决。该文以SCA犤6犦算法为基础,给出了一种基于最大频度与类内最小距离最大相结合的初始聚类中心优选法———SCAMMD聚类算法。实验表明:该算法能较大幅度地减少图像量化后的均方差以及颜色失真度,量化效果比SCA和其它一些聚类量化算法有显著的提高。     

结合Canny算子的图像二值化

对经典的二值化方法Ostu算法和Bernsen算法中存在的缺点进行了分析,提出一种结合Canny算子的图像二值化方法,该方法综合考虑了边缘信息和灰度信息,通过边缘附近种子点在高阈值二值化图像中的填充和低阈值图像对它的修补而得到二值化结果图像,较好地解决了经典二值化方法中存在的抗噪能力差、边缘粗糙、伪影现象等缺点,实验结果证明,该方法能够较好地解决低对比度图像和目标像素灰度不均匀图像的二值化问题。     

一种用于彩色图象量化的快速聚类算法

为了对彩色图象进行有效地压缩处理,提出了一种基于模式识别技术的图象量化新算法（FSCAMMD）,该算法首先把彩色图象中的颜色样本归为一类,并采用最大频度与类内最小距离最大相结合的方法选取初始类代表点--初始值优选法;然后采用欧氏距离聚类准则及重心法,求得新聚类域中心的向量值,从而得到了令人满意的量化效果。该算法不仅克服了SCA算法对聚类中心初始值选取的不足,较大幅度地减少了彩色图象量化后的总方差以及颜色失真度,而且较好地解决了重建彩色图象的整体层次与局部细节之间的矛盾,其量化效果优于SCA和其他一些聚类量化算法。     

基于Contourlet变换的图像压缩感知重构

根据图像信号在Contourlet变换域的稀疏特性,分析Contourlet变换的基本原理,提出一种基于Contourlet变换的压缩感知重构方法。针对Contourlet变换的基函数并不严格规范正交、无法构造正交变换矩阵的问题,采用改进梯度投影算法恢复稀疏处理后的系数,在保证图像质量的情况下,实现图像的低速率重构。实验结果表明,该算法的鲁棒性较好。     

基于马尔可夫随机场的快速图象分割

根据卫星遥感图象的特点,讨论了基于马可夫随机场的图象分割方法,建立了相应的基于马可夫随机场的图象分割模型,以实现复杂遥感图象的快速分割,并由此将图象分割问题转化成图象标记问题,进而转化成求解图象的最大后验概率估计的问题。虽然传统的模拟退火算法（SA）能达到后验概率的全局最大,但是时间复杂度太高,实际分割中经常采用次优算法,文中还引进了一种基于博弈理论的决定性退火算法（GSA）和一种基于竞争理论的算法（CA）,取得了快速分割图象的效果。试验证明,该两种算法完全可应用于复杂遥感图象的快速分割。     

Toward objective evaluation of image segmentation algorithms

Unsupervised image segmentation is an important component in many image understanding algorithms and practical vision systems. However, evaluation of segmentation algorithms thus far has been largely subjective, leaving a system designer to judge the effectiveness of a technique based only on intuition and results in the form of a few example segmented images. This is largely due to image segmentation being an ill-defined problem-there is no unique ground-truth segmentation of an image against which the output of an algorithm may be compared. This paper demonstrates how a recently proposed measure of similarity, the normalized probabilistic rand (NPR) index, can be used to perform a quantitative comparison between image segmentation algorithms using a hand-labeled set of ground-truth segmentations. We show that the measure allows principled comparisons between segmentations created by different algorithms, as well as segmentations on different images. We outline a procedure for algorithm evaluation through an example evaluation of some familiar algorithms - the mean-shift-based algorithm, an efficient graph-based segmentation algorithm, a hybrid algorithm that combines the strengths of both methods, and expectation maximization. Results are presented on the 300 images in the publicly available Berkeley segmentation data set     

基于数学形态学的免疫细胞图象分割

为了实现对免疫细胞图象的分析，首先要对该种图象进行正确分割，针对这一要求，提出了一种有效的免疫细胞图象分割方法，该方法是根据数学形态学的知识，利用直方图势池数来提取标记点，并将这些标记点作为种子点来对梯度图进行Watershed变换，进而实现了细胞图象的分割。该方法是一种谱信息与空间信息相结合的分割方法，根据实验结果和分析可见，该方法不仅解决了细胞在参数测量前的精确分割问题，同时，为水域分割的关键步骤－种子点的选取找到了一种有效而可靠的方法，实践表明，分割的结果与 目视感受相一致，且其分割速度及可重复性都达到了医学临床的要求。     

DSP实时图像处理软件优化方法研究

为提高高速图像处理系统中数字信号处理器(DSP)软件的实时性,分别提出面向算法与代码2个层次的优化方法。算法级优化通过重新设计算法的实现流程,充分利用处理器资源,完成算法到处理器上的高效映射;代码级优化使用汇编语言,对固定算法的代码进行优化,使循环核形成高效的软件流水,达到实时性能要求。实验结果表明,2种优化方法均能提高DSP软件中关键模块的处理速度。     

小波变换与纹理合成相结合的图像修复

目的 为了克服传统的图像修复算法在结构和纹理边界的错误修复,利用小波变换域的系数特征,探讨了一种基于小波变换与纹理合成相结合的修复算法。方法 算法先利用小波变换将待修复图像分解成具有不同分辨率的低频子图和高频子图,然后根据不同子图各自的特征分别进行修复。对代表图像结构信息的低频子图,采用FMM(fast marching method)算法进行修复;对代表图像纹理信息的高频子图,根据各子图中小波系数的特征,利用纹理合成方法进行修复。结果 分层、分类修复方法对边缘破损具有良好的修复效果,其峰值信噪比相比于传统算法提高了1~2 dB。结论 与相关算法相比,本文算法的综合修复能力较好,可以有效修复具有较强边缘和丰富纹理的破损图像,尤其对破损自然图像的修复,修复后图像质量得到较大提升,修复效果更符合人眼视觉效应。     

一种基于T-Snake模型的医学图像分割方法

改进的T-Snake算法首先在分水岭法中,对相邻区域以其像素数、灰度均值和灰度方差定义距离,并据其在图像上建立新的连通图,以对图像过度分割而产生的一些过小区域合并;其次,在模型跨边缘时,利用已分割断层图像中模型内部区域的统计特征,用区域生长法获取内点并重新参数化模型,使模型不再跨边缘,以保证模型形变到正确的边缘。算法在MATLAB上验证通过。     

Robust Wavelet-Based Super-Resolution Reconstruction: Theory and Algorithm

We present an analysis and algorithm for the problem of super-resolution imaging, that is the reconstruction of HR (high-resolution) images from a sequence of LR (low-resolution) images. Super-resolution reconstruction entails solutions to two problems. One is the alignment of image frames. The other is the reconstruction of a HR image from multiple aligned LR images. Both are important for the performance of super-resolution imaging. Image alignment is addressed with a new batch algorithm, which simultaneously estimates the homographies between multiple image frames by enforcing the surface normal vectors to be the same. This approach can handle longer video sequences quite well. Reconstruction is addressed with a wavelet-based iterative reconstruction algorithm with an efficient de-noising scheme. The technique is based on a new analysis of video formation. At a high level our method could be described as a better-conditioned iterative back projection scheme with an efficient regularization criteria in each iteration step. Experiments with both simulated and real data demonstrate that our approach has better performance than existing super-resolution methods. It can remove even large amounts of mixed noise without creating artifacts.     

Optimal multiple-seams search for image resizing with smoothness and shape prior

Content-aware image resizing is of increasing relevance to allow high-quality image and video to be displayed on devices with different resolution. We present a novel method to find multiple seams simultaneously with global optimality for image resizing, incorporating both region smoothness and seam shape prior using a 3-D graph-theoretic approach. The globally optimal seams can be simultaneously achieved by solving a maximum flow problem based on an arc-weighted graph representation. Representing the resizing problem in an arc-weighted graph, we can incorporate a wide spectrum of constraints into the formulation, thus improving resizing results. By removing or inserting those multiple seams, the goal of content-aware image resizing is achieved. Due to simultaneous detection of multiple seams, our algorithm exhibits several good features: the ability to handle both crossing and non-crossing-seam cases, the ability to incorporate various feasible geometry constraints, and the ability to incorporate the seams importance, region smoothness and shape prior information. The proposed method was implemented and experimented on a variety of image data and compared with the state of the art in image resizing.     

彩色图像脆弱水印自嵌入认证算法

脆弱水印是图像认证的一种有效手段,基于图像内容的脆弱水印可通过水印重建被修改的图像。通过在图像最低位嵌入基于图像内容的水印,提出了一种彩色图像脆弱水印自嵌入认证算法,并进行了大量实验。实验结果表明,该算法具有较强的抗图像剪切及涂改等攻击能力。