Results 1  10
of
3,891
Multiple invariance ESPRIT
 IEEE Trans. Signal Process. 1992
"... A h t r n c f ESPRIT is a recently developed technique for highresolution signal parameter estimation. For the specific problem of directionofarrival (DOA) estimation, a decrease in computational complexity of orders of magnitude over other highresolution methods is achieved by exploiting an ..."
Abstract

Cited by 34 (7 self)
 Add to MetaCart
naturally arises. In this paper, ESPRlT is extended to address the problem of exploiting all the invariances siniultaireously. The nonlinear multiple invariance ESPRIT algorithm is derived and compared via simulation to various standard ESPR/r solutions possible for arrays with multiple invariances. I.
Multiplicative Invariants and Semigroup Algebras
, 2001
"... Abstract. Let G be a finite group acting by automorphism on a lattice A, and hence on the group algebra S = k [A]. The algebra of Ginvariants in S is called an algebra of multiplicative invariants. We present an explicit version of a result of Farkas stating that multiplicative invariants of finit ..."
Abstract
 Add to MetaCart
Abstract. Let G be a finite group acting by automorphism on a lattice A, and hence on the group algebra S = k [A]. The algebra of Ginvariants in S is called an algebra of multiplicative invariants. We present an explicit version of a result of Farkas stating that multiplicative invariants
Class Groups of Multiplicative Invariants
"... . Let G be a finite subgroup of GL d (Z). Then G acts on the Laurent polynomial ring k[X \Sigma1 1 ; : : : ; X \Sigma1 d ] over the field k via the natural Gaction on the multiplicative group generated by the variables X 1 ; : : : ; X d ( = Z d ). We show that the class group of the ring of ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
. Let G be a finite subgroup of GL d (Z). Then G acts on the Laurent polynomial ring k[X \Sigma1 1 ; : : : ; X \Sigma1 d ] over the field k via the natural Gaction on the multiplicative group generated by the variables X 1 ; : : : ; X d ( = Z d ). We show that the class group of the ring
Object Recognition from Local ScaleInvariant Features
"... An object recognition system has been developed that uses a new class of local image features. The features are invariant to image scaling, translation, and rotation, and partially invariant to illumination changes and affine or 3D projection. These features share similar properties with neurons in ..."
Abstract

Cited by 2739 (13 self)
 Add to MetaCart
An object recognition system has been developed that uses a new class of local image features. The features are invariant to image scaling, translation, and rotation, and partially invariant to illumination changes and affine or 3D projection. These features share similar properties with neurons
Picard groups of multiplicative invariants
, 1997
"... Abstract. Let S = kA denote the group algebra of a finitely generated free abelian group A over the field k and let G be a finite subgroup of GL(A). Then G acts on S by means of the unique extension of the natural GL(A)action on A. We determine the Picard group Pic R of the algebra of invariants R ..."
Abstract
 Add to MetaCart
Abstract. Let S = kA denote the group algebra of a finitely generated free abelian group A over the field k and let G be a finite subgroup of GL(A). Then G acts on S by means of the unique extension of the natural GL(A)action on A. We determine the Picard group Pic R of the algebra of invariants
SAGBI bases in rings of multiplicative invariants
 Comment. Math. Helv
"... Abstract. Let k be a field and G be a finite subgroup of GLn(Z). We show that the ring of multiplicative invariants k[x±11,..., x ±1 n] G has a finite SAGBI basis if and only if G is generated by reflections. 1. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. Let k be a field and G be a finite subgroup of GLn(Z). We show that the ring of multiplicative invariants k[x±11,..., x ±1 n] G has a finite SAGBI basis if and only if G is generated by reflections. 1.
Multiresolution grayscale and rotation invariant texture classification with local binary patterns
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2002
"... This paper presents a theoretically very simple, yet efficient, multiresolution approach to grayscale and rotation invariant texture classification based on local binary patterns and nonparametric discrimination of sample and prototype distributions. The method is based on recognizing that certain ..."
Abstract

Cited by 1299 (39 self)
 Add to MetaCart
;uniform" patterns for any quantization of the angular space and for any spatial resolution and presents a method for combining multiple operators for multiresolution analysis. The proposed approach is very robust in terms of grayscale variations since the operator is, by definition, invariant against any monotonic
Gambling Systems and MultiplicationInvariant Measures
, 1997
"... Introduction. This short paper describes a surprising connection between two previously unrelated topics: the probability of winning certain gambling games, and the invariance of certain measures under pointwise multiplication on the circle. The former has been wellstudied by probabilists, notably ..."
Abstract
 Add to MetaCart
Introduction. This short paper describes a surprising connection between two previously unrelated topics: the probability of winning certain gambling games, and the invariance of certain measures under pointwise multiplication on the circle. The former has been wellstudied by probabilists
Results 1  10
of
3,891