Modified Adaptive Support Weight for Stereo Matching
Article Sidebar
Main Article Content
Abstract
Local stereo matching algorithms are very popular in the recent years. The adaptive support weight algorithms can give high accuracy results such as global methods. This paper proposed a support aggregation approach for stereo matching that computed support weight in sparse support window mask. The improvement from the previous work is that the new support weight can reduce the computation into the fourth of the earlier work and help to reach the optimum correspondence. It means sparse support weight affects the time computation that is needed in stereo matching and optimizes the disparity. This support weight is used to accomplish the stereo matching evaluation using this method.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
Copyright
Open Access authors retain the copyrights of their papers, and all open access articles are distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution and reproduction in any medium, provided that the original work is properly cited.
The use of general descriptive names, trade names, trademarks, and so forth in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations.
While the advice and information in this journal are believed to be true and accurate on the date of its going to press, neither the authors, the editors, nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein.
This work is licensed under a Creative Commons Attribution 4.0 International License.
