By Topic

IEE Proceedings E - Computers and Digital Techniques

Issue 2 • Mar 1991

Filter Results

Displaying Results 1 - 6 of 6
  • Image registration using an image graph and its application to map matching

    Publication Year: 1991, Page(s):79 - 84
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (440 KB)

    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 g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hypercube concurrent processor implementation of a position invariant object classifier

    Publication Year: 1991, Page(s):73 - 78
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (444 KB)

    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 techniques 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 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm for generating optimal tests for exclusive-OR networks

    Publication Year: 1991, Page(s):93 - 96
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (396 KB)

    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 2" unique input combinations are required to test an n-input (n>or=2) exclusive-OR gate. The algorithm requires no lookup tables. The method is suitable for automation but ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on systematic procedure for test generation of PAL based circuits

    Publication Year: 1991, Page(s):106 - 108
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (188 KB)

    Comments on the test generation algorithm 1 given in a previous paper (see ibid., vol.136, no.2, p.142-9 (1989)), for single S-fault detection are presented. It is shown that the test vectors belonging to the test set generated by algorithm 1 can not detect certain faults. To generate a test set T, detect all single faults in a given PAL modification to the algorithm 1 is suggested. Furthermore, i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation of Reed-Muller expansions of incompletely specified Boolean functions from reduced representations

    Publication Year: 1991, Page(s):85 - 92
    Cited by:  Papers (13)
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (588 KB)

    Reed-Muller canonical networks are known to be easily testable implementations of logical functions. The authors present a procedure to synthesise minimal 0th polarity Reed-Muller networks for incompletely specified Boolean functions. They also present a procedure that uses reduced representations of Boolean functions in the form of logical covers to synthesise Reed-Muller networks. The latter pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heuristic search approach to shape matching in image sequences

    Publication Year: 1991, Page(s):97 - 105
    IEEE is not the copyright holder of this material | Click to expandAbstract | PDF file iconPDF (824 KB)

    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 heuris... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.