乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T04:12:03Z","timestamp":1742703123846,"version":"3.40.2"},"reference-count":21,"publisher":"Institution of Engineering and Technology (IET)","issue":"5","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61272218","61021062"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2010CB327903"],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2100219038"],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IET Computer Vision"],"published-print":{"date-parts":[[2013,10]]},"abstract":"A stroke segmentation method named quick penalty\u2010based dynamic programming is proposed for splitting a sketchy stroke into several regular primitive shapes, such as line segments and elliptical arcs. The authors extend the dynamic programming framework with a customisable penalty function, which measures the correctness of splitting a stroke at a particular point. With the help of the penalty function, the proposed dynamic programming framework can finish the stroke segmentation process without any prior knowledge of the number and\/or the type of segments contained in the sketchy stroke. Its response time is sufficiently short for online applications, even for long strokes. Experiments show that the proposed method is robust for strokes with arbitrary shape and size.<\/jats:p>","DOI":"10.1049\/iet-cvi.2012.0296","type":"journal-article","created":{"date-parts":[[2013,8,20]],"date-time":"2013-08-20T01:14:22Z","timestamp":1376961262000},"page":"311-319","source":"Crossref","is-referenced-by-count":1,"title":["Online stroke segmentation by quick penalty\u2010based dynamic programming"],"prefix":"10.1049","volume":"7","author":[{"given":"Liu","family":"Wenyin","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology Shanghai University of Electric Power Shanghai People's Republic of China"},{"name":"State Key Laboratory of Novel Software Technology Nanjing University Nanjing 210046 People's Republic of China"}]},{"given":"Tong","family":"Lu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Novel Software Technology Nanjing University Nanjing 210046 People's Republic of China"}]},{"given":"Yu","family":"Yajie","sequence":"additional","affiliation":[{"name":"Department of Computer Science City University of Hong Kong HKSAR People's Republic of China"}]},{"given":"Shuang","family":"Liang","sequence":"additional","affiliation":[{"name":"School of Software Engineering Tongji University Shanghai 210804 People's Republic of China"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science City University of Hong Kong HKSAR People's Republic of China"}]}],"member":"265","published-online":{"date-parts":[[2013,10]]},"reference":[{"key":"e_1_2_10_2_2","doi-asserted-by":"crossref","unstructured":"Alvarado C. Davis R.: \u2018SketchREAD: a multi\u2010domain sketch recognition engine\u2019.ACM SIGGRAPH 2007 Courses: 34 2007","DOI":"10.1145\/1281500.1281545"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024168"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13728-0_12"},{"key":"e_1_2_10_5_2","doi-asserted-by":"crossref","unstructured":"Dachselt R. Frisch M. Decker E.: \u2018Enhancing UML sketch tools with digital pens and paper\u2019.Proc. Fourth ACM Symp. on Software Visualization 2008 pp.203\u2013204","DOI":"10.1145\/1409720.1409756"},{"key":"e_1_2_10_6_2","doi-asserted-by":"crossref","unstructured":"Shah D. Schneider J. Campbell M.: \u2018A robust sketch interface for natural robot control\u2019.IEEE\/RSJ Int. Conf. on Intelligent Robots and Systems 2010 pp.4458\u20134463","DOI":"10.1109\/IROS.2010.5649345"},{"key":"e_1_2_10_7_2","doi-asserted-by":"crossref","unstructured":"Yang Z. Guangshun S. Kai W.: \u2018A SVM\u2010HMM based online classifier for handwritten chemical symbols\u2019.20th Int. Conf. on Pattern Recognition 2010 pp.1888\u20131891","DOI":"10.1109\/ICPR.2010.465"},{"key":"e_1_2_10_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2008.09.013"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2005.10.006"},{"key":"e_1_2_10_10_2","doi-asserted-by":"crossref","unstructured":"Liu Y. Yu Y.J. Liu W.Y.: \u2018Online segmentation of freehand stroke by dynamic programming\u2019.Proc. ICDAR 2005 pp.197\u2013201","DOI":"10.1109\/ICDAR.2005.180"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009188"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/T\u2010C.1972.223573"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/34.232079"},{"key":"e_1_2_10_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/34.31447"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0031\u20103203(02)00084\u20105"},{"key":"e_1_2_10_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2010.12.003"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467\u20108659.2012.03224.x"},{"key":"e_1_2_10_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2009.01.031"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167\u20108655(00)00104\u20105"},{"journal-title":"IEEE Comput. Graph. Appl.","article-title":"DPFrag: a trainable stroke fragmentation framework based on dynamic programming","author":"T\u00fcmen R.","key":"e_1_2_10_20_2"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/964442.964472"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/34.765658"}],"container-title":["IET Computer Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/iet-cvi.2012.0296","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1049\/iet-cvi.2012.0296","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/iet-cvi.2012.0296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:49:53Z","timestamp":1742636993000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/iet-cvi.2012.0296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["10.1049\/iet-cvi.2012.0296"],"URL":"https:\/\/doi.org\/10.1049\/iet-cvi.2012.0296","archive":["Portico"],"relation":{},"ISSN":["1751-9632","1751-9640"],"issn-type":[{"type":"print","value":"1751-9632"},{"type":"electronic","value":"1751-9640"}],"subject":[],"published":{"date-parts":[[2013,10]]}}}