Team for Research in
Ubiquitous Secure Technology

Dynamic Dependency Tests: Analysis and Applications to Multi-modal Data Association
Michael Siracusa, John Fisher

Citation
Michael Siracusa, John Fisher. "Dynamic Dependency Tests: Analysis and Applications to Multi-modal Data Association". Eleventh International Conference on Artificial Intelligence and Statistics', March, 2007.

Abstract
The goal of a dynamic dependency test is to correctly label the interaction of multiple observed data streams and to describe how this interaction evolves over time. To this end, we propose the use of a hidden factorization Markov model (HFactMM) in which a hidden state indexes into a finite set of possible dependence structures on observations. We show that a dynamic dependency test using an HFactMM takes advantage of both structural and parametric changes associated with changes in interaction. This is contrasted both theoretically and empirically with standard sliding window based dependence analysis. Using this model we obtain state-of-the-art performance on an audio-visual association task without the benefit of labeled training data.

Electronic downloads

Citation formats  
  • HTML
    Michael Siracusa, John Fisher. <a
    href="http://www.truststc.org/pubs/274.html"
    >Dynamic Dependency Tests: Analysis and Applications to
    Multi-modal Data Association</a>, Eleventh
    International Conference on Artificial Intelligence and
    Statistics', March, 2007.
  • Plain text
    Michael Siracusa, John Fisher. "Dynamic Dependency
    Tests: Analysis and Applications to Multi-modal Data
    Association". Eleventh International Conference on
    Artificial Intelligence and Statistics', March, 2007.
  • BibTeX
    @inproceedings{SiracusaFisher07_DynamicDependencyTestsAnalysisApplicationsToMultimodal,
        author = {Michael Siracusa and John Fisher},
        title = {Dynamic Dependency Tests: Analysis and
                  Applications to Multi-modal Data Association},
        booktitle = {Eleventh International Conference on Artificial
                  Intelligence and Statistics'},
        month = {March},
        year = {2007},
        abstract = {The goal of a dynamic dependency test is to
                  correctly label the interaction of multiple
                  observed data streams and to describe how this
                  interaction evolves over time. To this end, we
                  propose the use of a hidden factorization Markov
                  model (HFactMM) in which a hidden state indexes
                  into a finite set of possible dependence
                  structures on observations. We show that a dynamic
                  dependency test using an HFactMM takes advantage
                  of both structural and parametric changes
                  associated with changes in interaction. This is
                  contrasted both theoretically and empirically with
                  standard sliding window based dependence analysis.
                  Using this model we obtain state-of-the-art
                  performance on an audio-visual association task
                  without the benefit of labeled training data.},
        URL = {http://www.truststc.org/pubs/274.html}
    }
    

Posted by Michael Siracusa on 24 Jul 2007.
For additional information, see the Publications FAQ or contact webmaster at www truststc org.

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.