Wide-band maximum likelihood direction finding by using tree-structured EM algorithm
Cadalli Nail, Arikan Orhan
IEEE Signal Processing Workshop on Statistical Signal and Array Processing, SSAP
IEEE, Los Alamitos, CA, United States
554 - 557
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27742
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.
- Work in Progress 656
Showing items related by title, author, creator and subject.
Tse, S.S.H. (2008)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 ...
Ozkan H.; Donmez, M.A.; Tunc, S.; Kozat, S.S. (Institute of Electrical and Electronics Engineers Inc., 2015)We analyze an online learning algorithm that adaptively combines outputs of two constituent algorithms (or the experts) running in parallel to estimate an unknown desired signal. This online learning algorithm is shown to ...
Sarıyüce, A. E.; Gedik, B.; Jacques-Silva, G.; Wu, Kun-Lung; Çatalyürek, Ü. V. (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, ...