메뉴 건너뛰기




Volumn , Issue , 2005, Pages 86-89

On real and complex valued ℓ 1-norm minimization for overcomplete blind source separation

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL APPROACH; COMBINATORIAL SOLUTION; SECOND ORDER CONE PROGRAMMING;

EID: 33745715306     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPAA.2005.1540175     Document Type: Conference Paper
Times cited : (37)

References (10)
  • 1
    • 35048832864 scopus 로고    scopus 로고
    • Overcomplete BSS for convolutive mixtures based on hierarchical clustering
    • Sept.
    • S. Winter, H. Sawada, S. Araki, and S. Makino, "Overcomplete BSS for convolutive mixtures based on hierarchical clustering," in Proc. ICA 2004, Sept. 2004, pp. 652-660.
    • (2004) Proc. ICA 2004 , pp. 652-660
    • Winter, S.1    Sawada, H.2    Araki, S.3    Makino, S.4
  • 2
    • 0038809493 scopus 로고    scopus 로고
    • Blind separation of more sources than mixtures using sparsity of their short-time fourier transform
    • June
    • P. Bofill and M. Zibulevsky, "Blind separation of more sources than mixtures using sparsity of their short-time fourier transform," in Proc. ICA 2000, June 2000, pp. 87-92.
    • (2000) Proc. ICA 2000 , pp. 87-92
    • Bofill, P.1    Zibulevsky, M.2
  • 3
    • 33749045545 scopus 로고    scopus 로고
    • Ph.D. dissertation, University of Regensburg, [Online]
    • F. Theis, "Mathematics in independent component analysis," Ph.D. dissertation, University of Regensburg, 2002. [Online]. Available: http://homepages.uni-regensburg.de/~thf11669/phdthesis.html
    • (2002) Mathematics in Independent Component Analysis
    • Theis, F.1
  • 4
    • 0141512720 scopus 로고    scopus 로고
    • Minimal distortion principle for blind source separation
    • Dec.
    • K. Matsuoka and S. Nakashima, "Minimal distortion principle for blind source separation," in Proc. ICA 2001, Dec. 2001, pp. 722-727.
    • (2001) Proc. ICA 2001 , pp. 722-727
    • Matsuoka, K.1    Nakashima, S.2
  • 5
    • 84859275953 scopus 로고    scopus 로고
    • [Online]
    • [Online]. Available: http://www.mathprog.org/
  • 6
    • 0034133184 scopus 로고    scopus 로고
    • Learning overcomplete representations
    • [Online]. Available: citeseer.nj.nec.com/ lewicki981earning.html
    • M. S. Lewicki and T. J. Sejnowski, "Learning overcomplete representations," Neural Computation, vol. 12, no. 2, pp. 337-365, 2000. [Online]. Available: citeseer.nj.nec.com/ lewicki981earning.html
    • (2000) Neural Computation , vol.12 , Issue.2 , pp. 337-365
    • Lewicki, M.S.1    Sejnowski, T.J.2
  • 7
    • 1542333710 scopus 로고    scopus 로고
    • 1-norm solutions for underdetermined source separation
    • Mar
    • 1-norm solutions for underdetermined source separation," IEEE Trans. Signal Processing, vol. 52, no. 3, pp. 582-591, Mar 2004.
    • (2004) IEEE Trans. Signal Processing , vol.52 , Issue.3 , pp. 582-591
    • Takigawa, I.1    Kudo, M.2    Toyama, J.3
  • 8
    • 4644315643 scopus 로고    scopus 로고
    • Optimal sparse representations in general overcomplete bases
    • D. M. Malioutov, M. Cetin, and A. S. Willsky, "Optimal sparse representations in general overcomplete bases," in Proc. ICASSP 2004, 2004, pp. 793-796.
    • (2004) Proc. ICASSP 2004 , pp. 793-796
    • Malioutov, D.M.1    Cetin, M.2    Willsky, A.S.3
  • 10
    • 0033296299 scopus 로고    scopus 로고
    • Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones
    • special issue on Interior Point Methods. [Online]
    • J. Sturm, "Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones," Optimization Methods and Software, vol. 11-12, pp. 625-653, 1999, special issue on Interior Point Methods. [Online]. Available: http://fewcal.kub.nl/sturm/software/sedumi.html
    • (1999) Optimization Methods and Software , vol.11-12 , pp. 625-653
    • Sturm, J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.