IPAG Dissertation Archive
Presented to the Faculty of the Graduate School
in Candidacy for the Degree of
Doctor of Philosophy
Dissertation Director: Anand Rangaranjan
The algorithm is built upon the heuristic of "fuzzy correspondence", which allows for multiple partial cor-respondences between points. With the help of the deterministic annealing technique, this new heuristic enables the algorithm to overcome many local minima that can be encountered in the matching process.
Devised as a general point matching framework, the algorithm can be easily extended to accommodate differ-ent specific requirements in many registration applications. Firstly, the modular design of the transformation module enables convenient incorporation of different non-rigid splines. Secondly, the point matching algorithm can be easily extended into a symmetric joint clustering-matching framework. It will be shown that by introducing a super point-set, the joint cluster-matching extension can be applied to estimate an average shape point-set from multiple point shape sets.
The algorithm is applied to the registration of 3D brain anatomical structures. We proposed in this work a joint feature registration framework, which is mainly based on the joint clustering-matching extension of the robust point matching. The proposed framework provides an effective and unified way to utilize spatial relationship existed between different brain structural features to improve the brain anatomical registration/normalization. For the first time, a carefully designed synthetic study is carried out to investigate and compare different anatomical features' abilities to achieve such an registration/normalization. Other applications of the robust non-rigid point matching algorithm, such as key-frame animation and human face matching, will also be demonstrated in this work.
@PhDthesis(ChuiThesis, author = "Haili Chui", title = "Non-Rigid Point Matching: Algorithms, Extensions and Applications", school = "Yale University", month = "May", year = "2001")
The complete text of the thesis is available as a .pdf file. (151 pages, 7.9 MB)
Questions regarding the content of this page should be directed to the group director.
Questions or bug reports regarding this interface should go to
Home Page, email@example.com