变差函数和形态学滤波的图像去雾算法

目的 为解决户外视觉系统在恶劣环境下捕捉图像存在细节模糊、对比度较低等问题,提出一种基于变差函数和形态学滤波的图像去雾算法（简称IDA_VAM）。方法 该算法首先利用变差函数获取较准确的全局环境光值,然后对最小通道图采用多结构元形态学开闭滤波器获取粗略的大气散射图,进而估计大气透射率并进行修正,接着采用双边滤波对其进行平滑操作,最后通过物理模型得到复原图像并进行色调调整,获取明亮、清晰无雾的图像。结果 本文算法与多种图像去雾算法进行对比,在含有雾气的近景图像、远景图像以及有明亮区域的图像均能很好地去除雾气,图像的信息熵值相对提高了38.0%,对比度值相对提高了34.1%,清晰度值相对提高了134.5%,得到较好的复原效果,获取一幅自然明亮的无雾图像。结论 大量仿真实验结果证实,IDA_VAM能够很好地恢复非复杂场景下的近景图像、远景图像以及含有明亮区域图像的色彩和清晰度,获得清晰明亮的无雾图像,细节可见度较高,且算法的时间复杂度与图像像素点个数呈线性关系,具有较好的实时性。     

支持角色双向继承的约束RBAC模型

针对经典RBAC(Role Based Access Control)模型在复杂应用系统中操作繁琐以及难以映射组织结构等不足之处,提出了一种支持角色双向继承的约束RBAC模型BI-RBAC。该模型对经典的RBAC模型进行扩展,增加虚拟角色及其层次结构以支持角色的双向继承,并定义资源操作的概念。给出模型的形式化定义的同时,设计了访问控制算法。模型在自主开发的大型平台软件钱塘中间件平台软件中得到了应用,可较好地支撑恒生证券交易系统等大型软件系统。     

Connectionist modeling for arm kinematics using visual information

The self-organizing adaptive map algorithm is adopted to learn all possible postures for an artificial arm of arbitrary configuration placed in a three-dimensional workspace. Arm postures are represented through their projections onto a set of image planes. Based on the link orientation and link length extracted from these images, a topological state space Q is generated. Arm kinematics is expressed as a transformation of topological hypersurfaces, the intersections of which represents the multiple postures of the arm in the workspace for a given end effector position. The self-organizing feature map learns how the topological hypersurfaces transform in the state space during arbitrary movements of the arm in the workspace. During the learning phase, the neural network generates clusters of neurons, each neuron being responsible for reproducing an arm posture in the workspace. The neural clusters map the hypersurfaces' intersection in the topological Q-space to any position of the arm gripper in the workspace. Simulations for planar and nonplanar multiple degrees of freedom arms are presented.     

Color-Based Image Salient Region Segmentation Using Novel Region Merging Strategy

In this paper, we propose a novel unsupervised algorithm for the segmentation of salient regions in color images. There are three phases in this algorithm. In the first phase, we use nonparametric density estimation to extract candidates of dominant colors in an image, which are then used for the quantization of the image. The label map of the quantized image forms initial regions of segmentation. In the second phase, we define salient region with two properties; i.e., conspicuous; compact and complete. According to the definition, two new parameters are proposed. One is called “Importance index”, which is used to measure the importance of a region, and the other is called “Merging likelihood”, which is utilized to measure the suitability of region merging. Initial regions are merged based on the two new parameters. In the third phase, a similarity check is performed to further merge the surviving regions. Experimental results show that the proposed method achieves excellent segmentation performance for most of our test images. In addition, the computation is very efficient.      

Efficient random saliency map detection

Most image retargeting algorithms rely heavily on valid saliency map detection to proceed. However, the inefficiency of high quality saliency map detection severely restricts the application of these image retargeting methods. In this paper, we propose a random algorithm for efficient context-aware saliency map detection. Our method is a multiple level saliency map detection algorithm that integrates multiple level coarse saliency maps into the resulting saliency map and selectively updates unreliable regio...     

一种随机的视觉显著性检测算法

图像处理与模式识别技术一样,依赖于高质量的视觉显著性图(saliency map)才能得到较好的处理结果.现有的视觉显著性检测技术通常只能检测得到粗糙的视觉显著性图;这些粗糙的视觉显著性图应用于图像处理中将严重影响图像处理的最终结果.本文提出了一种随机的基于内容的视觉显著性区域检测算法;该算法整合多层次粗糙的视觉显著性图到结果显著性图中,并逐步自适应地精化可信度不高的显著性值,最终得到一个考虑了多尺度特征的精细的视觉显著性结果.因为随机算法具有执行效率高,占用内存少等特点;本文的高效随机视觉显著性检测算法不需要建立额外的辅助数据结构来加速算法,只需占用少量内存就能快速检测出精细的高质量视觉显著性结果.并且高效随机的视觉显著性检测算法可以直接移植到GPU上并行执行;大量的实验结果表明本文的算法可以得到更加精细的显著性结果,这些精细的显著性结果应用于基于内容的图像缩放中得到了较好的处理结果.     

Color image segmentation—an innovative approach

In this paper we describe a color image segmentation system that performs color clustering in a color space and then color region segmentation in the image domain. For color segmentation, we developed a fuzzy clustering algorithm that iteratively generates color clusters using a uniquely defined fuzzy membership function and an objective function for clustering optimization. The fuzzy membership function represents belief value of a color belonging to a color cluster and the mutual interference of neighboring clusters. The region segmentation algorithm merges clusters in the image domain based on color similarity and spatial adjacency. We developed three different methods for merging regions in the image domain. Unlike many existing clustering algorithms, the image segmentation system does not require the knowledge about the number of the color clusters to be generated at each stage and the resolution of the color regions can be controlled by one single parameter, the radius of a cluster. The color image segmentation system has been implemented and tested on a variety of color images including satellite images, car and face images. The experiment results are presented and the performance of each algorithm in the segmentation system is analyzed. The system has shown to be both effective and efficient.     

用于屏幕图像编码的索引图快速预测算法

目的 屏幕图像编码要求压缩效率高、实时性好、复杂性适中。调色板编码是屏幕图像编码的主流方法之一,但是其索引图的预测编码效率仍有待提高。为此提出一种基于局部方向相关性的索引图快速预测编码算法。方法 实验统计发现两个相邻的索引值在0.93的平均概率下具有相同的方向性,本文称之为索引图的“局部方向相关性”,进而提出采用一个2×3的模板进行初始方向预测,在其预测失败的情况下再采用一个3×4的方向模板进行二次方向预测。结果 在19个标准测试视频序列和3个测试图像上进行了大量实验,实验结果表明,本文算法的预测准确率为95.43%,比典型的多级预测算法（MSP）平均提高2.48%,尤其对于包含文字字符和大量几何图元的复杂场景视频更为有效,并且计算复杂度显著低于MSP算法,能够较好地满足屏幕图像编码的要求。结论 本文提出的索引图的预测算法,发掘了索引图的局部方向相关性,加快了预测速度,可应用在屏幕图像文本/图形块的调色板编码中。     

Denoising by BV-duality

In this paper we apply Meyer’s G-norm for image processing problems. We use a definition of the G-norm as norm of linear functionals on BV, which seems to be more feasible for numerical computation. We establish the equivalence between Meyer’s original definition and ours and show that computing the norm can be expressed as an interface problem. This allows us to define an algorithm based on the level set method for its solution. Alternatively we propose a fixed point method based on mean curvature type equations. A computation of the G-norm according to our definition additionally gives functions which can be used for denoising of simple structures in images under a high level of noise. We present some numerical computations of this denoising method which support this claim.Dedicated to David Gottlieb on his 60th birthday.Stefan Kindermann on leave from University Linz, Austria.     

彩色地图图象的聚色算法研究

本文研究彩色地图图象中不纯净的颜色聚色问题，该问题是对地图图象进行自动识别的一个关键问题．本文对地图图象的颜色散射现象进行了分析，提出了对地图图象聚色的算法，该算法已经在ＩＢＭ４８６等微机上编程实现了，效果很理想．     

Image attribute learning with ontology guided fused lasso

Extended from the traditional pure statistical learning methods, we propose to augment the statistical learning methods with ontology and apply this idea for image attribute learning. In order to capture structural information among attributes, the graph-guided fused lasso model is adopted and improved by a new distance metric based on WordNet. The novelty of our method is that we find the semantic correlation with the ontology-guided attribute space and integrate inter-attribute similarity information into the learning model. The hierarchy of ImageNet is exploited to define the image attributes and a dataset from ImageNet including over 30,000 images is collected. The experimental results show that this method can both improve the accuracy and accelerate the algorithm convergency. Moreover, the learned semantic correlation owns transfer ability to related applications.     

基于颜色和形状特征的彩色图像显示与检索技术

提出了一种有效用于抽取特征、索引和检索彩色图像的技术途径,通过提取图像的颜色不变量,建立相应的色度直方图（hue histogram）来表示图像的颜色分布特征,为了描述图像中对象的位置及方向特征,首先计算图像的色度轮廓并对其进行Radon变换,然后计算相应的“空间直方图”,由此,得到了一种基于图像的颜色分布特征和形状特征的新的图像表示方法,为了计量图像的全局相似度,基于“累积距离”和“基于向量的距离”定义了两种图像的距离度量,并分别讨论了距离度量的选取与归一化、不同子特征的组合等CBIR所涉及的关键问题,实验结果表明,文中提出的方法能获得满意的检索性能,其检索结果能较好地接近于人的视觉感和结果。     

一种基于对象空间关系的图像检索模型

介绍一种基于空间相似的图像数据库检索模型，提出了空间相似度计算的算法，对对象的空间方位、拓扑关系、数量和空间关系局部高度相似等因素都作了全面考虑，详细阐述空间相似度与局部相似对象簇的求解过程，建立的模型不仅能识别经平移、缩放和旋转交换的图像，而且能识别图像的对称变换，通过实验验证，表明检索模型的图像搜索效率高。     

结合伪彩色与上下文感知的肺癌PET图像分割算法

由于肺癌PET成像质量较低且待分割区域边界没有明显的灰度差,使得基于颜色特征的图像分割算法不能做到有效分割。本文提出了结合伪彩色与上下文感知的肺癌PET图像分割算法。首先,将原始的肺癌PET图像根据彩色查找表生成对应的伪彩图;然后,使用改进的上下文感知模型获得伪彩图对应的显著图,并采用大津法对显著图进行二值化处理,初始化显著图的分割区域;最后,使用改进的GrabCut算法迭代分割图像。算法应用于肺癌的PET图像分割。实验结果表明,本文算法有效提升肺癌PET图像的分割效率、提升分割精度,取消GrabCut算法、Snake算法的用户操作,实现图像分割自动化,具有较高的可靠性、执行效率、以及实际应用价值。     

Contourlet HMT model with directional feature

According to Shanno’s information theory,the directional feature of texture is defined as the value of directional variable when an image signal attains a singularity of random distribution.In terms of this definition,we calculate the texture’s directional features using Tamura’s method and study the directional probability distribution of Contourlet coefficients.Then we find that the directional features tend to be conveyed across parent and child subbands.Based on this conclusion,we establish a novel probability distribution model of hidden direction variables under the condition of hidden state variable’s distribution,named Contourlet HMT model with directional feature.The structure and training method of the model are presented as well.Moreover,an unsupervised context-based image segmentation algorithm is proposed on the basis of the proposed model.Its effectiveness is verified via extensive experiments carried out on several synthesized images and remote sensing images.     

一种基于多层次MRF的多源图象融合算法

图象融合技术的主要目的是将多种图象传感器数据中的互补信息组合起来 ,使形成的新图象更适合于计算机处理 (如分割、特征提取和目标识别 )等 .在多层次 MRF模型的基础上 ,提出了一种应用于多源图象分类的图象融合算法 .该融合算法将定义在多层次图结构上的非线性因果 Markov模型与贝叶斯 SMAP(sequential m axi-mum a posteriori)最优化准则结合起来 ,克服了 MAP(maximum a posteriori)准则在多层次图结构上计算不合理的缺陷 .该算法可应用于多源遥感图象中的信息融合 ,使像素分类更精确 ,并解决多源海量数据的富集表示 .另外还利用合成图象与自然图象分别针对多层次 MRF模型的改进及算法中可最优化准则的不同进行了对比实验 ,结果表明 ,该算法具有许多优越性     

加权多分辨率图像融合的快速算法

快速、可靠的融合算法是图像融合技术实用化的关键,因此具有良好融合效果的快速融合算法的研究显得尤为重要。传统的加权多分辨率图像融合方法能够产生良好的融合效果,但是其计算复杂度却不能令人满意,为了降低算法的复杂度,基于定义的相关信号强度比,提出了一种加权多分辨率图像融合的快速算法。同传统加权多分辨率图像融合方法相比,算法具有较低的计算复杂度。实验结果表明,该算法同传统加权多分辨率图像融合方法一样,能够产生良好的融合效果。     

渐进式前景更新和区域关联的图像协同分割

目的 图像协同分割技术是通过多幅参考图像以实现前景目标与背景区域的分离，并已被广泛应用于图像分类和目标识别等领域中。不过，现有多数的图像协同分割算法只适用于背景变化较大且前景几乎不变的环境。为此，提出一种新的无监督协同分割算法。方法 本文方法是无监督式的，在分级图像分割的基础上通过渐进式优化框架分别实现前景和背景模型的更新估计，同时结合图像内部和不同图像之间的分级区域相似度关联进一步增强上述模型估计的鲁棒性。该无监督的方法不需要进行预先样本学习，能够同时处理两幅或多幅图像且适用于同时存在多个前景目标的情况，并且能够较好地适应前景物体类的变化。结果 通过基于iCoseg和MSRC图像集的实验证明，该算法无需图像间具有显著的前景和背景差异这一约束，与现有的经典方法相比更适用于前景变化剧烈以及同时存在多个前景目标等更为一般化的图像场景中。结论 该方法通过对分级图像分割得到的超像素外观分布分别进行递归式估计来实现前景和背景的有效区分，并同时融合了图像内部以及不同图像区域之间的区域关联性来增加图像前景和背景分布估计的一致性。实验表明当前景变化显著时本文方法相比于现有方法具有更为鲁棒的表现。     

面向RGBD图像的标记分水岭分割

目的 针对分水岭分割算法中存在的过分割现象及现有基于RGB图像分割方法的局限,提出了一种基于RGB图像和深度图像(RGBD)的标记分水岭分割算法。方法 本文使用物体表面几何信息来辅助进行图像分割,定义了一种深度梯度算子和一种法向量梯度算子来衡量物体表面几何信息的变化。通过生成深度梯度图像和法向量梯度图像,与彩色梯度图像进行融合,实现标记图像的提取。在此基础上,使用极小值标定技术对彩色梯度图像进行修正,然后使用分水岭算法进行图像分割。结果 在纽约大学提供的NYU2数据集上进行实验,本文算法有效抑制了过分割现象,将分割区域从上千个降至数十个,且获得了与人工标定的分割结果更接近的分割效果,分割的准确率也比只使用彩色图像进行分割提高了10%以上。结论 本文算法普遍适用于RGBD图像的分割问题,该算法加入了物体表面几何信息的使用,提高了分割的准确率,且对颜色纹理相似的区域获得了较好的分割结果。