This study is concerned with connectivity in regular lattices and random mosaics with applications to image modeling by mosaic models. It presents a solution to the hitherto unsolved problems of predicting the expected number of connected components in square, hexagonal and triangular lattices, using a one dimensional growth approach that can also be used for other lattices. It also investigates the relationship between connectivity in regular lattices and random mosaics. Experimental results are presented for both cases.
|Original language||English (US)|
|Title of host publication||Proc of the Int Jt Conf on Pattern Recognition, 4th; Kyoto, Jpn; 7 November 1978 through 10 November 1978|
|Number of pages||6|
|State||Published - Jan 1 1979|
ASJC Scopus subject areas