共查询到20条相似文献,搜索用时 109 毫秒
1.
2.
3.
4.
阵列探测器的像点亚像素定位精度 总被引:8,自引:0,他引:8
本文研究阵列探测器的像点亚像素定位精度与内插算法及像斑大小的关系,文中提出一种校正算法误差、提高定位精度的方法。上述分析和论述通过实验证明是正确的。 相似文献
5.
6.
刚性球形传声器阵列可以在无空间模糊的条件下进行球谐域数据处理,基于球形阵列的可控波束形成器导向响应功率(SRP)算法定位精度高,但是计算量大,计算效率低。通过将球面致密的全局网格搜索替换为分层搜索策略可以有效减小SRP算法的计算量。提出MRE-SRP算法保持球形阵列SRP定位精度的同时降低计算量,首先通过球谐域MUSIC(SH-MUSIC)算法判断入射声源的数量减小搜索区域;其次将相对熵模型引入球谐域SRP(SH-SRP)定位算法中,提取网格分层前后的信息增益,设计自适应网格选择判据,实现分层多分辨率网格的精准再细分,从而降低计算量。实验验证了所提出算法的性能,结果显示在单双声源定位中,该算法可以实现较高的定位精度,精准选择分层网格,计算量减少75%以上。 相似文献
7.
8.
9.
10.
11.
12.
13.
A high precision localization scheme for profiled extended objects based-on Generalized Hough Transform (GHT) is proposed. The proposed localization scheme utilizes the edge points’ gratitude orientations of profiled extended objects to build an R-table in frame t-1. When frame t is coming, we search the R-table according to the pre-computed edge points’ gratitude orientations of profiled extended objects in current frame, generating an accumulator array. The coordination corresponding to the accumulator's peak value is regarded as coarse localization point in current frame. Then, a relaxation iteration method is proposed to refine the coarse localization point to obtain a sub-pixel localization point. Numerical experiments show that the localization scheme has following characteristics: high-precision and stability. Furthermore, we present the results of our work which involves investigation of the performance evaluation for the proposed localization scheme. 相似文献
14.
15.
针对现有清洁机器人定位算法具有的定位精度不高且难以保证在线定位的实时性问题,设计了一种基于模糊距离和DS(DEMPSTER-SHAFER)证据融合的清洁机器人自定位算法。首先,对清洁机器人的总体结构进行了建模和分析,并对其进行硬件设计,为了实现清洁机器人的实时精确定位,采用DS证据数据融合方法对多传感器采集的数据进行有效数据融合,为了进一步提高其精确性,引入了模糊距离,定义当前传感器采集数据与理想结果之间的距离,根据距模糊距离的大小自适应地调大或减少传感器采集数据分配信度的权重,将加权信度作为新的信度进行融合得到最终的融合结果。在不同的场地中进行实际试验,对文中设计的清洁机器人进行实际定位,实验结果表明文中方法能有效地进行定位,较经典的DS证据融合和其它方法具有较高的定位精度,且具有较小的时间复杂度和空间复杂度, 具有较大的优越性。 相似文献
16.
17.
Zhang Q Abeida H Xue M Rowe W Li J 《The Journal of the Acoustical Society of America》2012,131(2):1249-1259
Fast implementations of the sparse iterative covariance-based estimation (SPICE) algorithm are presented for source localization with a uniform linear array (ULA). SPICE is a robust, user parameter-free, high-resolution, iterative, and globally convergent estimation algorithm for array processing. SPICE offers superior resolution and lower sidelobe levels for source localization compared to the conventional delay-and-sum beamforming method; however, a traditional SPICE implementation has a higher computational complexity (which is exacerbated in higher dimensional data). It is shown that the computational complexity of the SPICE algorithm can be mitigated by exploiting the Toeplitz structure of the array output covariance matrix using Gohberg-Semencul factorization. The SPICE algorithm is also extended to the acoustic vector-sensor ULA scenario with a specific nonuniform white noise assumption, and the fast implementation is developed based on the block Toeplitz properties of the array output covariance matrix. Finally, numerical simulations illustrate the computational gains of the proposed methods. 相似文献
18.
19.
Wireless Sensor Networks have been the focal point of research for many years due to their wide range of application areas. Such networks consist of resource-constrained sensor nodes that are generally not equipped with any positioning component due to cost issues. This requires the adoption of suitable methodologies to infer the location of the deployed sensor nodes. Location information of such sensor nodes can be obtained with the help of some location-aware nodes. Numerous localization algorithms exist in the literature. Amongst them, Distance Vector Hop (DV-Hop) is a computationally less expensive algorithm that uses hop count values between sensor nodes and anchor nodes for location estimation of the deployed sensor nodes. However, the traditional DV-Hop algorithm produces a larger positioning deviation for a higher hop count value. Several existing works attempt to address this issue by either modifying the hop size or optimizing the estimated position resulting in comparatively higher localization errors and computationally expensive. This paper aims to solve the issue by modifying the hop size by dividing it into equal-sized spherical bands (SB). Sensor nodes use this SB value for computing their distances from anchor nodes and non-coplanar anchor nodes for location estimation. The simulation results demonstrate that the mean localization error of the proposed approach has reduced approximately by 75%, 66%, and 47% in comparison to traditional DV-Hop, 3D PSODV-Hop, and 3D GAIDV-Hop respectively. 相似文献
20.
基于被动合成孔径原理,提出了一种具有高稳健性的运动声源高分辨聚焦定位识别方法.该方法采用综合优化手段,通过矢量最大似然聚焦定位算法生成虚拟阵列坐标及数据矩阵,进而利用基于最差性能优化的稀疏虚拟阵列聚焦算法,获取稳健的高分辨定位识别效果.理论及仿真研究表明,该方法对于非匀速运动以及与基阵存在运动倾角的复杂情况具有较强的适用性,聚焦空间谱表现出更大的动态范围、更为尖锐的聚焦峰尺度以及更强的背景噪声起伏压制能力.湖上试验进一步验证,在高分辨最小方差信号无畸变响应法(MVDR)聚焦算法动态范围仅为3.5 dB的相
关键词:
稳健性
运动噪声源定位识别
矢量阵
最差性能优化 相似文献