← Back to Patent Explorer
US4901360A Expired / Lapsed US ⏱️ 0.0 years remaining

Gated architecture for computer vision machine

Assignee: Raytheon Co
•
Filing: 1987-10-23
•
Granted: 1990-02-13
•
Expires: 2007-10-23
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A computer architecture 10 for performing iconic and symbolic operations on image data is disclosed. Three levels of processing elements (CAAPP, ICP, GPPA) are disclosed. The processing elements in the lowest level (CAAPP) are provided with a plurality of controllable gates (N, S, E, W, H, V, NW, NE) that are used to selectively connect together processing elements in that level. In such manner, certain algorithms such as the minimum spanning tree algorithm can be efficiently performed.

Inventors

  • 👤 David B. Shu
  • 👤 James G. Nash

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 21:55
CPC Classifications
G; G06; G06T; G06T1/00; G06T1/20

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 212 words
A computer architecture for performing iconic and symbolic operations, said architecture comprising: an array of substantially identical processing elements (PE) arranged in horizontal rows and vertical columns, each PE having electrically conductive lines running in the North, South, East and West directions connected to neighboring PEs in those directions, respectively; the North and South lines being connected together to form a vertical line, with the East and West lines being connected together to form a horizontal line; each PE having a node with a programmable voltage level thereon representing a given logical state of the PE, the array being arranged so that said logical state on the node can be simultaneously shared between PEs which are connected together; a vertical gate connected between the vertical line and the node in each PE to thereby permit selective connection of PE nodes in a column together; a horizontal gate connected between the horizontal line and the node in each PE to thereby permit selective connection of PE nodes in a row together; control means for opening and closing the gates; and memory means in each PE coupled to said node for storing a some/none result related to whether some or none of the nodes of the connected PEs are in a given logical state.
Claim 2
Dependent Claim 212 words
A computer architecture for performing iconic and symbolic operations, said architecture comprising: an array of substantially identical processing elements (PE) arranged in horizontal rows and vertical columns, each PE having electrically conductive lines running in the North, South, East and West directions connected to neighboring PEs in those directions, respectively; the North and South lines being connected together to form a vertical line, with the East and West lines being connected together to form a horizontal line; each PE having a node with a programmable voltage level thereon representing a given logical state of the PE, the array being arranged so that said logical state on the node can be simultaneously shared between PEs which are connected together; a vertical gate connected between the vertical line and the node in each PE to thereby permit selective connection of PE nodes in a column together; a horizontal gate connected between the horizontal line and the node in each PE to thereby permit selective connection of PE nodes in a row together; control means for opening and closing the gates; and memory means in each PE coupled to said node for storing a some/none result related to whether some or none of the nodes of the connected PEs are in a given logical state.
Claim 3
Dependent Claim 28 words
The architecture of claim 1 which further comprises a West gate in the West line, with the control means being adapted to open and close said West gate.
Claim 4
Dependent Claim 28 words
The architecture of claim 1 which further comprises: an East gate in the East line, with the control means being adapted to open and close said East gate.
Claim 5
Dependent Claim 28 words
The architecture of claim 1 which further comprises: a North gate in the North line, with the control means being adapted to open and close said North gate.
Claim 6
Dependent Claim 28 words
The architecture of claim 1 which further comprises: a South gate in the South line, with the control means being adapted to open and close said South gate.
Claim 7
Dependent Claim 32 words
The architecture of claim 1 which further comprises: a Northwest gate between the North line and the West line, with the control means being adapted to open and close said Northwest gate.
Claim 8
Dependent Claim 32 words
The architecture of claim 1 which further comprises: a Northeast gate between the North line and the East line, with the control means being adapted to open and close said Northeast gate.
Claim 9
Dependent Claim 37 words
The architecture of claim 1 wherein each PE includes: a programmable digital memory; and a multi-bit control register coupled to the memory, each bit in the control register determining whether a particular gate is opened or closed.
Claim 10
Dependent Claim 19 words
The architecture of claim 1 wherein each processing element is a bit serial processor including an arithmetic logic unit.
Claim 11
Dependent Claim 275 words
An image understanding machine comprising: a first level of image processing elements for operating on an image matrix on a pixel per processing element basis; a second level of processing elements associated with a group of first level processing elements; a third level of processing elements associated with a given number of second level processing elements; a host computer communicating with at least the third level processing element; and said first level of processing elements being an N×N array of bit serial processors including an arithmetic logic unit and a multi-bit memory, each PE having electrically conductive lines running in the North, South, East and West directions connected to neighboring first level PEs in those directions, respectively; the North and South lines being connected together to form a vertical line, with the East and West lines being connected together to form a horizontal line; a node having a programmable voltage level thereon, a vertical gate connected between the vertical line and the node, a horizontal gate connected between the horizontal line and the node, a North gate in the North line, an East gate in the East line, a South gate in the South line, a West gate in the West line, a Northeast gate connected between the North line and the East line, a Northwest gate connected between the North line and the West line; control means for controlling the opening and closing of said gates; and a some/none line coupled between the node and the memory whereby the state of the some/none line is a function of the voltage level on the nodes of those PEs which are connected together by said gate.
Claim 12
Dependent Claim 275 words
An image understanding machine comprising: a first level of image processing elements for operating on an image matrix on a pixel per processing element basis; a second level of processing elements associated with a group of first level processing elements; a third level of processing elements associated with a given number of second level processing elements; a host computer communicating with at least the third level processing element; and said first level of processing elements being an N×N array of bit serial processors including an arithmetic logic unit and a multi-bit memory, each PE having electrically conductive lines running in the North, South, East and West directions connected to neighboring first level PEs in those directions, respectively; the North and South lines being connected together to form a vertical line, with the East and West lines being connected together to form a horizontal line; a node having a programmable voltage level thereon, a vertical gate connected between the vertical line and the node, a horizontal gate connected between the horizontal line and the node, a North gate in the North line, an East gate in the East line, a South gate in the South line, a West gate in the West line, a Northeast gate connected between the North line and the East line, a Northwest gate connected between the North line and the West line; control means for controlling the opening and closing of said gates; and a some/none line coupled between the node and the memory whereby the state of the some/none line is a function of the voltage level on the nodes of those PEs which are connected together by said gate.
Claim 13
Dependent Claim 21 words
The machine of claim 11 wherein each PE includes register means coupled to the node for controlling the voltage level thereon.
Claim 14
Dependent Claim 31 words
The machine of claim 12 wherein said control means comprises a multi-bit register, with the states of the bits of each register controlling the opening and closing of an associated gate.

References Cited (Backward Citations)

US4309691A Cited
US4215401A Cited
US4224600A Cited
US4384273A Cited
US4574394A Cited
US4622632A Cited
US4601055A Cited
US4783738A Cited
US4809347A Cited
US4809346A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1993-02-12 1993-08-14 1994-02-13 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1997-02-12 1997-08-14 1998-02-13 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2001-02-12 2001-08-14 2002-02-13 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag