一种基于图象物理特征的分层匹配算法

文章将物理学相关概念引入图象匹配中,定义了二维灰度图象的质量、密度、重心以及物理特征矢量,并由此提出了一种新的基于图象物理特征的分层匹配算法。该算法首先利用图象物理特征矢量进行粗匹配,找出几个大致的匹配点,再利用灰度归一化积相关算法进行精匹配。实验结果表明该算法具有较强的抗噪声干扰及几何畸变能力,与传统的归一化积相关算法相比,该算法在保证较高匹配概率的基础上,大大缩短了匹配时间,提高了匹配效率。     

Flexible and Robust Model Matching based on Association Graph for Form Image Understanding

A new method of image understanding for forms based on model matching is proposed in this paper as the basis of an OCR which can read a variety of forms. The outline of this method is described as follows. First, ruled lines are extracted from the input image of a form. After that, several lines are grouped as one to be recognised as data corresponding to a sub-form. These lines and sub-forms are both used for understanding the form, taking into account their feature attributes and the relationships between them. Each feature in the input image of a form is expected to correspond to a feature in one of the model forms, which are described as structured features. This correspondence is represented by a node in an association graph, where an arc represents compatible correspondences established on the basis of feature relationships. The best match is found as the largest maximal clique in the association graph. Experimental results show the method is robust and effective for document images of poor quality, and also for various styles of forms.     

Matching graphs with unique node labels

A special class of graphs is introduced in this paper. The graphs belonging to this class are characterised by the existence of unique node labels. A number of matching algorithms for graphs with unique node labels are developed. It is shown that problems such as graph isomorphism, subgraph isomorphism, maximum common subgraph (MCS) and graph edit distance (GED) have a computational complexity that is only quadratic in the number of nodes. Moreover, computing the median of a set of graphs is only linear in the cardinality of the set. In a series of experiments, it is demonstrated that the proposed algorithms run very fast in practice. The considered class makes the matching of large graphs, consisting of thousands of nodes, computationally tractable. We also discuss an application of the considered class of graphs and related matching algorithms to the classification and detection of abnormal events in computer networks.     

基于光场图像序列的自适应权值块匹配深度估计算法

现有的深度估计算法中,针对光场序列图像进行深度估计时,在图像亮度变化较大和弱纹理区域,其匹配效果较差,鲁棒性较低.针对这些问题,本文提出了一种基于CIELab颜色空间的自适应权值块匹配算法.由于彩色图像RGB颜色空间中颜色差异匹配影响因素较多,本算法转换到CIELab空间进行颜色相似性匹配来计算权重值,然后结合梯度和距离计算匹配图像和待匹配图像中匹配块得到综合权重值,最后根据极平面图像(EPI)的线性特性对图像序列中匹配图像和待匹配图像块进行匹配计算,求得深度图.经过仿真验证,本文算法能够较好的估计场景的深度信息,精度上有较大的提升,明显优于以往的深度估计算法,可以广泛使用.