Pub Date : 2008-07-21DOI: 10.1109/SAM.2008.4606889
F. Nesta, P. Svaizer, M. Omologo
A new approach to the permutation problem for blind source separation (BSS) in the frequency domain is presented. By means of a state-space representation, the alignment is reduced to a recursive adaptive tracking of state trajectories associated with the demixing matrices. The estimated smooth trajectories are used to initialize the independent component analysis (ICA) in order to force it to converge with a coherent permutation across the whole spectrum. Since permutations are solved with no information about the signal power, this method works also for short utterances (0.5-1 s) and in highly reverberant environment (T 60 ap 700 ms). Furthermore it is shown that the underlying frequency link, provided by the recursive state estimation, increases the accuracy in the ICA step when only few observations are available.
{"title":"A BSS method for short utterances by a recursive solution to the permutation problem","authors":"F. Nesta, P. Svaizer, M. Omologo","doi":"10.1109/SAM.2008.4606889","DOIUrl":"https://doi.org/10.1109/SAM.2008.4606889","url":null,"abstract":"A new approach to the permutation problem for blind source separation (BSS) in the frequency domain is presented. By means of a state-space representation, the alignment is reduced to a recursive adaptive tracking of state trajectories associated with the demixing matrices. The estimated smooth trajectories are used to initialize the independent component analysis (ICA) in order to force it to converge with a coherent permutation across the whole spectrum. Since permutations are solved with no information about the signal power, this method works also for short utterances (0.5-1 s) and in highly reverberant environment (T 60 ap 700 ms). Furthermore it is shown that the underlying frequency link, provided by the recursive state estimation, increases the accuracy in the ICA step when only few observations are available.","PeriodicalId":422747,"journal":{"name":"2008 5th IEEE Sensor Array and Multichannel Signal Processing Workshop","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114527105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-21DOI: 10.1109/SAM.2008.4606830
Pei-Jung Chung
We study the performance of a recently proposed robust ML estimation procedure for unknown numbers of signals. This approach finds the ML estimate for the maximum number of signals and selects relevant components associated with the true parameters from the estimated parameter vector. Its computational cost is significantly lower than conventional methods based on information theoretic criteria or multiple hypothesis tests. We show that the covariance matrix of relevant estimates is upper and lower bounded by two covariance matrices. These bounds are easy to compute by existing results for standard ML estimation. Our analysis is further confirmed by numerical experiments over a wide range of SNRs.
{"title":"Robust ML estimation for unknown numbers of signals: Performance study","authors":"Pei-Jung Chung","doi":"10.1109/SAM.2008.4606830","DOIUrl":"https://doi.org/10.1109/SAM.2008.4606830","url":null,"abstract":"We study the performance of a recently proposed robust ML estimation procedure for unknown numbers of signals. This approach finds the ML estimate for the maximum number of signals and selects relevant components associated with the true parameters from the estimated parameter vector. Its computational cost is significantly lower than conventional methods based on information theoretic criteria or multiple hypothesis tests. We show that the covariance matrix of relevant estimates is upper and lower bounded by two covariance matrices. These bounds are easy to compute by existing results for standard ML estimation. Our analysis is further confirmed by numerical experiments over a wide range of SNRs.","PeriodicalId":422747,"journal":{"name":"2008 5th IEEE Sensor Array and Multichannel Signal Processing Workshop","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129543791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-21DOI: 10.1109/SAM.2008.4606879
Biao Jiang
In this paper, an efficient low-complexity robust adaptive beamforming method based on worst-case performance optimization is proposed. Lagrangian method was applied to obtain the expression for the robust adaptive weight vector, which is optimized on the boundary of the steering vector uncertainty region, that is to say, in the worst mismatch case. Combining the constraint condition and the eigendecomposition of the array covariance matrix, root-finding method is used to obtain the optimal Lagrange multiplier. Then, the diagonal loading-like robust weight vector is achieved. The implementation efficiency is greatly improved since the main computational burden is the eigendecomposition operator. Numerical results show that the performance of the proposed method is nearly identical to the robust Capon beamforming.
{"title":"Low-complexity implementation for worst-case optimization-based robust adaptive beamforming","authors":"Biao Jiang","doi":"10.1109/SAM.2008.4606879","DOIUrl":"https://doi.org/10.1109/SAM.2008.4606879","url":null,"abstract":"In this paper, an efficient low-complexity robust adaptive beamforming method based on worst-case performance optimization is proposed. Lagrangian method was applied to obtain the expression for the robust adaptive weight vector, which is optimized on the boundary of the steering vector uncertainty region, that is to say, in the worst mismatch case. Combining the constraint condition and the eigendecomposition of the array covariance matrix, root-finding method is used to obtain the optimal Lagrange multiplier. Then, the diagonal loading-like robust weight vector is achieved. The implementation efficiency is greatly improved since the main computational burden is the eigendecomposition operator. Numerical results show that the performance of the proposed method is nearly identical to the robust Capon beamforming.","PeriodicalId":422747,"journal":{"name":"2008 5th IEEE Sensor Array and Multichannel Signal Processing Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127840544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-21DOI: 10.1109/SAM.2008.4606866
D. McGarry, D. Zasada, P. Sanyal, R. Perry
The ability to detect and track moving targets in synthetic aperture radar (SAR) images has become a topic of much current research. The authors have been reporting on a multi-channel phase interferometry technique for detecting moving targets in SAR images for some time. They have also shown that the phase interferometry between two channels can be utilized to cancel ground clutter from one channel by subtracting a phase-weighted version of the image from the other channel. This is analogous to, but not the same as, the well known DPCA (displaced phase center antenna) technique for clutter cancellation. This paper reports on a clustering technique we have successfully used to detect moving targets, which in almost all cases occupy many more than one or a few pixels in the clutter-cancelled SAR image. This technique greatly reduces false alarms.
{"title":"Using a clustering technique for detection of moving targets in clutter-cancelled QuickSAR images","authors":"D. McGarry, D. Zasada, P. Sanyal, R. Perry","doi":"10.1109/SAM.2008.4606866","DOIUrl":"https://doi.org/10.1109/SAM.2008.4606866","url":null,"abstract":"The ability to detect and track moving targets in synthetic aperture radar (SAR) images has become a topic of much current research. The authors have been reporting on a multi-channel phase interferometry technique for detecting moving targets in SAR images for some time. They have also shown that the phase interferometry between two channels can be utilized to cancel ground clutter from one channel by subtracting a phase-weighted version of the image from the other channel. This is analogous to, but not the same as, the well known DPCA (displaced phase center antenna) technique for clutter cancellation. This paper reports on a clustering technique we have successfully used to detect moving targets, which in almost all cases occupy many more than one or a few pixels in the clutter-cancelled SAR image. This technique greatly reduces false alarms.","PeriodicalId":422747,"journal":{"name":"2008 5th IEEE Sensor Array and Multichannel Signal Processing Workshop","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116166850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-21DOI: 10.1109/SAM.2008.4606888
J. Dmochowski, J. Benesty, S. Affes
The localization of speech is essential for improving the quality of hands-free pick-up as well as for applications such as automatic camera steering. This paper proposes a source localization method tailored to the distinct nature of speech that is based on the linearly constrained minimum variance (LCMV) beamforming method. The LCMV steered beam temporally focuses the array onto the desired signal. By modeling the desired signal as an autoregressive (AR) process and embedding the AR coefficients in the linear constraints, the localization accuracy is significantly improved as compared to existing techniques.
{"title":"On the use of autoregressive modeling for localization of speech","authors":"J. Dmochowski, J. Benesty, S. Affes","doi":"10.1109/SAM.2008.4606888","DOIUrl":"https://doi.org/10.1109/SAM.2008.4606888","url":null,"abstract":"The localization of speech is essential for improving the quality of hands-free pick-up as well as for applications such as automatic camera steering. This paper proposes a source localization method tailored to the distinct nature of speech that is based on the linearly constrained minimum variance (LCMV) beamforming method. The LCMV steered beam temporally focuses the array onto the desired signal. By modeling the desired signal as an autoregressive (AR) process and embedding the AR coefficients in the linear constraints, the localization accuracy is significantly improved as compared to existing techniques.","PeriodicalId":422747,"journal":{"name":"2008 5th IEEE Sensor Array and Multichannel Signal Processing Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130176950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-21DOI: 10.1109/SAM.2008.4606864
Dinh-Quy Nguyen, W. Gan, Y. Chong
The DORT (decomposition de lpsilaoperateur de retournement temporel) method is an efficient technique to focus signal on the target. The DORT method requires the measurement of the inter-element impulse responses of the propagating medium for all pairs of elements in the array. The time reversal operator (TRO) is deduced and diagonalized from these responses. But DORT method has worse results in non-ideally resolved scatterer case that two scatterers are placed close with each other. Therefore, in this paper, weighted least-squares (WLS) combining with the DORT method are proposed to perform selective focusing in non-ideally resolved scatterer case. This technique can also perform target focusing with higher spatial resolution than original DORT method and faster computation than adaptive beamforming method.
DORT (decomposition de lpsilaoperateur de retourporel)方法是一种有效的将信号聚焦到目标上的方法。DORT方法要求测量阵列中所有元对的传播介质的元间脉冲响应。从这些响应中推导并对角化了时间反转算子。但对于非理想分辨散射体,当两个散射体放置得很近时,DORT方法的效果较差。因此,本文提出了加权最小二乘(WLS)与DORT方法相结合,在非理想分辨散射体情况下进行选择性聚焦。该方法可以实现比原DORT方法更高的空间分辨率和比自适应波束形成方法更快的计算速度的目标聚焦。
{"title":"Weighted least squares DORT method in selective focusing","authors":"Dinh-Quy Nguyen, W. Gan, Y. Chong","doi":"10.1109/SAM.2008.4606864","DOIUrl":"https://doi.org/10.1109/SAM.2008.4606864","url":null,"abstract":"The DORT (decomposition de lpsilaoperateur de retournement temporel) method is an efficient technique to focus signal on the target. The DORT method requires the measurement of the inter-element impulse responses of the propagating medium for all pairs of elements in the array. The time reversal operator (TRO) is deduced and diagonalized from these responses. But DORT method has worse results in non-ideally resolved scatterer case that two scatterers are placed close with each other. Therefore, in this paper, weighted least-squares (WLS) combining with the DORT method are proposed to perform selective focusing in non-ideally resolved scatterer case. This technique can also perform target focusing with higher spatial resolution than original DORT method and faster computation than adaptive beamforming method.","PeriodicalId":422747,"journal":{"name":"2008 5th IEEE Sensor Array and Multichannel Signal Processing Workshop","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128431560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-21DOI: 10.1109/SAM.2008.4606891
Jae-Mo Yang, Min-Seok Choi, Hong-Goo Kang
This paper proposes a robust two-channel frequency selective multiple signal classification (MUSIC) method to find a direction of arrival (DoA) information of speech signal. To overcome a phase distortion caused by reverberation and background noise in real acoustic room environments, we adopt a least square (LS)-based phase estimation method. In the phase compensation stage, distorted phases are replaced by estimated phases to enhance the accuracy of covariance matrix needed for the eigen-decomposition of the MUSIC method. Simulation results verify that the proposed algorithm shows much higher estimation accuracy than conventional one while its complexity can be reduced by the frequency selection method.
{"title":"Two-channel DOA estimation usign frequency selective music algorithm with a phase compensation in reverberant room","authors":"Jae-Mo Yang, Min-Seok Choi, Hong-Goo Kang","doi":"10.1109/SAM.2008.4606891","DOIUrl":"https://doi.org/10.1109/SAM.2008.4606891","url":null,"abstract":"This paper proposes a robust two-channel frequency selective multiple signal classification (MUSIC) method to find a direction of arrival (DoA) information of speech signal. To overcome a phase distortion caused by reverberation and background noise in real acoustic room environments, we adopt a least square (LS)-based phase estimation method. In the phase compensation stage, distorted phases are replaced by estimated phases to enhance the accuracy of covariance matrix needed for the eigen-decomposition of the MUSIC method. Simulation results verify that the proposed algorithm shows much higher estimation accuracy than conventional one while its complexity can be reduced by the frequency selection method.","PeriodicalId":422747,"journal":{"name":"2008 5th IEEE Sensor Array and Multichannel Signal Processing Workshop","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125581479","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-21DOI: 10.1109/SAM.2008.4606875
A. Hjørungnes, D. Palomar
A systematic and simple method is proposed for how to find the derivative of complex-valued matrix functions which depend on matrix arguments that contain patterns. The proposed method is developed by means of the chain rule and it is able to handle both linear and nonlinear patterns. One main issue of the proposed method is to identify a matrix function which depends on independent variables and its domain must have the same dimension as the dimension of the set of patterned matrices. In addition, this function must produce all the matrices within the pattern of interest. Some illustrative examples which are relevant for problems in the area of signal processing for communications are presented.
{"title":"Patterned complex-valued matrix derivatives","authors":"A. Hjørungnes, D. Palomar","doi":"10.1109/SAM.2008.4606875","DOIUrl":"https://doi.org/10.1109/SAM.2008.4606875","url":null,"abstract":"A systematic and simple method is proposed for how to find the derivative of complex-valued matrix functions which depend on matrix arguments that contain patterns. The proposed method is developed by means of the chain rule and it is able to handle both linear and nonlinear patterns. One main issue of the proposed method is to identify a matrix function which depends on independent variables and its domain must have the same dimension as the dimension of the set of patterned matrices. In addition, this function must produce all the matrices within the pattern of interest. Some illustrative examples which are relevant for problems in the area of signal processing for communications are presented.","PeriodicalId":422747,"journal":{"name":"2008 5th IEEE Sensor Array and Multichannel Signal Processing Workshop","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124434388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-21DOI: 10.1109/SAM.2008.4606877
L. Vicente, K. C. Ho
The partial adaptive concentric ring array (CRA) has been successfully applied to 3D beamforming because of its flexibility, faster tracking ability and reduced computation with respect to the fully adaptive CRA. In some cases, prior knowledge regarding some interferences is available so that better beamformers can be designed. The previous method that exploits prior knowledge by using a fixed penalty factor could not guarantee in maintaining a low residual interference and noise level. We propose in this paper an adaptive beamformer that automatically seeks out the optimum penalty factor to achieve the best performance. The proposed beamformer outperforms the previous design in maintaining a higher output signal to interference and noise ratio, even after the characteristics of the interferences have changed. The performance of the proposed beamformer is evaluated through simulations.
{"title":"Optimizing the performance of the partial adaptive concentric ring array in the presence of prior knowledge","authors":"L. Vicente, K. C. Ho","doi":"10.1109/SAM.2008.4606877","DOIUrl":"https://doi.org/10.1109/SAM.2008.4606877","url":null,"abstract":"The partial adaptive concentric ring array (CRA) has been successfully applied to 3D beamforming because of its flexibility, faster tracking ability and reduced computation with respect to the fully adaptive CRA. In some cases, prior knowledge regarding some interferences is available so that better beamformers can be designed. The previous method that exploits prior knowledge by using a fixed penalty factor could not guarantee in maintaining a low residual interference and noise level. We propose in this paper an adaptive beamformer that automatically seeks out the optimum penalty factor to achieve the best performance. The proposed beamformer outperforms the previous design in maintaining a higher output signal to interference and noise ratio, even after the characteristics of the interferences have changed. The performance of the proposed beamformer is evaluated through simulations.","PeriodicalId":422747,"journal":{"name":"2008 5th IEEE Sensor Array and Multichannel Signal Processing Workshop","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115816767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-07-21DOI: 10.1109/SAM.2008.4606914
F. Schulz
Synthetic aperture radar (SAR) as a method for ground imaging by using a single antenna or a sensor array has widely found attraction for remote sensing applications and reconnaissance tasks. Independent of the particular sensor but inherent to the SAR processing, moving objects in the observed scene will be imaged at wrong positions and can appear in a smeared fashion. To avoid these disturbing artifacts in the image, a joint spatial-spectral filtering approach is proposed in this paper that allows to suppress signal contributions from moving targets in multi-channel radar data. Results obtained with experimental data from an airborne system show the potential for a practical application of the presented method.
{"title":"Post-doppler space-time filtering for suppressing moving target signals in multi-channel SAR data","authors":"F. Schulz","doi":"10.1109/SAM.2008.4606914","DOIUrl":"https://doi.org/10.1109/SAM.2008.4606914","url":null,"abstract":"Synthetic aperture radar (SAR) as a method for ground imaging by using a single antenna or a sensor array has widely found attraction for remote sensing applications and reconnaissance tasks. Independent of the particular sensor but inherent to the SAR processing, moving objects in the observed scene will be imaged at wrong positions and can appear in a smeared fashion. To avoid these disturbing artifacts in the image, a joint spatial-spectral filtering approach is proposed in this paper that allows to suppress signal contributions from moving targets in multi-channel radar data. Results obtained with experimental data from an airborne system show the potential for a practical application of the presented method.","PeriodicalId":422747,"journal":{"name":"2008 5th IEEE Sensor Array and Multichannel Signal Processing Workshop","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128069520","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}