Daniel Eggert

ORCID: 0000-0003-0251-4390
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Robotics and Sensor-Based Localization
  • Advanced Vision and Imaging
  • Data Visualization and Analytics
  • Advanced Image and Video Retrieval Techniques
  • Scientific Computing and Data Management
  • Remote Sensing and LiDAR Applications
  • 3D Surveying and Cultural Heritage
  • Distributed and Parallel Computing Systems
  • Optical measurement and interference techniques
  • Data Management and Algorithms
  • Computational Geometry and Mesh Generation
  • Satellite Communication Systems
  • Spacecraft Design and Technology
  • Semantic Web and Ontologies
  • Geographic Information Systems Studies
  • Computer Graphics and Visualization Techniques
  • Species Distribution and Climate Change
  • Flood Risk Assessment and Management
  • Remote Sensing in Agriculture
  • Advanced Computational Techniques and Applications
  • Research Data Management Practices
  • Hydrology and Watershed Management Studies
  • 3D Shape Modeling and Analysis
  • Data Mining Algorithms and Applications
  • Computational Physics and Python Applications

GFZ Helmholtz Centre for Geosciences
2016-2023

Leibniz University Hannover
2012-2015

University of South Florida
1988-2003

Technical University of Denmark
2003

University of Edinburgh
1996-2002

University of Kentucky
2002

HRL Laboratories (United States)
1970

University of California, Berkeley
1967-1968

A methodology for evaluating range image segmentation algorithms is proposed. This involves (1) a common set of 40 laser finder images and structured light scanner that have manually specified ground truth (2) defined performance metrics instances correctly segmented, missed, noise regions, over- under-segmentation, accuracy the recovered geometry. tool used to objectively compare machine generated against truth. Four research groups contributed evaluate their own algorithm segmenting into...

10.1109/34.506791 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 1996-07-01

Abstract. This paper presents a multi-stage approach toward the robust classification of travel-modes from GPS traces. Due to fact that traces are often composed more than one travel-mode, they segmented find sub-traces characterized as an individual travel-mode. is conducted by finding movement segments identifying stops. In first stage three main travel-mode classes identified: pedestrian, bicycle, and motorized vehicles; this achieved based on identified using speed, acceleration heading...

10.5194/isprsarchives-xxxviii-4-w25-87-2011 article EN cc-by ˜The œinternational archives of the photogrammetry, remote sensing and spatial information sciences/International archives of the photogrammetry, remote sensing and spatial information sciences 2012-08-30

Currently the aspect graph is computed from theoretical standpoint of perfect resolution in object shape, viewpoint and projected image. This means that may include details an observer could never see practice. Introducing notion scale into framework provides a mechanism for selecting level detail "large enough" to merit explicit representation. effectively allows control over number nodes retained graph. paper introduces concept space graph, defines three different interpretations...

10.1109/34.244674 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 1993-11-01

When reverse engineering a CAD model, it is necessary to integrate information from several views of an object into common reference frame. Given rough initial alignment, further pose refinement here uses improved version the interactive closes point algorithm. Incremental adjustments are computed simultaneously for all data sets, resulting in more globally optimal set transformations. Also, thresholds removing outlier correspondences not needed, as merging sets considered whole. Motion...

10.1109/icpr.1996.546027 article EN 1996-01-01

An algorithm for computing the aspect graph a class of curved-surface objects based on an exact parcellation 3-D viewpoint space is presented. The object considered solids revolution. A detailed analysis visual events this given, as well constructing graph. Numerical search techniques, geometric interpretation events, have been devised to determine those event surfaces that cannot be calculated directly. worst-case complexity number cells in space, and, hence, nodes graph, O(N/sup 4/), where...

10.1109/34.192483 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 1993-01-01

This paper presents a procedure to extract parking statistics from 3D point cloud recorded with two 2D LiDAR sensors mounted on vehicle. Policy makers can use these reduce search traffic in cities by identifying characteristics and adjusting current rules policies. The extraction basically consists of an object segmentation classification step. For segmentation, region growing approach is used the ground surface separate distinct objects. classification, random forest classifier employed...

10.1109/itsc.2015.452 article EN 2015-09-01

Several researchers have previously described approaches to 3-D object recognition which use nonlinear optimization control the matching of features a niodel found in an image. Recognition, this context, includes estimating parameters translation and orientation object. A major problem acknowledged by previous is how efficiently choose set starting paranleter estimates will avoid errors due local minima. The unique contribution paper that it outlines approach for using perspective projection...

10.1109/ccv.1988.590030 article EN 1988-01-01

Constructing a full CAD model of part requires feature descriptions from all sides; in this case we consider surface patches as the geometric primitives. Most previous research patch extraction has concentrated on extracting single view. This leads to several problems with aligning and combining partial fragments order produce complete models. We have avoided these by adapting our view, range data segmentation program extract patches, thus models, directly fully merged datasets.

10.1109/im.1997.603860 article EN 2002-11-22

The first algorithm to handle a defined class of curved-surface objects is presented. automatically computes the partition Gaussian sphere, and thereby aspect graph, for solids revolution as right, circular, straight, homogeneous generalized cylinders. demonstrates that it possible compute exact graph at least some classes objects. obvious extension this work attempt apply same or similar approach larger more varied objects.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML"...

10.1109/tdscen.1989.68107 article EN 2003-01-07

People often only see what that they already know or explicitly look for. Thus, while mobile users might be interested in the historic background of their surrounding, its current significance relation to specific events, are likely miss places interest if not pointed out. Location based services (LBS) like tourist guides offer a potential technological solution, but production cost multimedia content is prohibitive many cases, limiting coverage such major areas. To provide with information...

10.15488/1130 article EN 2010-01-01

Abstract. Matching and fusion of 3D point clouds, such as close range laser scans, is important for creating an integrated model data infrastructure. The Iterative Closest Point algorithm alignment clouds one the most commonly used algorithms matching rigid bodies. Evidently, scans are acquired from different positions might present characterization accuracies, forcing complex data-handling issues. growing demand near real-time applications also introduces new computational requirements...

10.5194/isprsannals-i-3-105-2012 article EN cc-by ISPRS annals of the photogrammetry, remote sensing and spatial information sciences 2012-07-20

Abstract. Mobile Mapping is widely used for collecting large amounts of geo-referenced data. An important role plays sensor fusion, in order to evaluate multiple sensors such as laser scanner and cameras jointly. This requires determine the relative orientation between sensors. Based on data a RIEGL VMX-250 mobile mapping system equipped with two scanners, four optional cameras, highly precise GNSS/IMU system, we propose an approach improve camera orientations. A manually determined initial...

10.5194/isprsannals-ii-5-181-2014 article EN cc-by ISPRS annals of the photogrammetry, remote sensing and spatial information sciences 2014-05-28

Algorithms for computing the aspect graph representation are generalized to include a larger, more realistic domain of objects known as articulated assemblies those composed rigid parts with connections allowed between parts. The generalization suggests two slightly different representations: one that directly summarizes possible general views object and another (hierarchical) form summarizing configurations their respective views. outlined both representations. graphs formed using...

10.1109/34.216731 article EN IEEE Transactions on Pattern Analysis and Machine Intelligence 1993-06-01

Over the past few years, a number of researchers have presented algorithms for computing aspect graph representation both polyhedra and curved-surface objects. Viewpoint space models included viewing sphere (orthographic projection) all 3-D (perspective projection). The paper presents first (only) complete implementation an algorithm to compute exact class objects using as model viewpoint space. considered is solids revolution defined Right, Circular, Straight, Homogeneous Generalized...

10.1109/cadvis.1991.148756 article EN 2002-12-10

Currently the aspect graph is computed under assumption of perfect resolution in viewpoint, projected image, and object shape. Visual detail represented that an observer might never see practice. By introducing scale into this framework, a mechanism provided for selecting levels are large enough to merit explicit representation, effectively allowing control over size graph. To end space introduced, interpretation dimension terms spatial extent image features considered. A brief example given...

10.1109/cvpr.1992.223254 article EN 2003-01-02

Earth system science is an interdisciplinary effort to understand the fundamentals and interactions of environmental processes. Interdisciplinary research challenging since it demands integration scientific schemes practices from different fields into a collaborative work environment. This paper introduces framework F4ESS that supports this integration. provides methods technologies facilitate development integrative environments for science. enables scientists a) outline structured...

10.1080/17538947.2023.2259361 article EN cc-by International Journal of Digital Earth 2023-09-28

Abstract Planning an event-based monitoring campaign on the regional scale is challenging, e.g. timing and location of visits can dramatically impact efficacy depends optimal environmental conditions required by measurement parameters overarching goal. Therefore we developed a generic planning approach utilizing interactive visualization methods implemented this into component-based web tool called Tocap: Tool for Campaign Planning. As case study, determine most suitable time event-driven,...

10.2166/hydro.2022.057 article EN cc-by Journal of Hydroinformatics 2022-01-21

A prototype 3D object recognition system is described that composed of three major sections; an representation module, a feature extraction and matching control strategy module. The module uses algorithm which constructs perspective projection aspect graphs convex polyhedra. Fourier descriptors to characterize the complete 2D object. graph application constrained optimization algorithm. implemented in C on Sun workstation, some simple experiments are reported demonstrate validity overall...

10.1109/icpr.1988.28159 article EN 2003-01-06

10.1016/0022-0396(68)90039-9 article EN publisher-specific-oa Journal of Differential Equations 1968-04-01

10.1016/s0022-0000(67)80024-2 article EN Journal of Computer and System Sciences 1967-12-01
Coming Soon ...