共查询到19条相似文献,搜索用时 137 毫秒
2.
在研究图像拼接理论的基础上,改进了拼接算法中的特征点匹配问题。首先利用Harris算法进行角点检测,然后利用归一化相关法进行匹配,接着利用该文中提到的方法来去除误匹配,从而得到匹配点对。实验结果证明该方法有效地提高了图像拼接的精度和速度。 相似文献
3.
本文提出一种基于自适应非最大抑制策略的Harris角点检测算法;算法从角点响应函数的局部极大值入手,计算图像中每个像素点的局部极大值通过设置抑制半径与角点响应函数的局部最大值关联最终获取角点。实验表明,该算法检测出的角点均匀分布,提高了检测角点的准确性,算法能够应用于图像特征匹配、运动估计等方面。 相似文献
4.
基于单片机系统的倒车雷达以ARM单片机为主控,由超声波检测模块、摄像头图象采集模块、通信模块、显示模块和LINUX人机交互界面组成。超声波检测模块具有温度补偿功能,大大提高了倒车雷达测距的精度。经过实际电路调试,倒车雷达的测距效果良好,显示界面优美。 相似文献
5.
6.
冯焕飞 《中小企业管理与科技》2013,(1):324-325
针对特征点检测和相机标定精度问题,提出了一种亚像素级的角点检测和相机标定方法。该方法对角点的提取首先运用传统的方法得到初始值,并以此为初始值从棋盘格图像中搜索边缘,然后拟合边缘数据,并将拟合得到的曲线的交点作为角点的最终值,最后以这些角点作为标定相机的特征点对相机进行标定。实验结果表明,该方法提高了特征点提取的准确度和精度,以此提高了相机标定的精度。 相似文献
7.
为了克服传统的局部特征匹配算法对图像的尺寸和旋转比较敏感的缺点,文章提出了一种基于Harris和SIFT的特征匹配算法。该算法首先进行Harris角点提取,利用圆的旋转不变性和多维向量来构造SIFT特征描述子,然后利用极线约束降低对匹配点的搜索空间,最后度量特征描述子之间的欧氏距离,运用双向匹配技术得到最终的匹配结果。实验结果表明,该算法能提高匹配精度,减少匹配时间。 相似文献
8.
9.
10.
11.
This paper investigates the method of matching regarding two crucial implementation choices: the distance measure and the type of algorithm. We implement optimal full matching—a fully efficient algorithm—and present a framework for statistical inference. The implementation uses data from the NLSY79 to study the effect of college education on earnings. We find that decisions regarding the matching algorithm depend on the structure of the data: In the case of strong selection into treatment and treatment effect heterogeneity a full matching seems preferable. If heterogeneity is weak, pair matching suffices. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
12.
从物流运输效率和运输安全的角度,研究提出入选配载方案的箱数最大(“甩箱”摄少),车辆的平均重心高最低和车轴平均集重差最小为目标,基干双层集装箱的双层装载结构的运输安全条件为约束的配载方案优化的多目标模型,设计了求解该问题的距离理想点算法,对多目标函数极值进行加权整合得到最优配载方案,并通过实例验证了模型的有效性。 相似文献
13.
14.
运用入侵检测系统的融合模式匹配算法取得待匹配的字符串集合的公共前缀与文本匹配,若为单模式匹配则匹配结束,若为多模式匹配则将文本被分割成的字符串集中的字符串分别与模式串匹配,该融合算法对单模式匹配和多模式匹配均提高了效率,识别了正文的大小写。 相似文献
15.
16.
17.
18.
Mark de Rooij 《Statistica Neerlandica》2001,55(2):157-181
The present paper is concerned with the analysis of repeated transition frequency tables, for example, occupational mobility data measured in different cohorts. The association present in such a table will be modeled by a distance in Euclidean space. A large distance corresponds to a small association; a small distance corresponds to a large association. A more direct interpretation is that more transitions occur between categories that are close together in a social space. It is assumed that the same social structure (space) exists for the different slices (cohorts/time points) of a table, but that the dimensions of this space are weighted for the different slices, i.e., for each slice the dimensions are stretched or squeezed. We will propose a model, discuss an algorithm to obtain maximum likelihood estimates and apply the model to an empirical data set. 相似文献
19.
David Cantala 《Review of Economic Design》2011,15(4):293-316
For firms with responsive preferences, we prove that the set of stable matchings unanimously preferred by workers to any firm
quasi-stable matching has a lattice structure. This follows from a generalization of the Decomposition Lemma. The result does
not hold when firms have q-substitutable preferences. Nevertheless, we show that the set of stable matchings unanimously preferred by workers to a firm
quasi-stable matching contains an element which is unanimously least preferred by workers, and most preferred by firms. When
a firm quasi-stable matching is fed into our extension of the Deferred Acceptance algorithm (where firms propose), the existence
of this matching guarantees the success of the algorithm. 相似文献