메뉴 건너뛰기




Volumn 1, Issue , 2013, Pages 53-63

Grounded language learning from video described with sentences

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

EID: 84897743886     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (118)

References (27)
  • 3
    • 0000342467 scopus 로고
    • Statistical inference for probabilistic functions of finite state Markov chains
    • L. E. Baum and T. Petrie. 1966. Statistical inference for probabilistic functions of finite state Markov chains. The Annals of Mathematical Statistics, 37:1554-1563.
    • (1966) The Annals of Mathematical Statistics , vol.37 , pp. 1554-1563
    • Baum, L.E.1    Petrie, T.2
  • 4
    • 0000353178 scopus 로고
    • A maximization technique occuring in the statistical analysis of probabilistic functions of Markov chains
    • L. E. Baum, T. Petrie, G. Soules, and N. Weiss. 1970. A maximization technique occuring in the statistical analysis of probabilistic functions of Markov chains. The Annals of Mathematical Statistics, 41(1):164-171.
    • (1970) The Annals of Mathematical Statistics , vol.41 , Issue.1 , pp. 164-171
    • Baum, L.E.1    Petrie, T.2    Soules, G.3    Weiss, N.4
  • 5
    • 0001862769 scopus 로고
    • An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process
    • L. E. Baum. 1972. An inequality and associated maximization technique in statistical estimation of probabilistic functions of a Markov process. Inequalities, 3:1-8.
    • (1972) Inequalities , vol.3 , pp. 1-8
    • Baum, L.E.1
  • 6
    • 0003857778 scopus 로고    scopus 로고
    • A gentle tutorial of the EM algorithm and its application to parameter estimation for Gaussian mixture and hidden Markov models
    • ICSI
    • J. Bilmes. 1997. A gentle tutorial of the EM algorithm and its application to parameter estimation for Gaussian mixture and hidden Markov models. Technical Report TR-97-021, ICSI.
    • (1997) Technical Report TR-97-021
    • Bilmes, J.1
  • 9
    • 0000181889 scopus 로고
    • On nonlinear fractional programming
    • W. Dinkelbach. 1967. On nonlinear fractional programming. Management Science, 13(7):492-498.
    • (1967) Management Science , vol.13 , Issue.7 , pp. 492-498
    • Dinkelbach, W.1
  • 10
    • 24144435982 scopus 로고    scopus 로고
    • Learning to talk about events from narrated video in a construction grammar framework
    • P. F. Dominey and J.-D. Boucher. 2005. Learning to talk about events from narrated video in a construction grammar framework. Artificial Intelligence, 167(12):31-61.
    • (2005) Artificial Intelligence , vol.167 , Issue.12 , pp. 31-61
    • Dominey, P.F.1    Boucher, J.-D.2
  • 17
    • 0036663627 scopus 로고    scopus 로고
    • Learning visually-grounded words and syntax for a scene description task
    • D. Roy. 2002. Learning visually-grounded words and syntax for a scene description task. Computer Speech and Language, 16:353-385.
    • (2002) Computer Speech and Language , vol.16 , pp. 353-385
    • Roy, D.1
  • 20
    • 0030254719 scopus 로고    scopus 로고
    • A computational study of crosssituational techniques for learning word-to-meaning mappings
    • J. M. Siskind. 1996. A computational study of crosssituational techniques for learning word-to-meaning mappings. Cognition, 61:39-91.
    • (1996) Cognition , vol.61 , pp. 39-91
    • Siskind, J.M.1
  • 22
    • 84935113569 scopus 로고
    • Error bounds for convolutional codes and an asymtotically optimum decoding algorithm
    • A. J. Viterbi. 1967. Error bounds for convolutional codes and an asymtotically optimum decoding algorithm. IEEE Transactions on Information Theory, 13:260-267.
    • (1967) IEEE Transactions on Information Theory , vol.13 , pp. 260-267
    • Viterbi, A.J.1
  • 23
    • 0015143526 scopus 로고
    • Convolutional codes and their performance in communication systems
    • A. Viterbi. 1971. Convolutional codes and their performance in communication systems. IEEE Transactions on Communication Technology, 19(5):751-772.
    • (1971) IEEE Transactions on Communication Technology , vol.19 , Issue.5 , pp. 751-772
    • Viterbi, A.1
  • 27
    • 33747060155 scopus 로고    scopus 로고
    • Technical report, Department of Electrical and Computer Engineering, The University of Texas at Austin
    • S. Zhong and J. Ghosh. 2001. A new formulation of coupled hidden Markov models. Technical report, Department of Electrical and Computer Engineering, The University of Texas at Austin.
    • (2001) A New Formulation of Coupled Hidden Markov Models
    • Zhong, S.1    Ghosh, J.2


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