基于阵列天线和稀疏贝叶斯学习的室内定位方法

由于多径和非同源等因素的影响,传统基于蓝牙信号强度的室内定位方法的性能精度和稳定性都不高。针对基于蓝牙信号的复杂室内环境定位问题,该文提出基于低成本阵列天线的室内定位方法,该方法利用单通道轮采极化敏感阵列天线对蓝牙信号进行采样,然后结合暗室测量获得的准确阵列流形和极化快收敛稀疏贝叶斯学习(P-FCSBL)算法实现信源的角度估计,最后通过角度实现定位。该方法充分利用极化信息和角度信息来实现目标和多径信号的分离,同时对单信源的同时采样保证了估计的稳定性。最后通过实测数据处理验证了该方法的有效性。     

A probabilistic‐based approach for direction‐of‐arrival estimation and localization of multiple sources

This article contributes to science at two points. The first contribution is at a point of introducing a novel direction‐of‐arrival (DOA) estimation method which based on subspaces methods called Probabilistic Estimation of Several Signals (PRESS). The PRESS method provides higher resolution and DOA accuracy than current models. Second contribution of the article is at a point of localizing the unknown signal source. The process of localization achieved by using DOA information for the first time. The importance of localization exists in a large area of engineering applications. The aim is to determine the location of multiple sources by using PRESS with minimum effort of computation. We used the maximum probabilistic process in this study. Initially, all the signals are collected by the array of sensors and accurately identified using the proposed algorithm. The receiver at the best in test estimates the source location using only the knowledge of the geographical latitude and longitude values of the array of sensors. Several test points with an accurately calculated angle of arrival enable us to draw linear lines towards the transmitter. The transmitter location can be accurately identified with the line of interceptions. Simulation and numerical results show the outstanding performance of both the DOA estimation method and transmitter localization approach compared with many classical and new DOA estimation methods. The PRESS localization method first tested at 19°, 26°, and 35° with an signal‐to‐noise ratio (SNR) value of ‐5 dB. The PRESS method produced results with an extremely low bias of 0 and 0.00080°. The simulation tests are repeated and produced results with zero bias, which give the exact location of the unknown source.     

Locality preserving projection based on Euler representation

Locality preserving projection (LPP) is a widely used linear dimensionality reduction method, which preserves the locality structure of the original data. Motivated by the fact that kernel technique can capture nonlinear similarity of features and help to improve separability between nearby data points, this paper proposes locality preserving projection model based on Euler representation (named as ELPP). This model first projects the data into a complex space with Euler representation, then learns the dimensionality reduction projection with preserving locality structure in this complex space. We also extend ELPP to F-ELPP by replacing the squared F-norm with F-norm, which will weaken the exaggerated errors and be more robustness to outliers. The optimization algorithms of the two models are given, and the convergence of F-ELPP is proved. A large number of experiments on several public databases have demonstrated that the two proposed models have good robustness and feature extraction ability.     

Local maximal margin discriminant embedding for face recognition

In this paper, a manifold learning based method named local maximal margin discriminant embedding (LMMDE) is developed for feature extraction. The proposed algorithm LMMDE and other manifold learning based approaches have a point in common that the locality is preserved. Moreover, LMMDE takes consideration of intra-class compactness and inter-class separability of samples lying in each manifold. More concretely, for each data point, it pulls its neighboring data points with the same class label towards it as near as possible, while simultaneously pushing its neighboring data points with different class labels away from it as far as possible under the constraint of locality preserving. Compared to most of the up-to-date manifold learning based methods, this trick makes contribution to pattern classification from two aspects. On the one hand, the local structure in each manifold is still kept in the embedding space; one the other hand, the discriminant information in each manifold can be explored. Experimental results on the ORL, Yale and FERET face databases show the effectiveness of the proposed method.     

Data Pre-Processing in Compressive Sensing Based Indoor Fingerprinting Positioning

Presented is a novel compressive sensing (CS) based indoor positioning approach, which uses the signal strength differentials (SSDs) as location fingerprints (LFs). By using certain kernel-based transformation basis, the 2-D target location is represented as an unknown sparse location vector in the discrete spatial domain. Then it just takes a little number of online noisy SSD measurements for the exact recovery of the sparse location vector by solving an ?₁-minimization program. In order to effectively apply CS theory for high precision indoor positioning, we further import some data pre-processing algorithms in the LF space. Firstly, to mitigate the influence of large measurements noise on the recovery accuracy, a LF space denosing algorithm is designed to discriminate the unequal localization contribution rate of every SSD measurement in each LF. The basic idea of the denosing algorithm is to transform the original LF space into a robust and decorrelated LF space. Moreover, in order to lower the high computational complexity of the CS recovery algorithm, several LF space filtering algorithms are also exploited to remove certain percentage of useless LFs in the radio map according to the real-time RSS observations. The performance of these denosing and filtering algorithms are investigated and compared in real-world WLAN experiment test. Both experimental results and simulations demonstrate that we achieve remarkable improvements on the positioning performance of the CS based localization by using the proposed algorithms.     

Achieving robust wireless localization resilient to signal strength attacks

Received signal strength (RSS) based algorithms have been very attractive for localization since they allow the reuse of existing communication infrastructure and are applicable to many commodity radio technologies. Such algorithms, however, are sensitive to a set of non-cryptographic attacks, where the physical measurement process itself can be corrupted by adversaries. For example, the attacker can perform signal strength attacks by placing an absorbing or reflecting material around a wireless device to modify its RSS readings. In this work, we first formulate the all-around signal strength attacks, where similar attacks are launched towards all landmarks, and experimentally show the feasibility of launching such attacks. We then propose a general principle for designing RSS-based algorithms so that they are robust to all-around signal strength attacks. To evaluate our approach, we adapt a set of representative RSS-based localization algorithms according to our principle. We experiment with both simulated attacks and two sets of real attack scenarios. All the experiments show that our design principle can be applied to a wide spectrum of algorithms to achieve comparable performance with much better robustness.     

Ranging error‐tolerable localization in wireless sensor networks with inaccurately positioned anchor nodes

Localization is essential for wireless sensor networks (WSNs). It is to determine the positions of sensor nodes based on incomplete mutual distance measurements. In this paper, to measure the accuracy of localization algorithms, a ranging error model for time of arrival (TOA) estimation is given, and the Cramer—Rao Bound (CRB) for the model is derived. Then an algorithm is proposed to deal with the case where (1) ranging error accumulation exists, and (2) some anchor nodes broadcast inaccurate/wrong location information. Specifically, we first present a ranging error‐tolerable topology reconstruction method without knowledge of anchor node locations. Then we propose a method to detect anchor nodes whose location information is inaccurate/wrong. Simulations demonstrate the effectiveness of our algorithm. Copyright © 2008 John Wiley & Sons, Ltd.     

融合复小波与零空间判别投射的人脸识别方法

提出一种新颖的零空间判别投射(NDPE)的子空间人脸识别方法。基于局部保持映射(LPP)和非参数判别分析方法,NDPF能够同时编码人脸数据流形的几何和判别结构,并且通过在零空间中求解特征值来克服小样本尺寸问题。为进一步提高人脸识别的准确率,提出融合双树复小波变换(DTCWT)与NDPE的方法。实验结果表明,所提人脸识别方法在ORL、Yale和AR人脸数据库上均取得了较高的识别率。     

Performance Analysis of Received Signal Strength Fingerprinting Based Distributed Location Estimation System for Indoor WLAN

Location Estimation has become important for many applications of indoor wireless networks. Received Signal Strength (RSS) fingerprinting methods have been widely used for location estimation. Most of the location estimation system suffers with the problem of scalability and unavailability of all the access points at all the location for large site. The accuracy and response time of estimation are critical issues in location estimation system for large sites. In this paper, we have proposed a distributed location estimation method, which divide the location estimation system into subsystems. Our method partitions the input signal space and output location space into clusters on the basis of visibility of access points at various locations of the site area. Each cluster of input signal space together with output location subspace is used to learn the association between RSS fingerprint and their respective location in a subsystem. We have performed experimentation on two RSS dataset, which are gathered on different testbeds, and compared our results with benchmark RADAR method. Experimental results show that our method provide better results in terms of accuracy and response time in comparison to centralized systems, in which a single system is used for large site.     

Double-constraint flexible tree search-based orthogonal matching pursuit for DOA estimation using dynamic sensor arrays

Greedy algorithms have leveraged sparse signal models for parameter estimation purposes in applications including bearing estimation and direction-of-arrival (DOA) estimation. A dictionary whose elements correspond to observations for a sampling of the angle space is used for sparse approximation of the received signals; the resulting sparse coefficient vector’s support identifies the DOA estimates. Increasing the angle space sampling resolution provides better sparse approximations for arbitrary observations, while the resulting high dictionary coherence hampers the performance of standard sparse approximation, preventing accurate DOA estimation. To alleviate this shortcoming, in the each iteration, we use the structured sparsity model that keeps high coherent and close spacing dictionary elements. Besides, the proposed approach allows exploitation of the array orientation diversity (achievable via array dynamics) in the compressive sensing framework to address challenging array signal processing problems such as left-right ambiguity and poor estimation performance. And the simulation results show that our proposed algorithm can offer significantly improved performance in single-snapshot scenario with multiple sources.     

Least squares algorithms for time-of-arrival-based mobile location

Localization of mobile phones is of considerable interest in wireless communications. In this correspondence, two algorithms are developed for accurate mobile location using the time-of-arrival measurements of the signal from the mobile station received at three or more base stations. The first algorithm is an unconstrained least squares (LS) estimator that has implementation simplicity. The second algorithm solves a nonconvex constrained weighted least squares (CWLS) problem for improving estimation accuracy. It is shown that the CWLS estimator yields better performance than the LS method and achieves both the Crame/spl acute/r-Rao lower bound and the optimal circular error probability at sufficiently high signal-to-noise ratio conditions.     

Statistical analysis of beam-space estimation fordirection-of-arrivals

The authors analyze the beam-space performance of the DOA estimation for several subspace processing algorithms in a unified fashion based on a finite amount of measurements. The mean-squared errors (MSE) of the beam-space DOA estimation for these algorithms are expressed; in a single formula using physical parameters like array manifold, beamformer matrix. The important properties of beam-space performance are revealed; for instance, increasing beam-space dimension does not always reduce MSE for all algorithms. Also, the criteria for designing minimum mean-squared error beamformers are discussed     

Mobile location estimation for DS‐CDMA systems using self‐organizing maps

In this paper, a self‐organizing map (SOM) scheme for mobile location estimation in a direct‐sequence code division multiple access (DS‐CDMA) system is proposed. As a feedforward neural network with unsupervised or supervised and competitive learning algorithm, the proposed scheme generates a number of virtual neurons over the area covered by the corresponding base stations (BSs) and performs non‐linear mapping between the measured pilot signal strengths from nearby BSs and the user's location. After the training is finished, the location estimation procedure searches for the virtual sensor which has the minimum distance in the signal space with the estimated mobile user. Analytical results on accuracy and measurement reliability show that the proposed scheme has the advantages of robustness and scalability, and is easy for training and implementation. In addition, the scheme exhibits superior performance in the non‐line‐of‐sight (NLOS) situation. Numerical results under various terrestrial environments are presented to demonstrate the feasibility of the proposed SOM scheme. Copyright © 2006 John Wiley & Sons, Ltd.     

基于子空间分解的阵列流形向量估计新方法

实际阵列装配完成后的阵列流形向量与理论值存在偏差,这种偏差会导致阵列预设波束图的旁瓣升高、阵列高分辨算法的性能下降,严重影响阵列的实际应用。实际中先依据估计的部分实际阵列流形向量选取合适的误差模型,再根据模型得到逼近实际的阵列流形向量。现有的实际阵列流形向量估计方法有直接定义法和最小二乘法,这两种方法计算复杂度很高且估计精度随快拍数波动。对此本文给出一种新的阵列实际流形向量估计方法,它利用阵列接收数据协方差矩阵的信号子空间与阵列流形向量张成空间相同的特性来估计阵列的实际幅度相位响应,结合估计的波达方向,最后得到实际的阵列流形向量。仿真结果表明,本文所提方法比现有的两种估计方法估计精度高一倍且计算复杂度降低了一个数量级。      

Efficient localization of target in large scale farmland using generalized regression neural network

Although simple to implement, the traditional trilateration technique is generally associated with significant location estimation errors because of highly nonlinear relationship between Received Signal Strength Indicator (RSSI) and distance. In case of agricultural farmland, there is always noise uncertainty in the RSSI measurements because of signal propagation issues such as NLOS, multipath propagation, and reflection. In the context of such environmental dynamicity, the localization algorithm must be efficient in terms of Localization Accuracy and Execution Speed to provide real‐time performance. The Generalized Regression Neural Network (GRNN) is a noniterative highly parallel neural architecture with the capability to get trained quickly using very few training samples. This paper introduces a range free GRNN localization algorithm as an alternative to the traditional range‐based trilateration technique for a large scale wheat farmland. This paper also presents the modified Optimal Fitted Parametric Exponential Decay Model (OFPEDM)‐based signal path loss model to deal with the issue of environmental dynamicity. The evaluation of localization performance of the trilateration and the proposed GRNN‐based approaches is carried out with the help of Wireless Sensor Network (WSN) using three path loss models, namely, Log Normal Shadow Fading (LNSM), Original OFPEDM, and proposed Modified OFPEDM. For all these implementations, the proposed GRNN algorithm demonstrates superior localization performance (localization accuracy of the order of few centimeters) over traditional trilateration irrespective of nonlinear system dynamics, path loss model, and environmental dynamicity. The execution speed of the proposed algorithm is of the order of few milliseconds.     

Impact of sensor-enhanced mobility prediction on the design of energy-efficient localization

Energy efficiency and positional accuracy are often contradictive goals. We propose to decrease power consumption without sacrificing significant accuracy by developing an energy-aware localization that adapts the sampling rate to target’s mobility level. In this paper, an energy-aware adaptive localization system based on signal strength fingerprinting is designed, implemented, and evaluated. Promising to satisfy an application’s requirements on positional accuracy, our system tries to adapt its sampling rate to reduce its energy consumption. The contribution of this paper is fourfold. (1) We have developed a model to predict the positional error of a real working positioning engine under different mobility levels of mobile targets, estimation error from the positioning engine, processing and networking delay in the location infrastructure, and sampling rate of location information. (2) In a real test environment, our energy-saving method solves the mobility estimation error problem by utilizing additional sensors on mobile targets. The result is that we can improve the prediction accuracy by 56.34% on average, comparing to algorithms without utilizing additional sensors. (3) We further enhance our sensor-enhanced mobility prediction algorithm by detecting the target’s moving foot step and then estimate the target’s velocity. This method can improve the mobility prediction accuracy by 49.81% on an average, comparing to previous sensor-enhanced mobility prediction algorithm. (4) We implemented our energy-saving methods inside a working localization infrastructure and conducted performance evaluation in a real office environment. Our performance results show as much as 68.92% reduction in power consumption.     

Mode selection schemes for unicasting device‐to‐device communications supported by network coding

Device‐to‐device (D2D) communication in a cellular spectrum increases the spectral and energy efficiency of local communication sessions, while also taking advantage of accessing licensed spectrum and higher transmit power levels than when using unlicensed bands. To realize the potential benefits of D2D communications, appropriate mode selection algorithms that select between the cellular and D2D communication modes must be designed. On the other hand, physical‐layer network coding (NWC) at a cellular base station—which can be used without D2D capability—can also improve the spectral efficiency of a cellular network that carries local traffic. In this paper, we ask whether cellular networks should support D2D communications, physical‐layer NWC, or both. To this end, we study the performance of mode selection algorithms that can be used in cellular networks that use physical‐layer NWC and support D2D communications. We find that the joint application of D2D communication and NWC scheme yields additional gains compared with a network that implements only one of these schemes, provided that the network implements proper mode selection and resource allocation algorithms. We propose 2 mode selection schemes that aim to achieve high signal‐to‐interference‐plus‐noise ratio and spectral efficiency, respectively, and take into account the NWC and D2D capabilities of the network.     

A Decoupled Approach for Near-Field Source Localization Using a Single Acoustic Vector Sensor

This paper considers the problem of three-dimensional (3-D, azimuth, elevation, and range) localization of a single source in the near-field using a single acoustic vector sensor (AVS). The existing multiple signal classification (MUSIC) or maximum likelihood estimation (MLE) methods, which require a 3-D search over the location parameter space, are computationally very expensive. A computationally simple method previously developed by Wu and Wong (IEEE Trans. Aerosp. Electron. Syst. 48(1):159–169, 2012), which we refer to as Eigen-value decomposition and Received Signal strength Indicator-based method (Eigen-RSSI), was able to estimate 3-D location parameters of a single source efficiently. However, it can only be applied to an extended AVS which consists of a pressure sensor separated from the velocity sensors by a certain distance. In this paper, we propose a uni-AVS MUSIC (U-MUSIC) approach for 3-D location parameter estimation based on a compact AVS structure. We decouple the 3-D localization problem into step-by-step estimation of azimuth, elevation, and range and derive closed-form solutions for these parameter estimates by which a complex 3-D search for the parameters can be avoided. We show that the proposed approach outperforms the existing Eigen-RSSI method when the sensor system is required to be mounted in a confined space.     

Incorporating Data from Multiple Sensors for Localizing Nodes in Mobile Ad Hoc Networks

The ad hoc network localization problem deals with estimating the geographical location of all nodes in an ad hoc network, focusing on those nodes that do not have a direct way (for example, GPS) to determine their own location. Proposed solutions to the ad hoc localization problem (AHLP) assume that nodes are capable of measuring received signal strength indication (RSSI) and/or are able to do coarse (sectoring) or fine signal angle-of-arrival (AoA) measurements. Existing algorithms exploit different aspects of such sensory data to provide either better localization accuracy or higher localization coverage. However, there is a need for a framework that could benefit from the interactions of nodes with mixed types of sensors. In this paper, we study the behavior of RSSI and AoA sensory data in the context of AHLP by using both geometric analysis and computer simulations. We show which type of sensor is better suited for which type of network scenario. We study how nodes using either, both, or none of these sensors could coexist in the same localization framework. We then provide a general particle-filtering framework, the first of its kind, that allows heterogeneity in the types of sensory data to solve the localization problem. We show that, when compared to localization scenarios where only one type of sensor is used, our framework provides significantly better localization results. Furthermore, our framework provides not only a location estimate for each nonanchor, but also an implicit confidence measure as to how accurate this estimate is. This confidence measure enables nodes to further improve on their location estimates using a local, iterative one-hop simple message exchange without having to rely on synchronized multiphase operations like in traditional multilateration methods.     

基于四参数仿射模型的频域运动估计技术

仿射模型能比块平移模型更好地拟合真实运动场景,但待解的参数也相应地增加了.基于梯度的搜索算法在高阶问题中存在局部极小和收敛速度的缺陷,基于Hough变换和Gabor滤波等的变换域方法同样存在运算量的问题,影响了仿射模型在实时运动估计中的应用.传统的相位相关法仅利用了傅氏频谱的相位信息求解块平移而未利用频谱的幅值特性.本文通过对仿射运动场频域特性的分析,将仿射模型的线性项和平移项解耦,结合频谱的幅值特性和相位特性在频率域内求解仿射运动参数.实验结果表明该算法在运算量增加不大的情况下运动估计效果得到明显改善.