One-sided Radial-Fundamental Matrix Estimation

For modern consumer cameras often approximate calibration data is available, making applications such as 3D reconstruction or photo registration easier as compared to the pure uncalibrated setting. In this paper we address the setting with calibrateduncalibrated image pairs: for one image intrinsic parameters are assumed to be known, whereas the second view has unknown distortion and calibration parameters. This situation arises e.g. when one would like to register archive imagery to recently taken photos. A commonly adopted strategy for determining epipolar geometry is based on feature matching and minimal solvers inside a RANSAC framework. However, only very few existing solutions apply to the calibrated-uncalibrated setting. We propose a simple and numerically stable two-step scheme to first estimate radial distortion parameters and subsequently the focal length using novel solvers. We demonstrate the performance on synthetic and real datasets.

The influence of matrix mediated hopping conductivity, filler concentration, aspect ratio and orientation on the electrical response of carbon nanotube/polymer nanocomposites

A model to simulate the conductivity of carbon nanotube/polymer nanocomposites is presented. The proposed model is based on hopping between the fillers. A parameter related to the influence of the matrix in the overall composite conductivity is defined. It is demonstrated that increasing the aspect ratio of the fillers will increase the conductivity. Finally, it is demonstrated that the alignment of the filler rods parallel to the measurement direction results in higher conductivity values, in agreement with results from recent experimental work.

Eigenvalue computations in the context of data-sparse approximations of integral operators

In this work, we consider the numerical solution of a large eigenvalue problem resulting from a finite rank discretization of an integral operator. We are interested in computing a few eigenpairs, with an iterative method, so a matrix representation that allows for fast matrix-vector products is required. Hierarchical matrices are appropriate for this setting, and also provide cheap LU decompositions required in the spectral transformation technique. We illustrate the use of freely available software tools to address the problem, in particular SLEPc for the eigensolvers and HLib for the construction of H-matrices. The numerical tests are performed using an astrophysics application. Results show the benefits of the data-sparse representation compared to standard storage schemes, in terms of computational cost as well as memory requirements.