Multiple Resolution Skeletons

This paper presents a new algorithm to compute skeletons of noisy images of objects which can be described as ``amorphous blobs.'' Such a requirement arose from our research to obtain a better understanding of the role of the pseudopod in leukocyte locomotion. It involves the modeling and detection of pseudopods which are by their nature nonrigid bodies appearing on the cell's surface membrane. By computing skeletons at different resolutions, a filtered version can be produced without violating the constraints imposed by the semantic knowledge of pseudopod morphology. The filtered version incorporates all the significant ``events'' that occur at the different resolutions. The resolution at which the shape is examined is related to the degree of smoothing, in that the lower the resolution gets, the higher the degree of smoothing. Skeleton branches that persist over several scales arise from convexities that are locally as well as globally significant. Their stability is related to their perceptual significance. Our approach is to combine an initial region centered description (skeleton) with a boundary analysis executed at different resolutions. Having computed the skeleton at different scales, we then use those computed at the lower resolutions as a measure of how global the underlying convexity is. Clearly the skeletons computed at higher resolutions represent the exact location and orientation of the underlying convexities.

[1]  Theodosios Pavlidis,et al.  Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition , 1975, IEEE Transactions on Computers.

[2]  Larry S. Davis,et al.  A Corner-Finding Algorithm for Chain-Coded Curves , 1977, IEEE Transactions on Computers.

[3]  F. Grinnell,et al.  Migration of human neutrophils in hydrated collagen lattices. , 1982, Journal of cell science.

[4]  M E Miller,et al.  Movement of human polymorphonuclear leukocytes: a videotape analysis. , 1982, Journal of the Reticuloendothelial Society.

[5]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[6]  King-Sun Fu,et al.  Shape Discrimination Using Fourier Descriptors , 1977, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  G Gallus,et al.  Improved computer chromosome analysis incorporating preprocessing and boundary analysis , 1970, Physics in medicine and biology.

[8]  M. Brady,et al.  Smoothed Local Symmetries and Their Implementation , 1984 .

[9]  Martin D. Levine,et al.  Understanding blood cell motion , 1982, Comput. Graph. Image Process..

[10]  P. Danielsson Euclidean distance mapping , 1980 .

[11]  Azriel Rosenfeld,et al.  Angle Detection on Digital Curves , 1973, IEEE Transactions on Computers.

[12]  Michael Brady,et al.  The Curvature Primal Sketch , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  T. Pavlidis A thinning algorithm for discrete binary images , 1980 .

[14]  HARRY BLUM,et al.  Shape description using weighted symmetric axis features , 1978, Pattern Recognit..

[15]  C. J. Hilditch,et al.  Linear Skeletons From Square Cupboards , 1969 .

[16]  Martin D. Levine,et al.  Non-rigid body motion , 1986 .

[17]  Andrew P. Witkin,et al.  Scale-space filtering: A new approach to multi-scale description , 1984, ICASSP.

[18]  Theodosios Pavlidis,et al.  A review of algorithms for shape analysis , 1978 .

[19]  Robert C. Bolles,et al.  Perceptual Organization and the Curve Partitioning Problem , 1983, IJCAI.

[20]  Andrew P. Witkin,et al.  Uniqueness of the Gaussian Kernel for Scale-Space Filtering , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  M. Levine,et al.  Computer Assisted Analyses of Cell Locomotion and Chemotaxis , 1986 .

[22]  T. Poggio Vision by man and machine. , 1984, Scientific American.

[23]  Andrew P. Witkin,et al.  Scale-Space Filtering , 1983, IJCAI.

[24]  Ugo Montanari,et al.  A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance , 1968, J. ACM.

[25]  Alan L. Yuille,et al.  Scaling Theorems for Zero Crossings , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  Carlo Arcelli,et al.  Pattern thinning by contour tracing , 1981 .