Full metadata record
DC FieldValueLanguage
dc.contributor.authorChen, Wen-Chaoen_US
dc.contributor.authorChen, Zenen_US
dc.contributor.authorSung, Ping-Yien_US
dc.date.accessioned2015-07-21T08:28:54Z-
dc.date.available2015-07-21T08:28:54Z-
dc.date.issued2015-01-01en_US
dc.identifier.issn1016-2364en_US
dc.identifier.urihttp://hdl.handle.net/11536/124238-
dc.description.abstractThis paper presents a stochastic optimization based 3D dense reconstruction from multiple views. Accuracy and completeness are two major measure indices for performance evaluation of various multi-view stereo (MVS) algorithms. First, the reconstruction accuracy is highly related to the stereo mismatches over the multiple views. Stereo mismatches occur in the image regions involving the lack of texture, depth discontinuity, or repeated texture patterns. Second, an insufficient number of views or occlusions between objects also lead to the difficulty in matching so that the reconstruction completeness degrades. In pursuit of high accuracy and completeness we present the appropriate techniques to solve the above problems in the reconstruction task. To deal with the various stereo mismatch problems we propose to apply adaptive matching functions and allow partial matching. We shall model the object to be reconstructed by a set of 3D oriented planar patches covering the visible object surface. The adopted multi-view reconstruction is formulated as a patch expansion process under a tree hierarchy. In order to find the optimal patches via multi-view stereo matching we shall employ a PSO (Particle Swarm Optimization) method for the sake of implementation simplicity and avoidance of possible local traps as found in the derivative based optimization methods. The success in the PSO method relies on imposing proper constraints on ranges of the patch parameters including the patch depth and patch normal vector which are involved in the PSO objective function (i.e., the stereo matching function). Furthermore, we use a varying patch size to obtain the reliable patches in the areas containing less texture, repeated texture pattern, or depth discontinuity. To secure a high reconstruction quality we advocate a patch priority queue to select the best patch during the patch expansion. All of the above mentioned techniques are also effective in the situations when the number of views is sparse or the camera baseline width is wide. The proposed method is tested on synthetic and real image data sets. The experimental results indicate that the proposed method is superior or comparable to the top ranked reconstruction methods reported in the public Middlebury MVS evaluation website.en_US
dc.language.isoen_USen_US
dc.subject3D patch-based reconstructionen_US
dc.subjectmulti-view stereoen_US
dc.subjectadaptive matching functionen_US
dc.subjectGLN-PSOen_US
dc.subjectpatch priority queueen_US
dc.subjectpatch expansionen_US
dc.subjectpatch verificationen_US
dc.subjectpatch filteringen_US
dc.titleStochastic Optimization Based 3D Dense Reconstruction from Multiple Views with High Accuracy and Completenessen_US
dc.typeArticleen_US
dc.identifier.journalJOURNAL OF INFORMATION SCIENCE AND ENGINEERINGen_US
dc.citation.volume31en_US
dc.citation.spage131en_US
dc.citation.epage146en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000348091300007en_US
dc.citation.woscount0en_US
Appears in Collections:Articles