東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Graph-Based Data Fusion Methods.

Iyer, Geoffrey Sankar.

FindBook

Google Book

Amazon

博客來

Graph-Based Data Fusion Methods.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Graph-Based Data Fusion Methods./
作者:	Iyer, Geoffrey Sankar.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:	84 p.
附註:	Source: Dissertations Abstracts International, Volume: 80-06, Section: B.
Contained By:	Dissertations Abstracts International80-06B.
標題:	Applied Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13422492
ISBN:	9780438749634

Graph-Based Data Fusion Methods.
Iyer, Geoffrey Sankar.

Graph-Based Data Fusion Methods. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 84 p.

Source: Dissertations Abstracts International, Volume: 80-06, Section: B.

Thesis (Ph.D.)--University of California, Los Angeles, 2018.

This item must not be sold to any third party vendors.

As data of all kinds becomes more readily available, there is an increasing demand for algorithms that can jointly process data from multiple sources, also called modalities. In the current state-of-the-art the are many such algorithms, but for the most part each method is made with a specific application in mind. In this work we aim to create more general and data-driven methods for various multimodal machine learning problems. We approach this difficult problem from the standpoint of graph methods, as graph representations are historically robust to many possible data formats, while maintaining sufficient information to produce state-of-the-art results. The first problem considered here is a segmentation problem in the case of co-registered, multimodal datasets. Here we perform data fusion on the level of graph representations, specifically concentrating on finding and using the unique information that each modality may bring to the overall scene. From the fused graph we implement standard image segmentation techniques. We also consider here a matching problem between arbitrary datasets. Once again, graph representations are used to preserve relevant topological information while filtering out specific formatting details. We then match graph nodes using spectral information. By using the Nystrom extension eigensolver to quickly calculate approximate graph eigenfunctions, and by using a hierarchical matching algorithm narrow the matching search space, we obtain a runtime and space complexity that is, to the best of our knowledge, superior among the state-of-the-art.

ISBN: 9780438749634Subjects--Topical Terms:

1669109
Applied Mathematics.

Graph-Based Data Fusion Methods.
LDR:02637nmm a2200313 4500 001 2210671
005 20191121124255.5
008 201008s2018 ||||||||||||||||| ||eng d
020 $a 9780438749634
035 $a (MiAaPQ)AAI13422492
035 $a (MiAaPQ)ucla:17445
035 $a AAI13422492
040 $a MiAaPQ $c MiAaPQ
100 1 $a Iyer, Geoffrey Sankar. $3 3437808
245 1 0 $a Graph-Based Data Fusion Methods.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 84 p.
500 $a Source: Dissertations Abstracts International, Volume: 80-06, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Bertozzi, Andrea L.;Chanussot, Jocelyn.
502 $a Thesis (Ph.D.)--University of California, Los Angeles, 2018.
506 $a This item must not be sold to any third party vendors.
520 $a As data of all kinds becomes more readily available, there is an increasing demand for algorithms that can jointly process data from multiple sources, also called modalities. In the current state-of-the-art the are many such algorithms, but for the most part each method is made with a specific application in mind. In this work we aim to create more general and data-driven methods for various multimodal machine learning problems. We approach this difficult problem from the standpoint of graph methods, as graph representations are historically robust to many possible data formats, while maintaining sufficient information to produce state-of-the-art results. The first problem considered here is a segmentation problem in the case of co-registered, multimodal datasets. Here we perform data fusion on the level of graph representations, specifically concentrating on finding and using the unique information that each modality may bring to the overall scene. From the fused graph we implement standard image segmentation techniques. We also consider here a matching problem between arbitrary datasets. Once again, graph representations are used to preserve relevant topological information while filtering out specific formatting details. We then match graph nodes using spectral information. By using the Nystrom extension eigensolver to quickly calculate approximate graph eigenfunctions, and by using a hierarchical matching algorithm narrow the matching search space, we obtain a runtime and space complexity that is, to the best of our knowledge, superior among the state-of-the-art.
590 $a School code: 0031.
650 4 $a Applied Mathematics. $3 1669109
690 $a 0364
710 2 $a University of California, Los Angeles. $b Mathematics 0540. $3 2096468
773 0 $t Dissertations Abstracts International $g 80-06B.
790 $a 0031
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=13422492