You are here
Sampling and Subspace Methods for Learning Sparse Group Structures in Computer Vision
| Title: | Sampling and Subspace Methods for Learning Sparse Group Structures in Computer Vision. |
 68 views 36 downloads |
|---|---|---|
| Name(s): |
Jaberi, Maryam, Author Foroosh, Hassan, Committee Chair Pensky, Marianna, Committee CoChair Gong, Boqing, Committee Member Qi, GuoJun, Committee Member Pensky, Marianna, Committee Member University of Central Florida, Degree Grantor |
|
| Type of Resource: | text | |
| Date Issued: | 2018 | |
| Publisher: | University of Central Florida | |
| Language(s): | English | |
| Abstract/Description: | The unprecedented growth of data in volume and dimension has led to an increased number of computationally-demanding and data-driven decision-making methods in many disciplines, such as computer vision, genomics, finance, etc. Research on big data aims to understand and describe trends in massive volumes of high-dimensional data. High volume and dimension are the determining factors in both computational and time complexity of algorithms. The challenge grows when the data are formed of the union of group-structures of different dimensions embedded in a high-dimensional ambient space.To address the problem of high volume, we propose a sampling method referred to as the Sparse Withdrawal of Inliers in a First Trial (SWIFT), which determines the smallest sample size in one grab so that all group-structures are adequately represented and discovered with high probability. The key features of SWIFT are: (i) sparsity, which is independent of the population size; (ii) no prior knowledge of the distribution of data, or the number of underlying group-structures; and (iii) robustness in the presence of an overwhelming number of outliers. We report a comprehensive study of the proposed sampling method in terms of accuracy, functionality, and effectiveness in reducing the computational cost in various applications of computer vision. In the second part of this dissertation, we study dimensionality reduction for multi-structural data. We propose a probabilistic subspace clustering method that unifies soft- and hard-clustering in a single framework. This is achieved by introducing a delayed association of uncertain points to subspaces of lower dimensions based on a confidence measure. Delayed association yields higher accuracy in clustering subspaces that have ambiguities, i.e. due to intersections and high-level of outliers/noise, and hence leads to more accurate self-representation of underlying subspaces. Altogether, this dissertation addresses the key theoretical and practically issues of size and dimension in big data analysis. | |
| Identifier: | CFE0007017 (IID), ucf:52039 (fedora) | |
| Note(s): |
2018-05-01 Ph.D. Engineering and Computer Science, Computer Science Doctoral This record was generated from author submitted information. |
|
| Subject(s): | Sparse Sampling -- Big Data -- Sample Size -- Sufficient Statistic -- Parameter Estimation -- Structure Estimation -- Subspace Clustering -- Unsupervised Machine Learning -- High Dimensional Data -- Big Data Analysis -- Image Clustering -- Motion Segmentation -- Structure from Motion -- Clustering -- Spectral Clustering -- LASSO -- Highly Sparse Data -- Image Processing -- Video Processing | |
| Persistent Link to This Record: | http://purl.flvc.org/ucf/fd/CFE0007017 | |
| Restrictions on Access: | public 2018-05-15 | |
| Host Institution: | UCF |
