@inproceedings{SchmidtWongYeap2006, author = {Schmidt, Jochen and Wong, C.K. and Yeap, W.K.}, title = {A Split \& Merge Approach to Metric-Topological Map-Building}, series = {International Conference on Pattern Recognition (ICPR), volume 3, pages 1069-1072, Hong Kong}, booktitle = {International Conference on Pattern Recognition (ICPR), volume 3, pages 1069-1072, Hong Kong}, year = {2006}, abstract = {We present a novel split and merge based method for dividing a given metric map into distinct regions, thus effectively creating a topological map on top of a metric one. The initial metric map is obtained from range data that are converted to a geometric map consisting of linear approximations of the indoor environment. The splitting is done using an objective function that computes the quality of a region, based on criteria such as the average region width (to distinguish big rooms from corridors) and overall direction (which accounts for sharp bends). A regularization term is used in order to avoid the formation of very small regions, which may originate from missing or unreliable sensor data. Experiments based on data acquired by a mobile robot equipped with sonar sensors are presented, which demonstrate the capabilities of the proposed method.}, language = {en} } @inproceedings{WongYeapSchmidt2006, author = {Wong, C.K. and Yeap, W.K. and Schmidt, Jochen}, title = {Computing a Network of ASRs Using a Mobile Robot Equipped with Sonar Sensors}, series = {International Conference on Robotics, Automation, and Mechatronics (RAM), pages 57-62, Bangkok, Thailand}, booktitle = {International Conference on Robotics, Automation, and Mechatronics (RAM), pages 57-62, Bangkok, Thailand}, year = {2006}, abstract = {This paper presents a novel algorithm for computing absolute space representations (ASRs) in Yeap, W.K. and Jefferies, M. (1988) for mobile robots equipped with sonar sensors and an odometer. The robot is allowed to wander freely (i.e. without following any fixed path) along the corridors in an office environment from a given start point to an end point. It then wanders from the end point back to the start point. The resulting ASRs computed in both directions are shown}, language = {en} } @inproceedings{YeapWongSchmidt2006, author = {Yeap, W.K. and Wong, C.K. and Schmidt, Jochen}, title = {Initial Experiments with a Mobile Robot on Cognitive Mapping}, series = {International Symposium on Practical Cognitive Agents and Robots (PCAR 2006), pages 221-230, Perth, Australia}, booktitle = {International Symposium on Practical Cognitive Agents and Robots (PCAR 2006), pages 221-230, Perth, Australia}, year = {2006}, abstract = {This paper shows how a mobile robot equipped with sonar sensors and an odometer is used to test ideas about cognitive mapping. The robot first explores an office environment and computes a "cognitive map" which is a network of ASRs [1]. The robot generates two networks, one for the outward journey and the other for the journey home. It is shown that both networks are different. The two networks, however, are not merged to form a single network. Instead, the robot attempts to use distance information implicit in the shape of each ASR to find its way home. At random positions in the homeward journey, the robot calculates its orientation towards home. The robot's performances for both problems are evaluated and found to be surprisingly accurate.}, language = {en} } @inproceedings{SchmidtVogtNiemann2005, author = {Schmidt, Jochen and Vogt, F. and Niemann, H.}, title = {Calibration-Free Hand-Eye Calibration: A Structure-from-Motion Approach}, series = {Joint Pattern Recognition Symposium}, booktitle = {Joint Pattern Recognition Symposium}, publisher = {Springer}, address = {Berlin}, year = {2005}, abstract = {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.}, language = {en} } @inproceedings{ZinsslerSchmidtNiemann2005, author = {Zinßler, T. and Schmidt, Jochen and Niemann, H.}, title = {Point Set Registration with Integrated Scale Estimation}, series = {Proceedings of the Eighth International Conference on Pattern Recognition and Image Processing (PRIP 2005), pages 116-119, Minsk, Republic of Belarus}, booktitle = {Proceedings of the Eighth International Conference on Pattern Recognition and Image Processing (PRIP 2005), pages 116-119, Minsk, Republic of Belarus}, year = {2005}, abstract = {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.}, language = {en} } @inproceedings{SchmidtVogtNiemann2005, author = {Schmidt, Jochen and Vogt, F. and Niemann, H.}, title = {Vector Quantization Based Data Selection for Hand-Eye Calibration}, series = {Vision, Modeling, and Visualization 2004, pages 21-28, Stanford, USA}, booktitle = {Vision, Modeling, and Visualization 2004, pages 21-28, Stanford, USA}, year = {2005}, abstract = {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.}, language = {en} } @article{VogtKruegerSchmidtetal.2004, author = {Vogt, F. and Kr{\"u}ger, S. and Schmidt, Jochen and Paulus, D. and Niemann, H. and Hohenberger, W. and C. H., Schick}, title = {Light Fields for Minimal Invasive Surgery Using an Endoscope Positioning Robot}, series = {Methods of Information in Medicine}, journal = {Methods of Information in Medicine}, year = {2004}, abstract = {OBJECTIVES: To generate a fast and robust 3-D visualization of the operation site during minimal invasive surgery. METHODS: Light fields are used to model and visualize the 3-D operation site during minimal invasive surgery. An endoscope positioning robot provides the position and orientation of the endoscope. The a priori un-known transformation from the endoscope plug to the endoscope tip (hand-eye transformation) can either be determined by a three-step algorithm, which includes measuring the endoscope length by hand or by using an automatic hand-eye calibration algorithm. Both methods are described in this paper and their respective computation times and accuracies are compared. RESULTS: Light fields were generated during real operations and in the laboratory. The comparison of the two methods to determine the unknown hand-eye transformation was done in the laboratory. The results which are being presented in this paper are: rendered images from the generated light fields, the calculated extrinsic camera parameters and their accuracies with respect to the applied hand-eye calibration method, and computation times. CONCLUSION: Using an endoscope positioning robot and knowing the hand-eye transformation, the fast and robust generation of light fields for minimal invasive surgery is possible.}, language = {en} } @inproceedings{SchmidtVogtNiemann2003, author = {Schmidt, Jochen and Vogt, F. and Niemann, H.}, title = {Robust Hand-Eye Calibration of an Endoscopic Surgery Robot Using Dual Quaternions}, series = {Pattern Recognition, Proceedings of the 25th DAGM Symposium, Magdeburg}, booktitle = {Pattern Recognition, Proceedings of the 25th DAGM Symposium, Magdeburg}, year = {2003}, abstract = {This paper presents an approach for applying a dual quaternion hand-eye calibration algorithm on an endoscopic surgery robot. Special focus is on robustness, since the error of position and orientation data provided by the robot can be large depending on the movement actually executed. Another inherent problem to all hand-eye calibration methods is that non-parallel rotation axes must be used; otherwise, the calibration will fail. Thus we propose a method for increasing the numerical stability by selecting an optimal set of relative movements from the recorded sequence. Experimental evaluation shows the error in the estimated transformation when using well-suited and ill-suited data. Additionally, we show how a RANSAC approach can be used for eliminating the erroneous robot data from the selected movements.}, language = {en} } @inproceedings{ZinsserSchmidtNiemann2003, author = {Zinßer, T. and Schmidt, Jochen and Niemann, H.}, title = {A Refined ICP Algorithm for Robust 3-D Correspondence Estimation}, series = {Proceedings of the IEEE International Conference on Image Processing, volume 2, pages 695-698, Barcelona, Spain}, booktitle = {Proceedings of the IEEE International Conference on Image Processing, volume 2, pages 695-698, Barcelona, Spain}, year = {2003}, abstract = {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}, language = {en} } @book{ErnstSchmidtBeneken2020, author = {Ernst, Hartmut and Schmidt, Jochen and Beneken, Gerd}, title = {Grundkurs Informatik: Grundlagen und Konzepte f{\"u}r die erfolgreiche IT-Praxis - Eine umfassende, praxisorientierte Einf{\"u}hrung}, edition = {7}, publisher = {Springer Vieweg}, address = {Wiesbaden}, isbn = {978-3-658-30330-3}, publisher = {Technische Hochschule Rosenheim}, pages = {863}, year = {2020}, abstract = {Zahlensysteme und bin{\"a}re Arithmetik - Nachricht und Information - Codierung und Datenkompression - Verschl{\"u}sselung - Schaltalgebra, Schaltnetze und Elemente der Computerhardware - Rechnerarchitekturen - Rechnernetze - Betriebssysteme - prozedurale und objektorientierte Programmierung (C und Java) - Automatentheorie und formale Sprachen - Berechenbarkeit und Komplexit{\"a}t - Suchen und Sortieren - B{\"a}ume und Graphen - Software-Engineering - Datenbanken - Anwendungsprogrammierung im Internet (HTML, CSS, JavaScript und PHP) - Deep Learning mit neuronalen Netzen}, language = {de} } @book{Schmidt2020, author = {Schmidt, Jochen}, title = {Grundkurs Informatik - Das {\"U}bungsbuch: 148 Aufgaben mit L{\"o}sungen}, edition = {2}, publisher = {Springer Vieweg}, address = {Wiesbaden}, isbn = {978-3-658-30332-7}, publisher = {Technische Hochschule Rosenheim}, pages = {187}, year = {2020}, language = {de} } @article{WenningerMaierSchmidt2021, author = {Wenninger, Marc and Maier, Andreas and Schmidt, Jochen}, title = {DEDDIAG, a domestic electricity demand dataset of individual appliances in Germany}, series = {Scientific Data}, volume = {8}, journal = {Scientific Data}, number = {176}, pages = {15}, year = {2021}, abstract = {Real-world domestic electricity demand datasets are the key enabler for developing and evaluating machine learning algorithms that facilitate the analysis of demand attribution and usage behavior. Breaking down the electricity demand of domestic households is seen as the key technology for intelligent smart-grid management systems that seek an equilibrium of electricity supply and demand. For the purpose of comparable research, we publish DEDDIAG, a domestic electricity demand dataset of individual appliances in Germany. The dataset contains recordings of 15 homes over a period of up to 3.5 years, wherein total 50 appliances have been recorded at a frequency of 1 Hz. Recorded appliances are of significance for load-shifting purposes such as dishwashers, washing machines and refrigerators. One home also includes three-phase mains readings that can be used for disaggregation tasks. Additionally, DEDDIAG contains manual ground truth event annotations for 14 appliances, that provide precise start and stop timestamps. Such annotations have not been published for any long-term electricity dataset we are aware of.}, language = {en} }