File Download
Supplementary
-
Citations:
- Appears in Collections:
postgraduate thesis: Motion segmentation by adaptive mode seeking and clustering consensus
Title | Motion segmentation by adaptive mode seeking and clustering consensus |
---|---|
Authors | |
Advisors | Advisor(s):Wong, KKY |
Issue Date | 2012 |
Publisher | The University of Hong Kong (Pokfulam, Hong Kong) |
Citation | Pan, G. [潘国栋]. (2012). Motion segmentation by adaptive mode seeking and clustering consensus. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4819936 |
Abstract | The task of multi-body motion segmentation refers to segmenting feature trajectories
in a sequence of images according to their 3D motion affinity without
knowing the number of motions in advance. It is critical for understanding and
reconstructing a dynamic scene. This problem essentially consists of two subproblems,
segmenting features and detecting the number of motions. While the
state-of-the-art LBF algorithm achieves segmentation accuracy as high as 96.5%,
it is still disturbed by a phenomenon called over-locality. A novel mode seeking
algorithm with an adaptive distance measure is proposed to avoid this problem,
and improves the accuracy to 98.1%. The LBF algorithm is incapable of detecting
the number of motions itself. A randomized version of the mode seeking algorithm
is presented, which could detect the number as well as preserve satisfactory
segmentation accuracy. To detect the number of motions, a kernel optimization
method locates it via kernel alignment. However, it suffers from over-locality and
over-detects the number of motions. An intersection measure and two mutual
information measures are presented to solve this problem. Using these measures,
the proposed clustering consensus framework recasts the motion number detection
problem to a clustering consensus problem. It extends the kernel optimization
method from two-clustering consensus to multiple-clustering consensus. A large
number of experiments and comparisons have been done, and convincing results
are obtained. |
Degree | Doctor of Philosophy |
Subject | Computer vision. Computer algorithms. Cluster analysis. |
Dept/Program | Computer Science |
Persistent Identifier | http://hdl.handle.net/10722/167212 |
HKU Library Item ID | b4819936 |
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Wong, KKY | - |
dc.contributor.author | Pan, Guodong. | - |
dc.contributor.author | 潘国栋. | - |
dc.date.issued | 2012 | - |
dc.identifier.citation | Pan, G. [潘国栋]. (2012). Motion segmentation by adaptive mode seeking and clustering consensus. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4819936 | - |
dc.identifier.uri | http://hdl.handle.net/10722/167212 | - |
dc.description.abstract | The task of multi-body motion segmentation refers to segmenting feature trajectories in a sequence of images according to their 3D motion affinity without knowing the number of motions in advance. It is critical for understanding and reconstructing a dynamic scene. This problem essentially consists of two subproblems, segmenting features and detecting the number of motions. While the state-of-the-art LBF algorithm achieves segmentation accuracy as high as 96.5%, it is still disturbed by a phenomenon called over-locality. A novel mode seeking algorithm with an adaptive distance measure is proposed to avoid this problem, and improves the accuracy to 98.1%. The LBF algorithm is incapable of detecting the number of motions itself. A randomized version of the mode seeking algorithm is presented, which could detect the number as well as preserve satisfactory segmentation accuracy. To detect the number of motions, a kernel optimization method locates it via kernel alignment. However, it suffers from over-locality and over-detects the number of motions. An intersection measure and two mutual information measures are presented to solve this problem. Using these measures, the proposed clustering consensus framework recasts the motion number detection problem to a clustering consensus problem. It extends the kernel optimization method from two-clustering consensus to multiple-clustering consensus. A large number of experiments and comparisons have been done, and convincing results are obtained. | - |
dc.language | eng | - |
dc.publisher | The University of Hong Kong (Pokfulam, Hong Kong) | - |
dc.relation.ispartof | HKU Theses Online (HKUTO) | - |
dc.rights | The author retains all proprietary rights, (such as patent rights) and the right to use in future works. | - |
dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
dc.source.uri | http://hub.hku.hk/bib/B48199369 | - |
dc.subject.lcsh | Computer vision. | - |
dc.subject.lcsh | Computer algorithms. | - |
dc.subject.lcsh | Cluster analysis. | - |
dc.title | Motion segmentation by adaptive mode seeking and clustering consensus | - |
dc.type | PG_Thesis | - |
dc.identifier.hkul | b4819936 | - |
dc.description.thesisname | Doctor of Philosophy | - |
dc.description.thesislevel | Doctoral | - |
dc.description.thesisdiscipline | Computer Science | - |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.5353/th_b4819936 | - |
dc.date.hkucongregation | 2012 | - |
dc.identifier.mmsid | 991033761389703414 | - |