scholarly journals Closed-Form Distance Estimators under Kalman Filtering Framework with Application to Object Tracking

2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Vladimir Shin ◽  
Georgy Shevlyakov ◽  
Woohyun Jeong ◽  
Yoonsoo Kim

In this paper, the minimum mean square error (MMSE) estimation problem for calculation of distances between two signals via the Kalman filtering framework is considered. The developed algorithm includes two stages: the Kalman estimate of a state vector computed at the first stage is nonlinearly transformed at the second stage based on a distance function and the MMSE criterion. In general, the most challenging aspect of application of the distance estimator is calculation of the multivariate Gaussian integral. However, it can be successfully overcome for the specific metrics between two points in line, between point and line, between point and plane, and others. In these cases, the MMSE estimator is defined by an analytical closed-form expression. We derive the exact closed-form bilinear and quadratic MMSE estimators that can be effectively applied for calculation of an inner product, squared norm, and Euclidean distance. A novel low-complexity suboptimal estimator for special composite functions of linear, bilinear, and quadratic forms is proposed. Radar range-angle responses are described by the functions. The proposed estimators are validated through a series of experiments using real models and metrics. Experimental results show that the MMSE estimators outperform existing estimators that calculate distance and angle in nonoptimal manner.

IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Yassine Zouaoui ◽  
Larbi Talbi ◽  
Khelifa Hettak ◽  
Naresh K. Darimireddy

Author(s):  
Rong Ran ◽  
Hayoung Oh

AbstractSparse-aware (SA) detectors have attracted a lot attention due to its significant performance and low-complexity, in particular for large-scale multiple-input multiple-output (MIMO) systems. Similar to the conventional multiuser detectors, the nonlinear or compressive sensing based SA detectors provide the better performance but are not appropriate for the overdetermined multiuser MIMO systems in sense of power and time consumption. The linear SA detector provides a more elegant tradeoff between performance and complexity compared to the nonlinear ones. However, the major limitation of the linear SA detector is that, as the zero-forcing or minimum mean square error detector, it was derived by relaxing the finite-alphabet constraints, and therefore its performance is still sub-optimal. In this paper, we propose a novel SA detector, named single-dimensional search-based SA (SDSB-SA) detector, for overdetermined uplink MIMO systems. The proposed SDSB-SA detector adheres to the finite-alphabet constraints so that it outperforms the conventional linear SA detector, in particular, in high SNR regime. Meanwhile, the proposed detector follows a single-dimensional search manner, so it has a very low computational complexity which is feasible for light-ware Internet of Thing devices for ultra-reliable low-latency communication. Numerical results show that the the proposed SDSB-SA detector provides a relatively better tradeoff between the performance and complexity compared with several existing detectors.


2021 ◽  
Vol 48 (3) ◽  
pp. 91-96
Author(s):  
Shigeo Shioda

The consensus achieved in the consensus-forming algorithm is not generally a constant but rather a random variable, even if the initial opinions are the same. In the present paper, we investigate the statistical properties of the consensus in a broadcasting-based consensus-forming algorithm. We focus on two extreme cases: consensus forming by two agents and consensus forming by an infinite number of agents. In the two-agent case, we derive several properties of the distribution function of the consensus. In the infinite-numberof- agents case, we show that if the initial opinions follow a stable distribution, then the consensus also follows a stable distribution. In addition, we derive a closed-form expression of the probability density function of the consensus when the initial opinions follow a Gaussian distribution, a Cauchy distribution, or a L´evy distribution.


2021 ◽  
Vol 2021 (6) ◽  
Author(s):  
Vivek Kumar Singh ◽  
Rama Mishra ◽  
P. Ramadevi

Abstract Weaving knots W(p, n) of type (p, n) denote an infinite family of hyperbolic knots which have not been addressed by the knot theorists as yet. Unlike the well known (p, n) torus knots, we do not have a closed-form expression for HOMFLY-PT and the colored HOMFLY-PT for W(p, n). In this paper, we confine to a hybrid generalization of W(3, n) which we denote as $$ {\hat{W}}_3 $$ W ̂ 3 (m, n) and obtain closed form expression for HOMFLY-PT using the Reshitikhin and Turaev method involving $$ \mathrm{\mathcal{R}} $$ ℛ -matrices. Further, we also compute [r]-colored HOMFLY-PT for W(3, n). Surprisingly, we observe that trace of the product of two dimensional $$ \hat{\mathrm{\mathcal{R}}} $$ ℛ ̂ -matrices can be written in terms of infinite family of Laurent polynomials $$ {\mathcal{V}}_{n,t}\left[q\right] $$ V n , t q whose absolute coefficients has interesting relation to the Fibonacci numbers $$ {\mathrm{\mathcal{F}}}_n $$ ℱ n . We also computed reformulated invariants and the BPS integers in the context of topological strings. From our analysis, we propose that certain refined BPS integers for weaving knot W(3, n) can be explicitly derived from the coefficients of Chebyshev polynomials of first kind.


Author(s):  
M.J. Cañavate-Sánchez ◽  
A. Segneri ◽  
S. Godi ◽  
A. Georgiadis ◽  
S. Kosmopoulos ◽  
...  

2004 ◽  
Vol 40 (19) ◽  
pp. 1192 ◽  
Author(s):  
J. Pérez ◽  
J. Ibáñez ◽  
L. Vielva ◽  
I. Santamaría

Sign in / Sign up

Export Citation Format

Share Document