Filtyp
Boundary detection is a fundamental computer vision problem that is essential for a variety of tasks, such as contour and region segmentation, symmetry detection and object recognition and categorization. We propose a generalized formulation for boundary detection, with closed-form solution, applicable to the localization of different types of boundaries, such as object edges in natural images and
The Intermediate Data Structure (IDS) is a standardised database structure for longitudinal historical databases. Such a common structure facilitates data sharing and comparative research. In this study, we propose an extended version of IDS, named IDS-Geo, that also includes geographic data. The geographic data that will be stored in IDS-Geo are primarily buildings and/or property units, and the
This work presents a study of sensor network calibration from time-difference-of-arrival (TDOA) measurements for cases when the dimensions spanned by the receivers and the transmitters differ. This could for example be if receivers are restricted to a line or plane or if the transmitting objects are moving linearly in space. Such calibration arises in several applications such as calibration of (a
The ability to quickly acquire 3D models is an essential capability needed in many disciplines including robotics, computer vision, geodesy, and architecture. In this paper we present a novel method for real-time camera tracking and 3D reconstruction of static indoor environments using an RGB-D sensor. We show that by representing the geometry with a signed distance function (SDF), the camera pose
This paper presents a complete characterization and solution to microphone position self-calibration problem for time-of-arrival (TOA) measurements. This is the problem of determining the positions of receivers and transmitters given all receiver-transmitter distances. Such calibration problems arise in application such as calibration of radio antenna networks, audio or ultra-sound arrays and WiFi
Measurements with unknown time delays are common in different applications such as microphone array, radio antenna array calibration, where the sources (e.g. sounds) are transmitted in unknown time instants. In this paper, we present a method for estimating unknown time delays from Time-Difference-of-Arrival (TDOA) measurements. We propose a novel rank constraint on a matrix depending on the measu
The problem of fitting models to measured data has been studied extensively, not least in the field of computer vision. A central problem in this field is the difficulty in reliably find corresponding structures and points in different images, resulting in outlier data. This thesis presents theoretical results improving the understanding of the connection between model parameter estimation and pos
In this thesis some research questions regarding durability and quality of roads has been investigated. The questions are analyzed from an image analysis point of view and aims to be a complement to existing methods for analyzing asphalt. One important factor for the durability of the asphalt layer on roads is the affinity between the stones in the asphalt and the binder that holds the stones tog
Recent work on geometric vision problems has exploited convexity properties in order to obtain globally optimal solutions. In this paper we give an overview of these developments and show the tight connections between different types of convexity and optimality conditions for a large class of multiview geometry problems. We also show how the convexity properties are closely linked to different typ
Graph cuts methods are at the core of many state-of-the-art algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve the maximum flow/minimum cut problem in parallel by splitting the graph into multiple parts and hence, further increase the computational efficacy of graph cuts. Optimality of the solution is guaranteed by dual decomposit
In this paper, we study minimal problems related to dual microphone rig self-calibration using TOA measurements from sound sources with unknown positions. We consider the problems with varying setups as (i) if the internal distances between the microphone nodes are known a priori or not. (ii) if the microphone rigs lies in an affine space with different dimension than the sound sources. Solving th
Energies with high-order non-submodular interactions have been shown to be very useful in vision due to their high modeling power. Optimization of such energies, however, is generally NP-hard. A naive approach that works for small problem instances is exhaustive search, that is, enumera- tion of all possible labelings of the underlying graph. We propose a general minimization approach for large gr
The estimation of three-dimensional position information from two-dimensional images in computer vision systems can be formulated as a state estimation problem for a nonlinear perspective dynamic system. The multi-output state estimation problem has been treated by several authors using methods for nonlinear observer design. This paper shows that a perspective system can be transformed to two obse
This thesis concerns ego-motion and pose estimation of a single camera under the assumptions of planar motion and constant internal camera parameters. Planar motion is common for cameras mounted onto mobile robots, particularly in indoor scenarios, as they remain at a constant height above the ground plane. In Paper A, a parametrisation of the camera motion and pose is presented, along with an ite
Is the real problem in finding the relative orientation of two viewpoints the correspondence problem? We argue that this is only one difficulty. Even with known correspondences, popular methods like the eight point algorithm and minimal solvers may break down due to planar scenes or small relative motions. In this paper, we derive a simple, brute-force algorithm which is both robust to outliers an
This paper is concerned with model fitting in the presence of noise and outliers. Previously it has been shown that the number of outliers can be minimized with polynomial complexity in the number of measurements. This paper improves on these results in two ways. First, it is shown that for a large class of problems, the statistically more desirable truncated L-2-norm can be optimized with the sam
