Back to search

Rochester Institute of Technology

Low-Rank Clustering via LP1-PCA

Abstract

dc:description.abstract

In recent years, subspace clustering has found many practical use cases which include, for example, image segmentation, motion segmentation, and facial clustering. The image and video data that is common to these types of applications often has high dimensionality. Rather than viewing high dimensionality as a drawback, we propose a novel algorithm for subspace clustering that takes advantage of the high dimensional nature of such data. We call this algorithm LP1-PCA Spectral Clustering. Specifically, we introduce a concept that we call cluster-ID sparsity, and we propose an algorithm called LP1-PCA to attain this in low data dimensions. Our novel LP1-PCA algorithm is simple to implement and typically converges after only a few iterations. Conditions for which our algorithm performs well are discussed both theoretically and empirically, and we show that our method often attains superior clustering performance when compared to other common clustering algorithms on synthetic and real world datasets.

Degree

thesis:*
Name thesis:degree_name
Electrical Engineering (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Electrical Engineering (KGCOE)

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Krol, Matt
Contributors dc:contributor
  • Panos P. Markopoulos

Subjects

dc:subject × 6

Identifiers

dc:identifier.*
Repository record dc:identifier
https://repository.rit.edu/theses/11201

Chain of custody

source
Harvested from
Rochester Institute of Technology
Base URL
repository.rit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Krol, Matt. Low-Rank Clustering via LP1-PCA. Thesis thesis, https://repository.rit.edu/theses/11201