Abstract
Two common problems in image analysis are described—the region-labeling problem and the clustering problem. Both are shown to be instances of a search-and-rename problem which can be solved in parallel by a system architecture inherently suitable for VLSI implementation. That architecture, a novel type of content-addressable memory, is described, and its application to search-and-rename problems is discussed. Copyright © 1982 by The Institute of Eletrical and Electronis Engineers, Inc.
Author supplied keywords
Cite
CITATION STYLE
Snyder, W. E., & Savage, C. D. (1982). Content-Addressable Read/Write Memories for Image Analysis. IEEE Transactions on Computers, C–31(10), 963–968. https://doi.org/10.1109/TC.1982.1675905
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.