Award Abstract # 0956072
CAREER: New Paradigms in Geometric Analysis of Data Sets and their Applications

NSF Org: DMS
Division Of Mathematical Sciences
Recipient: REGENTS OF THE UNIVERSITY OF MINNESOTA
Initial Amendment Date: May 18, 2010
Latest Amendment Date: May 18, 2010
Award Number: 0956072
Award Instrument: Standard Grant
Program Manager: Junping Wang
jwang@nsf.gov
 (703)292-4488
DMS
 Division Of Mathematical Sciences
MPS
 Directorate for Mathematical and Physical Sciences
Start Date: July 1, 2010
End Date: June 30, 2016 (Estimated)
Total Intended Award Amount: $551,568.00
Total Awarded Amount to Date: $551,568.00
Funds Obligated to Date: FY 2010 = $551,568.00
History of Investigator:
  • Gilad Lerman (Principal Investigator)
    lerman@umn.edu
Recipient Sponsored Research Office: University of Minnesota-Twin Cities
2221 UNIVERSITY AVE SE STE 100
MINNEAPOLIS
MN  US  55414-3074
(612)624-5599
Sponsor Congressional District: 05
Primary Place of Performance: University of Minnesota-Twin Cities
2221 UNIVERSITY AVE SE STE 100
MINNEAPOLIS
MN  US  55414-3074
Primary Place of Performance
Congressional District:
05
Unique Entity Identifier (UEI): KABJZBBJ4B54
Parent UEI:
NSF Program(s): COMPUTATIONAL MATHEMATICS
Primary Program Source: 01001011DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 1045, 1187, 9263
Program Element Code(s): 127100
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.049

ABSTRACT

The PI and his collaborators will develop algorithms for detecting and recovering underlying sparse geometric structures from massive high-dimensional data sets. In particular, they plan to explore the following frameworks: geometric optimization for the purpose of detecting low-dimensional geometric structures within point clouds; multiscale methods for the effective detection of local scales and their combination for capturing the most relevant local and global geometric information; online and adaptive algorithms for organizing data as mixtures of manifolds while separating outliers. The proposed methodologies will be justified by theoretical guarantees on performance, and these methodologies will be applied to a variety of data sets, many of which will be provided by industrial collaborators. The applications include: automatic detection of moving objects in video surveillance cameras; motion segmentation of video images, automatic segmentation of blood vessels in the brain taken via dynamic CT scans into arteries and veins.

Recently there has been a fundamental shift in the analysis and manipulation of certain types of data sets such as digital satellite images and magnetic resonance images (MRI). This revolution relies on the fact that while such images seemingly have a complex and high-dimensional structure, in fact they are relatively low-dimensional or "sparse". The basic observation was that this sparsity could be exploited to more rapidly acquire, transmit, reconstruct, and analyze such images. The PI and his collaborators are extending such "dimensionality reduction" techniques to more general instances of data sets with the aim of identifying when seemingly high-dimensional collections of data are actually much more simple, and to then get a grip on what the simplified structure is. Such research has several important applications related to making computer aided decisions about data which has both security and medical significance. The hope is that the research yields speedy, efficient, and proven algorithms for separating various and important features of data which is changing in time. The practical benefits of the research would include reliable automation of security cameras. Many of the applications and themes suggested in this proposal are accessible to a broad community. The PI plans to take advantage of this accessibility in order to integrate the research effort with the education of younger researchers and students. In particular, the PI is committed to provide material to mathematics educators at all levels and involve undergraduate and graduate students in emerging industrial research. The PI will share his joint findings through publications and software, all available online to the scientific and engineering communities as well as the public at large.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 12)
A. M. Ebtehaj, E. Foufoula-Georgiou and G. Lerman "Sparse regularization for precipitation downscaling" J. Geophys. Res. , v.117 , 2012 , p.1 10.1029/2011JD017057
A. M. Ebtehaj, E. Foufoula-Georgiou, G. Lerman, and R. L. Bras "Compressive earth observatory: An insight from AIRS/AMSU retrievals" Geophysical Research Letters , v.42 , 2015 , p.362 10.1002/2014GL062711
A. M. Ebtehaj, M. Zupanski, G. Lerman and E. Foufoula-Georgiou "Variational data assimilation via sparse regularisation" Tellus A , v.66 , 2014 dx.doi.org/10.3402/tellusa.v66.21789
B. Poling and G. Lerman "A new approach to two-view motion segmentation using global dimension minimization" International Journal of Computer Vision , v.108 , 2014 10.1007/s11263-013-0694-0
Bryan Poling and Gilad Lerman "Enhancing Feature Tracking With Gyro Regularization" Image and Vision Computing , v.50 , 2016 DOI: 10.1016/j.imavis.2016.01.004
G. Lerman and J. T. Whitehouse "Least squares approximations of measures via geometric condition numbers" Mathematika , v.58 , 2012 , p.45 10.1112/S0025579311001720
G. Lerman and T. Zhang "lp-Recovery of the most significant subspace among multiple subspaces with outliers" Constructive Approximation , v.40 , 2014 , p.329 10.1007/s00365-014-9242-6
G. Lerman and T. Zhang "Robust recovery of multiple subspaces by geometric lp minimization" Annals of Statistics , v.39 , 2011 , p.2686 10.1214/11-AOS914
G. Lerman, M. McCoy, J. A. Tropp and T. Zhang "Robust computation of linear models or, how to find a needle in a haystack" Foundations of Computational Mathematics , v.15 , 2015 , p.363 10.1007/s10208-014-9221-0
T. Zhang and G. Lerman "A novel M-Estimator for robust PCA" Journal of Machine Learning Research , v.15 , 2014 , p.749
Yi Wang, Arthur Szlam, and Gilad Lerman "Robust Locally Linear Analysis with Applications to Image Denoising and Blind Inpainting" SIAM J. Imaging Sci. , v.6 , 2013 , p.526?562
(Showing: 1 - 10 of 12)

PROJECT OUTCOMES REPORT

Disclaimer

This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.

The work supported by the award focused on robust geometric data representations for effectively summarizing local, low-dimensional features of data. In particular, the PI and his collaborators developed successful algorithms with theoretical guarantees for the representation of data by mixtures of several subspaces and several manifolds. Such data representations show up in important practical applications such as motion segmentation in videos, action identification in video sequences, and brain fiber segmentation in medical imaging. Moreover, the PI and his collaborators have developed outlier-robust and noise-robust solutions for these and other important modeling tasks such as single subspace modeling for dimension reduction. Competitive algorithms and fundamental theory have been develolped for the problem of robust subspace recovery. The work also addressed sparse representation for data sets of the atmospheric sciences and explored additional geometric modeling problems, such as the nearest subspace problem.

Specific applications that utilized such representations were addressed: motion segmentation of videos, two-view motion segmentation, face recognition, robust dimension reduction, image denoising, blind inpainting, precipitation downscaling, retrievals from compressive earth measurements, variational data assimilation and improved feature tracking.

The supported research united theoretical guarantees on performance with flexible computational algorithms that were implemented on real-world data sets.

Broad and unconventional educational activities were conducted in order to introduce graduate, undergraduate and high-school students (and their teachers) both to mathematical and algorithmic problems in data science and to mathematical problems that are relevant to industries. Strong relations with several industries have been established.


Last Modified: 09/28/2016
Modified by: Gilad Lerman

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page