#### Filter Results:

- Full text PDF available (22)

#### Publication Year

2004

2018

- This year (4)
- Last 5 years (17)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Guangcan Liu, Zhouchen Lin, Shuicheng Yan, Ju Sun, Yong Yu, Yi Ma
- IEEE Transactions on Pattern Analysis and Machine…
- 2013

In this paper, we address the subspace clustering problem. Given a set of data samples (vectors) approximately drawn from a union of multiple subspaces, our goal is to cluster the samples into their respective subspaces and remove possible outliers as well. To this end, we propose a novel objective function named Low-Rank Representation (LRR), which seeks… (More)

- Ju Sun, Xiao Wu, Shuicheng Yan, Loong Fah Cheong, Tat-Seng Chua, Jintao Li
- 2009 IEEE Conference on Computer Vision and…
- 2009

The problem of recognizing actions in realistic videos is challenging yet absorbing owing to its great potentials in many practical applications. Most previous research is limited due to the use of simplified action databases under controlled environments or focus on excessively localized features without sufficiently encapsulating the spatio-temporal… (More)

- Ju Sun, Qing Qu, John Wright
- 2016 IEEE International Symposium on Information…
- 2016

Given nonlinear measurements y<sub>k</sub> = |〈a<sub>k</sub>, x〉| for k = 1,...,m, is it possible to recover x ∈ ℂ<sup>n</sup>? This generalized phase retrieval (GPR) problem is a fundamental task in various disciplines. Natural nonconvex methods often work remarkably well for GPR in practice, but lack clear theoretical… (More)

- Ju Sun, Yadong Mu, Shuicheng Yan, Loong Fah Cheong
- ICME
- 2010

Current research on visual action/activity analysis has mostly exploited appearance-based static feature descriptions, plus statistics of short-range motion fields. The deliberate ignorance of dense, long-duration motion trajectories as features is largely due to the lack of mature mechanism for efficient extraction and quantitative representation of visual… (More)

- Yuzhao Ni, Ju Sun, Xiao-Tong Yuan, Shuicheng Yan, Loong Fah Cheong
- 2010 IEEE International Conference on Data Mining…
- 2010

Recently there is a line of research work proposing to employ Spectral Clustering (SC) to segment (group)\footnote{Throughout the paper, we use segmentation, clustering, and grouping, and their verb forms, interchangeably.} high-dimensional structural data such as those (approximately) lying on subspaces\footnote{We follow~\cite{liu2010robust} and use the… (More)

- Qing Qu, Ju Sun, John Wright
- IEEE Transactions on Information Theory
- 2014

Is it possible to find the sparsest vector (direction) in a generic subspace S ⊆ ℝ<sup>p</sup> with dim(S) = n <; p? This problem can be considered a homogeneous variant of the sparse recovery problem and finds connections to sparse dictionary learning, sparse PCA, and many other problems in signal processing and machine learning. In this… (More)

- Ju Sun, Qing Qu, John Wright
- IEEE Transactions on Information Theory
- 2017

We consider the problem of recovering a complete (i.e., square and invertible) matrix <inline-formula> <tex-math notation="LaTeX">$ A_{0}$ </tex-math></inline-formula>, from <inline-formula> <tex-math notation="LaTeX">$ Y \in \mathbb R ^{n \times p}$ </tex-math></inline-formula> with <inline-formula> <tex-math notation="LaTeX">$ Y = A_{0} X_{0}$… (More)

- Ju Sun, Qing Qu, John Wright
- IEEE Transactions on Information Theory
- 2017

We consider the problem of recovering a complete (i.e., square and invertible) matrix <inline-formula> <tex-math notation="LaTeX">$ A_{0}$ </tex-math></inline-formula>, from <inline-formula> <tex-math notation="LaTeX">$ Y \in \mathbb R ^{n \times p}$ </tex-math></inline-formula> with <inline-formula> <tex-math notation="LaTeX">$Y = \boldsymbol A_{0} X_{0}$… (More)

- Yadong Mu, Ju Sun, Tony X. Han, Loong Fah Cheong, Shuicheng Yan
- ECCV
- 2010

Visual vocabulary construction is an integral part of the popular Bag-of-Features (BOF) model. When visual data scale up (in terms of the dimensionality of features or/and the number of samples), most existing algorithms (e.g. k-means) become unfavorable due to the prohibitive time and space requirements. In this paper we propose the random locality… (More)

- Ju Sun, Qing Qu, John Wright
- ArXiv
- 2015

In this note, we focus on smooth nonconvex optimization problems that obey: (1) all local minimizers are also global; and (2) around any saddle point or local maximizer, the objective has a negative directional curvature. Concrete applications such as dictionary learning, generalized phase retrieval, and orthogonal tensor decomposition are known to induce… (More)