Sciweavers

122 search results - page 12 / 25
» Fast matrix multiplication is stable
Sort
View
ISCAS
2007
IEEE
95views Hardware» more  ISCAS 2007»
14 years 2 months ago
A Universal Approach to Developing Fast Algorithm for Simplified Order-16 ICT
—Simplified order-16 Integer Cosine Transform (ICT) has been proved to be an efficient coding tool especially for High-Definition (HD) video coding and is much simpler than ICT a...
Jie Dong, King Ngi Ngan, Chi-Keung Fong, Wai-kuen ...
CVPR
2008
IEEE
14 years 3 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie
ISBI
2008
IEEE
14 years 9 months ago
Fast no ground truth image registration accuracy evaluation: Comparison of bootstrap and Hessian approaches
Image registration algorithms provide a displacement field between two images. We consider the problem of estimating accuracy of the calculated displacement field from the input i...
Jan Kybic
AVSS
2008
IEEE
14 years 3 months ago
A Fast Linear Registration Framework for Multi-camera GIS Coordination
We propose a novel registration framework to map the field-of-coverage of pan-tilt cameras to a GIS (Geographic Information System) planar coordinate system. The camera’s fiel...
Karthik Sankaranarayanan, James W. Davis
AMC
2007
90views more  AMC 2007»
13 years 8 months ago
Computing the square roots of matrices with central symmetry
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
Zhongyun Liu, Yulin Zhang, Rui Ralha