{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/113532"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/113532","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Experimental implementations of stereo matching algorithms in Halide","abstract":"Currently, most stereo matching algorithms focus their efforts on increasing accuracy at the price of losing run-time performance. However, applications such as robotics require high performance stereo algorithms to perform real time tasks. The problem is due to the difficulty of hand optimizing the complicated stereo matching pipelines. Halide is a programming language that has been widely used in writing high-performance image processing codes. In this work, we explore the usability of Halide in the area of real-time stereo algorithms by implementing several stereo algorithms in Halide. Because of Halide's ability to reduce the computation cost of dense algorithms, we focus on local dense stereo matching algorithms, including the simple box matching algorithm and the adaptive window stereo matching algorithms. Although we have found Halide's limitation in scheduling dynamic programming and recursive filters, our results demonstrate that Halide programs can achieve comparable performance as hand-tuned programs with much simpler and understandable code. Lastly, we also include a design solution to support dynamic programming in Halide.","abstract_html":"Currently, most stereo matching algorithms focus their efforts on increasing accuracy at the price of losing run-time performance. However, applications such as robotics require high performance stereo algorithms to perform real time tasks. The problem is due to the difficulty of hand optimizing the complicated stereo matching pipelines. Halide is a programming language that has been widely used in writing high-performance image processing codes. In this work, we explore the usability of Halide in the area of real-time stereo algorithms by implementing several stereo algorithms in Halide. Because of Halide's ability to reduce the computation cost of dense algorithms, we focus on local dense stereo matching algorithms, including the simple box matching algorithm and the adaptive window stereo matching algorithms. Although we have found Halide's limitation in scheduling dynamic programming and recursive filters, our results demonstrate that Halide programs can achieve comparable performance as hand-tuned programs with much simpler and understandable code. Lastly, we also include a design solution to support dynamic programming in Halide.","abstract_has_math":false,"creators":["Zhang, Min, M. Eng. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (2016)"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Saman Amarasinghe."],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016","date_published":"2016","updated_at":"2026-07-22T22:21:16Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/113532","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Saman Amarasinghe."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Zhang, Min, M. Eng. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (2016)"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2018-02-08T16:27:59Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2018-02-08T16:27:59Z"]},{"key":"dc:date.issued","label":"Date","values":["2016"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/113532"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 51-52)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Currently, most stereo matching algorithms focus their efforts on increasing accuracy at the price of losing run-time performance. However, applications such as robotics require high performance stereo algorithms to perform real time tasks. The problem is due to the difficulty of hand optimizing the complicated stereo matching pipelines. Halide is a programming language that has been widely used in writing high-performance image processing codes. In this work, we explore the usability of Halide in the area of real-time stereo algorithms by implementing several stereo algorithms in Halide. Because of Halide's ability to reduce the computation cost of dense algorithms, we focus on local dense stereo matching algorithms, including the simple box matching algorithm and the adaptive window stereo matching algorithms. Although we have found Halide's limitation in scheduling dynamic programming and recursive filters, our results demonstrate that Halide programs can achieve comparable performance as hand-tuned programs with much simpler and understandable code. Lastly, we also include a design solution to support dynamic programming in Halide."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M. Eng."]},{"key":"dc:title","label":"Title","values":["Experimental implementations of stereo matching algorithms in Halide"]}]}],"canonical_facts":{"dc:contributor.advisor":["Saman Amarasinghe."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:creator":["Zhang, Min, M. Eng. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (2016)"],"dc:date.accessioned":["2018-02-08T16:27:59Z"],"dc:date.available":["2018-02-08T16:27:59Z"],"dc:date.issued":["2016"],"dc:description":["Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 51-52)."],"dc:description.abstract":["Currently, most stereo matching algorithms focus their efforts on increasing accuracy at the price of losing run-time performance. However, applications such as robotics require high performance stereo algorithms to perform real time tasks. The problem is due to the difficulty of hand optimizing the complicated stereo matching pipelines. Halide is a programming language that has been widely used in writing high-performance image processing codes. In this work, we explore the usability of Halide in the area of real-time stereo algorithms by implementing several stereo algorithms in Halide. Because of Halide's ability to reduce the computation cost of dense algorithms, we focus on local dense stereo matching algorithms, including the simple box matching algorithm and the adaptive window stereo matching algorithms. Although we have found Halide's limitation in scheduling dynamic programming and recursive filters, our results demonstrate that Halide programs can achieve comparable performance as hand-tuned programs with much simpler and understandable code. Lastly, we also include a design solution to support dynamic programming in Halide."],"dc:description.degree":["M. Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/113532"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Experimental implementations of stereo matching algorithms in Halide"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:16Z"}