{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T11:14:46Z","timestamp":1720523686205},"reference-count":9,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0167-8655(92)90121-f","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:46:52Z","timestamp":1056995212000},"page":"647-656","source":"Crossref","is-referenced-by-count":12,"title":["Edge linking by using causal neighborhood window"],"prefix":"10.1016","volume":"13","author":[{"given":"Ming","family":"Xie","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8655(92)90121-F_BIB1","series-title":"Computer Methods in Image Analysis","author":"Aggarwal","year":"1977"},{"key":"10.1016\/0167-8655(92)90121-F_BIB2","series-title":"Computer Vision","author":"Ballard","year":"1982"},{"key":"10.1016\/0167-8655(92)90121-F_BIB3","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0146-664X(81)90078-2","article-title":"A single-pass, chain generating algorithm for region boundaries","volume":"15","author":"Chakravarty","year":"1981","journal-title":"Computer Graphics and Image Processing"},{"key":"10.1016\/0167-8655(92)90121-F_BIB4","doi-asserted-by":"crossref","DOI":"10.1007\/BF00123164","article-title":"Using Canny's criteria to derive a recursively implemented optimal edge detector","author":"Deriche","year":"1987","journal-title":"Int. J. Computer Vision"},{"key":"10.1016\/0167-8655(92)90121-F_BIB5","series-title":"IEEE Workshop on Computer Vision","first-page":"228","article-title":"A real time parallel edge following in single pass","author":"Giraudon","year":"1987"},{"key":"10.1016\/0167-8655(92)90121-F_BIB6","series-title":"Fundamentals of Digital Image Processing","author":"Jain","year":"1989"},{"issue":"3","key":"10.1016\/0167-8655(92)90121-F_BIB7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/1049-9660(91)90019-L","article-title":"A contour tracing algorithm that preserves common boundaries between regions","volume":"53","author":"Liow","year":"1991","journal-title":"CVGIP: Image Understanding"},{"key":"10.1016\/0167-8655(92)90121-F_BIB8","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1117\/12.969730","article-title":"Edge linking by ellipsoidal clustering","volume":"1192","author":"Ramesh","year":"1989","journal-title":"SPIE Intelligent Robots and Computer Vision VIII: Algorithms and Techniques"},{"key":"10.1016\/0167-8655(92)90121-F_BIB9","article-title":"From edges to line segments: a robust algorithm","author":"Xie","year":"1988"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559290121F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559290121F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:53:22Z","timestamp":1552917202000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016786559290121F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":9,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["016786559290121F"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(92)90121-f","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}