Efficient representation and transformation of image data on the connection machine system

1992 
We discuss the transformation of image data from one level of representation to another using the data parallel programming model of the Connection Machine System.1 Emphasis is placed on maintaining locality of reference in order to take advantage of fast, local communications. Image pyramids illustrate the transformation of image-based representations. We review pointer jumping as a transformation from the image to a sequence-based representation, the primary representation of data outside of the image plane. Using communication primitives, especially segmented scans, we review utilities for representing and manipulating such sequences. We then compare several algorithms for matching and evidence accumulation. The techniques emphasize the use of sorting and sparse representations of space, in order to limit the computational requirements of high level vision.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    16
    References
    1
    Citations
    NaN
    KQI
    []