An ordered sparse subspace clustering algorithm based on p-Norm

Liping Chen

doi:10.1111/exsy.12368

Return

An ordered sparse subspace clustering algorithm based on p-Norm

2019-01-09

DOI：10.1111/exsy.12368

Original

Save

View PDF

Abstract

En 中文

Images in video may include both Gaussian noise and geometric rotation. Thus, it is challenging to represent an image sequence in its intrinsically low-dimensional space in a noise-robust and rotation-robust manner. In this paper, we propose a novel-ordered sparse subspace clustering algorithm based on a p-norm to achieve an effective clustering of sequential data under heavy noise conditions. We also use the wavelet-histogram of oriented gradient (HOG) transform in the kernel view to extract both the global features (with the wavelet process) and the local features (with the HOG process) from the image. In addition, we assign different weights to different features to obtain a sparse coefficient matrix that helps to emphasize the global and local correlations in each sample. Similarly, the clustering algorithm based on the p-norm for sequential images emphasizes the within-class correlations amongst samples. Therefore, in this paper, we select additional denoising main components under a Laplacian constraint to achieve a better block-diagonal structure and highlight the independence of different clusters. Extensive experiments performed on various public datasets (including the ordered face dataset, handwritten recognition dataset, video scene segmentation dataset, and object recognition dataset) demonstrate that the proposed method is more resilient to noise and rotation than other representative sparse subspace clustering methods.

Keywords:

sparse subspace clustering

wavelet-HOG

block-diagonal transform

image sequence clustering

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.