메뉴 건너뛰기




Volumn 19, Issue 4, 2011, Pages 837-846

On the information geometry of audio streams with applications to similarity computing

Author keywords

Information geometry; music information retrieval (MIR)

Indexed keywords

AUDIO SIGNAL; AUDIO SPECTRUM; AUDIO STREAM; BIJECTIONS; BREGMAN DIVERGENCES; EXPONENTIAL DISTRIBUTIONS; INFORMATION GEOMETRY; INFORMATION PROCESSING; MUSIC INFORMATION; MUSIC INFORMATION RETRIEVAL; MUSIC INFORMATION RETRIEVAL (MIR); NON-STATIONARITIES; QUASI-STATIONARY; SIGNAL INFORMATION; SIMILARITY COMPUTING; SIMILARITY METRICS; STATISTICAL STRUCTURES; SYMBOLIC COMPUTING; THEORETICAL BASIS;

EID: 79951595797     PISSN: 15587916     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASL.2010.2066266     Document Type: Article
Times cited : (23)

References (24)
  • 2
    • 64849101362 scopus 로고    scopus 로고
    • Unified viewof prediction and repetition structure in audio signals with application to interest point detection
    • Feb.
    • S. Dubnov, "Unified viewof prediction and repetition structure in audio signals with application to interest point detection," IEEE Trans. Audio, Speech, Lang. Process., vol. 16, no. 2, pp. 327-337, Feb. 2008.
    • (2008) IEEE Trans. Audio, Speech, Lang. Process. , vol.16 , Issue.2 , pp. 327-337
    • Dubnov, S.1
  • 7
    • 85041123735 scopus 로고    scopus 로고
    • Divergence function, duality, and convex analysis
    • DOI 10.1162/08997660460734047
    • J. Zhang, "Divergence function, duality, and convex analysis," Neural Comput., vol. 16, no. 1, pp. 159-195, 2004. (Pubitemid 37528419)
    • (2004) Neural Computation , vol.16 , Issue.1 , pp. 159-195
    • Zhang, J.1
  • 8
    • 49949144765 scopus 로고
    • The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
    • L. M. Bregman, "The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming," USSR Comput. Math. Math. Phys., vol. 7, pp. 200-217, 1967.
    • (1967) USSR Comput. Math. Math. Phys. , vol.7 , pp. 200-217
    • Bregman, L.M.1
  • 9
    • 66949153253 scopus 로고    scopus 로고
    • Sided and symmetrized Bregman centroids
    • Jun.
    • F. Nielsen and R. Nock, "Sided and symmetrized Bregman centroids," IEEE Trans. Inf. Theory, vol. 55, no. 6, pp. 2882-2904, Jun. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , Issue.6 , pp. 2882-2904
    • Nielsen, F.1    Nock, R.2
  • 13
    • 0026366425 scopus 로고
    • A computationally compact divergence measure for speech processing
    • Dec.
    • B. A. Carlson and M. A. Clements, "A computationally compact divergence measure for speech processing," IEEE Trans. Pattern Anal. Mach. Intell., vol. 13, no. 12, pp. 1255-1260, Dec. 1991.
    • (1991) IEEE Trans. Pattern Anal. Mach. Intell. , vol.13 , Issue.12 , pp. 1255-1260
    • Carlson, B.A.1    Clements, M.A.2
  • 14
    • 3543099304 scopus 로고    scopus 로고
    • Generalization of spectral flatness measure for non-Gaussian linear processes
    • Aug.
    • S. Dubnov, "Generalization of spectral flatness measure for non-Gaussian linear processes," IEEE Signal Process. Lett., vol. 11, no. 8, pp. 698-701, Aug. 2004.
    • (2004) IEEE Signal Process. Lett. , vol.11 , Issue.8 , pp. 698-701
    • Dubnov, S.1
  • 15
    • 66949155737 scopus 로고    scopus 로고
    • Ph.D. dissertation, Univ. of Paris 6 and Univ. of California at San Diego, Paris, France and La Jolla, CA, Oct.
    • A. Cont, "Modeling musical anticipation: From the time of music to the music of time," Ph.D. dissertation, Univ. of Paris 6 and Univ. of California at San Diego, Paris, France and La Jolla, CA, Oct. 2008.
    • (2008) Modeling Musical Anticipation: From the Time of Music to the Music of Time
    • Cont, A.1
  • 16
    • 0037225974 scopus 로고    scopus 로고
    • On the computation of the kullback-leibler measure for spectral distances
    • Jan.
    • R. Veldhuis and E. Klabbers, "On the computation of the kullback-leibler measure for spectral distances," IEEE Trans. Speech Audio Process., vol. 11, no. 1, pp. 100-103, Jan. 2003.
    • (2003) IEEE Trans. Speech Audio Process. , vol.11 , Issue.1 , pp. 100-103
    • Veldhuis, R.1    Klabbers, E.2
  • 17
    • 56449104479 scopus 로고    scopus 로고
    • Fast nearest neighbor retrieval for Bregman divergences
    • New York, ACM
    • L. Cayton, "Fast nearest neighbor retrieval for Bregman divergences," in Proc. 25th Int. Conf. Mach. Learn. IMCL'08, New York, 2008, pp. 112-119, ACM.
    • (2008) Proc. 25th Int. Conf. Mach. Learn. IMCL'08 , pp. 112-119
    • Cayton, L.1
  • 18
    • 79951612734 scopus 로고    scopus 로고
    • Tailored Bregman ball trees for effective nearest neighbors
    • Brussels, Belgium
    • F. Nielsen, P. Piro, and M. Barlaud, "Tailored Bregman ball trees for effective nearest neighbors," in Proc. 25th Eur. Workshop Comput. Geom., Brussels, Belgium, 2009, pp. 29-32.
    • (2009) Proc. 25th Eur. Workshop Comput. Geom. , pp. 29-32
    • Nielsen, F.1    Piro, P.2    Barlaud, M.3
  • 21
    • 79951600828 scopus 로고    scopus 로고
    • Music structure analysis from acoustic signals
    • Berlin, Germany: Springer-Verlag
    • R. Dannenberg and M. Goto, "Music structure analysis from acoustic signals," in Handbook of Signal Processing in Acoustics. Berlin, Germany: Springer-Verlag, 2009, vol. 1, pp. 305-331.
    • (2009) Handbook of Signal Processing in Acoustics , vol.1 , pp. 305-331
    • Dannenberg, R.1    Goto, M.2
  • 24
    • 85032751306 scopus 로고    scopus 로고
    • Corpus-based concatenative synthesis
    • DOI 10.1109/MSP.2007.323274, Signal Processing for Sound Synthesis
    • D. Schwarz, "Corpus-based concatenative synthesis," IEEE Signal Process. Mag., vol. 24, no. 1, pp. 92-104, Mar. 2007. (Pubitemid 46534534)
    • (2007) IEEE Signal Processing Magazine , vol.24 , Issue.2 , pp. 92-104
    • Schwarz, D.1


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