DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Chung, Won-L. | - |
dc.contributor.advisor | 정원량 | - |
dc.contributor.author | Oh, Il-Seok | - |
dc.contributor.author | 오일석 | - |
dc.date.accessioned | 2011-12-13T05:54:12Z | - |
dc.date.available | 2011-12-13T05:54:12Z | - |
dc.date.issued | 1990 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=67780&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/33952 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전산학과, 1990, [ [ii], 16 p. ] | - |
dc.description.abstract | One of the key problems of edge-based digital picture processing is the filling of small gaps between edge segments after edge extraction. We describe a new solution to this problem which draws its power from the locality of gap filling procedure. This efficient algorithm finds by raster scanning the edge end-points from which filling operations are started and propagated only to the neighborhoods. Specifically, it restricts the search area for an edge extension to be filled to the direction in which each edge would most likely extend. We tested three algorithms including ours with a number of sample images to compare the performance. The experimental results confirm the superiority of our algorithm to others in terms of the time and storage complexity. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.title | (A) new edge gap filling algorithm based on local operations | - |
dc.title.alternative | 국부적 연산에 기반한 새로운 경계선 간격 메우기 알고리듬 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 67780/325007 | - |
dc.description.department | 한국과학기술원 : 전산학과, | - |
dc.identifier.uid | 000841192 | - |
dc.contributor.localauthor | Chung, Won-L. | - |
dc.contributor.localauthor | 정원량 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.