Abstract
This paper presents a novel modalities consensus framework for multi-modal pairwise constraint propagation (MCP). We first combine multiple single-modal constraint propagation (SCP) problems together, and then explicitly introduce a new modalities consensus regularizer to force the propagation results on different modalities to be consistent with each other. With a separable consensus regularizer, the proposed approach can be effectively solved using an alternating optimization way. More importantly, based on our modalities consensus framework, two single-modal constraint propagation algorithms can be directly reformulated as two well-defined multi-modal solutions. Experimental results on constrained clustering tasks have shown that the proposed framework can achieve significant improvements with respect to the state of the arts. © 2012 ACM.
| Original language | English |
|---|---|
| Title of host publication | MM 2012 - Proceedings of the 20th ACM International Conference on Multimedia |
| Pages | 773-776 |
| DOIs | |
| Publication status | Published - 2012 |
| Event | 20th ACM International Conference on Multimedia, MM 2012 - Nara, Japan Duration: 29 Oct 2012 → 2 Nov 2012 |
Conference
| Conference | 20th ACM International Conference on Multimedia, MM 2012 |
|---|---|
| Place | Japan |
| City | Nara |
| Period | 29/10/12 → 2/11/12 |
Research Keywords
- multi-modal analysis
- pairwise constraint propagation
Fingerprint
Dive into the research topics of 'Modalities consensus for multi-modal constraint propagation'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver