A New Method for Efficiently Generating Planar Graph Visibility Representations

Investigations which require electron microscope examination of a few specific areas of non-homogeneous tissues make random sampling of small blocks an inefficient and unrewarding procedure. Therefore, several investigators have devised methods which allow obtaining sample blocks for electron microscopy from region of tissue previously identified by light microscopy of present here techniques which make possible: 1) sampling tissue for electron microscopy from selected areas previously identified by light microscopy of relatively large pieces of tissue; 2) dehydration and embedding large numbers of individually identified blocks while keeping each one separate; 3) a new method of maintaining specific orientation of blocks during embedding; 4) special light microscopic staining or fluorescent procedures and electron microscopy on immediately adjacent small areas of tissue.

Download Full-text

Computational Micrograph Registration with Sieve Processes

Proceedings, annual meeting, Electron Microscopy Society of America ◽

10.1017/s0424820100164660 ◽

1996 ◽

Vol 54 ◽

pp. 440-441

Author(s):

P.J. Phillips ◽

J. Huang ◽

S. M. Dunn

Keyword(s):

Planar Graph ◽

Efficient Algorithm ◽

Spatial Organization ◽

Spatial Arrangement ◽

Stereo Image ◽

Image Model ◽

Geometric Invariants ◽

Point Set

In this paper we present an efficient algorithm for automatically finding the correspondence between pairs of stereo micrographs, the key step in forming a stereo image. The computation burden in this problem is solving for the optimal mapping and transformation between the two micrographs. In this paper, we present a sieve algorithm for efficiently estimating the transformation and correspondence.In a sieve algorithm, a sequence of stages gradually reduce the number of transformations and correspondences that need to be examined, i.e., the analogy of sieving through the set of mappings with gradually finer meshes until the answer is found. The set of sieves is derived from an image model, here a planar graph that encodes the spatial organization of the features. In the sieve algorithm, the graph represents the spatial arrangement of objects in the image. The algorithm for finding the correspondence restricts its attention to the graph, with the correspondence being found by a combination of graph matchings, point set matching and geometric invariants.

Download Full-text