您现在的位置: 首页> 研究主题> 内点

内点

内点的相关文献在1960年到2022年内共计208篇,主要集中在数学、自动化技术、计算机技术、测绘学 等领域,其中期刊论文154篇、会议论文2篇、专利文献245765篇;相关期刊115种,包括职业技术(下半月)、合肥师范学院学报、太原科技大学学报等; 相关会议2种,包括中国工程热物理学会传热传质学学术会议、2007年“信息化测绘论坛”暨中国测绘学会年会等;内点的相关文献由293位作者贡献,包括杨世国、朱德通、齐继兵等。

内点—发文量

期刊论文>

论文:154 占比:0.06%

会议论文>

论文:2 占比:0.00%

专利文献>

论文:245765 占比:99.94%

总计:245921篇

内点—发文趋势图

内点

-研究学者

  • 杨世国
  • 朱德通
  • 齐继兵
  • 万新旺
  • 向本勉
  • 杨振诚
  • 沈利祥
  • 王云娟
  • 陈中倩
  • 徐赐文
  • 期刊论文
  • 会议论文
  • 专利文献

搜索

排序:

年份

期刊

    • 熊超; 乌萌; 刘宗毅; 郭浩; 金峰
    • 摘要: 视觉里程计是通过单个相机或多个相机所获得的图像序列作为输入来估计自身运动的方法。应用领域涵盖机器人、可穿戴计算、增强现实和自动驾驶等。本文进行了随机抽样一致性算法和利用Huber核函数约束的光束法平差算法的研究,并在公开的KITTI标准数据集上进行了算法实验验证。实验结果表明:随机抽样一致性算法可以实时有效地进行异值点剔除。利用Huber核函数约束的光束法平差后,在100m的路径上的视觉里程计平面位置误差RMS值为2.09m,平面位置精度提升约17.72%。
    • 汪开云
    • 摘要: 本文主要比较拓扑空间中的聚点、孤立点、内点、边界点以及外点,从孤立点的角度深入分析它们之间的区别与联系.针对实际教学过程中学生容易出现的三个误区,建议在一般拓扑学的教学过程中,教师不仅要引导学生厘清这五类特殊点的定义,还需要加强对孤立点的讲解,从而加深学生对孤立点的理解.
    • 邱国清
    • 摘要: Region filling algorithm is widely used in drawing, but the arbitrary polygon nested region filling algorithm is very difficult to achieve, in order to solve this problem, puts forward new area filling algorithm that based on equidistant parallel lines. Firstly, draw a set of parallel lines use the same intervals. Secondly, calculation the intersection that all parallel lines with arbitrary nesting the polygon. Finally, use the interval value as a parameter sub block of size, each line contains the parallel calculation of the number of blocks and coordinates and filling, completion of the entire region filling at last. In the process of the experiment, solve the problem of computing in intersection of the nested polygons with the parallel lines is solved. Use multi group data through the application of independent design show that the algorithm can quickly and accurately complete any number of nested polygon area filling and explain the technical difficulties and algorithm complexity which arise in the process of experiment.%区域填充算法在制图中有着广泛的应用,但目前对任意多个多边形相互嵌套的区域填充算法很难实现,为此提出一种基于等间距平行线的区域填充算法.首先,按一定的间隔绘制一组平行线;其次,计算所有平行线与任意嵌套的多边形的交点;最后,以间隔值作为子块大小的参数,计算每条平行线所包含的子块个数及坐标值并填充,最终完成整个区域填充.在实验的过程中解决了如何准确计算相互嵌套的多边形同时与平行线都有交点的问题.通过自主设计的应用程序验证多组数据,表明该算法能快速准确地完成任意数量的多边形相互嵌套的区域填充并对实验过程中的技术难点和算法复杂度做了分析.
    • 邱国清1
    • 摘要: 区域填充算法在制图中有着广泛的应用,但目前对任意多个多边形相互嵌套的区域填充算法很难实现,为此提出一种基于等间距平行线的区域填充算法。首先,按一定的间隔绘制一组平行线;其次,计算所有平行线与任意嵌套的多边形的交点;最后,以间隔值作为子块大小的参数,计算每条平行线所包含的子块个数及坐标值并填充,最终完成整个区域填充。在实验的过程中解决了如何准确计算相互嵌套的多边形同时与平行线都有交点的问题。通过自主设计的应用程序验证多组数据,表明该算法能快速准确地完成任意数量的多边形相互嵌套的区域填充并对实验过程中的技术难点和算法复杂度做了分析。
    • 车雨红
    • 摘要: 本文专门区分平面中点集的内点、边界点、聚点和孤立点,运用举例法从以上各类点与点集的所属关系和它们间的相互关系两个方面帮助学生更加深刻和清晰地进行区分.
    • 陆祥雪
    • 摘要: 学生学习几何感到为难的是辅助线的画法.按用途辅助线我们可以分为两类,一类是构图,构造出解答题目时需要应用的几何定义、定理的图形,以便利用几何定义、定理;
    • 摘要: 【男子车内点蚊香驱蚊不料香灰掉落引燃豪车】近日,江苏省苏州市某停车场内一奔驰越野车内突然冒浓烟。消防员砸窗灭火,发现脚垫烧焦,真皮座椅被烧坏。车主赶到后十分后悔。原来他离开前在车内点蚊香驱蚊,不料香灰掉在脚垫上引发火灾!
    • 肖春宝; 冯大政
    • 摘要: Aiming to quickly and accurately select inliers from initial matching results of local invariant fea-tures, an inlier selection algorithm is proposed by jointly exploiting the distribution consistencies of features in location, scale and orientation. Firstly, coarse selection is performed by grouping feature correspondences into clusters according to disparities via the Mean-Shift algorithm. Secondly, K-nearest neighbors of each feature are found in the cluster to which it belongs. Then parameters of transformation between the two local image regions where each pair of features are located are estimated by feature scales and orientations, and a K-nearest neighbor matching similarity is calculated. Finally, according to K-nearest neighbor matching si-milarities, inliers are selected from the candidate matching set obtained by coarse selection. Experimental results show that the proposed algorithm is superior to the state-of-the-art inlier selection algorithms in terms of precision, recall and speed, and is robust to large changes between images in viewpoint, scale and rotation.%为了快速、准确地从局部不变特征初始匹配中选取内点提出一种联合利用特征点在位置、尺度和方向上的分布一致性进行内点选择的算法.首先采用均值漂移算法按视差对特征点对聚类实现粗选;然后找出特征点在类内的K近邻特征再利用特征的尺度和方向估算每个特征点对所在的二局部图像区域之间的变换参数并计算K近邻匹配相似度;最后依据K近邻匹配相似度从粗选获得的候选匹配集中选出内点.实验结果表明该算法在准确率、召回率和速度方面优于当前最新的内点选择算法对图像间大幅度的视点、尺度和旋转变化具有较高的鲁棒性.
    • 覃力; 唐卫清; 李士才
    • 摘要: A method based on classification tree with attributes is presented in this paper, to calculate the simi-larity without engineering parameters between different process plant equipments. In this method, it is needed to firstly build a classification tree that can meet the completeness requirements defined below and map the equipment to tree node. Then, min-distance, information granularity and smooth ratio of set to union of attrib-ute descriptions are involved in the calculation. The result shows that it has good mathematical properties and can be physically explained well, it also shows that the method performs well when applied to practice.%为了解决缺失工程参数时设备相似度的计算问题提出一种基于带属性分类树的设备相似度计算方法.首先建立满足文中定义的完备性的分类树;然后将设备映射到类别结点上利用结点间的最短距离、信息粒度及属性描述的平滑交并比计算设备间的相似度.结果表明该方法具有良好的数学特性和物理解释且在实际应用中表现良好.
    • 沈红新
    • 摘要: For a spacecraft with high thrust,a general equations based on variational calculus for formulating the Hamilton boundary value problem(HBVP)is proposed,where the optimality conditions on interior points and other general boundary points(inclucling initial and final points)are in the same manners,so that our equations tend to reveal the more intrinsic analytic structure of HBVP.The detailed optimality conditions can be determined conveniently according to the general equations;therefore,the tedious task of formulating HBVP is precluded.Simulations show that the method proposed in this paper could ensure obtaining the optimal flight path of the high-thrust spacecraft effectively and efficiently.%针对大推力航天器的Hamilton边值问题(HBVP),提出一组基于变分法的通用方程,其中内点和其它端点(包括始、末端点)可以满足统一的方程形式,由此反映了更本质的边值条件解析结构.具体问题的最优性必要条件均可以从本文给出的通用方程中较方便地推出,避免了以往构造边值问题复杂繁琐的困难.仿真结果表明,本文方法可以保证有效、快速地获得大推力航天器的最优飞行路径.
  • 查看更多

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号