首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3篇
  完全免费   2篇
  无线电   5篇
  2020年   1篇
  2013年   1篇
  2011年   1篇
  2009年   1篇
  2002年   1篇
排序方式: 共有5条查询结果,搜索用时 24 毫秒
1
1.
一种新的未知雷达信号快速分选方法   总被引:1,自引:1,他引:0  
针对未知雷达信号聚类分选实时性较差的问题,提出了一种改进的DBSCAN聚类分选方法。该方法首先依据脉冲数据在参数空间中的分布特性,寻找一些参考点来合理代替原有数据,然后利用这些参考点的密度连通性进行聚类处理。由于该方法减少了参与聚类运算的数据个数,因而有效克服了原算法计算量较大的缺陷,提高了未知雷达信号的聚类分选速度。仿真结果验证了改进方法的有效性。  相似文献
2.
一种基于网络密度分簇的移动信标辅助定位方法   总被引:1,自引:0,他引:1       下载免费PDF全文
赵方  马严  罗海勇  林权  林琳 《电子与信息学报》2009,31(12):2988-2992
现有移动信标辅助定位算法未充分利用网络节点分布信息,存在移动路径过长及信标利用率较低等问题。该文把网络节点分簇、增量定位与移动信标辅助相结合,提出了一种基于网络密度分簇的移动信标辅助定位算法(MBL(ndc))。该算法选择核心密度较大的节点作簇头,采用基于密度可达性的分簇机制把整个网络划分为多个簇内密度相等的簇,并联合使用基于遗传算法的簇头全局路径规划和基于正六边形的簇内局部路径规划方法,得到信标的优化移动路径。当簇头及附近节点完成定位后,升级为信标,采用增量定位方式参与网络其它节点的定位。仿真结果表明,该算法定位精度与基于HILBERT路径的移动信标辅助定位算法相当,而路径长度不到后者的50%。  相似文献
3.
Recently, a number of heuristic techniques have been devised in order to overcome some of the limitations of the Blind Source Separation (BSS) algorithms that are rooted in the theory of Independent Component Analysis (ICA). They are usually based on topographic maps and designed to separate mixtures of signals with either sub-Gaussian or super-Gaussian source densities. In the sub-Gaussian case, the coordinates of the winning neurons in the topographic map represent the estimates of the source signal amplitudes. In the super-Gaussian case, one relies on the topographic map's ability to detect the source directions in mixture space which, in turn, correspond to the column vectors of the mixing matrix in the linear case. We will introduce a new topographic map-based heuristic for super-Gaussian BSS. It relies on the tendency of the mixture samples to cluster around the source directions. We will demonstrate its performance on linear and mildly non-linear mixtures of speech signals, including the case where there are less mixtures than sources to be separated (non-square BSS).  相似文献
4.
Recently, privacy concerns become an increasingly critical issue. Secure multi-party computation plays an important role in privacy-preserving. Secure multi-party computational geometry is a new field of secure multi-party computation. In this paper, we devote to investigating the solutions to some secure geometric problems in a cooperative environment. The problem is collaboratively computing the Euclid-distance between two private vectors without disclosing the private input to each other. A general privacy-preserving Euclid-distance protocol is firstly presented as a building block and is proved to be secure and efficient in the comparison with the previous methods. And we proposed a new protocol for the application in Wireless Sensor Networks (WSNs), based on the novel Euclid-distance protocol and Density-Based Clustering Protocol (DBCP), so that the nodes from two sides can compute cooperatively to divide them into clusters without disclosing their location information to the opposite side.  相似文献
5.
星载光子计数激光测高系统具有较高的沿轨距离分辨率,能够探测得到植被冠层和地表的连续高程信息。然而星载植被点云的低点云密度和低信噪比,对植被相对冠层高度的估算方法提出了新的要求。本文提出了一种方向自适应的星载光子计数激光测高植被点云冠高估算方法。首先通过寻找点云高程统计直方图中代表冠层和地面位置的极值进行粗去噪,大致得到信号高程所在的范围,并估算出冠层,地面和噪声点云的平均密度以及地表坡度。随后对粗去噪后的点云进行方向自适应的密度聚类精去噪,其邻域的方向为地表坡度,与密度有关的阈值均根据估算出的点云密度自适应的做出调整。在滤波后,结合点云的密度和高程百分比分别找出地面与树冠顶端的初始点,并通过三角网方法(TIN)扩展初始点以进行分类,最终确定地表与树冠顶端的高程。采用ATLAS星载激光测高仪的植被点云对算法进行了验证,结果表明算法能够正确估算植被冠高,十分适用于坡度较大和叶面积指数较低的地区,其中冠顶与地面的高程和机载LIDAR数据高程的决定系数R2分别为0.99与0.77,均方根误差RMSE为0.28 m与2.6 m。  相似文献
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号