Hidden Conditional Random Fields for Meeting Segmentation
- 1 July 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19457871,p. 639-642
Abstract
Automatic segmentation and classification of recorded meetings provides a basis towards understanding the content of a meeting. It enables effective browsing and querying in a meeting archive. Though robustness of existing approaches is often not reliable enough. We therefore strive to improve on this task by applying conditional random fields augmented by hidden states. These hidden conditional random fields have been proven to be efficient in low level pattern recognition tasks. Now we propose to use these novel models to segment a pre-recorded meeting into meeting events. Since they can also be seen as an extension to hidden Markov models an elaborate comparison of the two approaches is provided. Extensive test runs on the public M4 Scripted Meeting Corpus prove the great performance of applying our suggested novel approach compared to other similar methods.Keywords
This publication has 7 references indexed in Scilit:
- Training Algorithms for Hidden Conditional Random Fields2006
- A Combined LSTM-RNN - HMM - Approach for Meeting Event Segmentation and Recognition2006
- Segmentation and Recognition of Meeting Events using a Two-Layered HMM and a Combined MLP-HMM Approach2006
- Modeling individual and group actions in meetings with layered HMMsIEEE Transactions on Multimedia, 2006
- Automatic analysis of multimodal group actions in meetingsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
- Modeling human interaction in meetings2004
- A tutorial on hidden Markov models and selected applications in speech recognitionProceedings of the IEEE, 1989