{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:39:40Z","timestamp":1649191180042},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[1994,4]]},"abstract":"<jats:p> The two-dimensional mesh computer architecture has proven to be an appropriate means to apply parallel computation to problems in image processing. However, this is most often done using local-neighbourhood operations to accomplish image filtering and morphological transformations. The discovery of structures in an image such as repetitions and symmetries is another form of visual analysis, and yet relatively little has been done to apply mesh computers to this problem. In this paper, we apply the primitive operations of prefix scanning and sorting to efficiently implement a repetition finding algorithm for arrays. The computational complexity of the algorithm on a n\u00d7n mesh is O(n log k) where k is the width of the largest repeated block in the array. The algorithm was implemented on a MasPar MP-1 computer. We describe variations of the algorithm for solving several related problems including the detection of partial symmetries in an image and repetitions in images modulo pixel-value transformations. <\/jats:p>","DOI":"10.1142\/s0218001494000231","type":"journal-article","created":{"date-parts":[[2004,11,19]],"date-time":"2004-11-19T02:21:13Z","timestamp":1100830873000},"page":"465-483","source":"Crossref","is-referenced-by-count":0,"title":["MESH ALGORITHMS FOR FINDING REPETITIONS AND PARTIAL SYMMETRIES IN ARRAYS"],"prefix":"10.1142","volume":"08","author":[{"given":"STEVEN L.","family":"TANIMOTO","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering FR-35, University of Washington, Seattle, WA 98195, USA"}]},{"given":"RUSS","family":"MILLER","sequence":"additional","affiliation":[{"name":"Department of Computer Science State University of New York at Buffalo Buffalo, NY 14260, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001494000231","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T02:12:55Z","timestamp":1565143975000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001494000231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":0,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[1994,4]]}},"alternative-id":["10.1142\/S0218001494000231"],"URL":"https:\/\/doi.org\/10.1142\/s0218001494000231","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}