Results 271 to 280 of about 4,480,200 (305)

On a fundamental property of the cross- Gramian matrix

IEEE Transactions on Circuits and Systems, 1984
Summary: The cross-Gramian matrix \(W_{c0}(T)\) for linear single-input single- output (SISO) dynamical systems has been related to the controllability and observability Gramians via \(W^ 2_{c0}(T)=W_ c(T)W_ 0(T)\) for \(T=\infty\). The result is now proved for any arbitrary time interval T, and is extended to symmetric multivariable systems which have
Fernando, K. V., Nicholson, H.
openaire   +1 more source

Highest Accuracy Fundamental Matrix Computation

2007
We compare algorithms for fundamental matrix computation, which we classify into "a posteriori correction", "internal access", and "external access". Doing experimental comparison, we show that the 7-parameter Levenberg-Marquardt (LM) search and the extended FNS (EFNS) exhibit the best performance and that additional bundle adjustment does not increase
Yasuyuki Sugaya, Ken-ichi Kanatani
openaire   +2 more sources

Discretization effects in the fundamental matrix computation

2012 19th IEEE International Conference on Image Processing, 2012
A polyhedron represents the solution set of an approximate system modeling the epipolar constraints. We introduce a new robust approach for the computation of the fundamental matrix taking into account the intrinsic errors involved in the discretization process.
openaire   +2 more sources

Case deletion for fundamental matrix computation

Proceedings of the 29th International Conference on Image and Vision Computing New Zealand, 2014
This paper reevaluates the case deletion algorithm for fundamental matrix computation and compares it against two RANSAC variants. The case deletion algorithm has several advantages for use in low-power devices in real-time applications including guaranteed time performance and excellent accuracy.
openaire   +1 more source

Randomized Acceleration of Fundamental Matrix Computations

2002
We accentuate the power of several known effective methods by combining them together and adding some novel techniques. As a result, we substantially improve the known record randomized bit-operation complexity estimates for various fundamental computations with integer matrices.
openaire   +2 more sources

Fundamental Matrix

2008
Shashi Shekhar, Hui Xiong
openaire   +1 more source

Fundamental fractional exponential matrix: New computational formulae and electrical applications

AEU - International Journal of Electronics and Communications, 2021
Zeyad Al-Zhour
exaly  

Kruppa's equations derived from the fundamental matrix

IEEE Transactions on Pattern Analysis and Machine Intelligence, 1997
R I Hartley
exaly  

Overall view regarding fundamental matrix estimation

Image and Vision Computing, 2003
J Salvi
exaly  

Estimating the fundamental matrix based on least absolute deviation

Neurocomputing, 2011
Yiguang Liu
exaly