abstract: This thesis introduces new techniques for clustering distributional data according to their geometric similarities. This work builds upon the optimal transportation (OT) problem that seeks global minimum cost for matching distributional data and leverages the connection between OT and power diagrams to solve different clustering problems. The OT formulation is based on the variational principle to differentiate hard cluster assignments, which was missing in the literature. This thesis shows multiple techniques to regularize and generalize OT to cope with various tasks including clustering, aligning, and interpolating distributional data. It also discusses the connections of the new formulation to other OT and clustering formulations to better understand their gaps and the means to close them. Finally, this thesis demonstrates the advantages of the proposed OT techniques in solving machine learning problems and their downstream applications in computer graphics, computer vision, and image processing. / Dissertation/Thesis / Doctoral Dissertation Computer Engineering 2020
| Identifer | oai:union.ndltd.org:asu.edu/item:57239 |
| Date | January 2020 |
| Contributors | Mi, Liang (Author), Wang, Yalin (Advisor), Chen, Kewei (Committee member), Karam, Lina (Committee member), Li, Baoxin (Committee member), Turaga, Pavan (Committee member), Arizona State University (Publisher) |
| Source Sets | Arizona State University |
| Language | English |
| Detected Language | English |
| Type | Doctoral Dissertation |
| Format | 108 pages |
| Rights | http://rightsstatements.org/vocab/InC/1.0/ |
Page generated in 0.0147 seconds