Further results on the subspace distance
β Scribed by Xichen Sun; Liwei Wang; Jufu Feng
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 145 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
β¦ Synopsis
In previous papers [L. Wang, X. Wang, J. Feng, Subspace distance analysis with application to adaptive Bayesian algorithm for face recognition, Pattern Recognition 39(3) ( 2006) 456-464, L. Wang, X. Wang, J. Feng, Intrapersonal subspace analysis with application to adaptive Bayesian algorithm for face recognition, Pattern Recognition 38(4) (2005) 617-621], we proposed a subspace distance. However, whether the subspace distance satisfies the triangle inequality was left open. In this note, we give positive answer to the open problem and prove our assertion.
π SIMILAR VOLUMES
Further contributions are given to the problem of synthesizing an insensitivity generating control law for a linear system. The results refer to the possibility of achieving trajectory insensitivity for any given subspace of initial conditions without modifying the state controllability subspace of
For ( p -2) (r-2)-=0 andB any n-dimensional subspaw of an Lppace, the BANAVH-MAWR distance from Z : to E' is at most cn"(1og n)P, where ct is the natural exponent a --I 1 1 1 =mas { -i. 1 , -I ) and fi depends on p nud r. 'For E and F normed spaces the BANACH-MAZUR distance from E to F is defined t