Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Machine Graphics and Vision

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Estimating a vascular network growth using random graphs

Cha S. H., Gargano M. L., Chang S., Quintas L. V., Wahl E. M.

Machine Graphics and Vision

2008

Vol. 17, No. 1/2

91-103

Vascular networks develop by way of angiogenesis, a growth process that involves the biological mechanisms of vessel sprouting (budding) and splitting (intussusception). Graph theory is excellently suited to model vascular networks and to analyze their properties (invariants). In particular, a random graph process model can simulate the development of a vascular network that has been modeled using graph theory. The renal glomerulus is one example of such a vascular network. Here the correlation between the invariants of this vascular network modeled as a graph and the mechanisms of the network growth using a random graph process are studied. It is proposed that the relative frequencies of sprouting and splitting during the growth of a given renal glomerulus can be estimated by the invariants (root distance, radius, and diameter) of the graph representing the renal glomerulus network. Experimental evidence has been given to support this conjecture.

A fast hue-based colour image indexing algorithm

Cha S. H.

Machine Graphics and Vision

2002

Vol. 11, No. 2/3

285-295

In content-based image indexing and retrieval (IIR), hue component histograms of images are widely used for indexing the images database. The aim is to retrieve all colour images whose distances to the query image in terms of hue distributions do not exceed some threshold value. Edit distance has been successfully used as a similarity measure. Our earlier O(b²) algorithm computing the edit distance between two angular histograms, where "b" is the number in the hue histogram, tends to be too slow for users to wait for the outputs when applied to every image in the database. For this reason, we design two filtration functions that quicly eliminate most colour iamges from consideration as possible outputs, and exact edit distances are only computed for the remaining images. We are still guaranteed to find all similar hue distributions, and the filtration technique gives significant.