• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • 1
  • Tagged with
  • 4
  • 4
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Segmentation Guided Registration for Medical Images

Wang, Yang 08 December 2005 (has links)
No description available.
2

Approches orientées modèle pour la capture des mouvements du visage en vision par ordinateur

Malciu, Marius 01 December 2001 (has links) (PDF)
Modèle 3D d'objet, séquences vidéos monoscopiques, estimation de la pose 3D, recalage 3D/2D, texture, flot optique, translation et rotation de grande amplitude, occultation, appariement par bloc, interpolation temporelle, modélisation ondulatoire, critère de visibilité, analyse de déformations faciales, description MPEG-4 du visage, prototype déformable, bouche, yeux, B-splines, classification floue non supervisée, méthode du simplexe, synthèse de déformations faciales..
3

Preparation of 2D sequences of corneal images for 3D model building

Elbita, Abdulhakim M., Qahwaji, Rami S.R., Ipson, Stanley S., Sharif, Mhd Saeed, Ghanchi, Faruque 08 January 2014 (has links)
Yes / A confocal microscope provides a sequence of images, at incremental depths, of the various corneal layers and structures. From these, medical practioners can extract clinical information on the state of health of the patient's cornea. In this work we are addressing problems associated with capturing and processing these images including blurring, non-uniform illumination and noise, as well as the displacement of images laterally and in the anterior posterior direction caused by subject movement. The latter may cause some of the captured images to be out of sequence in terms of depth. In this paper we introduce automated algorithms for classification, reordering, registration and segmentation to solve these problems. The successful implementation of these algorithms could open the door for another interesting development, which is the 3D modelling of these sequences.
4

Ensemble registration : combining groupwise registration and segmentation

Purwani, Sri January 2016 (has links)
Registration of a group of images generally only gives a pointwise, dense correspondence defined over the whole image plane or volume, without having any specific description of any common structure that exists in every image. Furthermore, identifying tissue classes and structures that are significant across the group is often required for analysis, as well as the correspondence. The overall aim is instead to perform registration, segmentation, and modelling simultaneously, so that the registration can assist the segmentation, and vice versa. However, structural information does play a role in conventional registration, in that if the registration is successful, it would be expected structures to be aligned to some extent. Hence, we perform initial experiments to investigate whether there is explicit structural information present in the shape of the registration objective function about the optimum. We perturbed one image locally with a diffeomorphism, and found interesting structure in the shape of the quality of fit function. Then, we proceed to add explicit structural information into registration framework, using various types of structural information derived from the original intensity images. For the case of MR brain images, we augment each intensity image with its own set of tissue fraction images, plus intensity gradient images, which form an image ensemble for each example. Then, we perform groupwise registration by using these ensembles of images. We apply the method to four different real-world datasets, for which ground-truth annotation is available. It is shown that the method can give a greater than 25% improvement on the three difficult datasets, when compared to using intensity-based registration alone. On the easier dataset, it improves upon intensity-based registration, and achieves results comparable with the previous method.

Page generated in 0.2076 seconds