Methods from the representation theory of finite groups are used to construct efficient processing methods for the special geometries related to the finite subgroups of the rotation group. We motivate the use of these subgroups in computer vision, summarize the necessary facts from the representation theory and develop the basics of Fourier theory for these geometries. We illustrate its usage for data compression in applications where the processes are (on average) symmetrical with respect to these groups. We use the icosahedral group as an example since it is the largest finite subgroup of the 3D rotation group. Other subgroups with fewer group elements can be studied in exactly the same way.
Crystal Vision-Applications of Point Groups in Computer Vision
Asian Conference on Computer Vision ; 2007 ; Tokyo, Japan November 18, 2007 - November 22, 2007
01.01.2007
10 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Irreducible Representation , Computer Vision , Point Group , Projection Matrice , Representation Theory Pattern Recognition , Artificial Intelligence , Algorithm Analysis and Problem Complexity , Computer Science , Biometrics , Image Processing and Computer Vision , Computer Imaging, Vision, Pattern Recognition and Graphics
Emerging applications of computer vision
TIBKAT | 1997
|Computer vision applications - Special issue
British Library Online Contents | 2007
|Security applications of computer vision
IEEE | 1999
|Multimedia Applications of Computer Vision
British Library Conference Proceedings | 1998
|Detecting Point Merge patterns using computer vision
AIAA | 2021
|