Marker-free Automatic Matching of Range Data

نویسندگان

  • Rui Liu
  • Gerd Hirzinger
چکیده

Matching of multiple views is often addressed in 3D-model generation and is normally a two-stage process consisting of a coarse and a fine matching stage. Coarse matching, that is the pre-alignment of the surfaces for the complex forms, which can be positioned far away from each other in 3D space, is a difficult problem to solve. Fine matching on the other hand can be performed accurately using either the ICP (iterative closest point) method or the least square surface matching method. Nevertheless, ICP involves an iterative solution which consumes much computing time, and it requires models with a considerable degree of overlap at the starting position. This is because it treats the closest point in the other model as the corresponding point and updates the corresponding relationship in each iterative step. If the models have insufficient overlap, ICP will converge to a false result. Consequently, a good coarse matching is a precondition for a successful ICP. The other matching method least square surface matching needs a prealigned corresponding relationship between the surfaces of complex objects, exactly the task of the coarse matching process. This paper presents a novel algorithm to perform coarse matching with an innovative data structure, a “matching tree”, which is a combination of an interpretation tree and a bipartite matching graph. The whole systematic process can be divided into three steps: firstly, it performs segmentation of the laser range scan data according to the geometric characteristics; secondly, a coarse matching is conducted to solve the pre-alignment problem; and finally, an efficient fine matching aligns the models accurately. The coarse matching is not affected by the position of the models, because it is generated from a matching tree using invariant relationships from the models themselves. This method is particularly suitable for laser range scan point cloud matching of rooms during the reconstruction of historic buildings, since it requires neither GPS nor wall markings. Experiments have been performed based on reconstructing King Ludwig II ’s working room in the real Neuschwanstein Castle and the carnival model of Neuschwanstein Castle.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fractured Reservoirs History Matching based on Proxy Model and Intelligent Optimization Algorithms

   In this paper, a new robust approach based on Least Square Support Vector Machine (LSSVM) as a proxy model is used for an automatic fractured reservoir history matching. The proxy model is made to model the history match objective function (mismatch values) based on the history data of the field. This model is then used to minimize the objective function through Particle Swarm Optimization (...

متن کامل

Improving ICP with easy implementation for free-form surface matching

Automatic range image registration and matching is an attractive but unresolved problem in both the machine vision and pattern recognition literature. Since automatic range image registration and matching is inherently a very difficult problem, the algorithms developed are becoming more and more complicated. In this paper, we propose a novel practical algorithm for automatic free-form surface m...

متن کامل

طراحی و توسعه یک روش تلفیقی تناظریابی ناحیه ای و عارضه مبنای جدید برای توجیه نسبی در فتوگرامتری برد کوتاه

By far, many stereo-matching techniques have been successfully proposed and applied in digital aerial photogrammetry. However, due to some problems such as large parallaxes, occlusions, geometric deformations, and repetitive patterns in convergent close range images, these methods may not be applicable to the same level of success as that of aerial imagery. In order to overcome these shortcomin...

متن کامل

Robust Automatic Marker-free Registration of Terrestrial Scan Data

Terrestrial laser scanning systems have become widely available during the past years. Raw data acquired by such systems typically consists of separate overlapping datasets – each in its own local coordinate system. Applications that need data from more than a single scan position therefore must be preceded by a registration of all scans into a common geometric reference frame. In this paper, a...

متن کامل

An Approach for Automatic Matching of Descriptive Addresses

Address matching (also called geocoding) is an applied spatial analysis which is frequently used in everyday life. Almost all desktop and web-based GIS environments are equipped with a module to match the addresses expressed in pre-defined standard formats on the map. It is an essential prerequisite for many of the functionalities provided by location-based services (e.g. car navigation). Sever...

متن کامل

Extraction of the Longitudinal Movement of the Carotid Artery Wall using Consecutive Ultrasonic Images: a Block Matching Algorithm

Introduction: In this study, a computer analysis method based on a block matching algorithm is presented to extract the longitudinal movement of the carotid artery wall using consecutive ultrasonic images. A window (block) is selected as the reference block in the first frame and the most similar block to the reference one is found in the subsequent frames. Material and Methods: The program was...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005