Sciweavers

42 search results - page 3 / 9
» Computing Characteristic Polynomials from Eigenvalues
Sort
View
ICIP
1998
IEEE
14 years 9 months ago
Generalized Hermite Polynomials for Image Reconstruction from Zero Crossing Contours
Generalized Hermite polynomials in two variables are employed for the reconstruction of images from a knowledge of their zero crossing contours. The problem of reconstruction of s...
Y. V. Venkatesh
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 2 months ago
The power and Arnoldi methods in an algebra of circulants
Circulant matrices play a central role in a recently proposed formulation of three-way data computations. In this setting, a three-way table corresponds to a matrix where each “...
David F. Gleich, Chen Greif, James M. Varah
ECCC
1998
117views more  ECCC 1998»
13 years 7 months ago
Determinant: Old Algorithms, New Insights
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
Meena Mahajan, V. Vinay
ICPR
2008
IEEE
14 years 1 months ago
Pattern vectors from the Ihara zeta function
This paper shows how to construct pattern vectors from the Ihara zeta function for the purposes of characterizing graph structures. To avoid the risk of sampling the meaningless i...
Peng Ren, Richard C. Wilson, Edwin R. Hancock
ICPR
2008
IEEE
14 years 1 months ago
Object recognition using graph spectral invariants
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
Bai Xiao, Richard C. Wilson, Edwin R. Hancock