Morphological Snakes

Álvarez, Luis, Baumela Molina, Luis ORCID: https://orcid.org/0000-0001-6910-4359, Henríquez, Pedro and Márquez Neila, Pablo (2010). Morphological Snakes. En: "IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2010", 13/06/2010 - 18/06/2010, San Francisco, EEUU. ISBN 978-1-4244-6984-0.

Descripción

Título: Morphological Snakes
Autor/es:
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2010
Fechas del Evento: 13/06/2010 - 18/06/2010
Lugar del Evento: San Francisco, EEUU
Título del Libro: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2010
Fecha: 2010
ISBN: 978-1-4244-6984-0
Materias:
ODS:
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[thumbnail of INVE_MEM_2010_75595.pdf]
Vista Previa
PDF (Portable Document Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (159kB) | Vista Previa

Resumen

We introduce a morphological approach to curve evolution. The differential operators used in the standard PDE snake models can be approached using morphological operations on a binary level set. By combining the morphological operators associated to the PDE components we achieve a new snakes evolution algorithm. This new solution is based on numerical methods which are very simple, fast and stable. Moreover, since the level set is just a binary piecewise constant function, this approach does not require to estimate a contour distance function. To illustrate the results obtained we present some numerical experiments on real images.

Más información

ID de Registro: 6913
Identificador DC: https://oa.upm.es/6913/
Identificador OAI: oai:oa.upm.es:6913
URL Oficial: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumbe...
Depositado por: Memoria Investigacion
Depositado el: 12 May 2011 08:35
Ultima Modificación: 20 Abr 2016 16:02