This thesis presents an implementation of a stereo vision system, using image processing techniques to determine depth information from pairs of stereo images. This system, which aims to aid vehicle reversal, involves working with stereo images of different vehicles, and the distance between the stereo cameras and the target vehicle is determined. For a pair of stereo images, the system algorit...

ELECT Precise estimation of inter-sensor distances is essential for reliable localisation in Internet of Things sensor networks. A cost-effective, scalable, asynchronous solution to estimate inter-sensor distances based solely on measurements of distances to a moving object is proposed. More specifically, the proposed solution estimates uncharted distances using trigonometry and processes these...

A common model for computing the similarity of two strings X and Y of lengths m, and n respectively with m n, is to transform X into Y through a sequence of edit operations which are of three types: insertion, deletion, and substitution of symbols. The model assumes a given weight function which assigns a non-negative real cost to each of these edit operations. The amortized weight for a given ...

Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarity of attributed graphs in an error-tolerant way. The key idea is to model graph variations by structural distortion operations. As one of its main constraints, however, the edit distance requires the adequate definitio...

We address the Monge problem in metric spaces with a geodesic distance: (X, d) is a Polish space and dL is a geodesic Borel distance which makes (X, dL) a non branching geodesic space. We show that under the assumption that geodesics are d-continuous and locally compact, we can reduce the transport problem to 1-dimensional transport problems along geodesics. We introduce two assumptions on the ...

This article may be used for research, teaching and private study purposes. Any substantial or systematic reproduction, redistribution , reselling , loan, sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...

Huge and expensive computation resources are usually required to perform graph labelling at high speed. This fact restricts an extensive use of this methodology in industrial applications such as visual inspection. A new systolic architecture is presented which computes structural distances between cliques of different graphs based on a modified incremental Levenshtein distance algorithm. The d...

information on the productivity, costs and applications of the logging system is a key component in the evaluation of management plans for the rehabilitation and utilization of caspian forests. skidding and road construction costs are expensive forest operations. determining the optimum forest road network density is one of the most important factors in sustainable forest management. logging me...

In many applied programs in real-life problems, both physical inputs and outputsare heterogeneous which in this case the ecient cost and income modelcan not apply to evaluate the cost and income of related turnover. So, a measurementbased on the directional value of prot was presented which we havedeveloped it in this paper and have computed it for interval data. In fact, wehave measured the in...

This paper presents a method for identifying those parts in a database that are similar to a given query part to be machined and hence can be potentially used as a basis for estimating the machining cost of the query part. We utilize projected feature vectors consisting of feature access directions, feature types, and feature volumes as a basis for assessing shape similarity. We have defined a ...