基于混合光场描述符的三维目标检索研究

针对三维目标（3D object）检索问题,提出了一种基于新型描述符的3D目标检索方法。首先,在分析现行基于视图的3D模型描述符在描述方法上不充分的基础上,提出了混合描述符H_D的总体思路。进而讨论了H_D总体框架,即在光场图像阵列自适应的基础上,实现了直方图颜色描述符H_CD,shock图形状描述符H_SD及贝叶斯网络（Bayesian Network,BN）纹理描述符H_TD的优化组合。其次,讨论了H_D各部分的具体实现及度量机制,最后,对H_D检索性能进行了实验分析,结果表明提出的方法是优于其他基于视图的检索方法。     

像素聚类改进二进制描述子鲁棒性

目标：本文通过挖掘图像局部区域特征信息,提出了一种鲁棒性更高的二进制描述子。针对BRIEF关于旋转和视角变化鲁棒性差的问题,本文通过图像补丁分层处理、增加关键点图像补丁个数来捕获更多的局部特征信息,对BRIEF描述子改进。方法：首先,根据灰度序列对补丁内所有像素点分类,像素的一个聚类形成了一个亚补丁,然后在每个亚图像补丁上进行类似BRIEF的随机测试。其次,由于原图像补丁大小、尺度大小影响补丁的像素点成分,从而影响像素聚类的效果,所以在原图像关键点周围分割出多个不同大小的图像补丁,或是将原图像补丁根据尺度金字塔确定几个尺度大小不同的补丁,然后再对图像补丁进行分层、测试。所构建的描述子不仅包含了补丁像素的灰度比较信息,而且包含了灰度排序信息和像素群聚信息,提高了描述子的鲁棒性。结果：通过性能对比实验,发现所提的描述子的性能提高了,而且好于对比的浮点描述子。结论：所以挖掘图像补丁的特征信息能提高二进制描述子的鲁棒性。     

Improving vector space embedding of graphs through feature selection algorithms

Graph based pattern representation offers a versatile alternative to vectorial data structures. Therefore, a growing interest in graphs can be observed in various fields. However, a serious limitation in the use of graphs is the lack of elementary mathematical operations in the graph domain, actually required in many pattern recognition algorithms. In order to overcome this limitation, the present paper proposes an embedding of a given graph population in a vector space Rⁿ. The key idea of this embedding approach is to interpret the distances of a graph g to a number of prototype graphs as numerical features of g. In previous works, the prototypes were selected beforehand with heuristic selection algorithms. In the present paper we take a more fundamental approach and regard the problem of prototype selection as a feature selection or dimensionality reduction problem, for which many methods are available. With several experiments we show the feasibility of graph embedding based on prototypes obtained from such feature selection algorithms and demonstrate their potential to outperform previous approaches.     

局部图像描述符最新研究进展

目的 局部图像描述符广泛应用于许多图像理解和计算机视觉应用领域,如图像分类、目标识别、图像检索、机器人导航、纹理分类等。SIFT算法的提出标志着现代局部图像描述符研究的开始。主要对最近发展的现代局部图像描述符进行了综述。方法 首先,介绍了4大类局部图像描述符:局部特征空间分布描述符、局部特征空间关联描述符、基于机器学习的局部描述符、扩展局部描述符(局部颜色描述符、局部RGB-D描述符、局部空时描述符)。对局部图像描述符进行了分析和分类,并总结了局部图像描述符的不变性、计算复杂度、应用领域、评价方法和评价数据集。最后,展望了局部图像描述符的未来研究方向。结果 近年来局部图像描述符研究取得了很大进展,提出了很多优秀的描述符,在辨别性、鲁棒性和实时性方面有了很大提高,应用领域不断拓展。结论 局部图像描述符应用广泛,是计算机视觉领域的重要基础研究。而目前,局部图像描述符还存在许多问题,还需进一步的深入研究。     

采用旋转匹配的二进制局部描述子

针对二进制描述子主方向计算误差影响图像匹配正确性的问题,提出了一种旋转不变的二进制描述子构造和匹配方法。在以特征点为中心的同心圆周上等间隔选取采样点,按照旋转不变的模式选取采样点对进行灰度值比较,将比较结果连接成二进制串,作为区域的描述子。匹配时比较描述子在所有旋转模式中的汉明距离,取最小值作为描述子的距离,实现不依赖于主方向的旋转不变性。配合多尺度特征检测方法,将采样模式进行缩放,并对图像进行亚像素插值,实现尺度不变性。描述子匹配的实验结果表明,本文方法在旋转,尺度和光照变换下的匹配效果比当前依赖主方向的二进制描述子方法具有更高的鲁棒性。     

A graph-based framework for sub-pixel image segmentation

Many image segmentation methods utilize graph structures for representing images, where the flexibility and generality of the abstract structure is beneficial. By using a fuzzy object representation, i.e., allowing partial belongingness of elements to image objects, the unavoidable loss of information when representing continuous structures by finite sets is significantly reduced, enabling feature estimates with sub-pixel precision.This work presents a framework for object representation based on fuzzy segmented graphs. Interpreting the edges as one-dimensional paths between the vertices of a graph, we extend the notion of a graph cut to that of a located cut, i.e., a cut with sub-edge precision. We describe a method for computing a located cut from a fuzzy segmentation of graph vertices. Further, the notion of vertex coverage segmentation is proposed as a graph theoretic equivalent to pixel coverage segmentations and a method for computing such a segmentation from a located cut is given. Utilizing the proposed framework, we demonstrate improved precision of area measurements of synthetic two-dimensional objects. We emphasize that although the experiments presented here are performed on two-dimensional images, the proposed framework is defined for general graphs and thus applicable to images of any dimension.     

一种新的特征描述符提取和匹配方法

特征描述符提取和匹配是基于特征点图像匹配方法的一个重要问题。针对特征描述符提取问题,分析了目前已提出的描述符提取方法存在的问题和不足,并针对这些问题提出一种新的描述符提取方法和相应的匹配方法,经过实验和比较,提出的方法有很高的准确率和稳定性。同时,还改进了特征点的梯度方向估计方法,使方向估计具有更高的准确率。     

基于SIFT和Daisy相结合的立体匹配算法

立体匹配是计算机视觉领域最活跃的研究课题之一,针对传统SIFT描述符在图像存在多个相似区域时易造成误匹配和Daisy的匹配效率会因200维的描述符而降低的问题,提出一种SIFT和Daisy相结合的立体匹配算法。该方法利用SIFT算法生成关键特征点,利用Daisy描述符自身具有的良好的旋转不变性,对特征点进行描述,利用特征描述符欧氏距离的最近邻匹配和种子区域增长得到视差图。实验结果表明,该方法匹配精度高,速度快,在部分遮挡、视点变化引起的图像变形等问题上有更好的表现。     

Graph simplification and matching using commute times

This paper exploits the properties of the commute time for the purposes of graph simplification and matching. Our starting point is the lazy random walk on the graph, which is determined by the heat kernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterise the random walk using the commute time between nodes, and show how this quantity may be computed from the Laplacian spectrum using the discrete Green's function. In this paper, we explore two different, but essentially dual, simplified graph representations delivered by the commute time. The first representation decomposes graphs into concentric layers. To do this we augment the graph with an auxiliary node which acts as a heat source. We use the pattern of commute times from this node to decompose the graph into a sequence of layers. Our second representation is based on the minimum spanning tree of the commute time matrix. The spanning trees located using commute time prove to be stable to structural variations. We match the graphs by applying a tree-matching method to the spanning trees. We experiment with the method on synthetic and real-world image data, where it proves to be effective.