Please use this identifier to cite or link to this item:
|Title:||Minimal basis facility location for subspace segmentation|
minimal basis subspace representation
|Citation:||Lee, C.-M., Cheong, L.-F. (2013). Minimal basis facility location for subspace segmentation. Proceedings of the IEEE International Conference on Computer Vision : 1585-1592. ScholarBank@NUS Repository. https://doi.org/10.1109/ICCV.2013.200|
|Abstract:||In contrast to the current motion segmentation paradigm that assumes independence between the motion subspaces, we approach the motion segmentation problem by seeking the parsimonious basis set that can represent the data. Our formulation explicitly looks for the overlap between subspaces in order to achieve a minimal basis representation. This parsimonious basis set is important for the performance of our model selection scheme because the sharing of basis results in savings of model complexity cost. We propose the use of affinity propagation based method to determine the number of motion. The key lies in the incorporation of a global cost model into the factor graph, serving the role of model complexity. The introduction of this global cost model requires additional message update in the factor graph. We derive an efficient update for the new messages associated with this global cost model. An important step in the use of affinity propagation is the subspace hypotheses generation. We use the row-sparse convex proxy solution as an initialization strategy. We further encourage the selection of subspace hypotheses with shared basis by integrating a discount scheme that lowers the factor graph facility cost based on shared basis. We verified the model selection and classification performance of our proposed method on both the original Hopkins 155 dataset and the more balanced Hopkins 380 dataset. © 2013 IEEE.|
|Source Title:||Proceedings of the IEEE International Conference on Computer Vision|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 19, 2018
WEB OF SCIENCETM
checked on Apr 3, 2018
checked on Apr 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.