Home
>
Journals & magazines
>
IEE Proceedings E (Computers and Digital Techniqu...
>
Volume 138
Issue 2
IEE Proceedings E (Computers and Digital Techniques)
Volume 138, Issue 2, March 1991
Volumes & issues:
Volume 138, Issue 2
March 1991
Hypercube concurrent processor implementation of a position invariant object classifier
- Author(s): M. Celenk and S.R. Datari
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 138, Issue 2, p. 73 –78
- DOI: 10.1049/ip-e.1991.0009
- Type: Article
- + Show details - Hide details
-
p.
73
–78
(6)
A position-invariant fast object classification scheme is described. The grey-level image of objects is converted to binary form and a parallel region growing technique is employed to detect objects. A 2-D fast Fourier transform (FFT) is applied to each object region after translating the origin of the image co-ordinate system to the object centre and aligning the image co-ordinate axes with the object principal axes. The first five components from the principal lobe of the Fourier spectrum of each object are selected as characteristic features for minimum-distance object classification. For time efficiency, region growing and 2-D FFT computations were performed on a 16-node hypercube processor.
Image registration using an image graph and its application to map matching
- Author(s): K. Fukunaga ; H. Murata ; T. Asano ; M. Izumi
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 138, Issue 2, p. 79 –84
- DOI: 10.1049/ip-e.1991.0010
- Type: Article
- + Show details - Hide details
-
p.
79
–84
(6)
A representation of line images by an algebraic expression is proposed and image registration between two maps by use of matching of the line segments is discussed using this expression. In this method, input map images are transformed into line images in which line segments are expressed by piecewise linear lines using unit vectors. Next, the structure of the line images is represented by image graphs. The matching process makes use of a degree of the structural similarity between nodes using the image graphs. The results of the computer simulations shows that our approach is insensitive to scaling, rotation and grey level modification of the map image and effective to the matching of the real map images.
Computation of Reed-Muller expansions of incompletely specified boolean functions from reduced representations
- Author(s): D. Varma and E.A. Trachtenberg
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 138, Issue 2, p. 85 –92
- DOI: 10.1049/ip-e.1991.0011
- Type: Article
- + Show details - Hide details
-
p.
85
–92
(8)
Reed-Muller canonical networks are known to be easily testable implementations of logical functions. We present a procedure to synthesise minimal 0th polarity Reed-Muller networks for incompletely specified Boolean functions. We also present a procedure that uses reduced representations of Boolean functions in the form of logical covers to synthesise Reed-Muller networks. The latter procedure avoids exponentially long minterm representations, and hence alleviates some of the difficulties in applying spectral synthesis procedures to large Boolean functions. Both of these procedures are suitable for automation.
Algorithm for generating optimal tests for exclusive-or networks
- Author(s): W.H. Debany ; C.R.P. Hartmann ; T.J. Snethen
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 138, Issue 2, p. 93 –96
- DOI: 10.1049/ip-e.1991.0012
- Type: Article
- + Show details - Hide details
-
p.
93
–96
(4)
An algorithm is presented for generating minimal-cardinality test sets for logic networks composed of exclusive-OR gates arranged in a structure that can be described in the form of a connected acyclic graph. It is assumed that 2n unique input combinations are required to test an n-input (n ≥ 2) exclusive-OR gate. The algorithm requires no lookup tables. The method is suitable for automation but can also be performed manually even for large networks.
Heuristic search approach to shape matching in image sequences
- Author(s): S. Chaudhury ; S. Subramanian ; G. Parthasarathy
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 138, Issue 2, p. 97 –105
- DOI: 10.1049/ip-e.1991.0013
- Type: Article
- + Show details - Hide details
-
p.
97
–105
(9)
The problem of detecting correspondences between object contours belonging to successive image frames of a dynamic scene is addressed. The object contours are represented using concave, convex and straight line segments which are extracted after smoothing the contour with a Gaussian kernel. The matching problem is tackled using heuristic search with a state space formulation. An admissible heuristic function is designed for guiding the search. Experimental results are presented to demonstrate the capabilities of the method.
Comments on “Systematic procedure for test generation of PAL based circuits”
- Author(s): A.S. Nale
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 138, Issue 2, p. 106 –108
- DOI: 10.1049/ip-e.1991.0014
- Type: Article
- + Show details - Hide details
-
p.
106
–108
(3)
Most viewed content for this Journal
Article
content/journals/ip-e
Journal
5
Most cited content for this Journal
We currently have no most cited data available for this content.
