{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T16:16:12Z","timestamp":1743264972216},"reference-count":7,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":[[1991,12]]},"DOI":"10.1016\/0167-8655(91)90073-u","type":"journal-article","created":{"date-parts":[[2004,9,10]],"date-time":"2004-09-10T13:21:56Z","timestamp":1094822516000},"page":"757-764","source":"Crossref","is-referenced-by-count":12,"title":["Optimal algorithms for extracting spatial regularity in images"],"prefix":"10.1016","volume":"12","author":[{"given":"Andrew B.","family":"Kahng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Robins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8655(91)90073-U_BIB1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0167-8655(90)90002-J","article-title":"A combinatorial Hough transform","volume":"11","author":"Ben-Tzvi","year":"1990","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"10.1016\/0167-8655(91)90073-U_BIB2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/361237.361242","article-title":"Use of the Hough transform to detect lines and curves in pictures","volume":"15","author":"Duda","year":"1972","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-8655(91)90073-U_BIB3","series-title":"Algorithms in Computational Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0167-8655(91)90073-U_BIB4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/0215024","article-title":"Constructing arrangements of lines and hyperplanes with applications","volume":"15","author":"Edelsbrunner","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8655(91)90073-U_BIB5","series-title":"Proc. ACM Symposium on Theory of Computing","first-page":"389","article-title":"Topologically sweeping an arrangement","author":"Edelsbrunner","year":"1986"},{"key":"10.1016\/0167-8655(91)90073-U_BIB6","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0167-8655(91)90073-U_BIB7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0734-189X(89)90036-4","article-title":"Hough transform for line recognition: complexity of evidence accumulation and cluster detection","volume":"46","author":"Risse","year":"1989","journal-title":"Computer Vision"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559190073U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559190073U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T01:20:36Z","timestamp":1549243236000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016786559190073U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":7,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["016786559190073U"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(91)90073-u","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}