A robust gross-to-fine pattern recognition system

This paper presents a model-based vision recognition engine for planar contours that are scale invariant of known models. Features are obtained by using a constant-curvature criterion and used to carry out efficient coarse-to-fine recognition. A robust shape matching is proposed for comparing contour fragments from scenes with partial occluding. In order to carry out an early pruning of a large portion of the models, hypotheses are only generated for a subset of contours with enough discriminative information. Poor scene contours are used later in validating or invalidating a relatively small set of hypotheses. Since hypotheses are selectively verified, blocking is avoided by extending current matching through pairing of hypotheses, predictive matching, and retrieving the next weighted hypotheses. This avoids the processing of a large number of initial hypotheses. The authors' evaluation shows that a high recognition error results from the use of too small a bucket size because the indexes may fall at random, producing nonrepeatable results. They use a multidimensional hashing scheme with space separation between dense parameter areas to create additional hashing tables. The robustness of the recognition is based on engineering a coarse bucket size to the best tolerance with respect to various sources of noise. Partially occluded scenes having three objects can be recognized with a success rate of 84%. The results are reproducible against changes in scale, rotation, and translation. Due to the selection of robust initial hypotheses and the structure of the selective matching system, the processing time essentially depends on scene complexity with a marginal dependence on database size     

A spatiotemporal neural network for recognizing partially occludedobjects

In this paper, a spatiotemporal neural network for partially occluded object recognition is presented. The system consists of two major components: a feature extraction process and a spatiotemporal modular neural network. The former is made up of a sequence of preprocessing techniques including thresholding, boundary extraction, Gaussian filtering, and a split-and-merge algorithm to generate features that will represent the objects to be recognized. These acquired features are invariant to rotation, translation, and scaling and can serve as input to the spatiotemporal network that utilizes the concept of tap delay to account for spatial correlation between consecutive input features. A shape perceiver is designed into the network to extract continued parts of an object as well as to enable the inclusion of each object's unique characteristics into the system. Traditional neural network approaches for recognizing partially occluded objects have encountered significant problems because of the incomplete boundaries of the objects. In our approach, by creatively installing tap delays, the system can escape this limitation. Experimental results show that the proposed system can produce satisfactory results in efficiently and effectively recognizing partially occluded objects. Furthermore, intrinsic to this system is the ease by which it can be realized through parallel implementation, thus minimizing the tremendous time spent in matching object contours stored in a model database, as is the case in conventional recognition systems     

一种改进的快速鲁棒性特征匹配算法

针对光照变化、噪声、局部遮挡等在图像配准技术中对配准精度有重要影响,提出了一种在多尺度空间下点预测快速鲁棒性不变特征的匹配算法。针对在探测对图像的尺度、旋转,仿射具有不变性的斑状特征极值点过程中计算复杂度较高的问题,提出一种特征点预测方法降低了描述子提取的复杂度,增强了对外部环境光照变化、噪声以及局部遮挡的适应能力;并在KD(KD Tree)树基础上,提出了一种动态平衡KD树(DBKD-Tree)快速搜索匹配算法,有效克服了KD树可能存在的病态划分,采用条件约束最邻近搜索,提升匹配效率,实现特征点高精度匹配。通过对在不同光照条件、噪声环境的仿射变换图像特征匹配测试,在加入20%的高斯噪声后,均能100%地完成重复特征检测,达到亚像素定位精度,误配率降低为零。     

基于局部二进制模式和图变换的快速匹配算法

针对图像匹配在图像拼接、目标识别等领域的应用中尺度不变特征变换（Scale Invariant Feature Transform,SIFT）算法计算复杂度高、实时性较差的问题,提出了一种基于局部二进制模式（Local Binary Patterns,LBP）和图变换（Graph Transformation Matching,GTM）的匹配算法.首先采用SIFT特征检测提取特征点并以特征点为中心取13×13的图像块作为特征区域;然后用本文提出的局部旋转不变二进制模式（Local Rotation Invariant Binary Patterns,LRIBP）描述子对特征区域进行描述产生29维的特征描述向量,降低了描述子的复杂度,并以欧氏距离为度量准则进行初始匹配;最后采用图变换匹配算法剔除误匹配点,从而提高算法的运算速率和匹配精度.仿真结果表明,本文所提算法不仅具有较高的精度和较强的鲁棒性,并且减少了算法的运算量,提高了算法的实时性.     

复杂地面背景下相对定位目标选择与识别算法

针对相对定位技术在复杂地面背景下存在相对定位目标选取质量不高、识别难度大的问题,基于最稳定极值区域（MSER）和双层匹配矫正策略提出一种新的相对定位目标选取与识别算法。算法首先提取基准图和实时图的MSER特征,并进行椭圆拟合和规则化,然后根据特征区域的选择权重指数自适应选取相对定位目标,再利用MSER特征的尺度和仿射不变特性,基于互相关性准则提取两图像间匹配的MSER特征对,最后采用位置权重指数和随机抽样一致性（RANSAC）算法进行双层匹配矫正,剔出误匹配特征对,实现相对定位目标的准确识别。实验结果表明,针对复杂地面建筑场景,该方法的相对误识别率最大为0.125,绝对误识别率为0.028。基本满足成像末制导相对定位技术稳健性好、识别精度高、抗干扰能力强等要求。     

Preferential Image Segmentation Using Trees of Shapes

A novel preferential image segmentation method is proposed that performs image segmentation and object recognition using mathematical morphologies. The method preferentially segments objects that have intensities and boundaries similar to those of objects in a database of prior images. A tree of shapes is utilized to represent the content distributions in images, and curve matching is applied to compare the boundaries. The algorithm is invariant to contrast change and similarity transformations of translation, rotation and scale. A performance evaluation of the proposed method using a large image dataset is provided. Experimental results show that the proposed approach is promising for applications such as object segmentation and video tracking with cluttered backgrounds.      

一种新的基于模板匹配的车型识别

为提高当前车型检测在交通场景下的实时性和准确性,提出了一种新的基于模板匹配的车型识别方法。首先,基于车辆区域的显著性设计了非均匀采点,然后采用梯度量化,二进制图像,线性化内存等手段实现模板的并行化匹配,最后通过kmeans聚类产生多层次的车型模板索引,实现快速查表的车型匹配算法。实验表明,该算法能实时高效地实现交通场景下的车型识别。     

一种新的快速局部不变特征算法

针对传统局部不变特征算子主方向提取不准确和匹配阶段过于耗时的问题,提出一种基于RI-LBP 算子和混合spill 树的快速局部不变特征算法。首先提出一种FAST-Difference 算法,提取出模板图像和待匹配图像的稳定特征点,然后使用旋转不变的RI-LBP 描述符计算特征向量,最后对特征向量集使用混合spill 树进行匹配并使用RANSAC 算法剔除误匹配点。RI-LBP 算子自身的旋转不变性能够在一定程度上克服特征点主方向确定不准确的缺点,使特征描述符的提取更加稳定,并生成更简单的53 维局部不变特征描述符。混合spill 树相对于kd-tree 省略了回溯过程,对于高维数据拥有更好的匹配效率。实验证明:该算法与SURF 算法描述能力相近,旋转和光照条件下比SURF 性能更优,并且匹配速度更快。     

Nonlinear distortion-tolerant filters for detection of road signsin background noise

In a road sign recognition task, many distortions of targets can occur at the same time. Scale invariance, tolerance to both in-plane and out-of-plane rotations and illumination invariance are examples of features that a road sign recognition system must possess. We propose a nonlinear correlator that performs several correlations between an input scene and different reference targets. Postprocessing of nonlinear correlation results permits attainment of a single output for the recognition system. The nonlinear filters provide invariance to. distortions of the target, noise robustness, and rejection of background noise. We combine a bank of nonlinear composite correlation filters to design a more versatile road sign recognition system. The bank of filters allows tolerance to changes in scale and tolerance to a certain degree of input-plane rotation. The synthesized nonlinear composite correlation filter permits tolerance to out-of-plane rotation of the target. The system is tested by analysis of real images, which include different distorted versions of stop signs. The processor can be designed for a variety of road signs in background scenes. The recognition results obtained for the proposed system show its robustness against the aforementioned distortions, any varying illumination conditions and partially occluded objects     

A contour-based approach to multisensor image registration

Image registration is concerned with the establishment of correspondence between images of the same scene. One challenging problem in this area is the registration of multispectral/multisensor images. In general, such images have different gray level characteristics, and simple techniques such as those based on area correlations cannot be applied directly. On the other hand, contours representing region boundaries are preserved in most cases. The authors present two contour-based methods which use region boundaries and other strong edges as matching primitives. The first contour matching algorithm is based on the chain-code correlation and other shape similarity criteria such as invariant moments. Closed contours and the salient segments along the open contours are matched separately. This method works well for image pairs in which the contour information is well preserved, such as the optical images from Landsat and Spot satellites. For the registration of the optical images with synthetic aperture radar (SAR) images, the authors propose an elastic contour matching scheme based on the active contour model. Using the contours from the optical image as the initial condition, accurate contour locations in the SAR image are obtained by applying the active contour model. Both contour matching methods are automatic and computationally quite efficient. Experimental results with various kinds of image data have verified the robustness of the algorithms, which have outperformed manual registration in terms of root mean square error at the control points.     

基于透视不变量的平面曲线的识别

提出一种快速有效的平面曲线的识别方法,在这种方法中,我们从单幅图象中提取表征曲线形状的描述子,该描述子由曲线上透视不变点之间的射影距离不变量构成,且不受物体和摄象机之间的位置、方向以及摄象机物理参数的影响。因此这种识别算法不受透视畸变的限制,本文用一组起初的平面物体进行了识别实验,结果表明这些形状描述 平面 曲线的识别有很好的性能。     

惯性组合导航系统中基于BRISK的快速景象匹配算法

针对景象匹配/惯性组合导航系统对景象匹配算法精确性、实时性和鲁棒性的要求,提出惯性组合导航用基于二进制鲁棒不变尺度关键点(BRISK)特征描述符的高精度快速景象匹配算法。首先,结合惯性导航的误差特性设置BRISK特征检测子及描述子参数,提取参考图和实测图的BRISK特征和描述符;然后,根据最近邻汉明距离准则获取匹配的BRISK特征点对;最后,利用RANSAC方法和最小二乘算法(LSA),求得位置和航向参数。实验结果表明,本算法具备亚pixel级精度、ms级实时性以及优越的抗噪声、抗光照变化和抗旋转尺度变换能力。     

Multiscale gradient watersheds of color images

We present a new framework for the hierarchical segmentation of color images. The proposed scheme comprises a nonlinear scale-space with vector-valued gradient watersheds. Our aim is to produce a meaningful hierarchy among the objects in the image using three image components of distinct perceptual significance for a human observer, namely strong edges, smooth segments and detailed segments. The scale-space is based on a vector-valued diffusion that uses the Additive Operator Splitting numerical scheme. Furthermore, we introduce the principle of the dynamics of contours in scale-space that combines scale and contrast information. The performance of the proposed segmentation scheme is presented via experimental results obtained with a wide range of images including natural and artificial scenes.     

一种仿射不变的直线描述子与直线匹配

从图像中提取的直线常出现不完整、端点位置不准确等问题,针对这些问题造成的直线匹配难点,本文提出了一种仿射不变的直线描述子.首先将待匹配直线离散为对应点的集合,将直线描述转化为点的描述,避免了直线不完整造成的支撑区域大小不一致的问题;然后结合直线的方向和长度,定义点描述子的主方向和尺度,通过统计离散点集的局部邻域的梯度信息使描述子具有仿射不变性.为了提高直线匹配速度,在进行直线描述之前,本文采用了极线约束精简了待匹配直线集合,再利用最近邻距离比准则对直线精确匹配.实验结果表明本文提出的直线描述子在仿射、亮度、视点、遮挡等变化条件下具有精确的匹配性能.     

一种抗噪声激光主动成像目标识别方法

提出一种基于轮廓曲率去噪和仿射不变矩的目标识别方法,适用于激光主动成像这样的高噪声复杂应用场合。通过计算每个像素及其邻域的轮廓曲率,判断像素携带的信息量大小,据此对像素点进行分类。对分属不同类别的像素点,使用不同滤波参数的Lee滤波器进行滤波。对滤波后的图像再次提取出轮廓,计算轮廓的仿射不变矩,训练分类器进行目标识别。实验结果表明,本文算法在噪声环境下对目标的仿射变换具有较高的识别率,并且满足激光主动成像识别系统对于实时性的要求。     

Automatic target recognition organized via jump-diffusionalgorithms

Proposes a framework for simultaneous detection, tracking, and recognition of objects via data fused from multiple sensors. Complex dynamic scenes are represented via the concatenation of simple rigid templates. The variability of the infinity of pose is accommodated via the actions of matrix Lie groups extending the templates to individual instances. The variability of target number and target identity is accommodated via the representation of scenes as unions of templates of varying types, with the associated group transformations of varying dimension. We focus on recognition in the air-to-ground and ground-to-air scenarios. The remote sensing data is organized around both the coarse scale associated with detection as provided by tracking and range radars, along with the fine scale associated with pose and identity supported by high-resolution optical, forward looking infrared and delay-Doppler radar imagers. A Bayesian approach is adopted in which prior distributions on target scenarios are constructed via dynamical models of the targets of interest. These are combined with physics-based sensor models which define conditional likelihoods for the coarse/fine scale sensor data given the underlying scene. Inference via the Bayes posterior is organized around a random sampling algorithm based on jump-diffusion processes. New objects are detected and object identities are recognized through discrete jump moves through parameter space, the algorithm exploring scenes of varying complexity as it proceeds. Between jumps, the scale and rotation group transformations are generated via continuous diffusions in order to smoothly deform templates into individual instances of objects.