Details
| Original language | English |
|---|---|
| Pages (from-to) | 475-482 |
| Number of pages | 8 |
| Journal | ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences |
| Volume | 2 |
| Issue number | 3W5 |
| Publication status | Published - 20 Aug 2015 |
| Event | ISPRS Geospatial Week 2015 - La Grande Motte, France Duration: 28 Sept 2015 → 3 Oct 2015 |
Abstract
In this paper, we propose a new framework for segmenting feature-based moving objects under affine subspace model. Since the feature trajectories in practice are high-dimensional and contain a lot of noise, we firstly apply the sparse PCA to represent the original trajectories with a low-dimensional global subspace, which consists of the orthogonal sparse principal vectors. Subsequently, the local subspace separation will be achieved via automatically searching the sparse representation of the nearest neighbors for each projected data. In order to refine the local subspace estimation result, we propose an error estimation to encourage the projected data that span a same local subspace to be clustered together. In the end, the segmentation of different motions is achieved through the spectral clustering on an affinity matrix, which is constructed with both the error estimation and sparse neighbors optimization. We test our method extensively and compare it with state-of-the-art methods on the Hopkins 155 dataset. The results show that our method is comparable with the other motion segmentation methods, and in many cases exceed them in terms of precision and computation time.
Keywords
- Affine subspace model, Motion segmentation, Optimization, Sparse PCA, Subspace estimation
ASJC Scopus subject areas
- Earth and Planetary Sciences(all)
- Earth and Planetary Sciences (miscellaneous)
- Environmental Science(all)
- Environmental Science (miscellaneous)
- Physics and Astronomy(all)
- Instrumentation
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, Vol. 2, No. 3W5, 20.08.2015, p. 475-482.
Research output: Contribution to journal › Conference article › Research › peer review
}
TY - JOUR
T1 - Global and local sparse subspace optimization for motion segmentation
AU - Ying Yang, M.
AU - Feng, Sitong
AU - Ackermann, Hanno
AU - Rosenhahn, Bodo
PY - 2015/8/20
Y1 - 2015/8/20
N2 - In this paper, we propose a new framework for segmenting feature-based moving objects under affine subspace model. Since the feature trajectories in practice are high-dimensional and contain a lot of noise, we firstly apply the sparse PCA to represent the original trajectories with a low-dimensional global subspace, which consists of the orthogonal sparse principal vectors. Subsequently, the local subspace separation will be achieved via automatically searching the sparse representation of the nearest neighbors for each projected data. In order to refine the local subspace estimation result, we propose an error estimation to encourage the projected data that span a same local subspace to be clustered together. In the end, the segmentation of different motions is achieved through the spectral clustering on an affinity matrix, which is constructed with both the error estimation and sparse neighbors optimization. We test our method extensively and compare it with state-of-the-art methods on the Hopkins 155 dataset. The results show that our method is comparable with the other motion segmentation methods, and in many cases exceed them in terms of precision and computation time.
AB - In this paper, we propose a new framework for segmenting feature-based moving objects under affine subspace model. Since the feature trajectories in practice are high-dimensional and contain a lot of noise, we firstly apply the sparse PCA to represent the original trajectories with a low-dimensional global subspace, which consists of the orthogonal sparse principal vectors. Subsequently, the local subspace separation will be achieved via automatically searching the sparse representation of the nearest neighbors for each projected data. In order to refine the local subspace estimation result, we propose an error estimation to encourage the projected data that span a same local subspace to be clustered together. In the end, the segmentation of different motions is achieved through the spectral clustering on an affinity matrix, which is constructed with both the error estimation and sparse neighbors optimization. We test our method extensively and compare it with state-of-the-art methods on the Hopkins 155 dataset. The results show that our method is comparable with the other motion segmentation methods, and in many cases exceed them in terms of precision and computation time.
KW - Affine subspace model
KW - Motion segmentation
KW - Optimization
KW - Sparse PCA
KW - Subspace estimation
UR - http://www.scopus.com/inward/record.url?scp=84988351625&partnerID=8YFLogxK
U2 - 10.5194/isprsannals-II-3-W5-475-2015
DO - 10.5194/isprsannals-II-3-W5-475-2015
M3 - Conference article
AN - SCOPUS:84988351625
VL - 2
SP - 475
EP - 482
JO - ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
JF - ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
SN - 2194-9042
IS - 3W5
T2 - ISPRS Geospatial Week 2015
Y2 - 28 September 2015 through 3 October 2015
ER -