基于网格IC图象的多模板快速匹配算法

为了加快 IC图象中多个相似单元模板的匹配与定位 ,提出了一种基于网格 IC图象的多模板快速匹配算法 .该算法首先抽取网格图象和模板的二值拓扑结构 ,以构成图象和模板的粗分辨率表示 ;然后 ,在拓扑结构表示上通过综合来构造多模板的二叉树模型 ;接着 ,在二值拓扑结构表示上运用树模型进行搜索 ,在搜索过程中应用二叉决策树识别多个模板 ;最后 ,将粗匹配得到的目标 ,在原图象对应位置的小邻域内进行二次匹配 ,以确定模板和对应实例的位置 .应用此算法对 IC图象库进行测试 ,结果表明 ,所提出的多模板二叉决策树搜索算法与逐个模板匹配的方法相比 ,速度和效率均有较大幅度的提高     

3D reconstruction for a scanning electron microscope

An algorithm for the reconstruction of the 3D shape of the surface of a micro-object from a stereo pair of images obtained on a raster electron microscope (REM) has been considered. A model of building an image in REM has been presented. The SIFT algorithm was used for determination of the correspondence points. The correspondence points are used to determine the mutual position of the object in a stereo pair by the RANSAC method. A set of points is created in the 3D space, which is later interpolated to reconstruct the 3D surface.     

基于几何与图像混合绘制中的快速WARP变换算法研究

基于几何与图像的混合绘制中，3D Warp算法以严格的数学变换为基础，从而能够保证准确的投影关系，但该算法在实时绘制阶段需进行大量的数学运算，故其时间复杂度较高，该文提出了一种新的快速Warp变换算法，算法以3D Warp算法为基础，采用了崭新的投影过程，从而使时间复杂度较3D Warp算法有较大幅度的下降（降低约7．51倍）。同时，该算法是一种流水结构，能够有效利用现有的加速硬件，而无需改变图形硬件的体系结构。     

Inexact graph matching for model-based recognition: Evaluation and comparison of optimization algorithms

A method for segmentation and recognition of image structures based on graph homomorphisms is presented in this paper. It is a model-based recognition method where the input image is over-segmented and the obtained regions are represented by an attributed relational graph (ARG). This graph is then matched against a model graph thus accomplishing the model-based recognition task. This type of problem calls for inexact graph matching through a homomorphism between the graphs since no bijective correspondence can be expected, because of the over-segmentation of the image with respect to the model. The search for the best homomorphism is carried out by optimizing an objective function based on similarities between object and relational attributes defined on the graphs. The following optimization procedures are compared and discussed: deterministic tree search, for which new algorithms are detailed, genetic algorithms and estimation of distribution algorithms. In order to assess the performance of these algorithms using real data, experimental results on supervised classification of facial features using face images from public databases are presented.     

基于形变模型由立体序列图象恢复物体的3D形状

结合立体视觉和形变模型提出了一种新的物体3D形状的恢复方法。采用立体视觉方法导出物体表面的3D坐标;利用光流模型估计物体的3D运动,根据此运动移动形变模型,使其对准物体的表面块;由形变模型将由各幅图象得到的离散的3D点融为一起,得到物体的表面形状。实验结果表明该方法能用于形状复杂的物体恢复。     

A flexible vision-based algorithm for a book sorting system

A flexible vision-based algorithm for a book sorting system is presented. The algorithm is based on a discrimination model that is adaptively generated for the current object classes by learning. The algorithm consists of an image normalization process, a feature element extraction process, a learning process, and a recognition process. The image normalization process extracts the contour of the object in an image, and geometrically normalizes the image. The feature extraction process converts the normalized image to the pyramidal representation, and the feature element is extracted from each resolution level. The learning process generates a discrimination model, which represents the differences between classes, based on hierarchical clustering. In the recognition process, the input images are hierarchically discriminated under the control of the decision tree. To evaluate the algorithm, a simulation system was implemented on a general-purpose computer and an image processor was developed     

一种文档图像多尺度分割算法

1.研究背景随着数字图书馆和电子办公应用的日益普及,面对大量纸质原始文件及资料的数字化,直接扫描、存储和传输文档的需求越来越多,为了解决扫描文档图像庞大信息量和存储容量、传输带宽之间的矛盾,迫切需要专门针对文档图像研究新的高性能压缩算法。根据扫描文挡页面的内容特征,提高压缩比最有挖掘潜力的方法是对文档图像进行图文分割后再分别     

L1-L 2正则化的图像复原交替优化算法

为快速且准确地重建原始图像,提出一种新的图像复原算法。在稀疏表示的框架下,建立图像复原问题的约束优化模型,同步估计原始图像及其稀疏表示。复原模型的目标函数包含L1-L 2双正则项,为此采用交替优化将模型分解为若干子问题,交替迭代求解这些子问题。其中不可微分的子问题,由迭代重加权方法进行处理。实验结果表明,仅需较少次迭代该算法即可获得原始图像及其稀疏表示的最优估计。与某些优秀的同类算法相比,该算法的速度更快,复原图像的质量更高。     

Approximation of displacement fields using wavefront region growing

This paper presents a novel approach for the computation of displacement fields along contours which correspond to moving homogeneous regions in an image sequence. Individual frames of the image sequence are treated one at a time by performing segmentation and 2D motion analysis simultaneously. For the first frame, an original segmentation of the image into disjoint regions is assumed to be given in the form of pixel markings and the properties of these regions. The analysis of each new frame consists of (a) finding the new segmentation and (b) a set of displacement vectors that link corresponding points on the original and the new contour. The new region is assumed to overlap with the original region, such that their intersection is not empty. After finding the intersection, wavefront region growing is applied to obtain the new region and to compute a set of tentative displacement vectors. The final approximation is found by using a relaxation-type algorithm which “rotates” the mapping between the original and the new boundary until a correspondence with minimum deformation is found. The proposed algorithm is simple and lends itself to parallel implementation. Various examples are presented to illustrate the approach.     

A New Multiwavelet-Based Approach to Image Fusion

Image fusion refers to the techniques that integrate complementary information from multiple image sensor data such that the new images are more suitable for the purpose of human visual perception and the compute-processing tasks. In this paper, a new image fusion algorithm based on multiwavelet transform to fuse multisensor images is presented. The detailed discussions in the paper are focused on the two-wavelet and two-scaling function multiwavelets. Multiwavelets are extensions from scalar wavelet, and have several unique advantages in comparison with scalar wavelets, so that multiwavelet is employed to decompose and reconstruct images in this algorithm. In this paper, the image fusion is performed at the pixel level, other types of image fusion schemes, such as feature or decision fusion, are not considered. In this fusion algorithm, a feature-based fusion rule is used to combine original subimages and to form a pyramid for the fused image. When images are merged in multiwavelet space, different frequency ranges are processed differently. It can merge information from original images adequately and improve abilities of information analysis and feature extraction. Extensive experiments including the fusion of registered multiband SPOT multispectral XS1\XS3 images, multifocus digital camera images, multisensor of VIS\IR images, and medical CT\MRI images are presented in this paper. In this paper, mutual information is employed as a means of objective assessing image fusion performance. The experiment results show that this fusion algorithm, based on multiwavelet transform, is an effective approach in image fusion area.     

Log-polar height maps for multiple range image registration

We propose a method for coarse registration of multiple range images that uses a log-polar height map (LPHM) as the key for establishing correspondence. The LPHM is a local height map orthogonally mapped on the tangent plane with the log-polar coordinate system. The input range images are roughly represented by signed distance field (SDF) samples. For each SDF sample, an LPHM is generated and is converted to an invariant feature vector. Point correspondence is established by a nearest neighbor search in feature space. The RANSAC algorithm is applied on the corresponding point pairs between each pair of range images, and the pairwise registration of input range images is determined by the extracted inlier point pairs. Finally, the global registration is determined by constructing a view tree, which is the spanning tree that maximizes the total number of inlier point pairs. The result of coarse registration is used as the initial state of the fine registration and modeling. The proposed method was tested on multiple real range image datasets.     

Fast Feature‐Oriented Visual Connection for Large Image Collections

Deriving the visual connectivity across large image collections is a computationally expensive task. Different from current image‐oriented match graph construction methods which build on pairwise image matching, we present a novel and scalable feature‐oriented image matching algorithm for large collections. Our method improves the match graph construction procedure in three ways. First, instead of building trees repeatedly, we put the feature points of the input image collection into a single kd‐tree and select the leaves as our anchor points. Then we construct an anchor graph from which each feature can intelligently find a small portion of related candidates to match. Finally, we design a new form of adjacency matrix for fast feature similarity measuring, and return all the matches in different photos across the whole dataset directly. Experiments show that our feature‐oriented correspondence algorithm can explore visual connectivity between images with significant improvement in speed.     

Parameter identification for a two-dimensional image fieId†

This paper presents a new approach to image enhancement based on a maximum likelihood identification method. It is assumed that the images are corrupted by a white gaussian noise field. A two-dimensional extension of the classical ARMA model is developed as a mathematical model for the image fields. Since the maximum likelihood identification leads to a parametric optimization problem, Davidon's algorithm is applied for numerical solutions. The advantage of the present method is that the enhanced images based on the predicted estimates are directly obtained from the noise-corruptod images, so that the autocovariance function of the original image is not required. To improve the quality of the enhanced images, a filtering algorithm is also derived. Digital simulation studies are carried out for various artificial images to show the feasibility of this approach.     

基于小波域局部高斯模型的图像复原

图像复原的目的是将原始图像从观测到的降析图像中恢复出来.提出了一种基于小波域局部高斯模型的线性图像复原算法.小波域局部高斯模型采用高斯函数刻画子带系数的局部概率分布,由于这一模型具有很好的局部自适应性,并能正确地反映图像的局部结构信息,因此算法以此作为自然图像的先验模型,把图像复原问题转化为一个约束优化问题并用共轭梯度法对其进行求解.实验结果表明,基于小波域局部高斯模型的图像复原算法较好地再现了各种边缘信息,复原出的图像在信噪比和主观视觉效果方面都有显著的提高.     

Road shape reconstruction by local flatness approximation

A new algorithm is presented for reconstructing the three-dimensional (3-D) road shape from camera images for the purposes of navigating autonomous land vehicles. The approximation that the road surface is locally flat enables us to determine a one-to-one correspondence between the two road boundaries, which together with our knowledge about roads (the 'model' of roads) determines the 3-D road shape. In order to cope with the inaccuracy of image data, a least-squares curve-fitting technique is proposed, and the behaviours of image noise are analysed. Some examples based on real images are given.     

一个稳健的用于HDR图像的相机响应函数标定算法

在Mitsunaga和Nayar给出的多项式模型的基础上,增加了图像亮度为0映射到场景亮度也为0的限制条件,并改进了迭代结束条件,所得到的新的标定算法可以使用多张不同曝光度的图像来标定相机响应函数,不同曝光度可以通过改变相机的光圈大小和曝光时间长短来得到.文中所述算法可以自动估计并最后求得精确的曝光度比,省略了原有算法需要输入曝光度比估计值的步骤.算法得到了相机响应函数后,可用多张不同曝光度的图像合成高动态范围的图像.和原有算法相比,此算法的稳健性得到了很大提高,实验表明它对所选的所有输入图像都能收敛,并且得到最优解.     

GMSAC——一种鲁棒的基于高斯混合模型的基础矩阵估计算法

基础矩阵的鲁棒性估计是计算机视觉领域的一个基本问题。为了提高基础矩阵的估计精度,首先指出了现有的鲁棒性算法——RANSAC和MLESAC理论上的缺陷和实际应用中的问题;然后通过详细分析局外点复杂的成因,同时运用混合高斯分布代替均匀分布分别对不同成因的局外点进行了有针对性的建模,并提出了一种鲁棒性更强的算法——GMSAC。实验结果表明,相比于MLESAC算法,GMSAC算法提供了更高的模型似然度和计算精度。     

基于混合有理插值的图像渐变算法*

针对现有的图像渐变方法只考虑两个图像间渐变的情况,提出一种非线性的多幅图像间渐变的新方法,即一元混合有理插值方法。将多幅图像间相同位置的像素点建立对应关系,按照该关系建立一元混合有理插值函数,对插值函数进行重采样,得到一系列的渐变中间图像。实验表明,新算法在反映空间数据的分布特性、保证图像纹理特征方面均优于其他算法,具有计算精度高、适应性强、易于编程实现等优点,是一种较实用的算法。     

不携密的安全批量隐写模型

采用数字图像的缩放算法,提出了一种符合绝对安全性定义的批量隐写模型。通过对隐秘图像进行分块,利用缩放算法推演隐秘信息,载体图像不直接携带隐秘信息。首先,选取n幅载体图像,通过特定算法将载体图像放大到指定倍数;然后,推出秘密图像的像素信息与新图像中像素信息的相关性;最后,再缩小为原图大小进行传输。由于未直接修改图像像素,提取密图不需原始图像,提高了隐秘信息的安全性。实验结果和分析表明了算法的有效性,适用于图像隐蔽通信。     

Iteration-free clustering algorithm for nonstationary image database

Image database systems must effectively and efficiently handle and retrieve images from a large collection of images. A serious problem faced by these systems is the requirement to deal with the nonstationary database. In an image database system, image features are typically organized into an indexing structure, and updating the indexing structure involves many computations. In this paper, this difficult problem is converted into a constrained optimization problem, and the iteration-free clustering (IFC) algorithm based on the Lagrangian function, is presented for adapting the existing indexing structure for a nonstationary database. Experimental results concerning recall and precision indicate that the proposed method provides a binary tree that is almost optimal. Simulation results further demonstrate that the proposed algorithm can maintain 94% precision in seven-dimensional feature space, even when the number of new-coming images is one-half the number of images in the original database. Finally, our IFC algorithm outperforms other methods usually applied to image databases.