Segmentation given partial grouping constraints

Citations Over TimeTop 10% of 2004 papers

Abstract

We consider data clustering problems where partial grouping is known a priori. We formulate such biased grouping problems as a constrained optimization problem, where structural properties of the data define the goodness of a grouping and partial grouping cues define the feasibility of a grouping. We enforce grouping smoothness and fairness on labeled data points so that sparse partial grouping information can be effectively propagated to the unlabeled data. Considering the normalized cuts criterion in particular, our formulation leads to a constrained eigenvalue problem. By generalizing the Rayleigh-Ritz theorem to projected matrices, we find the global optimum in the relaxed continuous domain by eigendecomposition, from which a near-global optimum to the discrete labeling problem can be obtained effectively. We apply our method to real image segmentation problems, where partial grouping priors can often be derived based on a crude spatial attentional map that binds places with common salient features or focuses on expected object locations. We demonstrate not only that it is possible to integrate both image structures and priors in a single grouping process, but also that objects can be segregated from the background without specific object knowledge.

Related Papers

• → The Bayesian‐Laplacian brain(2019)38 cited
• Experimental Evidence on Valuation and Learning with Multiple Priors(2013)
• → The Bayesian-Laplacian Brain(2016)4 cited
• → Reference Priors Versus Reverse Reference Priors: The Role of Invariance(2000)