اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBounds for maximum likelihood regular and non-regular DoA estimation in $K$-distributed noise
61
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider the problem of estimating the direction of arrival of a signal embedded in $K$-distributed noise, when secondary data which contains noise only are assumed to be available. Based upon a recent formula of the Fisher information matrix (FIM) for complex elliptically distributed data, we provide a simple expression of the FIM with the two data sets framework. In the specific case of $K$-distributed noise, we show that, under certain conditions, the FIM for the deterministic part of the model can be unbounded, while the FIM for the covariance part of the model is always bounded. In the general case of elliptical distributions, we provide a sufficient condition for unboundedness of the FIM. Accurate approximations of the FIM for $K$-distributed noise are also derived when it is bounded. Additionally, the maximum likelihood estimator of the signal DoA and an approximated version are derived, assuming known covariance matrix: the latter is then estimated from secondary data using a conventional regularization technique. When the FIM is unbounded, an analysis of the estimators reveals a rate of convergence much faster than the usual $T^{-1}$. Simulations illustrate the different behaviors of the estimators, depending on the FIM being bounded or not.
قيم البحث
اقرأ أيضاً
In this paper, the problem of determining the number of signal sources impinging on an array of sensors and estimating their directions-of-arrival (DOAs) in the presence of spatially white nonuniform noise is considered. It is known that, in the case
of nonuniform noise, the stochastic likelihood function cannot be concentrated with respect to the diagonal elements of noise covariance matrix. Therefore, the stochastic maximum-likelihood (SML) DOA estimation and source enumeration in the presence of nonuniform noise requires multidimensional search with very high computational complexity. Recently, two algorithms for estimating noise covariance matrix in the presence of nonuniform noise have been proposed in the literature. Using these new estimates of noise covariance matrix, an approach for obtaining the SML estimate of signal DOAs is proposed. In addition, new approaches are proposed for SML source enumeration with information criteria in the presence of nonuniform noise. The important feature of the proposed SML approaches for DOA estimation and source enumeration is that they have admissible computational complexity. In addition, some of them are robust against correlation between source signals. The performance of the proposed DOA estimation and source enumeration approaches are investigated using computer simulations.
Over the past years, many applications aim to assess the causal effect of treatments assigned at the community level, while data are still collected at the individual level among individuals of the community. In many cases, one wants to evaluate the
effect of a stochastic intervention on the community, where all communities in the target population receive probabilistically assigned treatments based on a known specified mechanism (e.g., implementing a community-level intervention policy that target stochastic changes in the behavior of a target population of communities). The tmleCommunity package is recently developed to implement targeted minimum loss-based estimation (TMLE) of the effect of community-level intervention(s) at a single time point on an individual-based outcome of interest, including the average causal effect. Implementations of the inverse-probability-of-treatment-weighting (IPTW) and the G-computation formula (GCOMP) are also available. The package supports multivariate arbitrary (i.e., static, dynamic or stochastic) interventions with a binary or continuous outcome. Besides, it allows user-specified data-adaptive machine learning algorithms through SuperLearner, sl3 and h2oEnsemble packages. The usage of the tmleCommunity package, along with a few examples, will be described in this paper.
Delsarte, Goethals, and Seidel (1977) used the linear programming method in order to find bounds for the size of spherical codes endowed with prescribed inner products between distinct points in the code. In this paper, we develop the linear programm
ing method to obtain bounds for the number of vertices of connected regular graphs endowed with given distinct eigenvalues. This method is proved by some dual technique of the spherical case, motivated from the theory of association scheme. As an application of this bound, we prove that a connected $k$-regular graph satisfying $g>2d-1$ has the minimum second-largest eigenvalue of all $k$-regular graphs of the same size, where $d$ is the number of distinct non-trivial eigenvalues, and $g$ is the girth. The known graphs satisfying $g>2d-1$ are Moore graphs, incidence graphs of regular generalized polygons of order $(s,s)$, triangle-free strongly regular graphs, and the odd graph of degree $4$.
We develop a new estimation technique for recovering depth-of-field from multiple stereo images. Depth-of-field is estimated by determining the shift in image location resulting from different camera viewpoints. When this shift is not divisible by pi
xel width, the multiple stereo images can be combined to form a super-resolution image. By modeling this super-resolution image as a realization of a random field, one can view the recovery of depth as a likelihood estimation problem. We apply these modeling techniques to the recovery of cloud height from multiple viewing angles provided by the MISR instrument on the Terra Satellite. Our efforts are focused on a two layer cloud ensemble where both layers are relatively planar, the bottom layer is optically thick and textured, and the top layer is optically thin. Our results demonstrate that with relative ease, we get comparable estimates to the M2 stereo matcher which is the same algorithm used in the current MISR standard product (details can be found in [IEEE Transactions on Geoscience and Remote Sensing 40 (2002) 1547--1559]). Moreover, our techniques provide the possibility of modeling all of the MISR data in a unified way for cloud height estimation. Research is underway to extend this framework for fast, quality global estimates of cloud height.
We study the curvature-dimension inequality in regular graphs. We develop techniques for calculating the curvature of such graphs, and we give characterizations of classes of graphs with positive, zero, and negative curvature. Our main result is to c
ompare the curvature-dimension inequality in these classes to the so-called Ollivier curvature. A consequence of our results is that in the case that the graph contains no subgraph isomorphic to either $K_3$ or $K_{2,3}$ these curvatures usually have the same sign, and we characterize the exceptions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
