Sciweavers

2239 search results - page 27 / 448
» Computing with abstract matrix structures
Sort
View
ACCV
2006
Springer
15 years 3 months ago
Multiple Similarities Based Kernel Subspace Learning for Image Classification
Abstract. In this paper, we propose a new method for image classification, in which matrix based kernel features are designed to capture the multiple similarities between images in...
Wang Yan, Qingshan Liu, Hanqing Lu, Songde Ma
AAAI
2004
15 years 1 months ago
Spatial Aggregation for Qualitative Assessment of Scientific Computations
Qualitative assessment of scientific computations is an emerging application area that applies a data-driven approach to characterize, at a high level, phenomena including conditi...
Chris Bailey-Kellogg, Naren Ramakrishnan
JCC
2010
105views more  JCC 2010»
14 years 10 months ago
Fast determination of the optimal rotational matrix for macromolecular superpositions
: Finding the rotational matrix that minimizes the sum of squared deviations between two vectors is an important problem in bioinformatics and crystallography. Traditional algorith...
Pu Liu, Dimitris K. Agrafiotis, Douglas L. Theobal...
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
15 years 3 months ago
Constructing Permutation Representations for Large Matrix Groups
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...
ICIP
2010
IEEE
14 years 9 months ago
Constructing a sparse convolution matrix for shift varying image restoration problems
Convolution operator is a linear operator characterized by a point spread functions (PSF). In classical image restoration problems, the blur is usually shift invariant and so the ...
Stanley H. Chan