Interpretation and generalization of complexity pursuit for the blind separation of modal contributions
详细信息 查看全文
- 作者：Jerome Antonia ; jerome.antoni@insa-lyon.fr" class="auth_mail" title="E-mail the corresponding author ; Roberto Castiglionea ; b ; roberto.castiglione@polito.it" class="auth_mail" title="E-mail the corresponding author ; Luigi Garibaldib ; luigi.garibaldi@polito.it" class="auth_mail" title="E-mail the corresponding author
- 关键词：AMUSE ; Algorithm for multiple unknown signals extraction (algorithm) ; BSS ; Blind source separation ; CP ; Complexity Pursuit (algorithm) ; DOF ; Degrees of freedom ; GCP ; Generalized Complexity Pursuit (algorithm) ; OMA ; Operational modal analysis ; SOBI ; Second order blind identification (algorithm)
- 刊名：Mechanical Systems and Signal Processing
- 出版年：2017
- 出版时间：15 February 2017
- 年：2017
- 卷：85
- 期：Complete
- 页码：773-788
- 全文大小：1432 K
文摘
- •
Exact solution of CP is returned by pure sines, the responses of conservative systems.
- •
CP is generally to be interpreted as separating the least dispersive components.
- •
CP may be generalized to arbitrary sets of filters.
- •
A generalization of CP is given based on optimized filters and joint diagonalization.
- •
Generalized CP includes several other BSS algorithms as particular cases.