東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Algorithms with Applications to Anth...

Ravier, Robert.

Linked to FindBook

Google Book

Amazon

博客來

Algorithms with Applications to Anthropology.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Algorithms with Applications to Anthropology./
Author:	Ravier, Robert.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
Description:	131 p.
Notes:	Source: Dissertations Abstracts International, Volume: 79-11, Section: B.
Contained By:	Dissertations Abstracts International79-11B.
Subject:	Applied Mathematics. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10749008
ISBN:	9780355929737

Algorithms with Applications to Anthropology.
Ravier, Robert.

Algorithms with Applications to Anthropology. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 131 p.

Source: Dissertations Abstracts International, Volume: 79-11, Section: B.

Thesis (Ph.D.)--Duke University, 2018.

This item is not available from ProQuest Dissertations & Theses.

In this dissertation, we investigate several problems in shape analysis. We start by discussing the shape matching problem. Given that homeomorphisms of shapes are computed in practice by interpolating sparse correspondence, we give an algorithm to refine pairwise mappings in a collection by employing a simple metric condition to obtain partial correspondences of points chosen in a manner that outlines the shapes of interest in a relatively small number of points. We then use this mapping algorithm in two separate applications. First, we investigate the extent to which classical assumptions and methods in statistical shape analysis hold for near continuous discretizations of surfaces spanning different species and genus groups. We find that these methods yield biologically meaningful information, and that resulting operations with these correspondences, including averaging and linear interpolation, yield biologically meaningful surfaces even for distinct geometries. As a second application, we discuss the problem of dictionary learning on shapes in an effort to find sparse decompositions of shapes in a collection. To this end, we define a construction of wavelet-like and ridgelet-like objects that are easily computable at the level of the discretization, both of which have natural interpretation in the smooth case. We then use these in tandem with feature points to create a sparse dictionary, and show that standard sparsification practices still retain biological information.

ISBN: 9780355929737Subjects--Topical Terms:

1669109
Applied Mathematics.

Algorithms with Applications to Anthropology.
LDR:02633nmm a2200349 4500 001 2210309
005 20191121124201.5
008 201008s2018 ||||||||||||||||| ||eng d
020 $a 9780355929737
035 $a (MiAaPQ)AAI10749008
035 $a (MiAaPQ)duke:14485
035 $a AAI10749008
040 $a MiAaPQ $c MiAaPQ
100 1 $a Ravier, Robert. $3 3437452
245 1 0 $a Algorithms with Applications to Anthropology.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 131 p.
500 $a Source: Dissertations Abstracts International, Volume: 79-11, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Daubechies, Ingrid.
502 $a Thesis (Ph.D.)--Duke University, 2018.
506 $a This item is not available from ProQuest Dissertations & Theses.
506 $a This item must not be sold to any third party vendors.
520 $a In this dissertation, we investigate several problems in shape analysis. We start by discussing the shape matching problem. Given that homeomorphisms of shapes are computed in practice by interpolating sparse correspondence, we give an algorithm to refine pairwise mappings in a collection by employing a simple metric condition to obtain partial correspondences of points chosen in a manner that outlines the shapes of interest in a relatively small number of points. We then use this mapping algorithm in two separate applications. First, we investigate the extent to which classical assumptions and methods in statistical shape analysis hold for near continuous discretizations of surfaces spanning different species and genus groups. We find that these methods yield biologically meaningful information, and that resulting operations with these correspondences, including averaging and linear interpolation, yield biologically meaningful surfaces even for distinct geometries. As a second application, we discuss the problem of dictionary learning on shapes in an effort to find sparse decompositions of shapes in a collection. To this end, we define a construction of wavelet-like and ridgelet-like objects that are easily computable at the level of the discretization, both of which have natural interpretation in the smooth case. We then use these in tandem with feature points to create a sparse dictionary, and show that standard sparsification practices still retain biological information.
590 $a School code: 0066.
650 4 $a Applied Mathematics. $3 1669109
650 4 $a Statistics. $3 517247
650 4 $a Computer science. $3 523869
690 $a 0364
690 $a 0463
690 $a 0984
710 2 $a Duke University. $b Mathematics. $3 1036449
773 0 $t Dissertations Abstracts International $g 79-11B.
790 $a 0066
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10749008