{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T15:37:06Z","timestamp":1777131426951,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,5,1]],"date-time":"1988-05-01T00:00:00Z","timestamp":578448000000},"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":["Image and Vision Computing"],"published-print":{"date-parts":[[1988,5]]},"DOI":"10.1016\/0262-8856(88)90008-x","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:31:39Z","timestamp":1060306299000},"page":"129-136","source":"Crossref","is-referenced-by-count":6,"title":["Matching Canny edgels to compute the principal components of optic flow"],"prefix":"10.1016","volume":"6","author":[{"given":"D.A.","family":"Castelow","sequence":"first","affiliation":[]},{"given":"D.W.","family":"Murray","sequence":"additional","affiliation":[]},{"given":"G.L.","family":"Scott","sequence":"additional","affiliation":[]},{"given":"B.F.","family":"Buxton","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"No 2","key":"10.1016\/0262-8856(88)90008-X_BIB1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0262-8856(88)90006-6","article-title":"From an image sequence to a recognized polyhedral object","volume":"Vol 6","author":"Murray","year":"1988","journal-title":"Image Vision Comput."},{"key":"10.1016\/0262-8856(88)90008-X_BIB2","article-title":"Dff \u2014 depth from optic flow","author":"Murray","year":"1987"},{"key":"10.1016\/0262-8856(88)90008-X_BIB3","article-title":"Edgeprune \u2014 edge interpretation tree pruner","author":"Murray","year":"1987"},{"key":"10.1016\/0262-8856(88)90008-X_BIB4","article-title":"Using the orientation of fragmentary 3D edge segments for polyhedral object recognition","author":"Murray","year":"1986","journal-title":"Int. J. Comput. Vision"},{"key":"10.1016\/0262-8856(88)90008-X_BIB5","series-title":"Canny \u2014 an implementation of the Canny edge detector","volume":"Vol AIVRU 014","year":"1985"},{"key":"10.1016\/0262-8856(88)90008-X_BIB6","article-title":"Icanny \u2014 integer arithmetic Canny edge detector","author":"Ruff","year":"1987"},{"key":"10.1016\/0262-8856(88)90008-X_BIB7","article-title":"Finding lines and edges in images","author":"Canny","year":"1983"},{"issue":"No 6","key":"10.1016\/0262-8856(88)90008-X_BIB8","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1109\/TPAMI.1986.4767851","article-title":"A computational approach to edge detection","volume":"Vol 8","author":"Canny","year":"1986","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/0262-8856(88)90008-X_BIB9","unstructured":"\u2018Hyster \u2014 edge thresholding with hysteresis\u2019 in GDB user documentation, Release 1.0, Vol AIVRU 014 AI Vision Research Unit, University of Sheffield, UK"},{"key":"10.1016\/0262-8856(88)90008-X_BIB10","article-title":"Mcs3 \u2014 a method for computing optic flow from Canny edgels","author":"Castelow","year":"1987"},{"issue":"No 2","key":"10.1016\/0262-8856(88)90008-X_BIB11","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0262-8856(87)90029-1","article-title":"\u2018Four-line\u2019 method of locally estimating optic flow","volume":"Vol 5","author":"Scott","year":"1987","journal-title":"Image Vision Comput."},{"key":"10.1016\/0262-8856(88)90008-X_BIB12","series-title":"Computer vision","author":"Ballard","year":"1982"},{"issue":"No 2","key":"10.1016\/0262-8856(88)90008-X_BIB13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0167-8655(86)90031-0","article-title":"On the use of relaxation labelling in the correspondence problem","volume":"Vol 4","author":"Ibison","year":"1986","journal-title":"Pattern Recogn. Lett."},{"issue":"No 4","key":"10.1016\/0262-8856(88)90008-X_BIB14","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1068\/p140449","article-title":"PMF \u2014 a stereo correspondence algorithm using a disparity gradient limit","volume":"Vol 14","author":"Pollard","year":"1985","journal-title":"Perception"},{"issue":"No 4","key":"10.1016\/0262-8856(88)90008-X_BIB15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0262-8856(85)90005-8","article-title":"Binocular stereo algorithm based on the disparity-gradient limit and using optimization theory","volume":"Vol 3","author":"Lloyd","year":"1985","journal-title":"Image Vision Comput."},{"key":"10.1016\/0262-8856(88)90008-X_BIB16","article-title":"WINSOM user's guide","author":"Quarendon","year":"1984"},{"key":"10.1016\/0262-8856(88)90008-X_BIB17","series-title":"Proc. ECAI-84: Advances in Artificial Intelligence Elsevier","first-page":"631","article-title":"3D solutions to the aperture problem","author":"Buxton","year":"1984"}],"container-title":["Image and Vision Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:026288568890008X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:026288568890008X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T05:23:57Z","timestamp":1552627437000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/026288568890008X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["026288568890008X"],"URL":"https:\/\/doi.org\/10.1016\/0262-8856(88)90008-x","relation":{},"ISSN":["0262-8856"],"issn-type":[{"value":"0262-8856","type":"print"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}