17 citations found. Retrieving documents...
J. A. Gallian, Contemporary Abstract Algebra. Narosa Publishing House, ISBN 81 -- 7319 -- 077 - 1, pp. 8-13, 1999.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Facial Asymmetry Quantification for Expression Invariant.. - Liu, Schmidt, Cohn (2002)   (2 citations)  (Correct)

....forces C 1 ; C 2 to be bilaterally symmetrical with respect to the face midline. This step is equivalent to reorienting the anatomical face midline by an ane transformation. In general, ane transformation may fail to preserve Euclidean distance upon which de nitions of symmetry are based [10]. However, as in the case of skewed symmetry [14] the relative distances of corresponding points with respect to their midpoint remain intact before and after skewing. Alternatively, one could normalize face images for facial asymmetry computation without skewing. The three facial feature points ....

J. A. Gallian. Contemporary Abstract Algebra. D.C. Heath and Company, Lexington,MA, 1986.


Skewed Symmetry Groups - Liu, Collins (2001)   (2 citations)  (Correct)

.... groups for all possible periodic patterns in dimension n [1] There are seven frieze groups [23] for 2D patterns repeated along one dimension, seventeen wallpaper groups [21] for patterns extended by two linearly independent translational generators, and 230 space groups (regular crystals) [9, 6] extended by three linearly independent translations. The mathematics of these Crystallographic groups or discrete groups [5] has been used extensively in physics, chemistry, and the arts [8, 22, 28] However, the application of these classic results to periodic pattern analysis in computer vision ....

....manipulation related research, where only rigid transformations are considered, we have shown (Proposition 3.3. 1 [16] Proposition: If G is a symmetry group of P and A is a rigid transformation, then AGA 1 is the symmetry group of A(P ) Here, AGA 1 is a conjugation of group G via A [6]. When A is a rigid transformation or a uniform scaling, there exists a bijection between the original symmetry group and the conjugated symmetry group, and G and AGA 1 are considered equivalent (isomorphic) When a periodic pattern undergoes non rigid transformations (other than uniform ....

J. A. Gallian. Contemporary Abstract Algebra. D.C. Heath and Company, 1986.


Computational Symmetry - Liu (2000)   (Correct)

.... monochrome planar periodic patterns, there are seven frieze groups [12, 33] for 2D patterns repeated along one dimension (strip patterns) seventeen wallpaper groups [30] describing patterns extended by two linearly independent translational generators (wallpaper patterns) and 230 space groups [11, 6] extended by three linearly independent translations (regular crystal patterns) It is the goal of this research to construct a computational model for periodic pattern perception and analysis based on the theory of crystallographic groups. Given the digital form of a periodic pattern, a computer ....

J. A. Gallian. Contemporary Abstract Algebra. D.C. Heath and Company, 1986.


A Finite Element Approach To Local Nonlinear Image Restoration - Veldhuizen, Jernigan   (Correct)

....the 8 orientations of a 3x3 window which should be treated as equivalent (for the purpose of restoring the central pixel) These symmetries are described by the dihedral group of order 8, which is given the symbol D4 . This group corresponds to the symmetries of a rigid square in the plane [4]. Applying this group to the local 3x3 window results in a permutation group on the symbols x1 ; x2 ; x9 . Polynomial and finite element bases can then be constructed which are invariant under the permutation group. The construction is straightforward but too lengthy to describe here. ....

Joseph A. Gallian. Contemporary Abstract Algebra. D. C. Heath and Company, Toronto, 3rd edition, 1994.


Grid Filters for Local Nonlinear Image Restoration - Veldhuizen (1998)   (1 citation)  (Correct)

....be processed the same as an edge running left and right. Figure 2. 15 illustrates the 8 orientations of a 3x3 window which should be treated as equivalent (for the purpose of restoring the central pixel) Working with this type of symmetry is greatly simplified by some rudimentary group theory[40]. A group is a set together with a binary operation which maps ordered pairs of elements (a; b) to another element, denoted ab. Simple examples of groups are: the integers under addition; nonsingular real matrices under the matrix product; and real functions under pointwise addition. There are ....

Joseph A. Gallian. Contemporary Abstract Algebra. D. C. Heath and Company, Toronto, 3rd edition, 1994.


Frieze and Wallpaper Symmetry Groups Classification under.. - Liu, Collins (1998)   (Correct)

....object recognition, and motion recovery. This is a report of an on going research effort. Existing prbolems and future work are discussed. 1 Motivation Any subset S of the Euclidean space R n is associated with a symmetry group all the rigid transformations that keep S setwise invariant [2, 9, 21]. A symmetry group is thus one of the important descriptors of any geometric entity. In particular, the symmetry group of a repeated pattern in a plane belongs to a finite possible set. These are the seven Frieze groups [14, 29] for 2D patterns repeated along one dimension, and the seventeen ....

J. A. Gallian. Contemporary Abstract Algebra. D.C. Heath and Company, 1986.


Frieze and Wallpaper Symmetry Groups Classification under.. - Liu, Collins (1998)   (Correct)

....object recognition, and motion recovery. This is a report of an on going research effort. Existing prbolems and future work are discussed. 1 Motivation Any subset S of the Euclidean space R n is associated with a symmetry group all the rigid transformations that keep S setwise invariant [2, 9, 21]. A symmetry group is thus one of the important descriptors of any geometric entity. In particular, the symmetry group of a repeated pattern in a plane belongs to a finite possible set. These are the seven Frieze groups [14, 29] for 2D patterns repeated along one dimension, and the seventeen ....

J. A. Gallian. Contemporary Abstract Algebra. D.C. Heath and Company, 1986.


Frieze and Wallpaper Symmetry Groups Classification under.. - Liu, Collins (1998)   (Correct)

....object recognition, and motion recovery. This is a report of an on going research effort. Existing prbolems and future work are discussed. 1 Motivation Any subset S of the Euclidean space R n is associated with a symmetry group all the rigid transformations that keep S setwise invariant [2, 9, 21]. A symmetry group is thus one of the important descriptors of any geometric entity. In particular, the symmetry group of a repeated pattern in a plane belongs to a finite possible set. These are the seven Frieze groups [14, 29] for 2D patterns repeated along one dimension, and the seventeen ....

J. A. Gallian. Contemporary Abstract Algebra. D.C. Heath and Company, 1986.


The Construction Of Geometric Threshold Schemes With Projective.. - Holder   (Correct)

....of 0 and a line L of Pi. Then 0 is called a subplane of Pi [1] P p W Figure 4.1. Subplane of a Projective Plane Since we are dealing with projective planes that are constructed over finite fields we have the following useful theorem pertaining to subfields of finite fields. Theorem. [5] For each divisor m of n, GF(p n ) has a unique subfield of order p m . Moreover, these are the only subfields of GF(p n ) 4.1 Even Characteristic Preamble One of the properties fundamental to the previous construction, with q odd, is the existence of conjugate pairs of points on an ....

J. A. Gallian, Contemporary Abstract Algebra, D.C. Heath and Company, 1990.


A Distributed Implementation of the Land-Use Change Analysis.. - Hazen (1995)   (1 citation)  (Correct)

....by the GFSR and therefore is just as fast, if not faster than LCGs. It also requires careful initialization of the vector before generating new random numbers. Kirkpatrick and Stoll presented a specific implementation of the generator described by y For more information about Galois Fields, see [Gal90] Equation 3.6 (denoted R250) using q = 103 and p = 250 [KS81] In 1994 Carter created a C class library [Car94] of R250 z which uses Park and Miller s minimal standard LCG to initialize the R250 s bit vector. LUCAS uses Carter s C implementation of R250 as its RNG. It has an extremely ....

J. A. Gallian. Contemporary Abstract Algebra, chapter 24, page 310. D. C. Heath and Co., Lexington, MA, 1990. Galois Field of order 2.


A Decision Procedure for Bit-Vector Arithmetic - Barrett, Dill, Levitt (1998)   (17 citations)  (Correct)

....[m] d0 Delta w0 [m 0 ] n] Delta Delta Delta d j Delta w j [m j ] Now, we must eliminate c in order to isolate z. If c is odd, we can do this by finding its multiplicative inverse, which is c 2 k Gamma1 for some k n Gamma 2. We explain briefly why this is true. It is well known [7] that the set of all positive integers less than and relatively prime to some positive integer p forms a group under multiplication modulo p, denoted U(p) In particular, when p = 2 n , every odd positive integer less than p is in U(p) Furthermore, U(2 n ) is isomorphic to the (external) ....

Joseph A. Gallian. Contemporary Abstract Algebra. D. C. Heath and Company, second edition, 1990.


Advisors: Dr. Robert Militello and Dr. Terri Lindquester 10 May.. - Er May   (Correct)

....proof gives that a cyclic group is Abelian. Applying the method of partitions in the last section, we see right away that groups of prime order are unique: there exists only one nonisomorphic group of any prime order (this result holds in general for cyclic groups of any order see Chapter 4 in [Ga]) Thus, in our modest program of classification, we have classified orders 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, and 31. Since jZ p j = p, p prime, all groups of order p are isomorphic to the cyclic group Z p of integers under modulo p arithmetic. Thus we can represent the cyclic subgroups of the ....

J. A. Gallian, Contemporary Abstract Algebra, 2nd. ed., D.C. Heath and Company, Lexington, MA, 1990.


The Design of the Land-Use Change Analysis System (LUCAS).. - Hazen, Berry (1995)   (Correct)

.... of bits) is equivalent to x k = c 1 x k Gamma1 Phi c 2 x k Gamma2 Phi : Phi c p Gamma1 x k Gammap 1 Phi x k Gammap : 5) Using primitive trinomials, 1 x q x p , p q, Equation (5) reduces to x k =x k Gammaq Phi x k Gammap : 6) 3 For more information about Galois Fields, see [10]. This requires only one XOR operation and some address calculations for each integer generated by the GFSR and therefore is just as fast, if not faster than LCGs. It also requires careful initialization of the vector before generating new random numbers. Kirkpatrick and Stoll presented a ....

J. A. Gallian. Contemporary Abstract Algebra, chapter 24, page 310. D. C. Heath and Co., Lexington, MA, 1990. Galois Field of order 2.


A New Remote User Authentication Scheme Using Smart Cards - Kumar (2004)   (1 citation)  (Correct)

No context found.

J. A. Gallian, Contemporary Abstract Algebra. Narosa Publishing House, ISBN 81 -- 7319 -- 077 - 1, pp. 8-13, 1999.


A Computational Model for Periodic Pattern Perception Based .. - Liu, Collins, Tsin (2004)   (2 citations)  (Correct)

No context found.

J.A. Gallian, Contemporary Abstract Algebra. Lexington, Mass.: D.C. Heath and Company, 1986.


High Performance Elliptic Curve Cryptographic Co-processor - Lutz (2003)   (Correct)

No context found.

Joseph A. Gallian. Contemporary Abstract Algebra. Houghton Mi#in Company, 1998.


Attacks on the RSA Cryptosystem and Some of Its Instances - Cosi Vinhthuy Phan   (Correct)

No context found.

J. A. Gallian, Contemporary Abstract Algebra, 2nd. Edition, D. C. Health and Company, 1990.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC