Consider real reductive group G, as defined in [Wal88]. Let Π be an irreducible admissible representation of G with the distribution character ΘΠ, [Har51]. Denote by uΠ the lowest term in the asymptotic expansion of ΘΠ, [BV80]. This is a finite linear combination of Fourier transforms of nilpotent coadjoint orbits, uΠ = ∑ O cOμ̂O. As shown by Rossmann, [Ros95], the closure of the union of the ni...

Mansir Abdulrahman1, Mousnad Mohamed Awad1, Asma Noureldaim Ahmad1 and Ahmed El Sayed2 Author informationArticle notesCopyright License information 1Department of Pharmacy Practice, Faculty Pharmacy, International University Africa, Khartoum, SUDAN 2Department Surgery, Alzaeim Alazhari University, Khartoum North, Corresponding author. Correspondence: Dr. Awad Department

Received August 5, 2002, from Sonoscan Ultrasonic Scan Centre (S.B.V.) and private practice, pediatric surgery (V.R.R.), Coimbatore, India; and private practice, radiology (S.K.M.), and Kumarakriba Clinic (K.M.), Pollachi, India. Manuscript accepted for publication August 7, 2002. Address correspondence and reprint requests to S. Boopathy Vijayaraghavan, MD, DMRD, 16 B Venkatachalam Rd, R. S. P...

Many algorithms for the computation of correspondences between deformable shapes rely on some variant of nearest neighbor matching in a descriptor space. Such are, for example, various point-wise correspondence recovery algorithms used as a postprocessing stage in the functional correspondence framework. In this paper, we show that such frequently used techniques in practice suffer from lack of...