Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Content-addressable memories for storing and processing recursively subdivided images and trees

Content-addressable memories for storing and processing recursively subdivided images and trees

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published

Content-addressable memories may be arranged to store three-state information in a reliable and efficient manner. They can be applied to the representation of tree structures used in some graphic display applications, such as quadtrees and octrees, avoiding the need for pointers, and speeding up many operations. Examples are given for picture updating and scan conversion.

Inspec keywords: computer graphics; computerised picture processing; content-addressable storage; trees (mathematics)

Other keywords: picture processing; octrees; trees; three-state information; graphic display; recursively subdivided images; image processing; picture updating; quadtrees; content addressable memories; scan conversion

Subjects: Memory circuits; Pattern recognition; Combinatorial mathematics; Optical information, image and video signal processing; Semiconductor storage; Combinatorial mathematics

References

    1. 1)
      • D.E. Knuth . (1968) , The art of computer programming. 1: fundamental algorithms.
    2. 2)
      • G.MCC. Haworth . The CAFS system today and tomorrow. ICL Tech. J. , 365 - 392
    3. 3)
      • J.V. Oldfield . Logic programs and an experimental architecture for their execution. IEE Proc. E, Comput. & Digital Tech. , 163 - 167
    4. 4)
      • Wade, J.P., Sodini, C.G.: `Dynamic cross-coupled bitline content addressable memory cell for high density arrays', Technical digest, IEEE international electron devices meeting, 1–4 December 1985, p. 284–287.
    5. 5)
      • M.A. Oliver , N.E. Wiseman . Operations on quadtree leaves and related image areas. Comput. J. , 375 - 380
    6. 6)
      • I. Gargantini . An effective way to represent quadtrees. Commun. ACM , 905 - 910
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19870191
Loading

Related content

content/journals/10.1049/el_19870191
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address