Gilad Lerman

Gilad Lerman

Auto-generated profile, based on publicly available information

Gilad Lerman

School of Mathematics University of Minnesota

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 December 2008 in International Journal of Computer Vision
Verified
Journal Article
Open access
PDF file
GCGuangliang Chen
Guangliang Chen
GLGilad Lerman
Gilad Lerman
This paper presents novel techniques for improving the performance of a multi-way spectral clustering framework (Govindu in Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05), vol. 1, pp. 1150–1157, 2005; Chen and Lerman, 2007, preprint in the supplementary webpage) for segmenting affine subspaces. Specifically, it suggests an iterative sampling procedure to improve the uniform sampling strategy, an automatic scheme of inferring the tuning parameter from the data, a precise initialization procedure for K-means, as well as a simple strategy for isolating outliers. The resulting algorithm, Spectral Curvature Clustering (SCC), requires only linear storage and takes linear running time in the size of the data. It is supported by theory which both justifies its successful performance and guides our practical choices. We compare it with other existing methods on a few artificial instances of affine subspaces. Application of the algorithm to several real-world problems is also discussed.

22 June 2012 in International Journal of Computer Vision
Verified
Journal Article
Open access
PDF file
TZTeng Zhang
Teng Zhang
ASArthur Szlam
Arthur Szlam
YWYi Wang
Yi Wang
GLGilad Lerman
Gilad Lerman
We present a simple and fast geometric method for modeling data by a union of affine subspaces. The method begins by forming a collection of local best-fit affine subspaces, i.e., subspaces approximating the data in local neighborhoods. The correct sizes of the local neighborhoods are determined automatically by the Jones’ β 2 numbers (we prove under certain geometric conditions that our method finds the optimal local neighborhoods). The collection of subspaces is further processed by a greedy selection procedure or a spectral method to generate the final model. We discuss applications to tracking-based motion segmentation and clustering of faces under different illuminating conditions. We give extensive experimental evidence demonstrating the state of the art accuracy and speed of the suggested algorithms on these problems and also on synthetic hybrid linear data as well as the MNIST handwritten digits data; and we demonstrate how to use our algorithms for fast determination of the number of affine subspaces.

23 September 2014 in Foundations of Computational Mathematics
Verified
Journal Article
Closed access
PDF file
GLGilad Lerman
Gilad Lerman
MMMichael B. McCoy
Michael B. McCoy
JTJoel A. Tropp
Joel A. Tropp
TZTeng Zhang
Teng Zhang

6 August 2018 in Proceedings of the IEEE
Verified
Journal Article
Open access
GLGilad Lerman
Gilad Lerman
TMTyler Maunu
Tyler Maunu
This paper will serve as an introduction to the body of work on robust subspace recovery. Robust subspace recovery involves finding an underlying low-dimensional subspace in a data set that is possibly corrupted with outliers. While this problem is easy to state, it has been difficult to develop optimal algorithms due to its underlying nonconvexity. This work emphasizes advantages and disadvantages of proposed approaches and unsolved problems in the area.

18 March 2009 in Foundations of Computational Mathematics
Verified
Journal Article
Closed access
PDF file
GCGuangliang Chen
Guangliang Chen
GLGilad Lerman
Gilad Lerman

31 August 2011 in Revista Matemática Iberoamericana
Verified
Journal Article
Open access
PDF file
GLGilad Lerman
Gilad Lerman
JWJ. Tyler Whitehouse
J. Tyler Whitehouse
We define discrete and continuous Menger-type curvatures. The discrete curvature scales the volume of a (d+1) -simplex in a real separable Hilbert space H , whereas the continuous curvature integrates the square of the discrete one according to products of a given measure (or its restriction to balls). The essence of this paper is to establish an upper bound on the continuous Menger-type curvature of an Ahlfors regular measure \mu on H in terms of the Jones-type flatness of \mu (which adds up scaled errors of approximations of \mu by d -planes at different scales and locations). As a consequence of this result we obtain that uniformly rectifiable measures satisfy a Carleson-type estimate in terms of the Menger-type curvature. Our strategy combines discrete and integral multiscale inequalities for the polar sine with the "geometric multipoles" construction, which is a multiway analog of the well-known method of fast multipoles.