{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/24154"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/24154","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Parallelization of SIFT on Rigel","abstract":"With the trend towards parallel processing in computing, interest is developing in enabling workloads to be done at faster speeds to enable new usage models. SIFT is an algorithm for image detection and can be used for a variety of purposes. It collects key-point features that are invariant to changes in lighting, orientation and affine transforms. We ported the SIFT algorithm to the many-core architecture Rigel and studied the amount of speedup that can be gained by parallelizing the algorithm. Our results showed the algorithm to provide a speedup of 75x when parallelized over 128 cores.","abstract_html":"With the trend towards parallel processing in computing, interest is developing in enabling workloads to be done at faster speeds to enable new usage models. SIFT is an algorithm for image detection and can be used for a variety of purposes. It collects key-point features that are invariant to changes in lighting, orientation and affine transforms. We ported the SIFT algorithm to the many-core architecture Rigel and studied the amount of speedup that can be gained by parallelizing the algorithm. Our results showed the algorithm to provide a speedup of 75x when parallelized over 128 cores.","abstract_has_math":false,"creators":["Hussain, Ali A."],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Electrical & Computer Engr","degree_department":null,"school":null,"contributors":["Patel, Sanjay J."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-25T14:51:09Z","date_published":"2011-05-25T14:51:09Z","updated_at":"2026-07-22T22:25:23Z","subjects":["Scale-Invariant Feature Transform (SIFT)","Rigel","Parallelization","Image recognition"],"languages":["en"],"rights":["Copyright 2011 Ali A. Hussain"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/24154","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Patel, Sanjay J."]},{"key":"dc:creator","label":"Author","values":["Hussain, Ali A."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-25T14:51:09Z","2011-05"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical & Computer Engr"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Scale-Invariant Feature Transform (SIFT)","Rigel","Parallelization","Image recognition"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2011 Ali A. Hussain"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/24154"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["With the trend towards parallel processing in computing, interest is developing in enabling workloads to be done at faster speeds to enable new usage models. SIFT is an algorithm for image detection and can be used for a variety of purposes. It collects key-point features that are invariant to changes in lighting, orientation and affine transforms. We ported the SIFT algorithm to the many-core architecture Rigel and studied the amount of speedup that can be gained by parallelizing the algorithm. Our results showed the algorithm to provide a speedup of 75x when parallelized over 128 cores.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-02-25T14:51:50Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 thesis.tar.gz: 204669 bytes, checksum: 51f6d4eff4f8e4820d0b512156b03a3d (MD5) Hussain_Ali.pdf: 164111 bytes, checksum: 02bc2ffa16dcf3930854df65598575e9 (MD5)","Made available in DSpace on 2011-05-25T14:51:09Z (GMT). No. of bitstreams: 3 Hussain_Ali.pdf: 164111 bytes, checksum: 02bc2ffa16dcf3930854df65598575e9 (MD5) license.txt: 4062 bytes, checksum: 3198d0b6b4dc97d70b2d7b028ca36574 (MD5) thesis.tar.gz: 204669 bytes, checksum: 51f6d4eff4f8e4820d0b512156b03a3d (MD5)"]},{"key":"dc:title","label":"Title","values":["Parallelization of SIFT on Rigel"]}]}],"canonical_facts":{"dc:contributor":["Patel, Sanjay J."],"dc:creator":["Hussain, Ali A."],"dc:date":["2011-05-25T14:51:09Z","2011-05"],"dc:description":["With the trend towards parallel processing in computing, interest is developing in enabling workloads to be done at faster speeds to enable new usage models. SIFT is an algorithm for image detection and can be used for a variety of purposes. It collects key-point features that are invariant to changes in lighting, orientation and affine transforms. We ported the SIFT algorithm to the many-core architecture Rigel and studied the amount of speedup that can be gained by parallelizing the algorithm. Our results showed the algorithm to provide a speedup of 75x when parallelized over 128 cores.","Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2011-02-25T14:51:50Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 thesis.tar.gz: 204669 bytes, checksum: 51f6d4eff4f8e4820d0b512156b03a3d (MD5) Hussain_Ali.pdf: 164111 bytes, checksum: 02bc2ffa16dcf3930854df65598575e9 (MD5)","Made available in DSpace on 2011-05-25T14:51:09Z (GMT). No. of bitstreams: 3 Hussain_Ali.pdf: 164111 bytes, checksum: 02bc2ffa16dcf3930854df65598575e9 (MD5) license.txt: 4062 bytes, checksum: 3198d0b6b4dc97d70b2d7b028ca36574 (MD5) thesis.tar.gz: 204669 bytes, checksum: 51f6d4eff4f8e4820d0b512156b03a3d (MD5)"],"dc:identifier":["http://hdl.handle.net/2142/24154"],"dc:language":["en"],"dc:rights":["Copyright 2011 Ali A. Hussain"],"dc:subject":["Scale-Invariant Feature Transform (SIFT)","Rigel","Parallelization","Image recognition"],"dc:title":["Parallelization of SIFT on Rigel"],"thesis:degree_discipline":["Electrical & Computer Engr"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:23Z"}