<ul><li>Many-to-many matching seeks to match multiple points in one set and multiple points in another set.</li><li>This paper proposes a novel many-to-many matching method that explicitly encodes many-to-many constraints while preventing one-to-one matching.</li><li>The method includes matching budget constraints and a deformed $q$-entropy regularization to maximize the matching budget.</li><li>Experimental results show that the proposed method achieves good performance in generating meaningful many-to-many matchings.</li></ul>

Many-to-Many Matching via Sparsity Controlled Optimal Transport

Discover more