Martin Pfeifle

Martin Pfeifle
NNG Software Developing and Commercial Llc · CTO

Dr.

About

68
Publications
7,023
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
1,487
Citations

Publications

Publications (68)
Article
Full-text available
In this paper we present a sensor fusion framework for the detection and classification of objects in autonomous driving applications. The presented method uses a state-of-the-art convolutional neural network (CNN) to detect and classify object from RGB images. The 2D bounding boxes calculated by the CNN are fused with the 3D point cloud measured b...
Article
This is a protocol for a Cochrane Review (Intervention). The objectives are as follows: To review the benefits and harms of surgery for the treatment of obstructive sleep apnoea. © 2017 The Cochrane Collaboration. Published by John Wiley & Sons, Ltd.
Patent
Full-text available
A geographic database is defined using hierarchical data trees and updated by changing selected portions of a data tree. A device defines a binary large object (BLOB) including map data as a first data tree and an update to the map data as a second data tree. The device computes a difference between the first data tree and the second data tree. The...
Patent
A method and system for fuzzy full text search is disclosed. The system includes an inverted index where tokens are organized in a Next Valid Character (NVC) tree. Each path through the tree defines a token. The document sets for the tokens are stored at leaf nodes. After receiving search tokens, the system traverses the NVC tree in a lazy manner b...
Patent
Full-text available
A method and system for searching for points of interest along a route is disclosed. A relation that includes records that associate link identifiers, point of interest identifiers, and distances between the links and the points of interest is generated during the compilation process of a first version of a geographic database. The relation is stor...
Patent
Full-text available
A method and system for efficiently storing, retrieving, and updating binary large objects (BLOBs) in embedded systems is disclosed. The metadata of the BLOBs is stored in relational tables, while the BLOBs are stored in a flat file. Querying the metadata of the BLOBs (i.e. the starting points of the BLOBs and their length) is performed based on SQ...
Patent
Full-text available
A method and system for full text search (FTS) using a navigation system is disclosed. The FTS system generates interwoven data tokens for documents that are stored in a database. An interwoven data token is combination of two or more data tokens and is formed by interweaving characters of one data token with characters of another data token. The F...
Patent
Full-text available
A method and system for searching for points of interest along a route is disclosed. A relation that includes records that associate link identifiers, point of interest identifiers, and distances between the links and the points of interest is generated during the compilation process of a first version of a geographic database. The relation is stor...
Patent
Full-text available
A method and system for full text search (FTS) using a navigation system is disclosed. The FTS system generates vectors for documents that are stored in a database. The vectors are formed by converting data token pairs to binary or hexadecimal strings. The FTS system may generate and store vectors in a multi-dimensional index (e.g., an R-Tree) for...
Patent
A method and system for full text search for use during destination selection with a navigation system is disclosed. The method partitions a full text search index based on frequently used terms. These frequently used terms are then mapped to dedicated full text search indexes, where each document contains this frequently used term but the term its...
Patent
Full-text available
To store geometric objects, a distance is determined from each prespecified objects to one other prespecified object. The distance represents a similarity of the corresponding prespecified objects. The prespecified objects are grouped together such that the prespecified objects are more similar with respect to prespecified geometric objects of the...
Conference Paper
Full-text available
In the consumer market, there has been an increasing interest in portable navigation systems in the last few years. These systems usually work on digital map databases stored on SD cards. As the price for these SD cards heavily depends on their capacity and as digital map databases are rather space-consuming, relatively high hardware costs go along...
Chapter
Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging, computer-aided engineering, marketing and purchasing assistance as well as many others. Furthermore, the feature transformations and distance measures used in similarity search build...
Article
Databases are getting more and more important for storing complex objects from scientific, engineering, or multimedia applications. Examples for such data are chemical compounds, CAD drawings, or XML data. The efficient search for similar objects in such databases is a key feature. However, the general problem of many similarity measures for comple...
Conference Paper
An important database primitive for commonly used feature databases is the similarity join. It combines two datasets based on some similarity predicate into one set such that the new set contains pairs of objects of the two original sets. In many different application areas, e.g. sensor databases, location based ser- vices or face recognition syste...
Conference Paper
In many scientific, engineering or multimedia applications, complex distance functions are used to measure similarity accurately. Furthermore, there often exist simpler lower-bounding distance func- tions, which can be computed much more eciently. In this paper, we will show how these simple distance functions can be used to parallelize the density...
Article
Data mining in large databases of complex objects from sci- entific, engineering or multimedia applications is getting more and more important. In many areas, complex distance measures are first choice but also simpler distance functions are available which can be com- puted much more eciently. In this paper, we will demonstrate how the paradigm of...
Conference Paper
Location-based services and data mining algorithms analyzing objects moving on a complex traffic network are becoming increasingly important. In this paper, we introduce a new approach which effectively and efficiently detects dense areas in spatial networks. In an offline phase, we generate a hierarchical partitioning of the traffic network. There...
Chapter
Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging, and many others. Especially for CAD (Computer-Aided Design), suitable similarity models and a clear representation of the results can help to reduce the cost of developing and produci...
Chapter
Full-text available
In order to generate efficient execution plans for queries comprising spatial data types and predicates, the database system has to be equipped with appropriate index structures, query processing methods and optimization rules. Although available extensible indexing frameworks provide a gateway for seamless integration of spatial access methods int...
Chapter
Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging, and many others. Especially for CAD (Computer-Aided Design), suitable similarity models and a clear representation of the results can help to reduce the cost of developing and produci...
Conference Paper
The hierarchical density-based clustering algorithm OPTICS has proven to help the user to get an overview over large data sets. When using OPTICS for analyzing uncertain data which naturally occur in many emerging application areas, e.g. location based services, or sensor databases, the similarity between uncertain objects has to be expressed by on...
Conference Paper
In many modem application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper, we present a general approach for extracting knowledge out of distributed data sets without transmitting all data from the local clients to a server site. In order to kee...
Conference Paper
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an ef- ficient distributed intersection join in order to extract new and global knowledge. A solution for carrying out a global intersection join is to transmit all distributed information from the client...
Conference Paper
The efficient management of complex objects has become an enabling technology for modern multimedia information systems as well as for many novel database applications. Unfortunately, the integration of modern database systems into human centered virtual reality applications including multimodal simulations fails to achieve the indispensably requir...
Conference Paper
One of the most common query types in spatial database management systems is the spatial intersection join. Many state-of-the-art join algorithms use minimal bounding rectangles to determine join candidates in a first filter step. In the case of very complex spatial objects, as used in novel database applications including computer-aided design and...
Conference Paper
Modern geographic information systems do not only have to handle static information but also dynamically moving ob- jects. Clustering algorithms for these moving objects provide new and helpful information, e.g. jam detection is possible by means of these algorithms. One of the main problems of these clustering algorithms is that only uncertain pos...
Conference Paper
Modern database applications including computer-aided de- sign, multimedia information systems, medical imaging, mo- lecular biology, or geographical information systems impose new requirements on the effective and efficient management of spatial data. Particular problems arise from the need of high resolutions for large spatial objects. In this sh...
Conference Paper
Clustering has become an increasingly important task in modern applica- tion domains. In many areas, e.g. when clustering complex objects, in distributed clustering, or when clustering mobile objects, due to technical, security, or efficiency reasons it is not possible to compute an "optimal" clustering. Recently a lot of re- search has been done o...
Conference Paper
Clustering has become an increasingly important task in modern application domains where the data are originally located at different sites. In order to create a central clustering, all clients have to transmit their data to a central server. Due to technical limitations and security aspects, at the central site often only vague object descriptions...
Conference Paper
In many different application areas, e.g. sensor databases, location based services or face recognition systems, distances between odjects have to be computed based on vague and uncertain data. Commonly, the distances between these uncertain object descriptions are expressed by one numerical distance value. Based on such single-valued distance func...
Chapter
In order to generate efficient execution plans for queries comprising spatial data types and predicates, the database system has to be equipped with appropriate index structures, query processing methods and optimization rules. Although available extensible indexing frameworks provide a gateway for seamless integration of spatial access methods int...
Conference Paper
Nowadays, data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many different application domains, complex object representations along with complex distance functions are used for measuring the similarity between objects. Often, not only these complex dista...
Conference Paper
Clustering has become an increasingly important task in analysing huge amounts of data. Traditional applications require that all data has to be located at the site where it is scrutinized. Nowadays, large amounts of heterogeneous, complex data reside on different, independently working computers which are connected to each other via local or wide...
Conference Paper
In contrast to space-partitioning index structures, data-partitioning index structures naturally adapt to the actual data distribution which results in a very good query response behavior. Besides efficient query processing, modern database applications including computer-aided design, medical imaging, or molecular biology require fully-fledged dat...
Conference Paper
Modern database applications including computer-aided design (CAD), medical imaging, molecular biology, or multimedia information systems impose new requirements on efficient spatial query processing. One of the most common query types in spatial database management systems is the spatial join. In this paper, we investigate spatial join processing...
Article
Full-text available
Introduction In the last ten years, an increasing number of database applications has emerged for which efficient and effective support for similarity search is substantial. Particularly, the task of finding similar shapes in 2-D and 3-D becomes more and more important. Examples for new applications that require the retrieval of similar 3-D objects...
Conference Paper
Full-text available
Similarity search in database systems is becoming an increas- ingly important task in modern application domains such as multimedia, molecular biology, medical imaging, computer aided engineering, marketing and purchasing assistance as well as many others. In this paper, we show how visualizing the hierarchical clustering structure of a database of...
Conference Paper
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational database systems. Furthermore, there exist effective and effi- cient models to estimate the selectivity and the I/O cost in order to guide the cost-based optimizer whether and...
Conference Paper
Full-text available
The efficient management of interval sequences represents a core re- quirement for many temporal and spatial database applications. With the Rela- tional Interval Tree (RI-tree), an efficient access method has been proposed to process intersection queries of spatial objects encoded by interval sequences on top of existing object-relational database...
Conference Paper
Clustering has become an increasingly important task in modern applica- tion domains such as marketing and purchasing assistance, multimedia, molecular bi- ology as well as many others. In most of these areas, the data are originally collected at different sites. In order to extract information from these data, they are merged at a central site and...
Article
Clustering has become an increasingly important task in modern application domains such as marketing and purchasing assistance, multimedia, molecular biology as well as many others. In many of these areas, the data are originally collected at different sites. In order to extract information out of these data, they are brought together and then clus...
Article
Full-text available
Similarity search is an important task in a wide range of scie ntific database applications. Besides being used directly, it is also used as a basic operation for many da ta mining algorithms. Example applications which are presented in this article are functional classific ation of proteins in biological databases and the similarity search of CAD...
Conference Paper
In order to guarantee efficient query processing together with industrial strength, spatial index structures have to be integrated into fully-fledged object-relational database management systems (ORDBMSs). A promising way to cope with spatial data can be found somewhere in between replicating and non-replicating spatial index structures. In this p...
Conference Paper
Clustering has become an increasingly important task in modern application domains. Mostly, the data are originally collected at different sites. In order to extract information from these data, they are merged at a central site and then clustered. Another approach is to cluster the data locally and extract suitable representatives from these clust...
Conference Paper
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new requirements on the effective and efficient management of spatial data. Particular problems arise from the need of high resolutions for large spatial objects and from the de...
Article
Modern spatial database applications including computer-aided design (CAD), medical imaging, molecular biology, or geographical information systems (GIS) impose new requirements on spatial query processing.
Article
Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging, computer aided engineering, marketing and purchasing assistance as well as many others. In this paper, we show how visualizing the hierarchical clustering structure of a database of o...
Article
Similarity search in database systems is becoming an increasingly important task in modern application domains such as multimedia, molecular biology, medical imaging, computer aided engineering, marketing and purchasing assistance as well as many others. In this paper, we show how visualizing the hierarchical clustering structure of a database of o...
Conference Paper
Full-text available
Relational index structures, as for instance the Relational Interval Tree, the Relational RTree, or the Linear Quadtree, support efficient processing of queries on top of existing object-relational database systems. Furthermore, there exist effective and efficient models to estimate the selectivity and the I/O cost in order to guide the cost-based...
Conference Paper
In modern application domains such as multimedia, molecular biology and medical imaging, similarity search in database systems is becoming an increasingly important task. Especially for CAD applications, suitable similarity models can help to reduce the cost of developing and producing new parts by maximizing the reuse of existing parts. Most of th...
Conference Paper
Full-text available
Modern database applications including computer-aided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems arise from the need of high resolutions for very large spatial objects, including cars, space stations, planes and industrial plants, and from the design goal to use gener...
Conference Paper
Full-text available
Similarity search in database systems is becoming an increasingly important task in modem application domains such as multimedia, molecular biology, medical imaging and many others. Especially for CAD applications, suitable similarity models and a clear representation of the results can help to reduce the cost of developing and producing new parts...
Conference Paper
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of quer ies on top of existing object-relational database sys- tems. Furthermore, there exist effec tive and efficient models to estimate the selectivity and the I/O cost in order to guide the cost-b...
Conference Paper
Full-text available
In order to achieve efficient execution plans for queries comprising user- defined data types and predicates, the database system has to be provided with appro- priate index structures, query processing methods, and optimization rules. Although available extensible indexing frameworks provide a gateway to seamlessly integrate user-defined access me...
Conference Paper
Full-text available
In the automotive and aerospace industry, millions of technical docu- ments are generated during the development of complex engineering products. Par- ticularly, the universal application of Computer Aided Design (CAD) from the very first design to the final documentation created the need for transactional, con- current, reliable, and secure data m...
Conference Paper
Full-text available
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the relational interval tree (RI-tree), an efficient access method has been proposed to process interval intersection queries on top of existing object-relational database systems. The paper complements that approach by...
Article
Full-text available
Databases are getting more and more important for storing com- plex objects from scientific, engineering or multimedia applica- tions. Examples for such data are chemical compounds, CAD draw- ings or XML data. The efficient search for similar objects in such databases is a key feature. However, the general problem of many similarity measures for co...
Article
München, University, Diss., 2004 (Nicht für den Austausch).

Network

Cited By