基于最小二乘法改进的随机圆检测算法

提出了一种利用最小二乘法迭代修正随机圆检测的改进算法.解决了由于随机圆检测算法中阈值选取不当,造成同一个圆被分割为多个圆的问题.首先根据随机选取四个点求解出的圆参数,得到属于假设圆的点集;然后由当前点集,利用最小二乘法重新计算得到新的圆参数;接着根据新参数,检测集合中属于当前假设圆的新点,加入到当前点集中,重新计算圆参...     

一种基于计算几何方法的最小包容圆求解算法

为实现点集最小包容圆(最小外接圆)的求解,将计算几何中的α-壳的概念应用到最小包容圆的计算过程,提出了一种精确有效的最小包容圆求解算法.根据α-壳定义及最小包容圆性质,证明当1/α等于最小包容圆半径时点集的α-壳顶点共圆,1/α小于最小包容圆半径时α-壳不存在,1/α大于最小包容圆半径时随着1/α减小α-壳顶点数逐渐减小的规律.将α-壳顶点数目作为搜索最小包容圆半径的依据,实现了最小包容圆半径的搜索和最小包容圆的求解.     

采用平面特征搜索的深度图像坐标对准

提出了一种包含平面特征的激光扫描深度图像行之有效的坐标自动调整方法.通过移动包围盒的方法在数据点集内自动搜索并判定特定平面特征作为基准;计算出平面特征的平均法向量,将点集的坐标向基准平面的法向对准;最后通过缩小包围盒范围并重复搜索,使点集的方向规范化.此方法在液货舱激光扫描数据上进行了应用,数据经过对准处理后,大大方便了后续的投影、分割等模型重建工作.     

基于最近邻搜索耦合近邻损耗聚类的图像伪造检测算法

目的为了解决当前图像伪造检测算法在对图像进行伪造检测时,主要依靠全局搜索的方式来完成特征点匹配,导致其检测效率较低,且在对复杂伪造图像进行检测时,易出现检测精度不高和检测错误的不足。方法提出基于最近邻搜索耦合近邻损耗聚类的图像伪造检测算法。首先引入积分图像的方法,对图像进行预处理,借助Hessian矩阵行列式来提取特征点。利用特征点构建圆形区域,通过求取圆形区域内Haar小波响应获取特征点的特征描述符。然后通过特征描述符建立KD树索引,利用最近邻搜索方法代替SURF中全局搜索的方法,对SURF进行改进,完成特征点的匹配。最后,利用特征点间的近邻关系求取近邻函数值,通过近邻函数值对特征点进行聚类,完成图像的伪造检测。结果实验结果显示,与当前图像伪造检测算法相比,所提算法具有更高的检测效率以及更高的检测正确度。结论所提算法具备较高的检测精度,在印刷防伪与信息安全等领域具有较好的应用价值。     

真假目标红外图像相似度检测算法

本文提出了真,假目标红外图像相似性定量的计算方法.该方法应用小波变换将真、假目标的红外图像分解为不用层次的子图像;利用Harris角点检测算子提取不用层次子图像的特征点,构成特征点集;并利用改进的Hausdorff距离计算出特征点集之间的Hausdorff距离.该距离越小说明真、假目标的红外图像越相似,也就说明假目标的红外示假效果越好.实验结果证明该算法能客观准确的计算出真、假目标红外图像的相似度,计算过程快速.     

反铁电晶体PbTaO3的对称性和序参量

根据室温下X射线衍射结果,仔细研究了反铁电晶体PbTaOa的晶体结构。确定PbTaO3在973K发生顺电一反铁电相变,反铁电相对称性所属点群是P2／m（C2i）。用轴矢量R作为序参量来描述反铁电相便是对称性的变化,对于已得到的晶体相变前后的对称点群,应用居里原理,得到了理想结果。     

随机圆检测快速算法

针对随机圆检测算法每随机采样4点约需计算4次圆参数,本文提出一种快速的随机圆检测算法.该算法在判断随机采样的4点是否能确定一个候选圆的过程中,若其中1点到其余3点所确定的圆边界的距离大于某一阈值,则重新随机采样四点进行计算.通过该阈值大量减少了圆参数的计算次数,同时结合快速证据积累方法确认候选圆是否为真圆.合成图像和实际图像的实验结果表明:该算法较随机圆检测算法的计算速度有了较大提高,具有对局部信息缺损不敏感和噪声鲁棒性强等特点.     

一种新颖的虹膜图像预处理方法

本文提出了一种新颖的虹膜图像预处理方法,该方法打破了传统的定位思想,并且将噪声检测的过程由空间域转到频域来完成.首先,在原始图像上填充瞳孔内的光斑;其次,将人眼图像展开成矩形,在矩形图像上以点线检测代替传统的圆检测确定虹膜的内外边界,并进行归一化;最后在归一化后的虹膜图像上利用2D-Galbor滤波器的方向选择性检测眼毛和眼睑,标记干扰区域.实验证明,该方法可以解决内边界不是理想圆造成的瞳孔遗留或纹理损失问题,而且显著降低了虹膜定位时间,提高了虹膜识别的准确性.     

1种提取包装上二维条码的新算法

针对包装上的二维条码,提出了1种快速提取算法.首先使用彩色过滤算法对背景进行过滤,然后利用二次梯度算法获取图像的分割阈值.对于条码的倾斜,使用Hough变换得到图像倾角,再利用二维旋转矩阵旋转图像.最后提出1种最佳的插值方法,以减少目标区域的毛刺以及空白点,确保旋转变换后的图像不失真.     

电子稳像的灰度投影三点局域自适应搜索算法

灰度投影算法是检测图像序列帧间运动矢量,实现电子稳像的关键技术之一。通过对其相关曲线的分析,基于单峰性的特征,提出了三点局域自适应搜索算法,即:在搜索宽度内均匀选取3点,计算比较其相关值,判断相关曲线梯度的变化方向,相应调整搜索参数,获得帧间运动矢量,在此基础上即可进行运动滤波和图像补偿,从而实现电子稳像。当搜索宽度为2n-1(n=1、2……且2n-1小于搜索方向上图像宽度的一半)时其运算量仅为3n,而非以往全局搜索算法的2n 1-1,从而克服了运算量大、耗时长的缺陷。该算法得到了仿真实验的验证。     

Symmetry in halo displays and symmetry in halo-making crystals

The relation between the symmetry in halo displays and crystal symmetry is investigated for halo displays that are generated by ensembles of crystals. It is found that, regardless of the symmetry of the constituent crystals, such displays are always left-right (L-R) symmetric if the crystals are formed from the surrounding vapor. L-R symmetry of a halo display implies here that the cross sections for formation of a halo arc on the left-hand side of the solar vertical and its right-hand side mirror image are equal. This property leaves room for two types of halo display only: a full symmetric one (mmm-symmetric), and a partial symmetric one (mm2-symmetric) in which halo constituents lack their counterparts on the other side of the parhelic circle. A partial symmetric display can occur only for point halos. Its occurrence implies that a number of symmetry elements are not present in the shape of the halo-making crystals. These elements are a center of inversion, any rotatory-inversion axis that is parallel to the crystal spin axis P, a mirror plane perpendicular to the P axis, and a twofold rotation axis perpendicular to the P axis. A simple conceptual method is presented to reconstruct possible shapes of the halo-generating crystals from the halos in the display. The method is illustrated in two examples. Halos that may occur on the Saturnian satellite Titan are discussed. The possibilities for the Huygens probe to detect these halos during its descent through the Titan clouds in 2005 are detailed.     

基于区域自适应模型耦合向量约束的图像匹配算法

目的 为了解决提高图像匹配算法的匹配精度与鲁棒性。方法 设计基于区域自适应模型耦合向量约束规则的图像匹配算法。首先引入采用上下文信息的显著性分析方法,提取图像的显著区域和非显著区域。根据区域的显著性特征构造区域自适应模型,用以动态调整FAST算法中的灰度阈值,提取图像中的特征点。然后,通过欧氏度量将特征点邻域内的点分为长、短点集;通过长点集生成特征方向,利用短点集生成特征向量,以获取特征点的描述符。最后,对特征点之间的Hamming距离进行度量,实现特征点的匹配。利用匹配特征点组成的向量建立向量约束规则,对匹配特征点进行优化,完成图像匹配。结果 实验结果表明,与当前图像匹配技术相比,所提算法具有更高的鲁棒性与匹配正确度,当目标旋转角度达到100°时,其匹配准确率仍可达到88.95%。结论 所提算法具有良好的适应性,在遇到几何变换时,具有较好的匹配精度,在图像处理、信息安全等领域具有良好的参考价值。     

一种基于快速搜索圆心的圆度新算法

根据ISO 1101-1983对圆度定义的要求,提出一种基于快速搜索圆心的圆度新算法。通过建立的数学模型和算法流程,快速搜索并找到两个同心圆和圆心。首先,采用最小二乘法拟合圆心,并获得距离该圆心的最远点和最近点,确定圆心移动方向;然后,结合设置的步长值搜索下一个圆心;最后,经过多次迭代计算直至圆度符合要求。实验结果表明:该算法与区域搜索法相比,圆度计算误差＜1μm,计算效率可提高10倍以上 ,符合工程应用需求。     

Strategy for selecting representative points via tangent spheres in the probability density evolution method

A strategy of selecting efficient integration points via tangent spheres in the probability density evolution method (PDEM) for response analysis of non‐linear stochastic structures is studied. The PDEM is capable of capturing instantaneous probability density function of the stochastic dynamic responses. The strategy of selecting representative points is of importance to the accuracy and efficiency of the PDEM. In the present paper, the centers of equivalent non‐overlapping tangent spheres are used as the basis to construct a representative point set. An affine transformation is then conducted and a hypersphere sieving is imposed for spherically symmetric distributions. Construction procedures of centers of the tangent spheres are elaborated. The features of the point sets via tangent spheres, including the discrepancy and projection ratio, are observed and compared with some other typical point sets. The investigations show that the discrepancies of the point sets via tangent spheres are in the same order of magnitude as the point sets by the number theoretical method. In addition, it is observed that rotation transformation could greatly improve the projection ratios. Numerical examples show that the proposed method is accurate and efficient for situations involving up to four random variables. Copyright © 2007 John Wiley & Sons, Ltd.     

基于Zernike矩的快速图像配准算法

图像配准是机器视觉中的重要研究课题.本文针对任意角度图像配准问题,提出了一种基于Zemike矩的互相关算法.首先根据三角函数的对称性和反对称性,仅基于八分之一单位圆信息,快速计算Zemike矩;然后通过求取图像多个矩的互相关性,确定配准点位置;进而通过最小二乘拟合,得到亚像素配准位置;最终利用Zemike相位信息,估算旋转角度.同时,在线阶段采用径向多项式查表法加速配准过程.实验结果表明,该算法在保障配准精度的前提下显著提高了配准速度.     

A Novel Contour Tracing Algorithm for Object Shape Reconstruction Using Parametric Curves

Parametric curves such as Bézier and B-splines, originally developed for the design of automobile bodies, are now also used in image processing and computer vision. For example, reconstructing an object shape in an image, including different translations, scales, and orientations, can be performed using these parametric curves. For this, Bézier and B-spline curves can be generated using a point set that belongs to the outer boundary of the object. The resulting object shape can be used in computer vision fields, such as searching and segmentation methods and training machine learning algorithms. The prerequisite for reconstructing the shape with parametric curves is to obtain sequentially the points in the point set. In this study, a novel algorithm has been developed that sequentially obtains the pixel locations constituting the outer boundary of the object. The proposed algorithm, unlike the methods in the literature, is implemented using a filter containing weights and an outer circle surrounding the object. In a binary format image, the starting point of the tracing is determined using the outer circle, and the next tracing movement and the pixel to be labeled as the boundary point is found by the filter weights. Then, control points that define the curve shape are selected by reducing the number of sequential points. Thus, the Bézier and B-spline curve equations describing the shape are obtained using these points. In addition, different translations, scales, and rotations of the object shape are easily provided by changing the positions of the control points. It has also been shown that the missing part of the object can be completed thanks to the parametric curves.     

Shi-Tomasi角点区域的拷贝图像检测

针对由于裁剪、翻转和旋转等产生的图像拷贝问题,提出一种Shi-Tomasi角点的拷贝检测算法.先使用Shi-Tomasi角点检测算法提取图像的局部角点;然后在以Shi-Tomasi角点为中心的圆环区域内计算特征向量的协方差描述子(多特征融合);最后通过协方差描述子的相似性度量来检测圆环区域的相似性,并以此判断检测图像是否为原图像的拷贝.实验结果证明,该检测算法对图像的裁剪、旋转等攻击具有较好的鲁棒性.     

大型刚体惯性参数识别的三线扭摆系统实验方法改进研究

精确获取汽车动力总成刚体惯性参数是发动机悬置系统设计的重要前提之一。利用三线扭摆法测量刚体单轴转动惯量精度较高的特点,基于表面固定点确定刚体方位的三点定位方法和测量6个~9个不同方位的多次测量原理,发展了一套适合于大型复杂刚体的惯性参数识别方法。关键技术有:(1)选取刚体表面三个定位点定义一个刚体随动坐标系以描述刚体方位;(2)通过测量刚体定位点至托盘表面参考点(定义一个整体坐标系)的距离,计算出定位点在整体坐标系下的坐标和两个坐标系之间的转换关系;(3)求出各组实验中在动坐标系下的刚体转轴方位和转动惯量;(4)运用最小二乘原理,求解多个转轴的最优交点得到动坐标系下的刚体质心坐标,求解由转动惯量转轴定理导出的线性方程组得到刚体惯性矩阵。实验方法中容易引起误差的环节较多,但是可以根据最小二乘原理进行逐级误差估计和控制。通过误差分析、长方体质量块实验验证和大量的汽车动力总成惯量参数识别实验,证明了该方法的实用性和可靠性。     

Moving least‐square interpolants in the hybrid particle method

The hybrid particle method (HPM) is a particle‐based method for the solution of high‐speed dynamic structural problems. In the current formulation of the HPM, a moving least‐squares (MLS) interpolant is used to compute the derivatives of stress and velocity components. Compared with the use of the MLS interpolant at interior particles, the boundary particles require two additional treatments in order to compute the derivatives accurately. These are the rotation of the local co‐ordinate system and the imposition of boundary constraints, respectively. In this paper, it is first shown that the derivatives found by the MLS interpolant based on a complete polynomial are indifferent to the orientation of the co‐ordinate system. Secondly, it is shown that imposing boundary constraints is equivalent to employing ghost particles with proper values assigned at these particles. The latter can further be viewed as placing the boundary particle in the centre of a neighbourhood that is formed jointly by the original neighbouring particles and the ghost particles. The benefit of providing a symmetric or a full circle of neighbouring points is revealed by examining the error terms generated in approximating the derivatives of a Taylor polynomial by using a linear‐polynomial‐based MLS interpolant. Symmetric boundaries have mostly been treated by using ghost particles in various versions of the available particle methods that are based on the strong form of the conservation equations. In light of the equivalence of the respective treatments of imposing boundary constraints and adding ghost particles, an alternative treatment for symmetry boundaries is proposed that involves imposing only the symmetry boundary constraints for the HPM. Numerical results are presented to demonstrate the validity of the proposed approach for symmetric boundaries in an axisymmetric impact problem. Copyright © 2005 John Wiley & Sons, Ltd.     

Aliasing errors due to quadratic nonlinearities on triangular spectral /hp element discretisations

In this paper, consideration is given to how aliasing errors, introduced when evaluating nonlinear products, inexactly affect the solution of Galerkin spectral/hp element polynomial discretisations on triangles. A theoretical discussion is presented of how aliasing errors are introduced by a collocation projection onto a set of quadrature points insufficient for exact integration, and consider interpolation projections to geometrically symmetric ollocation points. The discussion is corroborated by numerica examples that elucidate the key features. The study is first motivated with a review of aliasing errors introduced in one-dimensional spectral-element methods (these results extend naturally to tensor-product quadrilaterals and hexahedra.) Within triangular domains two commonly used expansions are a hierarchical, or modal, expansion based on a rotationally non-symmetric collapsed-coordinate system, and a Lagrange expansion based on a set of rotationally symmetric nodal points. Whilst both expansions span the same polynomial space, the construction of the two bases numerically motivates a different set of collocation points for use in the collocation projection of a nonlinear product. The purpose of this paper is to compare these two collocation projections. The analysis and results show that aliasing errors produced using a collocation projection on the rotationally non-symmetric, collapsed-coordinate system are significantly smaller than those for a collocation projection using the rotationally symmetric nodal points. In the case of the collapsed coordinate projection, if the Gaussian quadrature order employed is less than half the polynomial order of the integrand, then it is possible for the aliasing error to modify the constant mode of the expansion and therefore affect the conservation property of the approximation. However, the use of a collocation projection onto a polynomial expansion associated with a set of rotationally symmetric nodal points within the triangle is always observed to be non-conservative. Nevertheless, the rotationally symmetric collocation will maintain the overall symmetry of the triangular region, which is not typically the case when a collapsed coordinate quadrature projection is used.