融合颜色和深度信息的图像物体分割算法*

当图像中存在阴影、低对比度边缘和模糊区域时,传统算法仅利用外观信息难以准确提取物体轮廓,而深度不连续性为辨识物体边界提供有用信息。文中提出基于颜色和深度信息的图像物体分割算法,首先利用mean-shift算法对图像进行适度的过分割,然后融合颜色和深度信息充分描述过分割区域的特性,根据深度信息自动选取目标和背景的种子区域,最后基于最大相似度进行区域合并,得到图像物体分割结果。在Middlebury和NYU-V2数据库上的实验表明,相比当前通用算法,文中算法简单有效,能提高分割的准确性,改善分割图像的视觉效果。     

包含运动物体的图像拼接关键技术

提出一种基于特征点的运动场景图像拼接算法。基于相似变换消除选取在运动物体上的特征点,并使用RANSAC算法进行外点的剔除。在融合阶段,根据齐次变换矩阵求得对2幅图像的差异图像,并执行区域增长算法,从而分割出运动区域。使用一种分段映射算法生成全景图像。实验证明了算法的有效性。     

融合模糊Histon阈值和FCM的Lab空间色彩分割算法

提出了一种简单有效的自适应无监督方法。在CIELab空间中利用模糊Histon阈值技术获得图像中所有可能的均匀区域,即通过寻找峰值,区域初始分割和区域颜色相似性合并,获得由聚类中心标注的均匀区域,提出自适应FCM聚类算法以提高均匀区域之间的紧密度,最终完成色彩分割。该算法已成功应用到伯克利图像库,相比当前一些无监督色彩分割算法,例如：Mean-Shift、NCuts取得了合理更好的划分,视觉上有效提取目标物体,具有一定鲁棒性。     

Spatial color histogram based center voting method for subsequent object tracking and segmentation

In this paper, we introduce an algorithm for object tracking in video sequences. In order to represent the object to be tracked, we propose a new spatial color histogram model which encodes both the color distribution and spatial information. Using this spatial color histogram model, a voting method based on the generalized Hough transform is employed to estimate the object location from frame to frame. The proposed voting based method, called the center voting method, requests every pixel near the previous object center to cast a vote for locating the new object center in the new frame. Once the location of the object is obtained, the back projection method is used to segment the object from the background. Experiment results show successful tracking of the object even when the object being tracked changes in size and shares similar color with the background.     

Real-time rear obstacle detection using reliable disparity for driver assistance

A vision based real-time rear obstacle detection system is one of the most essential technologies, which can be used in many applications such as a parking assistance systems and intelligent vehicles. Although disparity is a useful feature for detecting obstacles, estimating a correct disparity map is a hard problem due to the matching ambiguity and noise sensitivity, especially in homogeneous regions. To overcome these problems, we leverage reliable disparities only for obstacle detection. A reliability factor is introduced to measure an inhomogeneity of the regions quantitatively. It is computed at each superpixel to consider the noise sensitivity of pixel-wise gradients and to assign similar reliability value within a same object. It includes two major components: firstly, In a feature extraction and combining stage, we extract three features from stereo images such as disparity, superpixel segments and pixel-wise gradient and compute the reliability of disparity from superpixel segments and the pixel-wise gradient. Secondly, In an obstacle detection stage, a disparity feature with reliability votes for localizing obstacles and dominant candidates in voting map are selected as initial obstacle region. The initial obstacle regions are expanded into their neighbor superpixels based on CIELAB color similarity and distance similarity between superpixels. Experimental results show satisfactory performance under various real parking environments. Its detection rate is at least 4% higher than those of other existing methods, and its false detection rate is more than 10% lower and thus, can be used for parking assistance system.     

Specific object retrieval based on salient regions

In this paper, we present an image retrieval technique for specific objects based on salient regions. The salient regions we select are invariant to geometric and photometric variations. Those salient regions are detected based on low level features, and need to be classified into different types before they can be applied on further vision tasks. We first classify the selected regions into four types including blobs, edges and lines, textures, and texture boundaries, by using the correlations with the neigbouring regions. Then, some specific region types are chosen for further object retrieval applications. We observe that regions selected from images of the same object are more similar to each other than regions selected from images of different objects. Correlation is used as the similarity measure between regions selected from different images. Two images are considered to contain the same object, if some regions selected from the first image are highly correlated to some regions selected from the second image. Two data sets are employed for experiment: the first data set contains human face images of a number of different people and is used for testing the retrieval algorithm on distinguishing specific objects of the same category; and the second data set contains images of different objects and is used for testing the retrieval algorithm on distinguishing objects of different categories. The results show that our method is very effective on specific object retrieval.     

融合深度和颜色信息的图像物体分割算法

讨论立体图对的图像分割问题,提出一种基于深度和颜色信息的图像物体分割算法。该算法首先利用基于聚类的Mean-shift分割算法对目标图像进行适度的过分割,同时借助双目立体视觉算法获取立体图对的稠密深度图,并依据深度不连续性从过分割结果中选取用于继续进行“精致”分割的种子点集,接着对未分配种子标签的区域用图割算法分配标签,并对彼此之间没有深度不连续边界但具有不同标签的相邻区域进行融合。相比于传统图像分割算法,该算法可有效克服过分割和欠分割问题,获取具有一定语义的图像分割结果。相关的对比实验结果验证了该算法的有效性。     

一种基于伪随机数调制的混合域盲水印算法

提出了一种基于伪随机调制技术的混合域彩色图像盲水印算法,先将彩色图像由RGB空间转换到HSI空间,并取出饱和度分量S,随后对S分量多小波变换后的中频区域进行分块DCT变换,对每个DCT系数子块,按一定的方案提取出若干个中频系数。然后使用密钥产生两个互不相关的伪随机数列,用其调制前面选出的DCT系数来嵌入水印。通过比较两个伪随机数列和待检测系数相关性的大小来实现水印的提取,不需要原始图像参与。实验结果表明,该算法能有效抵抗剪切JPEG压缩、放缩和较大强度的噪声攻击等攻击操作。     

基于小波模糊聚类的均质纹理和非均质纹理图象检索

基于内容的图象检索是近年来的研究热点 ,为此提出了一种自动区分均质纹理和非均质纹理图象 ,并对这两类图象分别进行检索的算法 .算法首先从图象离散小波变换的低频子带提取一定的颜色和纹理特征用于模糊聚类 ,将图象的低频子带分割为一定的区域 ;然后根据分割的结果将图象自动语义分类为均质纹理或者非均质纹理图象 ;最后对均质纹理和非均质纹理图象分别提取不同的特征矢量 ,并按照一定的相似度准则检索图象 .实验结果表明 ,该算法具有良好的均质纹理和非均质纹理图象分类和检索性能 .     

Computing Color Transforms with Applications to Image Editing

In this paper, we present a unified approach for the problem of computing color transforms, applications of which include shadow removal and object recoloring. We propose two algorithms for transforming colors. In the first algorithm, the detection of source and target regions is performed using a Bayesian classifier. Given these regions, the computed transform alters the color properties of the target region so as to closely resemble those of the source region. The proposed probabilistic formulation leads to a linear program (similar to the classic Transportation Problem), which computes the desired transformation between the target and source distributions. In the second algorithm, the detection and transformation steps are united into a single unified approach; furthermore, the continuity of the transformation arises more intrinsically within this algorithm. Both formulations allow the target region to acquire the properties of the source region, while at the same time retaining its own look and feel. Promising results are shown for a variety of applications.     

一种基于目标区域的彩色图像检索算法

提出了一种基于目标区域的彩色图像检索算法。首先，获取彩色图像HSV颜色空间中各个分量图像，然后计算各分量图像的二值边缘图像。根据边缘图像的连通性提取彩色图像的目标区域。在图像检索时，抽取彩色图像目标区域所对应的子图像特征，代替全局图像特征进行图像相似性匹配。实验表明，基于目标区域的彩色图像检索算法优于基于全局图像的检索算法。     

一种基于HSV空间的彩色边缘图像检索方法

结合重要的彩色图像边缘及人眼视觉特性,提出了一种基于彩色边缘直方图的图像检索方法。该方法首先利用Canny检测算子提取出原始图像的彩色边缘信息,然后将彩色图像边缘转换至符合人眼视觉特性的HSV空间并进行量化处理,再将彩色边缘划分成圆环区域和角形区域,并分别计算出圆环区域和角形区域的颜色直方图,最后综合利用上述圆环区域和角形区域的颜色直方图计算图像间内容的相似度,并进行彩色图像检索。仿真实验表明,该方法能够准确和高效地查找出用户所需内容的彩色图像,并且具有较好的查准率和查全率。     

Shape-Based Mutual Segmentation

We present a novel variational approach for simultaneous segmentation of two images of the same object taken from different viewpoints. Due to noise, clutter and occlusions, neither of the images contains sufficient information for correct object-background partitioning. The evolving object contour in each image provides a dynamic prior for the segmentation of the other object view. We call this process mutual segmentation. The foundation of the proposed method is a unified level-set framework for region and edge based segmentation, associated with a shape similarity term. The suggested shape term incorporates the semantic knowledge gained in the segmentation process of the image pair, accounting for excess or deficient parts in the estimated object shape. Transformations, including planar projectivities, between the object views are accommodated by a registration process held concurrently with the segmentation. The proposed segmentation algorithm is demonstrated on a variety of image pairs. The homography between each of the image pairs is estimated and its accuracy is evaluated.     

Shapes recognition using the straight line Hough transform: theoryand generalization

A shape matching technique based on the straight line Hough transform (SLHT) is presented. In the &thetas;-ρ space, the transform can be expressed as the sum of the translation term and the intrinsic term. This formulation allows the translation, rotation, and intrinsic parameters of the curve to be easily decoupled. A shape signature, called the scalable translation invariant rotation-to-shifting (STIRS) signature, is obtained from the &thetas;-ρ space by computing the distances between pairs of points having the same &thetas; value. This signature is invariant to translation and can be easily normalized, and rotation in the image space corresponds to circular shifting of the signature. Matching two signatures only amounts to computing a 1D correlation. The height and location of a peak (if it exists) indicate the similarity and orientation of the test object with respect to the reference object. The location of the test object is obtained, once the orientation is known, by an inverse transform (voting) from the &thetas;-ρ space to the x-y plane     

Color image segmentation based on homogram thresholding and region merging

In this paper, a color image segmentation approach based on homogram thresholding and region merging is presented. The homogram considers both the occurrence of the gray levels and the neighboring homogeneity value among pixels. Therefore, it employs both the local and global information. Fuzzy entropy is utilized as a tool to perform homogram analysis for finding all major homogeneous regions at the first stage. Then region merging process is carried out based on color similarity among these regions to avoid oversegmentation. The proposed homogram-based approach (HOB) is compared with the histogram-based approach (HIB). The experimental results demonstrate that the HOB can find homogeneous regions more effectively than HIB does, and can solve the problem of discriminating shading in color images to some extent.     

基于区域对比度和背景先验的显著目标检测

针对现有算法对复杂背景的图像检测效果较差的问题,提出融合区域对比度和背景先验的显著目标检测算法。首先利用超像素分割将图像分割成感知均匀的图像块,然后根据区域对比度计算全局对比度特征和空间聚集度特征,再根据背景先验得到背景集,计算图像块与背景集间的相似性特征,接着对三个特征显著图进行融合计算,最后根据每个像素与周围超像素的颜色和距离对比度得到每个像素的显著值。实验结果表明,所提算法能较均匀高亮整个目标且有效抑制无关背景信息。     

一种图像之间的颜色传输方法

首先用OTSU方法将目标图像和参考图像递归分解成对应的若干个相对均匀的区域,这些区域的类间距较大而类内距较小;然后将对应的区域之间进行颜色线性变换.由于没有使用全局统计信息,因而具有较强的通用性.实验结果表明：文中算法的颜色传输效果良好,适用性强,且能在相似性较差的图像间进行颜色传输.     

基于假设检验和区域合并的视频对象分割

提出了基于假设检验和区域合并的视频对象分割算法。初始分割采用分水岭算法，接着根据颜色相似性进行区域合并，然后利用光流场估计和全局运动估计获得全局运动的残余误差，最后以各个区域的残余误差数据进行假设检验和小区域验证来确定运动区域，通过组合所有的运动区域即可分割出具有准确边缘的完整视频对象。对MPEG-4测试序列的实验结果表明了本算法具有良好的分割性能。     

Object tracking using SIFT features and mean shift

A scale invariant feature transform (SIFT) based mean shift algorithm is presented for object tracking in real scenarios. SIFT features are used to correspond the region of interests across frames. Meanwhile, mean shift is applied to conduct similarity search via color histograms. The probability distributions from these two measurements are evaluated in an expectation–maximization scheme so as to achieve maximum likelihood estimation of similar regions. This mutual support mechanism can lead to consistent tracking performance if one of the two measurements becomes unstable. Experimental work demonstrates that the proposed mean shift/SIFT strategy improves the tracking performance of the classical mean shift and SIFT tracking algorithms in complicated real scenarios.     

结合背景和前景先验的显著性检测

目的 显著性检测已成为图像处理过程中的一个重要步骤,已被应用到许多计算机视觉任务中。虽然显著性检测已被研究多年并取得了较大的进展,但仍存在一些不足,例如在复杂场景中的检测不准确或检测结果夹带着背景噪声等。因此,针对已有图像显著性检测方法存在的不能有效抑制背景区域,或不能清晰突显出完整的目标区域的缺点,提出一种结合背景先验和前景先验信息的图像显著性检测算法。方法 首先选取图像的边界超像素作为背景区域,从而根据每个区域与背景区域的差异度来建立背景先验显著图;然后通过计算特征点来构建一个能够粗略包围目标区域的凸包,并结合背景先验显著图来选取前景目标区域,从而根据每个区域与前景目标区域的相似度来生成前景先验显著图;最后融合这两个显著图并对其结果进一步优化得到更加平滑和准确的显著图。结果 利用本文算法对MSRA10K数据库内图像进行显著性检测,并与主流的算法进行对比。本文算法的检测效果更接近人工标注,而且精确率和效率都优于所对比的算法,其中平均精确率为87.9%,平均召回率为79.17%,F值为0.852 6,平均绝对误差（MAE）值为0.113,以及平均运行时间为0.723 s。结论 本文提出了一种结合两类先验信息的显著性检测算法,检测结果既能够有效地抑制背景区域,又能清晰地突显目标区域,从而提高了检测的准确性。