助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   local feature point 在 计算机软件及计算机应用 分类中 的翻译结果: 查询用时:0.062秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

local feature point
相关语句
查询“local feature point”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


A Delaunay strategy based algorithm combined the technology of both graphics and image process for DTM reduction was proposed in this paper. According a certain resolution requirement, DTM data were projected to 2D image space and it's local feature points were detected. Then the local feature points were triangulated by Delaunay method and projected back to 3D space, therefore, a TIN model which met the need of quality was got and the DTM data were reduced. The validity of the algorithm was proved...

A Delaunay strategy based algorithm combined the technology of both graphics and image process for DTM reduction was proposed in this paper. According a certain resolution requirement, DTM data were projected to 2D image space and it's local feature points were detected. Then the local feature points were triangulated by Delaunay method and projected back to 3D space, therefore, a TIN model which met the need of quality was got and the DTM data were reduced. The validity of the algorithm was proved by the experiments at last.

提出了一种将图形生成技术与图像处理相结合,对DTM数据进行最优三角划分的简化DTM数据的算法。依据一定的分辨率条件,将DTM数据转化到二维图像空间,找到它的局部特征点,并将二维空间的特征点利用Delaunay剖分三角化,再映射到三维空间,从而在简化数据的同时,得到一个满足保真性要求的TIN模型。最后实验验证了算法的有效性。

Feature points extraction is crucial for image segmentation and moving object modeling, and uniform sampling always causes lost of details. Illumination variation and noise also make the extracted feature points unreliable because of the sensitivity of classical detector to noise. A method based on 2D Gabor wavelet is presented to extract features, and a dynamic feature clustering based on feature GWT energy is used to compute the local feature points. The method...

Feature points extraction is crucial for image segmentation and moving object modeling, and uniform sampling always causes lost of details. Illumination variation and noise also make the extracted feature points unreliable because of the sensitivity of classical detector to noise. A method based on 2D Gabor wavelet is presented to extract features, and a dynamic feature clustering based on feature GWT energy is used to compute the local feature points. The method is robust to noise and the features points extracted are very close to true local features. Active mesh based on image features can be generated by feature points extration. 

基于内容的图像分割和建立运动目标模型都需要选择图像的特征点,均匀采样会丢失过多的细节特征。图像受噪声和光照的影响,通常特征点不是很稳健,普通的边界检测算子和角点检测算子对噪声敏感,提出采用2DGabor小波变换计算目标的局部特征能量,利用能量系数进行特征点检测,能很好克服噪声的影响;然后采用基于能量系数加权的动态聚类,提取局部特征点,避免了聚类中心偏离实际特征部位。通过特征点提取,建立一种基于图像特征的主动网格。

The curve discretization is one of the fundamental issues in triangulation of planar region and the parameter domain of curved surface. In this paper, the conception of the curve's local feature point is presented. A fast algorithm for the acquisition of the curve's local feature point is proposed, according to the theory of parallel. Through optimizing the local feature point, the needless local feature point is omitted, and the feature point set requisite is obtained. Accordingly...

The curve discretization is one of the fundamental issues in triangulation of planar region and the parameter domain of curved surface. In this paper, the conception of the curve's local feature point is presented. A fast algorithm for the acquisition of the curve's local feature point is proposed, according to the theory of parallel. Through optimizing the local feature point, the needless local feature point is omitted, and the feature point set requisite is obtained. Accordingly the curve discretization is realized, making use of the curve's local feature point. In the course of curve discretization, the quality influence of the succeeding triangulation, resulted by the tolerance of the discretization precision and the length of the approximation polygon edge, is fully considered in this method. If the approximation precision is high, the curve surface crack can be avoided. If the edge of the approximation polygon is too short, too dense triangle mesh will be created, which will result in long computation time and more memory space, or the long and narrow triangle mesh will be produced, which will make the quality of triangle mesh worse. Experiments indicate that the polygon consisting of the feature points can perfectly approximate the curve, and the algorithm is highly efficient.

提出了曲线局部特征点的概念 ,并根据平行线原理给出了一种快速求取特征点的算法。通过对局部特征点进行优化 ,得到所需的局部特征点集 ,实现了曲线的离散。该方法在离散过程中充分考虑了离散精度误差与逼近弦长对后续三角化质量的影响。实验结果表明 ,由这些特征点组成的多边形可较好地逼近曲线 ,算法效率较高。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关local feature point的内容
在知识搜索中查有关local feature point的内容
在数字搜索中查有关local feature point的内容
在概念知识元中查有关local feature point的内容
在学术趋势中查有关local feature point的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社