Polar decomposition unquestionably provides a notion of factorization in the category of Hilbert spaces. But it does not fit existing categorical notions, mainly because its factors are not closed under composition. We observe that the factors are images of functors. This leads us to consider notions of factorization that emphasize reconstruction of the composite category from the factors. We f...

The different orthogonal relationship that exists in the Löwdin orthogonalizat ions is presented. Other orthogonalizat ion techniques such as polar decomposition (PD), principal component analysis (PCA) and reduced singular value decomposition (SVD) can be derived from Löwdin methods. It is analytically shown that the polar decomposition is presented in the symmetric o rthogonalization; princip...

The polar decomposition of a square matrix has been generalized by several authors to scalar products on Rn or Cn given by a bilinear or sesquilinear form. Previous work has focused mainly on the case of square matrices, sometimes with the assumption of a Hermitian scalar product. We introduce the canonical generalized polar decomposition A = WS, defined for general m × n matrices A, where W is...

In this note we point out the relation between Brion’s formula for the lattice point generating function of a convex polytope in terms of the vertex cones [Bri88] on the one hand, and the polar decomposition à la Lawrence/Varchenko [Law91a, Var87] on the other. We then go on to prove a version of polar decomposition for non-simple polytopes.

General 3×3 linear or 4×4 homogenous matrices can be formed by composing primitive matrices for translation, rotation, scale, shear, and perspective. Current 3-D computer graphics systems manipulate and interpolate parametric forms of these primitives to generate scenes and motion. For this and other reasons, decomposing a composite matrix in a meaningful way has been a longstanding challenge. ...

Classical discrete wavelet packet transforms are sensitive to changes in image orientation and translation. Therefore, it is hardly possible to extract rotation invariant features from images in the transform domain. This paper proposes several algorithms for invariant discrete wavelet decomposition to produce an invariant representation for an image. The procedure can be divided into several s...