Wide-band maximum likelihood direction finding by using tree-structured EM algorithm
Date
1996Source Title
Proceedings of the 8th Workshop on Statistical Signal and Array Processing, IEEE 1996
Publisher
IEEE
Pages
554 - 557
Language
English
Type
Conference PaperItem Usage Stats
156
views
views
115
downloads
downloads
Metadata
Show full item recordAbstract
A tree structured Expectation Maximization (EM) algorithm is proposed and applied to the wide-band angle of arrival estimation. It may be seen as a generalization on EM using the ideas of Cascade EM algorithm and Space Alternating Generalized EM algorithm. Also, for passive data acquisition, robust and efficient alternatives for the estimation of the source signals are investigated.
Keywords
Data acquisitionOptimization
Parameter estimation
Sensors
Signal processing
Trees (mathematics)
Cascade algorithm
Direction of arrivals
Measured signals
Source signals
Space alternating generalized algorithm
Tree structured expectation maximization algorithm
Wide band maximum Angle of arrival estimation
Algorithms
Permalink
http://hdl.handle.net/11693/27742Published Version (Please cite this version)
https://doi.org/10.1109/SSAP.1996.534937Collections
Related items
Showing items related by title, author, creator and subject.
-
Online balancing two independent criteria
(Springer, 2008-10)We study the online bicriteria load balancing problem in this paper. We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose two online approximate algorithms for balancing ... -
Automatic detection of geospatial objects using multiple hierarchical segmentations
(Institute of Electrical and Electronics Engineers, 2008-07)The object-based analysis of remotely sensed imagery provides valuable spatial and structural information that is complementary to pixel-based spectral information in classification. In this paper, we present novel methods ... -
Incremental k-core decomposition: algorithms and evaluation
(Association for Computing Machinery, 2016)A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, ...
