repository
Multi-Scale Fusion Network Using Adaptive Cost Volume Filtering for Stereo Matching
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | 허용석 | - |
| dc.contributor.author | 전수연 | - |
| dc.date.accessioned | 2022-11-29T03:01:29Z | - |
| dc.date.available | 2022-11-29T03:01:29Z | - |
| dc.date.issued | 2022-08 | - |
| dc.identifier.other | 32262 | - |
| dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/21221 | - |
| dc.description | 학위논문(석사)--아주대학교 일반대학원 :인공지능학과,2022. 8 | - |
| dc.description.tableofcontents | 1 Introduction 1 2 Related Works 7 2.1 Efficient Stereo Matching Networks 7 2.2 Cost Volume Filtering 9 3 Proposed Method 11 3.1 Feature Extractor 12 3.2 Cost Aggregation 12 3.3 Interlaced Cost Volume 17 3.4 Disparity Regression and Refinement 17 3.5 Loss Function 19 3.5.1 Disparity Regression Loss 19 3.5.2 Adaptive Cost Volume Filtering Loss 19 3.5.3 Total Loss Function 23 4 Experiments and Results 24 4.1 Datasets and Evaluation Metrics 24 4.2 Implementation Details 25 4.3 Comparative Result 26 4.3.1 SceneFlow Result 26 4.3.2 KITTI 2015 Result 27 4.4 Ablation Study 30 4.4.1 Effect of Interlaced Cost Concatenation 30 4.4.2 Effect of Adaptive Cost Volume Filtering Loss 32 5 Conclusions 33 References 34 | - |
| dc.language.iso | eng | - |
| dc.publisher | The Graduate School, Ajou University | - |
| dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
| dc.title | Multi-Scale Fusion Network Using Adaptive Cost Volume Filtering for Stereo Matching | - |
| dc.type | Thesis | - |
| dc.contributor.affiliation | 아주대학교 일반대학원 | - |
| dc.contributor.alternativeName | Suyeon Jeon | - |
| dc.contributor.department | 일반대학원 인공지능학과 | - |
| dc.date.awarded | 2022. 8 | - |
| dc.description.degree | Master | - |
| dc.identifier.localId | 1254236 | - |
| dc.identifier.uci | I804:41038-000000032262 | - |
| dc.identifier.url | https://dcoll.ajou.ac.kr/dcollection/common/orgView/000000032262 | - |
| dc.subject.keyword | Stereo Matching | - |
| dc.description.alternativeAbstract | While recent deep learning-based stereo matching networks have shown outstanding advances, there are still some unsolved challenges. First, most state-of-the-art stereo models employ 3D convolutions for 4D cost volume aggregation,which limit the deployment of networks for resource-limited mobile environments owing to heavy consumption of computation and memory. Second, most stereo networks indirectly supervise cost volumes through disparity regression loss by using the softargmax function. This causes problems in ambiguous regions, such as the boundaries of objects, because there are many possibilities for unreasonable cost distributions which result in overfitting problem. To address these problems, we first propose an efficient multi scale sequential feature fusion network (MSFFNet). Specifically, we connect multi-scale SFF modules in parallel with a cross-scale fusion function to generate a set of cost volumes with different scales. These cost volumes are then effectively combined using the proposed interlaced concatenation method. Second, we propose an adaptive cost volume filtering (ACVF) loss function that directly supervises our estimated cost volume. The proposed ACVF loss directly adds constraints to the cost volume using the probability distribution generated from the ground truth disparity map and that estimated from the teacher network with higher accuracy. Results of several experiments using representative datasets for stereo matching shows that our proposed method is more efficient than previous methods. Concretely, our network architecture consumes fewer parameters and generates reasonable disparity maps with faster speed compared with the existing state-of-the art stereo models. | - |
- Appears in Collections:
- Graduate School of Ajou University > Department of Artificial Intelligence > 3. Theses(Master)
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
-
- License
- STATISTICS
- Total Visit :3,762,163
- Total Download :1,819
- Today View :8,355
