Refine
Year of publication
Document Type
- Conference Proceeding (25) (remove)
Is part of the Bibliography
- no (25)
Keywords
- Augmented Reality (AR) (3)
- Robotic Research (3)
- Cognitive Mapping (2)
- Mobile Robot (2)
- Pattern Recognition (2)
- Sonar Sensor (2)
- 3D Point-Sets (1)
- 3D Rotations (1)
- Approximate dynamic program (1)
- Automation and Mechatronics (1)
- Calibration Pattern (1)
- Camera (1)
- Camera calibration (1)
- Color segmentation (1)
- Computer vision (1)
- Data selection (1)
- Demand Side Management (1)
- Didaktik (1)
- Dual Quaternion (1)
- Dual Quaternion (1)
- Endoscopic Surgery Robot (1)
- Farbsegmentierung (1)
- Feature Tracking (1)
- Hand-Eye Calibration (1)
- Heating control (1)
- Home Automation (1)
- Household Appliance Usage Prediction (1)
- Humanoid Robot (1)
- ICP Algorithm (1)
- Iterative Closest Point (1)
- Iterative algorithms (1)
- Iterative closest point algorithm (1)
- Layout (1)
- Localization (1)
- Machine Learning (1)
- Mapping (1)
- Metric-Topological Map-Building (1)
- Mobile Robots (1)
- NILM (1)
- Noise robustnes (1)
- Numerical Stability (1)
- Obstacle Avoidance (1)
- Pattern recognition (1)
- Real Time Pricing (RTP) (1)
- Real time systems (1)
- Rechnersehen (1)
- Recurrence Plot (1)
- Reward Function (1)
- Robotics (1)
- Scale Estimation (1)
- Service Robot (1)
- Smart Meter, Advanced Metering Infrastructure, AMI (1)
- Software Development (1)
- Speech recognition (1)
- Target Temperature (1)
- Teaching Robotics (1)
- Temporal Orderr (1)
- Translation Vector (1)
- Unconstrained NonlinearOptimization (1)
- V-I trajectory (1)
- Vector Quantization (1)
- World Coordinate System (1)
- endoscopic camera (1)
- minimalinvasive surgery (1)
- virtuelle Vorlesung (1)
Institute
This work presents a technique for computing dense disparity maps from a binocular stereo camera system. The methods are applied in an Augmented Reality setting for combining real and virtual worlds with proper occlusions. The proposed stereo correspondence technique is based oil area matching and facilitates an efficient strategy by using the concept of a three-dimensional similarity accumulator whereby occlusions are detected and object boundaries are extracted correctly. The main contribution of this paper is the way we fill the accumulator using absolute differences of images and computing a mean filter on these difference images. This. is. where the main advantages of the accumulator approach can be exploited, since all entries can be computed in parallel and thus extremely efficient. Additionally, we-perform an asymmetric correction step and a post-processing of the disparity maps that maintains object edges.
In this paper we address the problem of using quaternions in unconstrained nonlinear optimization of 3-D rotations. Quaternions representing rotations have four elements but only three degrees of freedom, since they must be of norm one.
This constraint has to be taken into account when applying e.g. the Levenberg-Marquardt algorithm, a method for unconstrained nonlinear optimization widely used in computer vision. We propose an easy to use method for achieving this.
Experiments using our parametrization in photo grammetric bündle -adjustment are presented at the end of the paper.
We describe an Augmented Reality system using the corners of a color cube for camera calibration. In the augmented image the cube is replaced by a computer generated virtual object.
The cube is localized in an image by the CSC color segmentation algorithm. The camera projection matrix is estimated with a linear method that is followed by a nonlinear refinement step.
Because of possible missclassifications of the segmented color regions and the minimum number of point correspondences used for calibration, the estimated pose of the cube may be very erroneous for some frames; therefore we perform outlier detection and treatment for rendering the virtual object in an acceptable manner.
Es wird ein System aus der Augmented Reality (Erweiterte Realiäat, AR) vorgestellt, das zur Kamerakalibrierung einen farbigen Würfel verwendet, der außerdem als Platzhalter für ein virtuelles Objekt dient.
Zur Erkennung des Würfels in einer Szene werden Methoden aus der Farbbildverarbeitung verwendet, wie der Color Structure Code (CSC) und die Klassifikation der entstehenden Regionen nach ihrer Farbe. Zur Beschleunigung der Segmentierung wird ein hierarchisches Verfahren eingesetzt.
There are many nearest neighbor algorithms tailor made for ICP,but most of them require Special input data like range Images or triangle meshes.
We focus on efficient nearest neighbor algorithms that do not impose this limitation, and thus can also be used with 3-D point sets generated by structure-frommotion techniques. We shortly present the evaluated algorithms and introduce the modifications we made to improve their efficiency.
In particular, several enhancements to the well-known k-D tree algorithm are described. The first part of our Performance Analysis consists of Experiments on synthetic point sets, whereas the second part features experiments with the ICP algorithm on real point sets. Both parts are completed by a thorough evaluation of the obtained results.
Dieser Artikel stellt ein Konzept f¨ur eine Online-Vorlesung im Rahmen der virtuellen Hochschule Bayern vor.
Zunächst werden kurz die fachlichen Inhalte erl¨autert, die es zu vermitteln gilt.
Nach dieser Einführung wird auf die Umsetzung der Inhalte in eine dem neuen Medium Internet angemessene Form eingegangen.
Dies betrifft vor allem die ausgewählten Techniken, die zur Wissensvermittlung eingesetzt werden.
Ein besonderer Schwerpunkt liegt auf der Möglichkeit durch Interaktivität das Wissen experimentell zu vertiefen und somit eine Verbindung zwischen dem theoretisch Gelernten und dem praktisch Erfahrenen herzustellen.
Weiterhin wird eine Vielfalt an Kommunikationsm¨oglichkeiten vorgestellt, da Kommunikation eine wichtige soziale Komponente im Lernprozess und h¨aufig entscheidend f¨ur den Erfolg ist.
Robust registration of two 3-D point sets is a common problem in computer vision.
The iterative closest point (ICP) algorithm is undoubtedly the most popular algorithm for solving this kind of problem. In this paper, we present the Picky ICP algorithm, which has been created by merging several extensions of the standard ICP algorithm, thus improving its robustness and computation time.
Using pure 3-D point sets as input data, we do not consider additional information like point color or neighborhood relations. In addition to the standard ICP algorithm and the Picky ICP algorithm proposed in this paper, a robust algorithm due to Masuda and Yokoya and the RICP algorithm by Trucco et al. are evaluated.
We have experimentally determined the basin of convergence, robustness to noise and outliers, and computation time of these four ICP based algorithms
The paper presents an extended hand-eye calibration approach that, in contrast to the standard method, does not require a calibration pattern for determining camera position and orientation. Instead, a structure-from-motion algorithm is applied for obtaining the eye-data that is necessary for computing the unknown hand-eye transformation.
Different ways of extending the standard algorithm are presented, which mainly involves the estimation of a scale factor in addition to rotation and translation. The proposed methods are experimentally compared using data obtained from an optical tracking system that determines the pose of an endoscopic camera.
The approach is of special interest in our clinical setup, as the usage of an unsterile calibration pattern is difficult in a sterile environment.
Wepresentaniterativeregistrationalgorithmfor aligning two differently scaled 3-D point sets. It extends the popular Iterative Closest Point (ICP) algorithm by estimating a scale factor between the two point sets in every iteration.
The presented algorithm is especially useful for the registration of point sets generated by structure-frommotion algorithms, which only reconstruct the 3-D structure of a scene upto scale. LiketheoriginalICPalgorithm,thepresentedalgorithm requires a rough pre-alignment of the point sets.
In order to determine the necessary accuracy of the pre-alignment, wehaveexperimentallyevaluatedthebasinofconvergence of the algorithm with respect to the initial rotation, translation, andscale factor between the two point sets.
The paper presents a new vectorquantization based Approach for selecting well-suited data for hand-eye calibration from a given sequence of hand and eye movements.
Data selection is essential if control of the movements used for calibration is not possible, especially when using continuously recorded data. The new algorithm is compared to another method for data selection as well as to the processing of subsequent movements.
Experimental results on real and synthetic data sets show the superior performance of the new approach with respect to calibration errors and computation time.
Real data has been obtained from an optical tracking system and a camera mounted on an endoscope, the goal being the reconstruction of medical lightfields.