DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Chang-Ick | - |
dc.contributor.advisor | 김창익 | - |
dc.contributor.author | Kim, Young-Woo | - |
dc.contributor.author | 김영우 | - |
dc.date.accessioned | 2011-12-28T03:04:02Z | - |
dc.date.available | 2011-12-28T03:04:02Z | - |
dc.date.issued | 2009 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=393078&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/55057 | - |
dc.description | 학위논문(석사) - 한국정보통신대학교 : 공학부, 2009.2, [ vi, 48 p. ] | - |
dc.description.abstract | In this thesis, we propose a 2D-to-3D conversion system based on view-distance classification. An input image frame is transformed by using $\It{Fourier transform}$, and feature vectors are obtained by $\It{principle component analysis}$ (PCA). Based on these feature vectors, the image view is categorized into $\It{close-up view }$, $\It{long view with vanishing point}$, or $\It{ long view without vanishing point}$. According to the view classes, different methods are applied to depth map generation, which is needed for stereoscopic video generation. Experimental results show the final depth map generated by each technique, and indicate our system is useful for various 3D applications. | eng |
dc.language | eng | - |
dc.publisher | 한국정보통신대학교 | - |
dc.subject | 소실점 검출 | - |
dc.subject | 깊이 지도 생성 | - |
dc.subject | 깊이 추정 | - |
dc.subject | 영상 분류 | - |
dc.subject | 2D-to-3D 변환 | - |
dc.subject | Depth map generation | - |
dc.subject | Depth estimation | - |
dc.subject | Image classification | - |
dc.subject | 2D-to-3D conversion | - |
dc.subject | Vanishing point detection | - |
dc.title | 2D-to-3D conversion of single-view video based on view-distance classification | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 393078/225023 | - |
dc.description.department | 한국정보통신대학교 : 공학부, | - |
dc.identifier.uid | 020074241 | - |
dc.contributor.localauthor | Kim, Chang-Ick | - |
dc.contributor.localauthor | 김창익 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.