다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
정보과학회논문지 = Journal of KIISE, v.44 no.11, 2017년, pp.1194 - 1208
AI-Helper
A traditional average smoothing method is designed for smoothing out noise, which, however, unintentionally results in smooth corner points on the curvature accompanied with a shrinkage of curves. In this paper, we propose a novel curve smoothing method via polygonal approximation of the input curve...
D. Lowe, "Organization of smooth image curves at multiple scales," International Journal of Computer Vision, Vol. 3, No. 2, pp. 119-130, 1989.
G. Taubin, "Curve and surface smoothing without shrinkage," Proc. IEEE International Conference on Computer Vision, pp. 852-857, 1995.
J. Oliensis, "Local reproducible smoothing without shrinkage," IEEE Transaction on Pattern Recognition and Machine Intelligence, Vol. 15, No. 3, pp. 307-312, Mar. 1993.
R. Legault and C. Suen, "Optimal local weighted averaging methods in contour smoothing," IEEE Transaction on Pattern Recognition and Machine Intelligence, Vol. 19, No. 8, pp. 801-817, Aug. 1997.
F. Mokhtarian and A. Mackworth, "A theory of multiscale, curvature-based shape representation for planar curves," IEEE Transaction on Pattern Recognition and Machine Intelligence, Vol. 14, No. 8, pp. 789-805, 1992.
B. Zhong, and K. Ma, "On the convergence of planar curves under smoothing," IEEE Transaction on Image Processing, Vol. 19, No. 8, pp. 2171-2189, Aug. 2010.
M. Mansouryar and A. Hedayati, "Smoothing via iterative averaging (SIA) a basic technique for line smoothing," International Journal of Computer & Electrical Engineering, Vol. 4, pp. 307-311, Jun. 2012.
S. Lyu, "Smoothing Method for Digital Curve by Iterative Averaging with Controllable Error," Journal of KIISE : Software and Applications, Vol. 42, No. 6, 2015. (in Korean)
A. Saalfeld, "Topologically Consistent Line Simplification with the Douglas-Peucker Algorithm," Cartography and Geographic Information Science, Vol. 26, No. 1, pp. 7-18, 1999.
M. Abam, M. DeBerg, P. Hachenberger and A. Zarei, "Streaming algorithms for line simplication," Discrete & Computational Geometry, Vol. 43, No. 3, pp. 497-515, 2010.
J. Sklansky, "Measuring concavity on a rectangular mosaic," IEEE Transaction on Computers, Vol. 21, pp. 1355-1364, 1972.
E. Aguilera, et. al., "The computation of polygonal approximations for 2d contours based on a concavity tree," Journal of Visual Communication and Image Representation, 25, pp. 1905-1917, 2014.
F. Cuevas, et. al., "An efficient unsupervised method for obtaining polygonal approximations of closed digital planar curves," Journal of Visual Communication and Image Representation, 39, pp. 152-163, 2016.
MPEG-7 Core Experiment CE-Shape-1 Test Set, publicly available at http://www.dabi.temple.edu/-shape/MPEG7/dataset.html
OpenStreetMap, 2004. http://www.openstreetmaps.org.
A. Bruckstein, A. Katzir Nir, M. Lindenbaum and M. Porat, "Similarity-invariant signatures for partially occluded planar shapes," International Journal of Computer Vision, Vol. 7, pp. 271-285, 1992.
A. Pikaz and I. Dinstein, "Using simple decomposition for smoothing and feature point detection of noisy digital curves," IEEE Transaction on Pattern Recognition and Machine Intelligence, Vol. 16, No. 8, pp. 808-813, 1994.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.