A new class of parallel algorithms for finding connected components on machines with bit-vector operations

1994 ◽  
Vol 76 (3-4) ◽  
pp. 177-195
Author(s):  
Y. Liang ◽  
S.K. Dhall ◽  
S. Lakshmivarahan
1998 ◽  
Vol 30 (01) ◽  
pp. 1-35 ◽  
Author(s):  
Jesper Møller ◽  
Rasmus Plenge Waagepetersen

A new class of Gibbsian models with potentials associated with the connected components or homogeneous parts of images is introduced. For these models the neighbourhood of a pixel is not fixed as for Markov random fields, but is given by the components which are adjacent to the pixel. The relationship to Markov random fields and marked point processes is explored and spatial Markov properties are established. Extensions to infinite lattices are also studied, and statistical inference problems including geostatistical applications and statistical image analysis are discussed. Finally, simulation studies are presented which show that the models may be appropriate for a variety of interesting patterns, including images exhibiting intermediate degrees of spatial continuity and images of objects against background.


Sign in / Sign up

Export Citation Format

Share Document