• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Globfit: Consistently fitting primitives by discovering global relations

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Conference Paper
    Authors
    Li, Yangyan
    Wu, Xiaokun
    Chrysathou, Yiorgos
    Sharf, Andrei Sharf
    Cohen-Or, Daniel
    Mitra, Niloy J. cc
    KAUST Department
    Computer Science Program
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Visual Computing Center (VCC)
    Date
    2011-07-26
    Online Publication Date
    2011-07-26
    Print Publication Date
    2011
    Permanent link to this record
    http://hdl.handle.net/10754/575901
    
    Metadata
    Show full item record
    Abstract
    Given a noisy and incomplete point set, we introduce a method that simultaneously recovers a set of locally fitted primitives along with their global mutual relations. We operate under the assumption that the data corresponds to a man-made engineering object consisting of basic primitives, possibly repeated and globally aligned under common relations. We introduce an algorithm to directly couple the local and global aspects of the problem. The local fit of the model is determined by how well the inferred model agrees to the observed data, while the global relations are iteratively learned and enforced through a constrained optimization. Starting with a set of initial RANSAC based locally fitted primitives, relations across the primitives such as orientation, placement, and equality are progressively learned and conformed to. In each stage, a set of feasible relations are extracted among the candidate relations, and then aligned to, while best fitting to the input data. The global coupling corrects the primitives obtained in the local RANSAC stage, and brings them to precise global alignment. We test the robustness of our algorithm on a range of synthesized and scanned data, with varying amounts of noise, outliers, and non-uniform sampling, and validate the results against ground truth, where available. © 2011 ACM.
    Citation
    Li, Y., Wu, X., Chrysathou, Y., Sharf, A., Cohen-Or, D., & Mitra, N. J. (2011). GlobFit. ACM SIGGRAPH 2011 Papers on - SIGGRAPH ’11. doi:10.1145/1964921.1964947
    Publisher
    Association for Computing Machinery (ACM)
    Journal
    ACM SIGGRAPH 2011 papers on - SIGGRAPH '11
    Conference/Event name
    ACM SIGGRAPH 2011, SIGGRAPH 2011
    ISBN
    9781450309431
    DOI
    10.1145/1964921.1964947
    10.1145/2010324.1964947
    ae974a485f413a2113503eed53cd6c53
    10.1145/1964921.1964947
    Scopus Count
    Collections
    Conference Papers; Computer Science Program; Visual Computing Center (VCC); Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2022  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.