This paper presents an approach to process raw lidar 3-D point clouds over urban area and extract terrain, buildings and other urban features. In the initial step, “non-ground points” are separated from ground points using a one dimensional filtering process based on the slope between two consecutive points in the point cloud and the terrain elevation in the vicinity of the points. In the next ...

The paper presents a technique suitable in robot vision applications where it is not possible to establish the object position from one view. Usually, one view pose calculation methods are based on the correspondence of image features established at a training step and exactly the same image features extracted at the execution step, for a different object pose. When such a correspondence is not...

Standard structure from motion algorithms recover 3D structure of points. If a surface representation is desired, for example a piece-wise planar representation, then a two-step procedure typically follows: in the first step the plane-membership of points is first determined manually, and in a subsequent step planes are fitted to the sets of points thus determined, and their parameters are reco...

We present an automatic method for the generation of surface triangulations from sets of scattered points. Given a set of scattered points in three-dimensional space, without connectivity information, our method reconstructs a triangulated surface model in a two-step procedure. First, we apply an adaptive clustering technique to the given set of points, identifying point subsets in regions that...

Parametric geocoding is a standard procedure for orthorectification of hyperspectral airborne scanner data. Boresight parameters are estimated by using the image coordinates of precisely known ground reference points. To fully automate the processing of the recorded hyperspectral data ground reference points should be selected and matched by an algorithm without user interaction. In this articl...

In this paper, we consider the construction of a new class of numerical methods based on the backward differentiation formulas (BDFs) that be equipped by including two off--step points. We represent these methods from general linear methods (GLMs) point of view which provides an easy process to improve their stability properties and implementation in a variable stepsize mode. These superioritie...

The existence of coincidence points and common fixed points for operators satisfying a Presić-Kannan type contraction condition in a metric spaces setting is proved. A multi-step iterative method for constructing the common fixed points is also provided.

in this paper an efficient three- stage algorithm is developed for software production cost and time estimation. first stage includes a hybrid model composed of cocomo and function points methods to increase estimation accuracy. second stage encompasses paired comparisons matrix of analytical hierarchy process to determine amount of any resources consumed in each step of software production by ...