{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:40:27Z","timestamp":1649101227660},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2001,11]]},"abstract":"<jats:p> A partially occluded scene in an image consists of a number of objects that are partially obstructed by others. By validating a partially occluded image one aims to generate a sequence of concatenated and possibly overlapping objects that corresponds to the input image. <\/jats:p><jats:p> This is a theoretical study of partially occluded strings (considered as one-dimensional images) allowing for the presence of errors in each occluded object appearing in the input. Using the unit cost edit distance as our measure of errors, for some small integer k \u2265 0, we present a sequential algorithm for validating a k-approximate one-dimensional image x of length n over a dictionary [Formula: see text] of m objects each having equal length \u03c4 in O(nd) time where d = m\u03c4 is the size of the dictionary. <\/jats:p>","DOI":"10.1142\/s0218001401001313","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T07:02:01Z","timestamp":1027753321000},"page":"1129-1142","source":"Crossref","is-referenced-by-count":1,"title":["DECOMPOSITION OF PARTIALLY OCCLUDED STRINGS IN THE PRESENCE OF ERRORS"],"prefix":"10.1142","volume":"15","author":[{"given":"COSTAS S.","family":"ILIOPOULOS","sequence":"first","affiliation":[{"name":"Department of Computer Science, King's College London, Strand, London WC2R 2LS, UK"},{"name":"School of Computing, Curtin University of Technology, Perth, WA 6102, Australia"}]},{"given":"JAMES F.","family":"REID","sequence":"additional","affiliation":[{"name":"Department of Computer Science, King's College London, Strand, London WC2R 2LS, UK"},{"name":"LNCIB, AREA Science Park, Padriciano 99, Trieste 34012, Italy"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90056-N"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(94)90047-7"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1007\/s100440050009"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01679683"},{"key":"p_5","first-page":"77","author":"Hoff K.","year":"1997","journal-title":"Comput. Graph. Proc., Annual Conference Series, Sigraph"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1007\/BF00119844"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(99)00114-3"},{"key":"p_9","author":"Iliopoulos C. S.","journal-title":"J. Automata, Languages and Combinatorics, to appear."},{"key":"p_10","first-page":"511","author":"Moore D. W. G.","year":"1994","journal-title":"Proc. 5th ACM-SIAM Symp. Discrete Algorithms"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001498000373"},{"key":"p_42","first-page":"1996","year":"1994","journal-title":"UK in"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001401001313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:23:02Z","timestamp":1565130182000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001401001313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":11,"journal-issue":{"issue":"07","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2001,11]]}},"alternative-id":["10.1142\/S0218001401001313"],"URL":"https:\/\/doi.org\/10.1142\/s0218001401001313","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}