obtain the subspace in each view. Then, we derive an
alternating optimization [16]-based iterative algorithm to
obtain the optimal low-dimensional subspace from
multiple views. Finally, in this subspace, the Euclidean
distance can be directly used to measure the dissimilarity
between two cartoon characters, and the cartoon character
retrieval and clip synthesis can be conducted accordingly.