File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Hilbert functions and applications to the estimation of subspace arrangements

TitleHilbert functions and applications to the estimation of subspace arrangements
Authors
Issue Date2005
Citation
Proceedings of the IEEE International Conference on Computer Vision, 2005, v. I, p. 158-165 How to Cite?
AbstractThis 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 Identifierhttp://hdl.handle.net/10722/326713

 

DC FieldValueLanguage
dc.contributor.authorYang, Allen Y.-
dc.contributor.authorRao, Shankar-
dc.contributor.authorWagner, Andrew-
dc.contributor.authorMa, Yi-
dc.contributor.authorPossum, Robert M.-
dc.date.accessioned2023-03-31T05:26:00Z-
dc.date.available2023-03-31T05:26:00Z-
dc.date.issued2005-
dc.identifier.citationProceedings of the IEEE International Conference on Computer Vision, 2005, v. I, p. 158-165-
dc.identifier.urihttp://hdl.handle.net/10722/326713-
dc.description.abstractThis 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.languageeng-
dc.relation.ispartofProceedings of the IEEE International Conference on Computer Vision-
dc.titleHilbert functions and applications to the estimation of subspace arrangements-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICCV.2005.114-
dc.identifier.scopuseid_2-s2.0-33745945906-
dc.identifier.volumeI-
dc.identifier.spage158-
dc.identifier.epage165-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats