Peter Protzel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Peter Protzel has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Peer Neubert
University of Koblenz
14 shared publications - Niko Sünderhauf
Queensland University of Technology
6 shared publications - Stefan Schubert
TU Chemnitz
5 shared publications - Sven Lange
Chemnitz University of Technology
4 shared publications - Kenny Schlegel
Chemnitz University of Technology, Chemnitz, Germany
3 shared publications - Fangming Yuan
Chemnitz University of Technology, Chemnitz, Germany
2 shared publications
Latest Publications
- 30 December 2024
- Published by Springer Nature
- p. 94-106
Towards Revisiting Visual Place Recognition for Joining Submaps in Multimap SLAM$^\star $- 30 December 2024
- Published by Springer Nature
- p. 94-106
Towards Revisiting Visual Place Recognition for Joining Submaps in Multimap SLAM$^\star $- 29 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (3) , 2686-2693
Local Positional Graphs and Attentive Local Features for a Data and Runtime-Efficient Hierarchical Place Recognition Pipeline
Large-scale applications of Visual Place Recognition (VPR) require computationally efficient approaches. Further, a well-balanced combination of data-based and training-free approaches can decrease the required amount of training data and effort and can reduce the influence of distribution shifts between the training and application phases. This paper proposes a runtime and data-efficient hierarchical VPR pipeline that extends existing approaches and presents novel ideas. There are three main contributions: First, we propose Local Positional Graphs (LPG), a training-free and runtime-efficient approach to encode spatial context information of local image features. LPG can be combined with existing local feature detectors and descriptors and considerably improves the image-matching quality compared to existing techniques in our experiments. Second, we present Attentive Local SPED (ATLAS), an extension of our previous local features approach with an attention module that improves the feature quality while maintaining high data efficiency. The influence of the proposed modifications is evaluated in an extensive ablation study. Third, we present a hierarchical pipeline that exploits hyperdimensional computing to use the same local features as holistic HDC-descriptors for fast candidate selection and for candidate reranking. We combine all contributions in a runtime and data-efficient VPR pipeline that shows benefits over the state-of-the-art method Patch-NetVLAD on a large collection of standard place recognition datasets with 15 $\%$ better performance in VPR accuracy, 54× faster feature comparison speed, and 55× less descriptor storage occupancy, making our method promising for real-world high-performance large-scale VPR in changing environments. Source code is provided online: https://github.com/Yuan-Fangming/Hir-ATLAS
- 29 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 9 (3) , 2686-2693
Local Positional Graphs and Attentive Local Features for a Data and Runtime-Efficient Hierarchical Place Recognition Pipeline
Large-scale applications of Visual Place Recognition (VPR) require computationally efficient approaches. Further, a well-balanced combination of data-based and training-free approaches can decrease the required amount of training data and effort and can reduce the influence of distribution shifts between the training and application phases. This paper proposes a runtime and data-efficient hierarchical VPR pipeline that extends existing approaches and presents novel ideas. There are three main contributions: First, we propose Local Positional Graphs (LPG), a training-free and runtime-efficient approach to encode spatial context information of local image features. LPG can be combined with existing local feature detectors and descriptors and considerably improves the image-matching quality compared to existing techniques in our experiments. Second, we present Attentive Local SPED (ATLAS), an extension of our previous local features approach with an attention module that improves the feature quality while maintaining high data efficiency. The influence of the proposed modifications is evaluated in an extensive ablation study. Third, we present a hierarchical pipeline that exploits hyperdimensional computing to use the same local features as holistic HDC-descriptors for fast candidate selection and for candidate reranking. We combine all contributions in a runtime and data-efficient VPR pipeline that shows benefits over the state-of-the-art method Patch-NetVLAD on a large collection of standard place recognition datasets with 15 $\%$ better performance in VPR accuracy, 54× faster feature comparison speed, and 55× less descriptor storage occupancy, making our method promising for real-world high-performance large-scale VPR in changing environments. Source code is provided online: https://github.com/Yuan-Fangming/Hir-ATLAS
- 15 November 2023
- Published by Springer Nature
- p. 418-430
FETCH: A Memory-Efficient Replay Approach for Continual Learning in Image Classification
- 15 November 2023
- Published by Springer Nature
- p. 418-430
FETCH: A Memory-Efficient Replay Approach for Continual Learning in Image Classification
- 28 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 7 (3) , 6020-6027
A Credible and Robust Approach to Ego-Motion Estimation Using an Automotive Radar
Consistent motion estimation is fundamental for all mobile autonomous systems. While this sounds like an easy task, often, it is not the case because of changing environmental conditions affecting odometry obtained from vision, Lidar, or the wheels themselves. Unsusceptible to challenging lighting and weather conditions, radar sensors are an obvious alternative. Usually, automotive radars return a sparse point cloud, representing the surroundings. Utilizing this information to motion estimation is challenging due to unstable and phantom measurements, which result in a high rate of outliers. We introduce a credible and robust probabilistic approach to estimate the ego-motion based on these challenging radar measurements; intended to be used within a loosely-coupled sensor fusion framework. Compared to existing solutions, evaluated on the popular nuScenes dataset and others, we show that our proposed algorithm is more credible while not depending on explicit correspondence calculation.
- 28 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 7 (3) , 6020-6027
A Credible and Robust Approach to Ego-Motion Estimation Using an Automotive Radar
Consistent motion estimation is fundamental for all mobile autonomous systems. While this sounds like an easy task, often, it is not the case because of changing environmental conditions affecting odometry obtained from vision, Lidar, or the wheels themselves. Unsusceptible to challenging lighting and weather conditions, radar sensors are an obvious alternative. Usually, automotive radars return a sparse point cloud, representing the surroundings. Utilizing this information to motion estimation is challenging due to unstable and phantom measurements, which result in a high rate of outliers. We introduce a credible and robust probabilistic approach to estimate the ego-motion based on these challenging radar measurements; intended to be used within a loosely-coupled sensor fusion framework. Compared to existing solutions, evaluated on the popular nuScenes dataset and others, we show that our proposed algorithm is more credible while not depending on explicit correspondence calculation.
- Top Cited PapersOpen Access
- 15 December 2021
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 55 (6) , 4523-4555
A comparison of vector symbolic architectures
Vector Symbolic Architectures combine a high-dimensional vector space with a set of carefully designed operators in order to perform symbolic computations with large numerical vectors. Major goals are the exploitation of their representational power and ability to deal with fuzziness and ambiguity. Over the past years, several VSA implementations have been proposed. The available implementations differ in the underlying vector space and the particular implementations of the VSA operators. This paper provides an overview of eleven available VSA implementations and discusses their commonalities and differences in the underlying vector space and operators. We create a taxonomy of available binding operations and show an important ramification for non self-inverse binding operations using an example from analogical reasoning. A main contribution is the experimental comparison of the available implementations in order to evaluate (1) the capacity of bundles, (2) the approximation quality of non-exact unbinding operations, (3) the influence of combining binding and bundling operations on the query answering performance, and (4) the performance on two example applications: visual place- and language-recognition. We expect this comparison and systematization to be relevant for development of VSAs, and to support the selection of an appropriate VSA for a particular task. The implementations are available.
- 15 December 2021
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 55 (6) , 4523-4555
Top Cited PapersOpen AccessA comparison of vector symbolic architectures
Vector Symbolic Architectures combine a high-dimensional vector space with a set of carefully designed operators in order to perform symbolic computations with large numerical vectors. Major goals are the exploitation of their representational power and ability to deal with fuzziness and ambiguity. Over the past years, several VSA implementations have been proposed. The available implementations differ in the underlying vector space and the particular implementations of the VSA operators. This paper provides an overview of eleven available VSA implementations and discusses their commonalities and differences in the underlying vector space and operators. We create a taxonomy of available binding operations and show an important ramification for non self-inverse binding operations using an example from analogical reasoning. A main contribution is the experimental comparison of the available implementations in order to evaluate (1) the capacity of bundles, (2) the approximation quality of non-exact unbinding operations, (3) the influence of combining binding and bundling operations on the query answering performance, and (4) the performance on two example applications: visual place- and language-recognition. We expect this comparison and systematization to be relevant for development of VSAs, and to support the selection of an appropriate VSA for a particular task. The implementations are available.
- 11 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 602-609
Multivariate Time Series Analysis for Driving Style Classification using Neural Networks and Hyperdimensional Computing
In this paper, we present a novel approach for driving style classification based on time series data. Instead of automatically learning the embedding vector for temporal representation of the input data with Recurrent Neural Networks, we propose a combination of Hyperdimensional Computing (HDC) for data representation in high-dimensional vectors and much simpler feed-forward neural networks. This approach provides three key advantages: first, instead of having a “black box” of Recurrent Neural Networks learning the temporal representation of the data, our approach allows to encode this temporal structure in high-dimensional vectors in a human-comprehensible way using the algebraic operations of HDC while only relying on feed-forward neural networks for the classification task. Second, we show that this combination is able to achieve at least similar and even slightly superior classification accuracy compared to state-of-the-art Long Short-Term Memory (LSTM)-based networks while significantly reducing training time and the necessary amount of data for successful learning. Third, our HDC-based data representation as well as the feed-forward neural network, allow implementation in the substrate of Spiking Neural Networks (SNNs). SNNs show promise to be orders of magnitude more energy-efficient than their rate-based counterparts while maintaining comparable prediction accuracy when being deployed on dedicated neuromorphic computing hardware, which could be an energy-efficient addition in future intelligent vehicles with tight restrictions regarding on-board computing and energy resources. We present a thorough analysis of our approach on a publicly available data set including a comparison with state-of-the-art reference models.
- 11 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 602-609
Multivariate Time Series Analysis for Driving Style Classification using Neural Networks and Hyperdimensional Computing
In this paper, we present a novel approach for driving style classification based on time series data. Instead of automatically learning the embedding vector for temporal representation of the input data with Recurrent Neural Networks, we propose a combination of Hyperdimensional Computing (HDC) for data representation in high-dimensional vectors and much simpler feed-forward neural networks. This approach provides three key advantages: first, instead of having a “black box” of Recurrent Neural Networks learning the temporal representation of the data, our approach allows to encode this temporal structure in high-dimensional vectors in a human-comprehensible way using the algebraic operations of HDC while only relying on feed-forward neural networks for the classification task. Second, we show that this combination is able to achieve at least similar and even slightly superior classification accuracy compared to state-of-the-art Long Short-Term Memory (LSTM)-based networks while significantly reducing training time and the necessary amount of data for successful learning. Third, our HDC-based data representation as well as the feed-forward neural network, allow implementation in the substrate of Spiking Neural Networks (SNNs). SNNs show promise to be orders of magnitude more energy-efficient than their rate-based counterparts while maintaining comparable prediction accuracy when being deployed on dedicated neuromorphic computing hardware, which could be an energy-efficient addition in future intelligent vehicles with tight restrictions regarding on-board computing and energy resources. We present a thorough analysis of our approach on a publicly available data set including a comparison with state-of-the-art reference models.
- 18 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 6 (2) , 3941-3948
Advancing Mixture Models for Least Squares Optimization
Gaussian mixtures are a powerful and widely used tool to model non-Gaussian estimation problems. They are able to describe measurement errors that follow arbitrary distributions and can represent ambiguity in assignment tasks like point set registration or tracking. However, using them with common least squares solvers is still difficult. Existing approaches are either approximations of the true mixture or prone to convergence issues due to their strong nonlinearity. We propose a novel least squares representation of a Gaussian mixture, which is an exact and almost linear model of the corresponding log-likelihood. Our approach provides an efficient, accurate and flexible model for many probabilistic estimation problems and can be used as cost function for least squares solvers. We demonstrate its superior performance in various Monte Carlo experiments, including different kinds of point set registration. Our implementation is available as open source code for the state-of-the-art solvers Ceres and GTSAM.
- 18 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 6 (2) , 3941-3948
Advancing Mixture Models for Least Squares Optimization
Gaussian mixtures are a powerful and widely used tool to model non-Gaussian estimation problems. They are able to describe measurement errors that follow arbitrary distributions and can represent ambiguity in assignment tasks like point set registration or tracking. However, using them with common least squares solvers is still difficult. Existing approaches are either approximations of the true mixture or prone to convergence issues due to their strong nonlinearity. We propose a novel least squares representation of a Gaussian mixture, which is an exact and almost linear model of the corresponding log-likelihood. Our approach provides an efficient, accurate and flexible model for many probabilistic estimation problems and can be used as cost function for least squares solvers. We demonstrate its superior performance in various Monte Carlo experiments, including different kinds of point set registration. Our implementation is available as open source code for the state-of-the-art solvers Ceres and GTSAM.
- 19 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 6 (2) , 2084-2090
Resolving Place Recognition Inconsistencies Using Intra-Set Similarities
Place recognition is the problem of finding associations between a query set of place descriptions and a database. It is an important means for loop closure detection in SLAM. The primary source of information to decide about associations is the pairwise similarity of descriptors between the query and the database items (e.g., image descriptor similarities). Beyond better descriptors, significant improvements were achieved by exploiting additional structural information, in particular by comparing sequences instead of individual items. In this letter, we propose to use another systematic source of information: intra-set similarities between items within the query or the database sets. They can be used to detect inconsistencies of groups of associations between database and query items, e.g. to inhibit matchings of multiple query descriptors to the same database descriptor if the query descriptors are mutually different. The underlying idea is a heuristic tightening of the triangle inequality of groups of descriptors. Based on a definition of matching inconsistencies, we propose an Inconsistency Resolution Procedure (IRP) to modify the inter-set similarities between database and query in a way that resolves existing inconsistencies with intra-set similarities. Our experiments show an average place recognition performance gain of $>$ 30% in a general place recognition setup with 21 datasets and two state of the art image processing front-ends. The proposed approach does not require additional information beyond descriptor similarities, makes no assumptions of sequences, does not require training, and has no parameter that needs adjustment. It can be combined with other established techniques like descriptor standardization and sequence processing.
- 19 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 6 (2) , 2084-2090
Resolving Place Recognition Inconsistencies Using Intra-Set Similarities
Place recognition is the problem of finding associations between a query set of place descriptions and a database. It is an important means for loop closure detection in SLAM. The primary source of information to decide about associations is the pairwise similarity of descriptors between the query and the database items (e.g., image descriptor similarities). Beyond better descriptors, significant improvements were achieved by exploiting additional structural information, in particular by comparing sequences instead of individual items. In this letter, we propose to use another systematic source of information: intra-set similarities between items within the query or the database sets. They can be used to detect inconsistencies of groups of associations between database and query items, e.g. to inhibit matchings of multiple query descriptors to the same database descriptor if the query descriptors are mutually different. The underlying idea is a heuristic tightening of the triangle inequality of groups of descriptors. Based on a definition of matching inconsistencies, we propose an Inconsistency Resolution Procedure (IRP) to modify the inter-set similarities between database and query in a way that resolves existing inconsistencies with intra-set similarities. Our experiments show an average place recognition performance gain of $>$ 30% in a general place recognition setup with 21 datasets and two state of the art image processing front-ends. The proposed approach does not require additional information beyond descriptor similarities, makes no assumptions of sequences, does not require training, and has no parameter that needs adjustment. It can be combined with other established techniques like descriptor standardization and sequence processing.
- 18 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 6 (2) , 811-818
Graph-Based Non-Linear Least Squares Optimization for Visual Place Recognition in Changing Environments
Visual place recognition is an important subproblem of mobile robot localization. Since it is a special case of image retrieval, the basic source of information is the pairwise similarity of image descriptors. However, the embedding of the image retrieval problem in this robotic task provides additional structure that can be exploited, e.g., spatio-temporal consistency. Several algorithms exist to exploit this structure, e.g., sequence processing approaches or descriptor standardization approaches for changing environments. In this letter, we propose a graph-based framework to systematically exploit different types of additional structure and information. The graphical model is used to formulate a non-linear least squares problem that can be optimized with standard tools. Beyond sequences and standardization, we propose the usage of intra-set similarities within the database and/or the query image set as additional source of information. If available, our approach also allows to seamlessly integrate additional knowledge about poses of database images. We evaluate the system on a variety of standard place recognition datasets and demonstrate performance improvements for a large number of different configurations including different sources of information, different types of constraints, and online or offline place recognition setups.
- 18 January 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 6 (2) , 811-818
Graph-Based Non-Linear Least Squares Optimization for Visual Place Recognition in Changing Environments
Visual place recognition is an important subproblem of mobile robot localization. Since it is a special case of image retrieval, the basic source of information is the pairwise similarity of image descriptors. However, the embedding of the image retrieval problem in this robotic task provides additional structure that can be exploited, e.g., spatio-temporal consistency. Several algorithms exist to exploit this structure, e.g., sequence processing approaches or descriptor standardization approaches for changing environments. In this letter, we propose a graph-based framework to systematically exploit different types of additional structure and information. The graphical model is used to formulate a non-linear least squares problem that can be optimized with standard tools. Beyond sequences and standardization, we propose the usage of intra-set similarities within the database and/or the query image set as additional source of information. If available, our approach also allows to seamlessly integrate additional knowledge about poses of database images. We evaluate the system on a variety of standard place recognition datasets and demonstrate performance improvements for a large number of different configurations including different sources of information, different types of constraints, and online or offline place recognition setups.
- 3 December 2020
- Published by Springer Nature
- p. 103-115
Building a Navigation System for a Shopping Assistant Robot from Off-the-Shelf Components
- 3 December 2020
- Published by Springer Nature
- p. 103-115
Building a Navigation System for a Shopping Assistant Robot from Off-the-Shelf Components