TY - JOUR
AB - Distribution calibration plays an important role in cross-domain learning. However, existing distribution distance metrics are not geodesic; therefore, they cannot measure the intrinsic distance between two distributions. In this paper, we calibrate two distributions by using the geodesic distance in Riemannian symmetric space. Our method learns a latent subspace in the reproducing kernel Hilbert space, where the geodesic distance between the distribution of the source and the target domains is minimized. The corresponding geodesic distance is thus equivalent to the geodesic distance between two symmetric positive definite (SPD) matrices defined in the Riemannian symmetric space. These two SPD matrices parameterize the marginal distributions of the source and target domains in the latent subspace. We carefully design an evolutionary algorithm to find a local optimal solution that minimizes this geodesic distance. Empirical studies on face recognition, text categorization, and web image annotation suggest the effectiveness of the proposed scheme. © 2011 IEEE.
AU - Si, S
AU - Liu, W
AU - Tao, D
AU - Chan, KP
DA - 2011/08/01
DO - 10.1109/TSMCB.2010.2100042
EP - 930
JO - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
PY - 2011/08/01
SP - 921
TI - Distribution calibration in Riemannian symmetric space
VL - 41
Y1 - 2011/08/01
Y2 - 2019/07/24
ER -