how to separate the left and right lung using dynamic programming

1 visualización (últimos 30 días)
jithu
jithu el 6 de Mayo de 2015
Dynamic programming is applied to find the maximum cost path through a graph with weights proportional to pixel gray-level of the original image.The maximum cost path corresponds to the junction line position.

Iniciar sesión para responder a esta pregunta.

Respuestas (0)

Categorías

Más información sobre Vector Volume Data en Help Center y File Exchange.

Etiquetas

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by