Ograniczanie wyników
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 1

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
In this article we present an optimisation of the execution time of the "dividing-cubes" alorithm. whose aim is to extract 3D surfaces from volumic images. These images are generally very voluminous and represents an pile up of many iso-surfaces, what require a considerable time to process them fpr extract the desired iso-surface. In first time it's matter of reducing the cover time of the 3D image by subdividing it into blocs of voxels, witch comes to visits a more reduce number of voxels. We propose in a second step, an optimization of the subdividing blocs parameters that allow us to have a bloc size the most suitable as possible, and permint to genetare a minimal execution time.Our propositions and formulations are made vaild by means of experiments carried out on processed images, and medical images.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.