CAREER: Variational and Geometric Methods for Data Analysis
CAREER: Variational and Geometric Methods for Data Analysis
批准号:
1752202
负责人:
Braxton Osting
金额:
$40.0万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2018
资助国家:
美国
项目状态:
已结题
起止时间:
2018-07-01 至 2024-06-30
中文摘要
该项目将使用应用数学的工具开发和分析大规模数据分析的可扩展方法,特别是针对聚类、几何处理、图像分析和分析数据中的高阶交互的问题。一个具体的最终目标是使用n方向场来创建四边形网格,这可以证明是高质量的,并且在工程有限元模拟中有直接的应用。PI计划通过研究研讨会和学生项目来吸引、参与和教育犹他大学的本科生和研究生。学生将受益于接触这一跨学科领域,并成为研究的组成部分,参加定期小组会议和讨论,并有机会在会议上展示他们的研究成果。拟议的教育计划包括开发两门课程,优化导论和数据科学导论,这两门课程将为犹他大学科学与工程学院的学生提供服务。作为犹他大学ACCESS项目的一部分,一门关于数据分析的新课程将促进这个代表性不足的群体对STEM学科的研究。ACCESS项目是一个为期七周的暑期强化项目,面向即将入学的女本科生。该项目将开发和分析基于几何、变分原理和偏微分方程的新的计算方法,用于数据分析。由于相关的变分特征和随机过程,这些方法在几何和/或物理上是可解释的,并且具有可证明的性质,补充和扩展了统计学和计算机科学的传统数据分析方法。拟议的研究计划有三个主要目标。第一个目标是研究与图划分问题的Cheeger公式相关的基础问题以及与图曲率和Merriman-Bence-Osher (MBO)扩散产生运动的联系。特别是,MBO方法的一种新的概率解释将导致有效的算法系统地平衡分区成分。第二个目标是使用向量场的泛化,当N=4时称为N方向场或交叉场,用于几何处理和图像分析中的各种任务。这项工作受到PI和他的研究生在基于金兹堡-朗道理论的边界对齐四边形网格生成方面的最新进展的推动。在某种程度上,这将涉及扩展MBO算法和相关的Lyapunov函数来近似广义集中图像的调和映射。第三个目标是发展分析简单复合体的有效方法,推广和扩展分析图的方法。为了克服简单复合体的非局部和多尺度特性所带来的固有计算成本,PI将基于保留相关广义拉普拉斯算子的谱来开发有效的稀疏化算法。该奖项反映了美国国家科学基金会的法定使命,并通过使用基金会的知识价值和更广泛的影响审查标准进行评估,被认为值得支持。
英文摘要
This project will use tools from applied mathematics to develop and analyze scalable methods for large-scale data analysis, especially for the problems of clustering, geometry processing, image analysis, and analyzing high-order interactions in data. One specific end-goal is to use N-direction fields to create quad meshes, which are provably high-quality, and have immediate applications in finite element simulations for engineering. The PI plans to attract, involve, and educate students at both the undergraduate and graduate levels at the University of Utah through research seminars and student programs. Students will benefit from exposure to this interdisciplinary field and be an integral part of the research, participating at regular group meetings and discussions, and given the opportunity to present their research findings at conferences. The proposed education plan includes the development of two courses, Introduction to Optimization and Introduction to Data Science, which will serve students throughout the University of Utah's Schools of Science and Engineering. A new course on Data analysis as part of the University of Utah's ACCESS program, a seven-week intensive summer program for incoming female undergraduates, will foster study of STEM disciplines for this underrepresented group.This project will develop and analyze new computational methods based on geometry, variational principles, and partial differential equations for data analysis. Due to associated variational characterizations and stochastic processes, these methods are geometrically and/or physically interpretable and have provable properties, complementing and extending traditional data analytic methods from statistics and computer science. The proposed research plan has three primary goals. The first goal is to study foundational questions related to the Cheeger formulation of the graph partitioning problem and connections to graph curvature and Merriman-Bence-Osher (MBO) diffusion generated motion. In particular, a new probabilistic interpretation of the MBO method will lead to efficient algorithms that systematically balance partition components. The second goal is to use a generalization of vector fields, called N-direction fields or cross fields when N=4, for a variety of tasks in geometry processing and image analysis. This work is well-motivated by recent progress of the PI and his graduate student on the generation of boundary-aligned quadrilateral meshes based on the Ginzburg-Landau theory. In part, this will involve the extension of the MBO algorithm and associated Lyapunov function to approximate harmonic maps with image in generalized sets. The third goal is to develop efficient methods for analyzing simplicial complexes, generalizing and extending methods for analyzing graphs. To overcome the inherent computational costs due to the non-local and multi-scale nature of simplicial complexes, the PI will develop efficient sparsification algorithms based on preserving the spectrum of associated generalized Laplacian operators.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(20)
专著(0)
科研奖励(0)
会议论文
登录
查看更多内容
DOI:
10.1137/21m1405216
发表时间:
2022
期刊:
SIAM Journal on Applied Dynamical Systems
影响因子:
2.1
作者:
[Yoon, Ryeongkyung, Bhat, Harish S., Osting, Braxton]
通讯作者:
Osting, Braxton
Steklov Eigenvalues of Nearly Spherical Domains
近球形域的 Steklov 特征值
DOI:
10.1137/21m1411925
发表时间:
2022
期刊:
SIAM Journal on Control and Optimization
影响因子:
2.2
作者:
[Viator, Robert, Osting, Braxton]
通讯作者:
Osting, Braxton
DOI:
10.1137/20m1348315
发表时间:
2020-06
期刊:
ArXiv
影响因子:
--
作者:
[Z. Boyd;Nicolas Fraiman;J. Marzuola;P. Mucha;B. Osting;J. Weare]
通讯作者:
Z. Boyd;Nicolas Fraiman;J. Marzuola;P. Mucha;B. Osting;J. Weare
DOI:
10.1090/mcom/3473
发表时间:
2019-09
期刊:
Math. Comput.
影响因子:
--
作者:
[B. Osting;Dong Wang]
通讯作者:
B. Osting;Dong Wang
Consistency of Archetypal Analysis
原型分析的一致性
DOI:
10.1137/20m1331792
发表时间:
2021
期刊:
SIAM Journal on Mathematics of Data Science
影响因子:
3.6
作者:
[Osting, Braxton, Wang, Dong, Xu, Yiming, Zosso, Dominique]
通讯作者:
Zosso, Dominique
共 18 条
Computational Methods and Consistency for Dirichlet Graph Partitions
-
批准号:1619755
-
项目类别:Continuing Grant
-
资助金额:$18.0万
-
财政年份:2016
-
负责人:Braxton Osting
-
依托单位:
Geometric Methods for Graph Partitioning
-
批准号:1418812
-
项目类别:Standard Grant
-
资助金额:$7.9万
-
财政年份:2014
-
负责人:Braxton Osting
-
依托单位:
Geometric Methods for Graph Partitioning
-
批准号:1461138
-
项目类别:Standard Grant
-
资助金额:$7.9万
-
财政年份:2014
-
负责人:Braxton Osting
-
依托单位:
PostDoctoral Research Fellowship
-
批准号:1103959
-
项目类别:Fellowship Award
-
资助金额:$13.5万
-
财政年份:2011
-
负责人:Braxton Osting
-
依托单位:
海外基金