{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:06:30Z","timestamp":1725469590722},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1109\/icip.2018.8451563","type":"proceedings-article","created":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T17:59:22Z","timestamp":1536343162000},"page":"664-668","source":"Crossref","is-referenced-by-count":0,"title":["Sketch Based Reduced Memory Hough Transform"],"prefix":"10.1109","author":[{"given":"Levi","family":"Offen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Werman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1006\/ciun.1993.1009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLC.2006.258739"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(91)90037-Y"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2007.09.006"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLC.2008.4620920"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633056"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/872785.872787"},{"key":"ref17","first-page":"1093","article-title":"Sketch Algorithms for Estimating Point Queries in NLP","author":"goyal","year":"2012","journal-title":"EMNLP-CoNLL ' ‘12"},{"key":"ref18","first-page":"346","article-title":"Approx-imate Frequency Counts over Data Streams","author":"singh manku","year":"2002","journal-title":"VLDB ‘05"},{"journal-title":"Approximate Scalable Bounded Space Sketch for Large Data NLP","year":"2011","author":"daum","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00400-6"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1562764.1562789"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.08.027"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-009-0267-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(81)90009-1"},{"journal-title":"A method and means for recognizing complex patterns","year":"1962","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(91)90073-E"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","article-title":"Finding Frequent Items in Data Streams","author":"charikar","year":"2002","journal-title":"Lecture Notes in Computer Science"}],"event":{"name":"2018 25th IEEE International Conference on Image Processing (ICIP)","start":{"date-parts":[[2018,10,7]]},"location":"Athens","end":{"date-parts":[[2018,10,10]]}},"container-title":["2018 25th IEEE International Conference on Image Processing (ICIP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8436606\/8451009\/08451563.pdf?arnumber=8451563","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T09:22:21Z","timestamp":1643188941000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8451563\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/icip.2018.8451563","relation":{},"subject":[],"published":{"date-parts":[[2018,10]]}}}