{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T16:31:20Z","timestamp":1778344280459,"version":"3.51.4"},"reference-count":26,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2019,12,1]]},"DOI":"10.1587\/transinf.2018edp7353","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T15:51:14Z","timestamp":1575301874000},"page":"2547-2556","source":"Crossref","is-referenced-by-count":3,"title":["Sampling Shape Contours Using Optimization over a Geometric Graph"],"prefix":"10.1587","volume":"E102.D","author":[{"given":"Kazuya","family":"OSE","sequence":"first","affiliation":[{"name":"Graduate School of Information Sciences, Hiroshima City University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazunori","family":"IWATA","sequence":"additional","affiliation":[{"name":"Graduate School of Information Sciences, Hiroshima City University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuo","family":"SUEMATSU","sequence":"additional","affiliation":[{"name":"Graduate School of Information Sciences, Hiroshima City University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] C. Grigorescu and N. Petkov, \u201cDistance sets for shape filters and shape recognition,\u201d IEEE Trans. Image Process., vol.12, no.10, pp.1274-1286, Oct. 2003. 10.1109\/tip.2003.816010","DOI":"10.1109\/TIP.2003.816010"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] K. Ueaoki, K. Iwata, N. Suematsu, and A. Hayashi, \u201cMatching handwritten line drawings with von Mises distributions,\u201d IEICE Trans. Inf. & Syst., vol.E94-D, no.12, pp.2487-2494, Dec. 2011. 10.1587\/transinf.e94.d.2487","DOI":"10.1587\/transinf.E94.D.2487"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] H. Fan, Y. Cong, and Y. Tang, \u201cSelf-closed partial shape descriptor for shape retrieval,\u201d Proc. 19th IEEE International Conference on Image Processing, Orlando, FL, pp.505-508, IEEE, Sept. 2012. 10.1109\/icip.2012.6466907","DOI":"10.1109\/ICIP.2012.6466907"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[5] I.L. Dryden and K.V. Mardia, Statistical Shape Analysis, with Applications in R, 2nd ed., Wiley Series in Probability and Statistics, John Wiley & Sons, Chichester, UK, 2016. 10.1002\/9781119072492","DOI":"10.1002\/9781119072492"},{"key":"5","unstructured":"[6] J.-C. Perez and E. Vidal, \u201cAn algorithm for the optimum piecewise linear approximation of digitized curves,\u201d Proc. 11th IAPR International Conference on Pattern Recognition, vol.III, pp.167-170, IEEE, Aug. 1992. 10.1109\/icpr.1992.201953"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[7] J.-C. Perez and E. Vidal, \u201cOptimum polygonal approximation of digitized curves,\u201d Pattern Recognition Letters, vol.15, no.8, pp.743-750, Aug. 1994. 10.1016\/0167-8655(94)90002-7","DOI":"10.1016\/0167-8655(94)90002-7"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[8] A.R. Backes and O.M. Bruno, \u201cPolygonal approximation of digital planar curves through vertex betweenness,\u201d Information Sciences, vol.222, pp.795-804, Feb. 2013. 10.1016\/j.ins.2012.07.062","DOI":"10.1016\/j.ins.2012.07.062"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[9] E.J. Aguilera-Aguilera, A. Carmona-Poyato, F.J. Madrid-Cuevas, and R. Medina-Carnicer, \u201cThe computation of polygonal approximations for 2D contours based on a concavity tree,\u201d Journal of Visual Communication and Image Representation, vol.25, no.8, pp.1905-1917, Nov. 2014. 10.1016\/j.jvcir.2014.09.012","DOI":"10.1016\/j.jvcir.2014.09.012"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[10] E.J. Aguilera-Aguilera, A. Carmona-Poyato, F.J Madrid-Cuevas, and M.J. Mar\u00edn-Jim\u00e9nez, \u201cFast computation of optimal polygonal approximations of digital planar closed curves,\u201d Graphical Models, vol.84, pp.15-27, March 2016. 10.1016\/j.gmod.2016.01.004","DOI":"10.1016\/j.gmod.2016.01.004"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[11] W.-Y. Wu, \u201cAn adaptive method for detecting dominant points,\u201d Pattern Recognition, vol.36, no.10, pp.2231-2237, Oct. 2003. 10.1016\/s0031-3203(03)00087-6","DOI":"10.1016\/S0031-3203(03)00087-6"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[12] T.P. Nguyen and I. Debled-Rennesson, \u201cA discrete geometry approach for dominant point detection,\u201d Pattern Recognition, vol.44, no.1, pp.32-44, Jan. 2011. 10.1016\/j.patcog.2010.06.022","DOI":"10.1016\/j.patcog.2010.06.022"},{"key":"12","doi-asserted-by":"publisher","unstructured":"[13] M.S. Tahaei, S.N. Hashemi, A. Mohades, and A. Gheibi, \u201cGeometric algorithm for dominant point extraction from shape contour,\u201d Pattern Analysis and Applications, vol.17, no.3, pp.481-496, Aug. 2014. 10.1007\/s10044-012-0311-9","DOI":"10.1007\/s10044-012-0311-9"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[14] J. Peethambaran, A.D. Parakkat, A. Tagliasacchi, R. Wang, and R. Muthuganapathy, \u201cIncremental labelling of Voronoi vertices for shape reconstruction,\u201d Computer Graphics Forum, vol.38, no.1, pp.521-536, March 2019. 10.1111\/cgf.13589","DOI":"10.1111\/cgf.13589"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[15] M. Cui, J. Femiani, J. Hu, P. Wonka, and A. Razdan, \u201cCurve matching for open 2D curves,\u201d Pattern Recognition Letters, vol.30, no.1, pp.1-10, Jan. 2009. 10.1016\/j.patrec.2008.08.013","DOI":"10.1016\/j.patrec.2008.08.013"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[16] L. Younes, Shapes and Diffeomorphisms, Applied Mathematical Sciences, vol.171, American Mathematical Society, Springer, Berlin, 2010. 10.1007\/978-3-642-12055-8","DOI":"10.1007\/978-3-642-12055-8"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[17] J. Pach, ed., Towards a Theory of Geometric Graphs, Contemporary Mathematics, vol.342, American Mathematical Society, Providence, RI, 2004. 10.1090\/conm\/342","DOI":"10.1090\/conm\/342"},{"key":"17","unstructured":"[18] R.J. Wilson, Introduction to Graph Theory, 4th ed., Pearson Education, Harlow, Longman, 1996."},{"key":"18","doi-asserted-by":"publisher","unstructured":"[19] A.D. Parakkat, J. Peethambaran, P. Joseph, and R. Muthuganapathy, \u201cA graph-based geometric approach to contour extraction from noisy binary images,\u201d Computer-Aided Design and Applications, vol.12, no.4, pp.403-413, 2015. 10.1080\/16864360.2014.997636","DOI":"10.1080\/16864360.2014.997636"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[20] T.G. Kolda, R.M. Lewis, and V. Torczon, \u201cOptimization by direct search: New perspectives on some classical and modern methods,\u201d SIAM Review, vol.45, no.3, pp.385-482, 2003. 10.1137\/s003614450242889","DOI":"10.1137\/S003614450242889"},{"key":"20","unstructured":"[21] R.C. Gonzalez, R.E. Woods, and S.L. Eddins, Digital Image Processing Using MATLAB, Pearson Education, Upper Saddle River, NJ, 2004."},{"key":"21","unstructured":"[22] K. Sugihara, Mathematics of Graphics, Kyoritsu Shuppan, Tokyo, Japan, Jan. 1995, in Japanese."},{"key":"22","doi-asserted-by":"publisher","unstructured":"[23] A.D. Parakkat, U.B. Pundarikaksha, and R. Muthuganapathy, \u201cA Delaunay triangulation based approach for cleaning rough sketches,\u201d Computers & Graphics, vol.74, pp.171-181, Aug. 2018. 10.1016\/j.cag.2018.05.011","DOI":"10.1016\/j.cag.2018.05.011"},{"key":"23","unstructured":"[24] K. Ose and K. Iwata, \u201cData set of line drawings with different stroke order and number,\u201d http:\/\/www.prl.info.hiroshima-cu.ac.jp\/kiwata\/oseiwata\/, May 2017."},{"key":"24","unstructured":"[25] Consumer Affairs Agency, Government of Japan, \u201cWashing tag symbols (before November 30, 2016),\u201d http:\/\/www.caa.go.jp\/policies\/policy\/representation\/household_goods\/guide\/wash.html, 2018 (in Japanese)."},{"key":"25","unstructured":"[26] Consumer Affairs Agency, Government of Japan, \u201cWashing tag symbols (after November 30, 2016),\u201d http:\/\/www.caa.go.jp\/policies\/policy\/representation\/household_goods\/guide\/wash_01.html, 2018 (in Japanese)."},{"key":"26","doi-asserted-by":"publisher","unstructured":"[27] J.G. Snodgrass and M. Vanderwart, \u201cA standardized set of 260 pictures: Norms for name agreement, image agreement, familiarity, and visual complexity,\u201d Journal of Experimental Psychology: Human Learning and Memory, vol.6, no.2, pp.174-215, March 1980. 10.1037\/\/0278-7393.6.2.174","DOI":"10.1037\/\/0278-7393.6.2.174"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/12\/E102.D_2018EDP7353\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,7]],"date-time":"2019-12-07T03:31:06Z","timestamp":1575689466000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E102.D\/12\/E102.D_2018EDP7353\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,1]]},"references-count":26,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2018edp7353","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,1]]}}}