File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICCV.2005.114
- Scopus: eid_2-s2.0-33745945906
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Hilbert functions and applications to the estimation of subspace arrangements
Title | Hilbert functions and applications to the estimation of subspace arrangements |
---|---|
Authors | |
Issue Date | 2005 |
Citation | Proceedings of the IEEE International Conference on Computer Vision, 2005, v. I, p. 158-165 How to Cite? |
Abstract | This paper develops a new mathematical framework for studying the subspace-segmentation problem. We examine some important algebraic properties of subspace arrangements that are closely related to the subspace-segmentation problem. More specifically, we introduce an important class of invariants given by the Hilbert functions. We show that there exist rich relations between subspace arrangements and their corresponding Hilbert functions. We propose a new subspace-segmentation algorithm, and showcase two applications to demonstrate how the new theoretical revelation may solve subspace segmentation and model selection problems under less restrictive conditions with improved results. © 2005 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/326713 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yang, Allen Y. | - |
dc.contributor.author | Rao, Shankar | - |
dc.contributor.author | Wagner, Andrew | - |
dc.contributor.author | Ma, Yi | - |
dc.contributor.author | Possum, Robert M. | - |
dc.date.accessioned | 2023-03-31T05:26:00Z | - |
dc.date.available | 2023-03-31T05:26:00Z | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | Proceedings of the IEEE International Conference on Computer Vision, 2005, v. I, p. 158-165 | - |
dc.identifier.uri | http://hdl.handle.net/10722/326713 | - |
dc.description.abstract | This paper develops a new mathematical framework for studying the subspace-segmentation problem. We examine some important algebraic properties of subspace arrangements that are closely related to the subspace-segmentation problem. More specifically, we introduce an important class of invariants given by the Hilbert functions. We show that there exist rich relations between subspace arrangements and their corresponding Hilbert functions. We propose a new subspace-segmentation algorithm, and showcase two applications to demonstrate how the new theoretical revelation may solve subspace segmentation and model selection problems under less restrictive conditions with improved results. © 2005 IEEE. | - |
dc.language | eng | - |
dc.relation.ispartof | Proceedings of the IEEE International Conference on Computer Vision | - |
dc.title | Hilbert functions and applications to the estimation of subspace arrangements | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ICCV.2005.114 | - |
dc.identifier.scopus | eid_2-s2.0-33745945906 | - |
dc.identifier.volume | I | - |
dc.identifier.spage | 158 | - |
dc.identifier.epage | 165 | - |