 |
Dr. Martin Werner Lehrstuhl für Mobile und Verteilte Systeme Ludwig-Maximilians-Universität München, Institut für Informatik Raum Telefon: Fax: Mail: martin.werner@ifi.lmu.de |
Aufgabengebiet
Indoor-Positioning
Indoor-Location-Based Services
Security and Privacy in Location Based Services
Ubiquitous Computing
Sprechstunde:
auf Anfrage
Publikationen
2018
- M. Werner and S. Feld, „Successful Data Science Is a Communication Challenge,“ in Digital Marketplaces Unleashed, Springer, 2018, p. 583–592.
[BibTeX]@incollection{werner2018successful, title = {Successful Data Science Is a Communication Challenge}, author = {Werner, Martin and Feld, Sebastian}, booktitle = {Digital Marketplaces Unleashed}, publisher = {Springer}, year = {2018}, pages = {583--592}, owner = {sfeld}, timestamp = {2017.09.20} }
2017
- M. Kiermeier, M. Werner, C. Linnhoff-Popien, H. Sauer, and J. Wieghardt, „Anomaly Detection in Self-Organizing Industrial Systems Using Pathlets,“ in Proceedings of the 18th IEEE International Conference on Industrial Technology (ICIT), 2017.
[BibTeX]@inproceedings{kiermeier2017anomaly, title = {Anomaly Detection in Self-Organizing Industrial Systems Using Pathlets}, author = {Marie Kiermeier and Martin Werner and Claudia Linnhoff-Popien and Horst Sauer and Jan Wieghardt}, booktitle = {Proceedings of the 18th IEEE International Conference on Industrial Technology (ICIT)}, year = {2017}, owner = {mkiermeier}, timestamp = {2017.05.29} } - C. Linnhoff-Popien, S. Feld, M. Werner, and M. Schönfeld, „Innovationszentrum Mobiles Internet des ZD.B – Methoden der Digitalisierung in der Arbeitswelt,“ in 50 Jahre Universitäts-Informatik in München, Springer Vieweg, Berlin, Heidelberg, 2017, p. 87–95.
[BibTeX]@incollection{linnhoff2017innovationszentrum, title = {Innovationszentrum Mobiles Internet des ZD.B -- Methoden der Digitalisierung in der Arbeitswelt}, author = {Claudia Linnhoff-Popien and Sebastian Feld and Martin Werner and Mirco Schönfeld}, booktitle = {50 Jahre Universitäts-Informatik in München}, publisher = {Springer Vieweg, Berlin, Heidelberg}, year = {2017}, pages = {87--95}, owner = {clinnhoff}, timestamp = {2017.09.12} } - M. Kiermeier, M. Werner, H. Sauer, and J. Wieghardt, „Building scalable models for anomaly detection in self-organizing industrial systems,“ in Proceedings of the 15th IEEE International Conference on Industrial Informatics (INDIN), 2017.
[BibTeX]@inproceedings{kiermeier2017building, author = {Kiermeier, Marie and Werner, Martin and Sauer, Horst and Wieghardt, Jan}, title = {Building scalable models for anomaly detection in self-organizing industrial systems}, booktitle = {Proceedings of the 15th IEEE International Conference on Industrial Informatics (INDIN)}, year = {2017}, publisher = {IEEE}, owner = {mkiermeier} } - M. Kiermeier and M. Werner, „Similarity Search for Spatial Trajectories Using Online Lower Bounding DTW and Presorting Strategies,“ in Proceedings of the 24th International Symposium on Temporal Representation and Reasoning (TIME), 2017.
[BibTeX]@inproceedings{kiermeier2017similarity, author = {Kiermeier, Marie and Werner, Martin}, title = {Similarity Search for Spatial Trajectories Using Online Lower Bounding DTW and Presorting Strategies}, booktitle = {Proceedings of the 24th International Symposium on Temporal Representation and Reasoning (TIME)}, year = {2017}, owner = {mkiermeier} }
2016
- S. Feld, M. Schönfeld, and M. Werner, „Traversing Bitcoin’s P2P network: Insights into the structure of a decentralized currency,“ International Journal of Computational Science and Engineering (IJCSE), Special Issue on Security and Trust Issues in Peer-to-Peer Networks, vol. 13, iss. 2, pp. 122-131, 2016.
[BibTeX] [Abstract] [Download PDF]
Bitcoin has become increasingly important for several years. While being declared dead in the meantime, it got a boost in 2011. The exchange rate increased from \$14 in January 2013 up to \$240 in April 2013 and even \$900 in early 2014. Lots of existing work addresses the analysis of the publicly available transaction graph. There are evaluations of the user’s anonymity and privacy, but no proper measurements of the underlying network. In this paper, we present novel insights about Bitcoin’s peer-to-peer network, with a focus on its distribution among distinct autonomous systems. The resilience of the Bitcoin ecosystem, the unambiguousness of the blockchain in use, the propagation and verification of transaction blocks, but also the anonymity of Bitcoin’s users depend on the structure of the global peer-to-peer network. Our work is the first thorough analysis of Bitcoin’s underlying peer-to-peer network, especially with regard to its distribution at the autonomous system level. We traversed Bitcoin’s peer-to-peer network in a protocol-compliant manner and made statements about the size of the accessible network and the number of clients. This information is useful when modelling the probability of attacks against the user’s privacy or other aspects. Further, we investigated the distribution of the peer-to-peer network on autonomous systems. The concrete form has an impact on the above-mentioned topics, such as vitality, resilience or privacy. Finally, we analysed the mechanism to announce known peers. It turns out that Bitcoin’s peer announcement is not well distributed, affecting information propagation.
@article{bitcoinjournal, title = {Traversing Bitcoin’s P2P network: Insights into the structure of a decentralized currency}, author = {Sebastian Feld and Mirco Schönfeld and Martin Werner}, journal = {International Journal of Computational Science and Engineering (IJCSE), Special Issue on Security and Trust Issues in Peer-to-Peer Networks}, year = {2016}, number = {2}, pages = {122-131}, volume = {13}, abstract = {Bitcoin has become increasingly important for several years. While being declared dead in the meantime, it got a boost in 2011. The exchange rate increased from \$14 in January 2013 up to \$240 in April 2013 and even \$900 in early 2014. Lots of existing work addresses the analysis of the publicly available transaction graph. There are evaluations of the user's anonymity and privacy, but no proper measurements of the underlying network. In this paper, we present novel insights about Bitcoin's peer-to-peer network, with a focus on its distribution among distinct autonomous systems. The resilience of the Bitcoin ecosystem, the unambiguousness of the blockchain in use, the propagation and verification of transaction blocks, but also the anonymity of Bitcoin's users depend on the structure of the global peer-to-peer network. Our work is the first thorough analysis of Bitcoin's underlying peer-to-peer network, especially with regard to its distribution at the autonomous system level. We traversed Bitcoin's peer-to-peer network in a protocol-compliant manner and made statements about the size of the accessible network and the number of clients. This information is useful when modelling the probability of attacks against the user's privacy or other aspects. Further, we investigated the distribution of the peer-to-peer network on autonomous systems. The concrete form has an impact on the above-mentioned topics, such as vitality, resilience or privacy. Finally, we analysed the mechanism to announce known peers. It turns out that Bitcoin's peer announcement is not well distributed, affecting information propagation.}, owner = {sfeld}, url = {http://www.inderscience.com/offer.php?id=78441} } - S. Feld, M. Werner, and C. Linnhoff-Popien, „Approximated Environment Features With Application to Trajectory Annotation,“ in 6th IEEE Symposium Series on Computational Intelligence (IEEE SSCI 2016), 2016.
[BibTeX]@inproceedings{feld2016approximated, author = {Sebastian Feld and Martin Werner and Claudia Linnhoff-Popien}, title = {Approximated Environment Features With Application to Trajectory Annotation}, booktitle = {6th IEEE Symposium Series on Computational Intelligence (IEEE SSCI 2016)}, year = {2016}, owner = {sfeld} } - S. Feld, M. Werner, and C. Linnhoff-Popien, „Criteria for Selecting Small Sets of Alternative Routes in Free Space Scenarios,“ in 13th International Conference on Location-Based Services (LBS 2016), 2016.
[BibTeX]@inproceedings{feld2016criteria, author = {Sebastian Feld and Martin Werner and Claudia Linnhoff-Popien}, title = {Criteria for Selecting Small Sets of Alternative Routes in Free Space Scenarios}, booktitle = {13th International Conference on Location-Based Services (LBS 2016)}, year = {2016}, owner = {sfeld} } - E. J. Hoffmann, M. Werner, and L. Schauer, „Indoor Navigation Using Virtual Anchor Points,“ in European Navigation Conference (ENC 2016), 2016.
[BibTeX] [Download PDF]@inproceedings{hoffmann2016indoor, title = {Indoor Navigation Using Virtual Anchor Points}, author = {Eike Jens Hoffmann and Martin Werner and Lorenz Schauer}, booktitle = {European Navigation Conference (ENC 2016)}, year = {2016}, owner = {ehoffmann}, timestamp = {2016.07.28}, url = {http://www.martinwerner.de/preprint/VAP.pdf} } - M. Werner, C. Hahn, and L. Schauer, „DeepMoVIPS: Visual Indoor Positioning Using Transfer Learning,“ in 7th International Conference on Indoor Positioning and Indoor Navigation (IPIN 2016), 2016.
[BibTeX]@inproceedings{werner2016deepmovips, title = {DeepMoVIPS: Visual Indoor Positioning Using Transfer Learning}, author = {Martin Werner and Carsten Hahn and Lorenz Schauer}, booktitle = {7th International Conference on Indoor Positioning and Indoor Navigation (IPIN 2016)}, year = {2016}, owner = {mwerner} } - M. Werner and M. Kiermeier, „A Low-Dimensional Feature Vector Representation for Alignment-Free Spatial Trajectory Analysis,“ in Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems (MobiGIS’16), 2016.
[BibTeX]@inproceedings{AlignmentFree, title = {A Low-Dimensional Feature Vector Representation for Alignment-Free Spatial Trajectory Analysis}, author = {Martin Werner and Marie Kiermeier}, booktitle = {Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems (MobiGIS'16)}, year = {2016}, owner = {mwerner}, timestamp = {2016.11.17} }
2015
- A. Ebert, S. Feld, and M. Werner, „Nuanced Collision Detection for Parked Vehicles,“ in 12. GI/ITG KuVS Fachgespräch Ortsbezogene Anwendungen und Dienste (LBAS 2015), 2015.
[BibTeX]@inproceedings{collisiondetection15, title = {Nuanced Collision Detection for Parked Vehicles}, author = {André Ebert and Sebastian Feld and Martin Werner}, booktitle = {12. GI/ITG KuVS Fachgespräch Ortsbezogene Anwendungen und Dienste (LBAS 2015)}, year = {2015}, owner = {aebert} } - A. Ebert, C. Marouane, B. Rott, and M. Werner, „KeyPocket – Improving Security and Usability for Provider Independent Login Architectures with Mobile Devices,“ in EAI 11th International Conference on Security and Privacy in Communication Networks (SecureComm 2015), 2015.
[BibTeX]@inproceedings{keypocket15, title = {KeyPocket - Improving Security and Usability for Provider Independent Login Architectures with Mobile Devices}, author = {André Ebert and Chadly Marouane and Benno Rott and Martin Werner}, booktitle = {EAI 11th International Conference on Security and Privacy in Communication Networks (SecureComm 2015)}, year = {2015}, publisher = {EAI}, owner = {aebert}, timestamp = {2015.09.30} } - S. Feld, M. Werner, M. Schönfeld, and S. Hasler, „Archetypes of Alternative Routes in Buildings,“ in 6th International Conference on Indoor Positioning and Indoor Navigation (IPIN 2015), 2015, pp. 1-10.
[BibTeX] [Abstract]
Alternative routes have found many applications in navigation scenarios. However, alternative routes have only been introduced recently for the indoor space due to the complexity of these environments. Furthermore, the number of alternative routes in buildings can be quite high. With this paper, we propose to organize sets of alternative routes by employing archetypal analysis on a feature space representation of routes and show results in which a set of hundreds of routes between the same start and end point has been compressed to only a few obviously different archetypal routes. Additionally, the framework allows for comparing routes with archetypes and with each other. This comparison does not reveal spatial similarity alone, but rather a measure of routes‘ similarity representing their inherent semantic character.
@inproceedings{feld2015archetypes, title = {Archetypes of Alternative Routes in Buildings}, author = {Sebastian Feld and Martin Werner and Mirco Schönfeld and Stefanie Hasler}, booktitle = {6th International Conference on Indoor Positioning and Indoor Navigation (IPIN 2015)}, year = {2015}, pages = {1-10}, abstract = {Alternative routes have found many applications in navigation scenarios. However, alternative routes have only been introduced recently for the indoor space due to the complexity of these environments. Furthermore, the number of alternative routes in buildings can be quite high. With this paper, we propose to organize sets of alternative routes by employing archetypal analysis on a feature space representation of routes and show results in which a set of hundreds of routes between the same start and end point has been compressed to only a few obviously different archetypal routes. Additionally, the framework allows for comparing routes with archetypes and with each other. This comparison does not reveal spatial similarity alone, but rather a measure of routes' similarity representing their inherent semantic character.}, owner = {sebastian}, timestamp = {2015.12.01} } - L. Schauer and M. Werner, „Kunden-Monitoring im stationären Handel,“ in Marktplätze im Umbruch – Digitale Strategien fuer Services im Mobilen Internet, C. Linnhoff-Popien, M. Zaddach, and A. Grahl, Eds., Springer Berlin Heidelberg, 2015, pp. 73-82.
[BibTeX] [Download PDF]@incollection{schauer15kunden, title = {Kunden-Monitoring im stationären Handel}, author = {Lorenz Schauer and Martin Werner}, booktitle = {Marktplätze im Umbruch - Digitale Strategien fuer Services im Mobilen Internet}, publisher = {Springer Berlin Heidelberg}, year = {2015}, editor = {Claudia Linnhoff-Popien and Michael Zaddach and Andreas Grahl}, pages = {73-82}, series = {Xpert.press}, owner = {lschauer}, timestamp = {2015.09.28}, url = {http://link.springer.com/chapter/10.1007/978-3-662-43782-7_10} } - L. Schauer and M. Werner, „Analyzing Pedestrian Flows Based on Wi-Fi and Bluetooth Captures,“ EAI Endorsed Transactions on Ubiquitous Environments, vol. 15, iss. 4, 2015. doi:10.4108/ue.1.4.e4
[BibTeX] [Download PDF]@article{schauer15analyzing, title = {Analyzing Pedestrian Flows Based on Wi-Fi and Bluetooth Captures}, author = {Lorenz Schauer and Martin Werner}, journal = {EAI Endorsed Transactions on Ubiquitous Environments}, year = {2015}, month = {5}, number = {4}, volume = {15}, doi = {10.4108/ue.1.4.e4}, keywords = {crowd density, pedestrian flow, tracking, Wi-Fi probes, Bluetooth}, owner = {lschauer}, timestamp = {2015.07.10}, url = {http://www.eudl.eu/pdf/10.4108/ue.1.4.e4} } - L. Schauer and M. Werner, „Clustering of Inertial Indoor Positioning Data,“ in 1st KuVS Expert Talk on Localization, 2015.
[BibTeX] [Download PDF]@inproceedings{schauer15clustering, title = {Clustering of Inertial Indoor Positioning Data}, author = {Lorenz Schauer and Martin Werner}, booktitle = {1st KuVS Expert Talk on Localization}, year = {2015}, owner = {lschauer}, timestamp = {2015.07.10}, url = {http://www.cip.ifi.lmu.de/~schauer/publications/ClusteringIndoor.pdf} } - M. Schönfeld, M. Werner, C. Linnhoff-Popien, and A. Erk, „Towards a Privacy-Preserving Hybrid Radio Network: Design and Open Challenges,“ in 15th International Conference on Innovations for Community Services (I4CS 2015), 2015, pp. 1-6.
[BibTeX] [Download PDF]@inproceedings{RadioNetwork, title = {Towards a Privacy-Preserving Hybrid Radio Network: Design and Open Challenges}, author = {Mirco Schönfeld and Martin Werner and Claudia Linnhoff-Popien and Alexander Erk}, booktitle = {15th International Conference on Innovations for Community Services (I4CS 2015)}, year = {2015}, pages = {1-6}, owner = {mschönfeld}, timestamp = {2015.08.06}, url = {http://publications.mircoschoenfeld.de/2015-RadioNetwork.pdf} } - M. Werner, F. Dorfmeister, and M. Schönfeld, „AMBIENCE: A Context-Centric Online Social Network,“ in Accepted for Inclusion in the 12th Workshop on Positioning, Navigation and Communications (WPNC 2015), 2015.
[BibTeX] [Download PDF]@inproceedings{ambience, title = {AMBIENCE: A Context-Centric Online Social Network}, author = {Martin Werner and Florian Dorfmeister and Mirco Schönfeld}, booktitle = {Accepted for Inclusion in the 12th Workshop on Positioning, Navigation and Communications (WPNC 2015)}, year = {2015}, publisher = {IEEE}, file = {2015-Ambience.pdf:http\://publications.mircoschoenfeld.de/2015-Ambience.pdf:PDF}, url = {http://publications.mircoschoenfeld.de/2015-Ambience.pdf} } - M. Werner and M. Schönfeld, „The Gaussian Bloom Filter,“ in 20th International Conference on Database Systems for Advanced Applications (DASFAA 2015), 2015, pp. 191-206.
[BibTeX]@inproceedings{gaussianbloom, title = {The Gaussian Bloom Filter}, author = {Martin Werner and Mirco Schönfeld}, booktitle = {20th International Conference on Database Systems for Advanced Applications (DASFAA 2015)}, year = {2015}, pages = {191-206} }
2014
- M. T. Beck, M. Werner, S. Feld, and T. Schimper, „Mobile Edge Computing: A taxonomy,“ in 6h International Conference on Advances in Future Internet (AFIN 2014), 2014, pp. 48-54.
[BibTeX] [Abstract]
Mobile Edge Computing proposes co-locating computing and storage resources at base stations of cellular networks. It is seen as a promising technique to alleviate utilization of the mobile core and to reduce latency for mobile end users. Due to the fact that Mobile Edge Computing is a novel approach not yet deployed in real-life networks, recent work discusses merely general and non-technical ideas and concepts. This paper introduces a taxonomy for Mobile Edge Computing applications and analyzes chances and limitations from a technical point of view. Application types which profit from edge deployment are identified and discussed. Furthermore, these applications are systematically classified based on technical metrics.
@inproceedings{mectaxonomy, title = {Mobile Edge Computing: A taxonomy}, author = {Michael Till Beck and Martin Werner and Sebastian Feld and Thomas Schimper}, booktitle = {6h International Conference on Advances in Future Internet (AFIN 2014)}, year = {2014}, pages = {48-54}, publisher = {IARIA}, abstract = {Mobile Edge Computing proposes co-locating computing and storage resources at base stations of cellular networks. It is seen as a promising technique to alleviate utilization of the mobile core and to reduce latency for mobile end users. Due to the fact that Mobile Edge Computing is a novel approach not yet deployed in real-life networks, recent work discusses merely general and non-technical ideas and concepts. This paper introduces a taxonomy for Mobile Edge Computing applications and analyzes chances and limitations from a technical point of view. Application types which profit from edge deployment are identified and discussed. Furthermore, these applications are systematically classified based on technical metrics.}, keywords = {Edge Deployment, Cellular Networks, Classification}, owner = {mbeck} } - S. Feld, M. Schönfeld, and M. Werner, „Analyzing the Deployment of Bitcoin’s P2P Network under an AS-level Perspective,“ in 5th International Conference on Ambient Systems, Networks and Technologies (ANT 2014) and 4th International Conference on Sustainable Energy Information Technology (SEIT 2014), 2014, pp. 1121-1126.
[BibTeX] [Abstract] [Download PDF]
Bitcoin has become increasingly important in recent years. The exchange rate raised from \$14 in January 2013 up to \$240 in April 2013 and even \$900 in early 2014. In this paper, we present novel insights about Bitcoin’s peer-to-peer (P2P) network with a special focus on its distribution among distinct autonomous systems. We traversed Bitcoin’s P2P network in a protocol-compliant manner and collected information about the network size, the number of clients, and the network distribution among autonomous systems. Our findings lead to conclusions about the resilience of the Bitcoin ecosystem, the unambiguousness of the blockchain in use, and the propagation and verification of transaction blocks.
@inproceedings{bitcoin, title = {Analyzing the Deployment of Bitcoin's P2P Network under an AS-level Perspective}, author = {Sebastian Feld and Mirco Schönfeld and Martin Werner}, booktitle = {5th International Conference on Ambient Systems, Networks and Technologies (ANT 2014) and 4th International Conference on Sustainable Energy Information Technology (SEIT 2014)}, year = {2014}, pages = {1121-1126}, abstract = {Bitcoin has become increasingly important in recent years. The exchange rate raised from \$14 in January 2013 up to \$240 in April 2013 and even \$900 in early 2014. In this paper, we present novel insights about Bitcoin's peer-to-peer (P2P) network with a special focus on its distribution among distinct autonomous systems. We traversed Bitcoin's P2P network in a protocol-compliant manner and collected information about the network size, the number of clients, and the network distribution among autonomous systems. Our findings lead to conclusions about the resilience of the Bitcoin ecosystem, the unambiguousness of the blockchain in use, and the propagation and verification of transaction blocks.}, file = {pdf?md5=2a5efb534e0d4dc1e12ba9b4157ae4c9&pid=1-s2.0-S187705091400742X-main.pdf:http\://www.sciencedirect.com/science/article/pii/S187705091400742X/pdf?md5=2a5efb534e0d4dc1e12ba9b4157ae4c9&pid=1-s2.0-S187705091400742X-main.pdf:PDF}, owner = {sfeld}, url = {http://www.sciencedirect.com/science/article/pii/S187705091400742X} } - S. Feld and M. Werner, „Compression of GPS tracks Using Map Information,“ in 11. GI/ITG KuVS Fachgespräch Ortsbezogene Anwendungen und Dienste (LBAS 2014), 2014, pp. 103-114.
[BibTeX] [Abstract]
With this paper, we propose a novel semantic compression scheme for GPS trajectories which exploits map knowledge for data reduction. Therefore, the compression is integrated into a simple map matching scheme and shows superior performance with respect to the compression ratio. In contrast to other compression schemes including compressed GPX files, a lot of information about a trajectory can be readily extracted from the given representation and a uniformly sampled representative can be easily calculated for advanced trajectory comparison. We provide a detailed analysis of the approach as well as preliminary results on performance and feasibility of this approach in typical urban mobility scenarios.
@inproceedings{feld2014compression, title = {Compression of GPS tracks Using Map Information}, author = {Sebastian Feld and Martin Werner}, booktitle = {11. GI/ITG KuVS Fachgespräch Ortsbezogene Anwendungen und Dienste (LBAS 2014)}, year = {2014}, pages = {103-114}, abstract = {With this paper, we propose a novel semantic compression scheme for GPS trajectories which exploits map knowledge for data reduction. Therefore, the compression is integrated into a simple map matching scheme and shows superior performance with respect to the compression ratio. In contrast to other compression schemes including compressed GPX files, a lot of information about a trajectory can be readily extracted from the given representation and a uniformly sampled representative can be easily calculated for advanced trajectory comparison. We provide a detailed analysis of the approach as well as preliminary results on performance and feasibility of this approach in typical urban mobility scenarios.}, owner = {sfeld} } - C. Marouane, M. Maier, S. Feld, and M. Werner, „Visual Positioning Systems – An Extension to MoVIPS,“ in 5th International Conference on Indoor Positioning and Indoor Navigation (IPIN 2014), 2014, pp. 95-104.
[BibTeX] [Abstract]
Due to the increasing popularity of location-based services, the need for reliable and cost-effective indoor positioning methods is rising. As an alternative to radio-based localization methods, in 2011, we introduced MoVIPS (Mobile Visual Indoor Positioning System), which is based on the idea to extract visual feature points from a query image and compare them to those of previously collected geo-referenced images. The general feasibility of positioning by SURF points on a conventional smartphone was already shown in our previous work. However, the system still faced several shortcomings concerning real-world usage such as request times being too high and distance estimation being unreliable because of the employed estimation method not being rotation invariant. In this paper, three extensions are presented that improve the practical applicability of MoVIPS. To speed up request times, both a dead reckoning approach (based on step counting using the accelerometer) and an orientation estimation (based on the smartphone’s compass) are introduced to filter relevant images from the database and thus to reduce the amount of images to compare the query image to. Furthermore, the vectors of the SURF points are quantized. For this purpose, clusters are calculated from all SURF points from the database. As a result, each image can be represented by a histogram of cluster frequencies, which can be compared with each other a lot more efficiently. The third extension is an improvement of the distance estimation method, which uses the matched feature points of an image to perform a perspective transformation and to determine the actual position with the aid of the transformation matrix. Employing the first extension, request times are reduced by 84\% percent. The quantization of the SURF points reduces the search time by a factor of 1000. Finally, the distance estimation is now rotation invariant and enables a better position correction.
@inproceedings{marouane2014visual, title = {Visual Positioning Systems - An Extension to MoVIPS}, author = {Chadly Marouane and Marco Maier and Sebastian Feld and Martin Werner}, booktitle = {5th International Conference on Indoor Positioning and Indoor Navigation (IPIN 2014)}, year = {2014}, pages = {95-104}, abstract = {Due to the increasing popularity of location-based services, the need for reliable and cost-effective indoor positioning methods is rising. As an alternative to radio-based localization methods, in 2011, we introduced MoVIPS (Mobile Visual Indoor Positioning System), which is based on the idea to extract visual feature points from a query image and compare them to those of previously collected geo-referenced images. The general feasibility of positioning by SURF points on a conventional smartphone was already shown in our previous work. However, the system still faced several shortcomings concerning real-world usage such as request times being too high and distance estimation being unreliable because of the employed estimation method not being rotation invariant. In this paper, three extensions are presented that improve the practical applicability of MoVIPS. To speed up request times, both a dead reckoning approach (based on step counting using the accelerometer) and an orientation estimation (based on the smartphone's compass) are introduced to filter relevant images from the database and thus to reduce the amount of images to compare the query image to. Furthermore, the vectors of the SURF points are quantized. For this purpose, clusters are calculated from all SURF points from the database. As a result, each image can be represented by a histogram of cluster frequencies, which can be compared with each other a lot more efficiently. The third extension is an improvement of the distance estimation method, which uses the matched feature points of an image to perform a perspective transformation and to determine the actual position with the aid of the transformation matrix. Employing the first extension, request times are reduced by 84\% percent. The quantization of the SURF points reduces the search time by a factor of 1000. Finally, the distance estimation is now rotation invariant and enables a better position correction.}, owner = {cmarouane} } - L. Schauer, M. Werner, and P. Marcus, „Estimating Crowd Densities and Pedestrian Flows Using Wi-Fi and Bluetooth,“ in 11th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (Mobiquitous 2014), 2014, pp. 171-177.
[BibTeX] [Download PDF]@inproceedings{schaflow14, title = {Estimating Crowd Densities and Pedestrian Flows Using Wi-Fi and Bluetooth}, author = {Lorenz Schauer and Martin Werner and Philipp Marcus}, booktitle = {11th International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (Mobiquitous 2014)}, year = {2014}, pages = {171-177}, owner = {lschauer}, url = {http://www.cip.ifi.lmu.de/~schauer/publications/estimatingCrowds.pdf} } - M. Schönfeld and M. Werner, „Distributed Privacy-Preserving Mean Estimation,“ in 2nd International Conference on Privacy and Security in Mobile Systems (PRISMS 2014), 2014, pp. 1-8.
[BibTeX] [Abstract] [Download PDF]
Due to the rise of mobile computing and smartphones, a lot of information about groups has become accessible. This information shall often be kept secret. Hence distributed algorithms for privacy-preserving distribution estimation are needed. Most research currently focuses on privacy in a database, where a single entity has collected the secret information and privacy is ensured between query results and the database. In fully distributed systems such as sensor networks it is often infeasible to move the data towards a central entity for processing. Instead, distributed algorithms are needed. With this paper we propose a fully distributed, privacy-friendly, consensus-based approach. In our approach all nodes cooperate to generate a sufficiently random obfuscation of their secret values until the estimated and obfuscated values of the individual nodes can be safely published. Then the calculations can be done on this replacement containing only non-secret values but recovering some aspects (mean, standard deviation) of the original distribution.
@inproceedings{distributedmeanestim, title = {Distributed Privacy-Preserving Mean Estimation}, author = {Mirco Schönfeld and Martin Werner}, booktitle = {2nd International Conference on Privacy and Security in Mobile Systems (PRISMS 2014)}, year = {2014}, pages = {1-8}, publisher = {IEEE}, abstract = {Due to the rise of mobile computing and smartphones, a lot of information about groups has become accessible. This information shall often be kept secret. Hence distributed algorithms for privacy-preserving distribution estimation are needed. Most research currently focuses on privacy in a database, where a single entity has collected the secret information and privacy is ensured between query results and the database. In fully distributed systems such as sensor networks it is often infeasible to move the data towards a central entity for processing. Instead, distributed algorithms are needed. With this paper we propose a fully distributed, privacy-friendly, consensus-based approach. In our approach all nodes cooperate to generate a sufficiently random obfuscation of their secret values until the estimated and obfuscated values of the individual nodes can be safely published. Then the calculations can be done on this replacement containing only non-secret values but recovering some aspects (mean, standard deviation) of the original distribution.}, file = {2014-DistrPrivPresMeanEstim.pdf:http\://publications.mircoschoenfeld.de/2014-DistrPrivPresMeanEstim.pdf:PDF}, keywords = {Mobile Systems; Privacy; Distributed Privacy;}, url = {http://publications.mircoschoenfeld.de/2014-DistrPrivPresMeanEstim.pdf} } - M. Werner and S. Feld, „Homotopy and Alternative Routes in Indoor Navigation Scenarios,“ in 5th International Conference on Indoor Positioning and Indoor Navigation (IPIN 2014), 2014, pp. 230-238.
[BibTeX] [Abstract]
There are lots of innovative use cases possible that build on a shortest route between two locations together with a set of alternatives that are highly different yet short. Imagine, for example, a complicated building like an airport, where passengers can consult a computer terminal to get navigation advices to a desired goal. By scanning the boarding card the calculation of alternatives can be made context-sensitive. Based on gender, amount of time, or shopping preferences, for example, the terminal can display different routes regarding floors traversed, or shops and restaurants passed. Furthermore, the building operator can control the presentation of alternatives in order to influence visitor flows in real time. Therefore, we propose to use the topological concept of homotopy in order to decide if two routes should be considered equivalent or alternative. Basically, the homotopy relation identifies equivalence classes. We propose that a representative of an equivalence class is an alternative regarding another equivalence class. We concatenate the two routes in question and thus, create a polygon. If there is an obstacle inside, the routes are non-homotopic and we consider them as proper alternatives. For this situation, we propose two fundamentally different approaches that are able to find alternative routes with respect to homotopy. The input is a building plan in form of an occupancy grid. Bitmaps allow for fast calculation of the homotopy relation and can be generated from almost any type of environmental model. The first approach aims for enumerating routes that have to visit a special supporting point. This concatenation of two shortest paths leads to alternatives very fast. The second approach is orthogonal to that in the sense that it generates alternatives roughly ordered by their length. Finally, we evaluate and discuss the approaches‘ feasibility based on different metrics in several scenarios.
@inproceedings{werner2014homotopy, title = {Homotopy and Alternative Routes in Indoor Navigation Scenarios}, author = {Martin Werner and Sebastian Feld}, booktitle = {5th International Conference on Indoor Positioning and Indoor Navigation (IPIN 2014)}, year = {2014}, pages = {230-238}, abstract = {There are lots of innovative use cases possible that build on a shortest route between two locations together with a set of alternatives that are highly different yet short. Imagine, for example, a complicated building like an airport, where passengers can consult a computer terminal to get navigation advices to a desired goal. By scanning the boarding card the calculation of alternatives can be made context-sensitive. Based on gender, amount of time, or shopping preferences, for example, the terminal can display different routes regarding floors traversed, or shops and restaurants passed. Furthermore, the building operator can control the presentation of alternatives in order to influence visitor flows in real time. Therefore, we propose to use the topological concept of homotopy in order to decide if two routes should be considered equivalent or alternative. Basically, the homotopy relation identifies equivalence classes. We propose that a representative of an equivalence class is an alternative regarding another equivalence class. We concatenate the two routes in question and thus, create a polygon. If there is an obstacle inside, the routes are non-homotopic and we consider them as proper alternatives. For this situation, we propose two fundamentally different approaches that are able to find alternative routes with respect to homotopy. The input is a building plan in form of an occupancy grid. Bitmaps allow for fast calculation of the homotopy relation and can be generated from almost any type of environmental model. The first approach aims for enumerating routes that have to visit a special supporting point. This concatenation of two shortest paths leads to alternatives very fast. The second approach is orthogonal to that in the sense that it generates alternatives roughly ordered by their length. Finally, we evaluate and discuss the approaches' feasibility based on different metrics in several scenarios.}, owner = {mwerner} } - M. Werner, L. Schauer, and A. Scharf, „Reliable Trajectory Classification Using Wi-Fi Signal Strength in Indoor Scenarios,“ in 2014 IEEE/ION Position Location and Navigation Symposium (PLANS 2014), 2014, pp. 663-670.
[BibTeX] [Download PDF]@inproceedings{reliabletrajectory, title = {Reliable Trajectory Classification Using Wi-Fi Signal Strength in Indoor Scenarios}, author = {Martin Werner and Lorenz Schauer and Andreas Scharf}, booktitle = {2014 IEEE/ION Position Location and Navigation Symposium (PLANS 2014)}, year = {2014}, pages = {663-670}, url = {http://trajectorycomputing.com/datasets/reliable-trajectory-classification-using-wi-fi-signal-strength-indoor-scenarios/} }
2013
- S. Feld and M. Werner, „Efficient Path Planning Involving Equivalent Places,“ in 10. GI/ITG KuVS Fachgespräch Ortsbezogene Anwendungen und Dienste (LBAS 2013), 2013, pp. 13-22.
[BibTeX] [Abstract]
This paper investigates a complication of the classical Traveling Salesman Problem, which arises due to multiple points of interest with functional equivalence. While the classical Traveling Salesman Problem tries to find a shortest tour visiting each point in a set exactly once, we consider the challenge of finding the shortest tour visiting each point of a given set exactly once and exactly one additional point out of a different set of equivalent places. The insertion of a gas station to a traveling salesman problem provides an example. With this paper, we investigate and analyze different algorithms to solve this complex problem by reducing it to the solution of a set of classic Traveling Salesman Problems. Furthermore, we provide an efficient tradeoff between the size of the set of traditional problems still to be solved and the expected error of the algorithm.
@inproceedings{equivalentplan, title = {Efficient Path Planning Involving Equivalent Places}, author = {Sebastian Feld and Martin Werner}, booktitle = {10. GI/ITG KuVS Fachgespräch Ortsbezogene Anwendungen und Dienste (LBAS 2013)}, year = {2013}, pages = {13-22}, publisher = {Logos Verlag Berlin}, abstract = {This paper investigates a complication of the classical Traveling Salesman Problem, which arises due to multiple points of interest with functional equivalence. While the classical Traveling Salesman Problem tries to find a shortest tour visiting each point in a set exactly once, we consider the challenge of finding the shortest tour visiting each point of a given set exactly once and exactly one additional point out of a different set of equivalent places. The insertion of a gas station to a traveling salesman problem provides an example. With this paper, we investigate and analyze different algorithms to solve this complex problem by reducing it to the solution of a set of classic Traveling Salesman Problems. Furthermore, we provide an efficient tradeoff between the size of the set of traditional problems still to be solved and the expected error of the algorithm.}, owner = {sfeld} } - P. Marcus, M. Kessel, and M. Werner, „Dynamic Nearest Neighbors and Online Error Estimation for SMARTPOS,“ International Journal On Advances in Internet Technology, vol. 6, iss. 1 and 2, pp. 1-11, 2013.
[BibTeX] [Download PDF]@article{13MarKesWer, title = {Dynamic Nearest Neighbors and Online Error Estimation for SMARTPOS}, author = {Philipp Marcus and Moritz Kessel and Martin Werner}, journal = {International Journal On Advances in Internet Technology}, year = {2013}, number = {1 and 2}, pages = {1-11}, volume = {6}, owner = {pmarcus}, url = {http://www.thinkmind.org/download.php?articleid=inttech_v6_n12_2013_1} } - M. Schönfeld and M. Werner, „Node Wake-Up via OVSF-Coded Bloom Filters in Wireless Sensor Networks,“ in 5th International Conference on Ad Hoc Networks (ADHOCNETS 2013), 2013.
[BibTeX] [Abstract] [Download PDF]
Interest dissemination in constrained environments such as wireless sensor networks utilizes Bloom filters commonly. A Bloom filter is a probabilistic data structure of fixed length, which can be used to encode the set of sensor nodes to be awake. In this way an application can disseminate interest in specific sensor nodes by broadcasting the Bloom filter throughout the complete wireless sensor network. The probabilistic nature of a Bloom filter induces false positives, that is some sensor nodes will be awake without the application having interest in their sensor values. As the interest is often depending on location such as in adaptive sampling applications, we present a novel method to encode both interest and possible location of information into one probabilistic data structure simultaneously. While our algorithm is able to encode any kind of tree-structured information into a fixed length bit array we exemplify its use through a wireless sensor network. In comparison to traditional Bloom encoding techniques we are able to reduce the overall number of false positives and furthermore reduce the average distance of false positives from the next true positive of the same interest. In our example this helps to reduce the overall energy consumption of the sensor network by only requesting sensor nodes that are likely to store the requested information.
@inproceedings{bloomwakeup, title = {Node Wake-Up via OVSF-Coded Bloom Filters in Wireless Sensor Networks}, author = {Mirco Schönfeld and Martin Werner}, booktitle = {5th International Conference on Ad Hoc Networks (ADHOCNETS 2013)}, year = {2013}, abstract = {Interest dissemination in constrained environments such as wireless sensor networks utilizes Bloom filters commonly. A Bloom filter is a probabilistic data structure of fixed length, which can be used to encode the set of sensor nodes to be awake. In this way an application can disseminate interest in specific sensor nodes by broadcasting the Bloom filter throughout the complete wireless sensor network. The probabilistic nature of a Bloom filter induces false positives, that is some sensor nodes will be awake without the application having interest in their sensor values. As the interest is often depending on location such as in adaptive sampling applications, we present a novel method to encode both interest and possible location of information into one probabilistic data structure simultaneously. While our algorithm is able to encode any kind of tree-structured information into a fixed length bit array we exemplify its use through a wireless sensor network. In comparison to traditional Bloom encoding techniques we are able to reduce the overall number of false positives and furthermore reduce the average distance of false positives from the next true positive of the same interest. In our example this helps to reduce the overall energy consumption of the sensor network by only requesting sensor nodes that are likely to store the requested information.}, file = {2013-HierarchicalHashing.pdf:http\://publications.mircoschoenfeld.de/2013-HierarchicalHashing.pdf:PDF}, url = {http://publications.mircoschoenfeld.de/2013-HierarchicalHashing.pdf} }
2012
- M. Kessel and M. Werner, „Automated WLAN Calibration with a Backtracking Particle Filter,“ in International Conference on Indoor Positioning and Indoor Navigation (IPIN 2012), 2012, pp. 1-10.
[BibTeX] [Download PDF]@inproceedings{kessel2012ipin, title = {Automated WLAN Calibration with a Backtracking Particle Filter}, author = {Moritz Kessel and Martin Werner}, booktitle = {International Conference on Indoor Positioning and Indoor Navigation (IPIN 2012)}, year = {2012}, pages = {1-10}, publisher = {IEEE}, url = {http://dx.doi.org/10.1109/IPIN.2012.6418907} } - M. Kessel, M. Werner, and C. Linnhhoff, „Compass and WLAN Integration for Indoor Tracking on Mobile Phones,“ in 6th International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies (UBICOMM 2012), 2012.
[BibTeX] [Download PDF]@inproceedings{ubicomm2012, title = {Compass and WLAN Integration for Indoor Tracking on Mobile Phones}, author = {Moritz Kessel and Martin Werner and Claudia Linnhhoff}, booktitle = {6th International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies (UBICOMM 2012)}, year = {2012}, url = {http://www.thinkmind.org/index.php?view=article&articleid=ubicomm_2012_1_10_10041} } - J. Preis, M. Kessel, M. Werner, and C. Linnhoff-Popien, „Gait Recognition with Kinect,“ in 1st International Workshop on Kinect in Pervasive Computing, 2012, pp. 28-36.
[BibTeX] [Download PDF]@inproceedings{gaitkinect, title = {Gait Recognition with Kinect}, author = {Johannes Preis and Moritz Kessel and Martin Werner and Claudia Linnhoff-Popien}, booktitle = {1st International Workshop on Kinect in Pervasive Computing}, year = {2012}, pages = {28-36}, url = {http://noggnogg.com/pervasivekinect/wp-content/uploads/2012/06/Preis_GaitRecognition.pdf} } - C. Scheuermann, M. Werner, M. Kessel, C. Linnhoff-Popien, and S. A. W. Verclas, „Evaluation of Barcode Decoding Performance using ZXING Library,“ in 2nd Workshop on Smart Mobile Applications (SmartApps 2012), 2012.
[BibTeX] [Download PDF]@inproceedings{zxingeval, title = {Evaluation of Barcode Decoding Performance using ZXING Library}, author = {Constantin Scheuermann and Martin Werner and Moritz Kessel and Claudia Linnhoff-Popien and Stephan A. W. Verclas}, booktitle = {2nd Workshop on Smart Mobile Applications (SmartApps 2012)}, year = {2012}, url = {http://www.mobile.ifi.uni-muenchen.de/aktuelles/smartapps2012/smartapps12_barcodes.pdf} } - M. Schönfeld, M. Werner, and F. Dorfmeister, „Location-based Access Control Providing One-Time Passwords Through 2D Barcodes,“ in 9. GI/ITG KuVS Fachgespräch Ortsbezogene Anwendungen und Dienste, 2012, pp. 165-168.
[BibTeX] [Abstract] [Download PDF]
Location-based Access Control often relies a location proof, which ensures that a specific user is at a specific location. These locations are most often inferred from measurements. As a consequence, such systems are never trustworthy. An attacker can simply fake sensor measurements or even sensor data in absence of a trusted measurement module. Moreover, the measurement data is typically stable over time at a fixed location and can thus be replayed at later times. With this paper, we propose a system, which can provide functionality for a location proof, which does not rely on measurements and does not suffer from replay attacks. Therefore, a self-contained system is generating signed one-time passwords and communicates them via 2D barcodes for authentication of camera-enabled devices being in a specific location.
@inproceedings{qrcodelocationproof, title = {Location-based Access Control Providing One-Time Passwords Through 2D Barcodes}, author = {Mirco Schönfeld and Martin Werner and Florian Dorfmeister}, booktitle = {9. GI/ITG KuVS Fachgespräch Ortsbezogene Anwendungen und Dienste}, year = {2012}, pages = {165-168}, abstract = {Location-based Access Control often relies a location proof, which ensures that a specific user is at a specific location. These locations are most often inferred from measurements. As a consequence, such systems are never trustworthy. An attacker can simply fake sensor measurements or even sensor data in absence of a trusted measurement module. Moreover, the measurement data is typically stable over time at a fixed location and can thus be replayed at later times. With this paper, we propose a system, which can provide functionality for a location proof, which does not rely on measurements and does not suffer from replay attacks. Therefore, a self-contained system is generating signed one-time passwords and communicates them via 2D barcodes for authentication of camera-enabled devices being in a specific location.}, file = {2012-LBAC.pdf:http\://publications.mircoschoenfeld.de/2012-LBAC.pdf:PDF}, url = {http://publications.mircoschoenfeld.de/2012-LBAC.pdf} } - M. Werner, Ubiquitous Navigation: Skalierbare ortsbezogene Dienste in Gebäuden, Logos Verlag Berlin, 2012.
[BibTeX] [Download PDF]@book{dissertation, title = {Ubiquitous Navigation: Skalierbare ortsbezogene Dienste in Gebäuden}, author = {Martin Werner}, publisher = {Logos Verlag Berlin}, year = {2012}, isbn = {978-3-8325-3226-0}, url = {http://www.logos-verlag.de/cgi-bin/buch/isbn/3226} } - M. Werner, M. Kessel, F. Gschwandtner, M. Dürr, K. Wiesner, and T. Mair, „Technologische Herausforderungen für kontextsensitive Geschäftsanwendungen,“ in Smart Mobile Apps: Mit Business-Apps ins Zeitalter mobiler Geschäftsprozesse, Springer, 2012. doi:10.1007/978-3-642-22259-7_19
[BibTeX] [Download PDF]@incollection{werner2012technologische, title = {Technologische Herausforderungen für kontextsensitive Geschäftsanwendungen}, author = {Martin Werner and Moritz Kessel and Florian Gschwandtner and Michael Dürr and Kevin Wiesner and Thomas Mair}, booktitle = {Smart Mobile Apps: Mit Business-Apps ins Zeitalter mobiler Geschäftsprozesse}, publisher = {Springer}, year = {2012}, doi = {10.1007/978-3-642-22259-7_19}, url = {http://dx.doi.org/10.1007/978-3-642-22259-7_19} } - M. Werner and M. Schönfeld, „DualCodes: Backward-Compatible Multi-Layer 2D-Barcodes,“ in 9th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MOBIQUITOUS 2012), 2012, pp. 25-36.
[BibTeX] [Abstract] [Download PDF]
Matrix codes enable a coupling between virtual and physical worlds for ubiquitous computing applications. With this paper, we propose a technique, which can be used to increase the amount of information contained in a matrix barcode in a backward compatible way. This enables applications to fully utilize the wide spread of QR Codes or Data Matrix Codes for service discovery or basic service, while being able to transmit much more information during one scan for advanced applications. We present the approach, explain difficulties in decoding typical camera images, a simulatory evaluation of decoding performance, and application examples.
@inproceedings{dualcodes, title = {DualCodes: Backward-Compatible Multi-Layer 2D-Barcodes}, author = {Martin Werner and Mirco Schönfeld}, booktitle = {9th Annual International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services (MOBIQUITOUS 2012)}, year = {2012}, pages = {25-36}, abstract = {Matrix codes enable a coupling between virtual and physical worlds for ubiquitous computing applications. With this paper, we propose a technique, which can be used to increase the amount of information contained in a matrix barcode in a backward compatible way. This enables applications to fully utilize the wide spread of QR Codes or Data Matrix Codes for service discovery or basic service, while being able to transmit much more information during one scan for advanced applications. We present the approach, explain difficulties in decoding typical camera images, a simulatory evaluation of decoding performance, and application examples.}, file = {2012-DualCodes.pdf:http\://publications.mircoschoenfeld.de/2012-DualCodes.pdf:PDF}, url = {http://www.springer.com/computer/communication+networks/book/978-3-642-40237-1} }
2011
- M. Duchon, A. Paulus, and M. Werner, „Mobile Anwendung zur Routenplanung mit öffentlichen Verkehrsmitteln basierend auf OpenStreetMap-Daten,“ in Tagungsband der Anwenderkonferenz für Freie und Open Source Software für Geoinformationssysteme (FOSSGIS 2011), 2011.
[BibTeX] [Download PDF]@inproceedings{routeopnv, title = {Mobile Anwendung zur Routenplanung mit öffentlichen Verkehrsmitteln basierend auf OpenStreetMap-Daten}, author = {Markus Duchon and Andreas Paulus and Martin Werner}, booktitle = {Tagungsband der Anwenderkonferenz für Freie und Open Source Software für Geoinformationssysteme (FOSSGIS 2011)}, year = {2011}, url = {https://www.legato.net/download/attachments/2555944/2011_FOSSGIS_Tagungsband.pdf} } - W. Heidrich, M. Schulze, M. Kessel, and M. Werner, „Robustes Map-Matching hoch aufgelöster, fahrzeugbasierter GPS-Tracks,“ in 8. GI/KuVS-Fachgespräches „Ortsbezogene Anwendungen und Dienste“, 2011.
[BibTeX] [Download PDF]@inproceedings{mapmatch, title = {Robustes Map-Matching hoch aufgelöster, fahrzeugbasierter GPS-Tracks}, author = {Wolf Heidrich and Martin Schulze and Moritz Kessel and Martin Werner}, booktitle = {8. GI/KuVS-Fachgespräches "Ortsbezogene Anwendungen und Dienste"}, year = {2011}, url = {http://www.logos-verlag.de/cgi-bin/buch/isbn/3041} } - M. Kessel and M. Werner, „SMARTPOS: Accurate and Precise Indoor Positioning on Mobile Phones,“ in 1st International Conference on Mobile Services, Resources, and Users (MOBILITY 2011), 2011, pp. 158-163.
[BibTeX] [Download PDF]@inproceedings{kessel2011smartpos, title = {SMARTPOS: Accurate and Precise Indoor Positioning on Mobile Phones}, author = {Moritz Kessel and Martin Werner}, booktitle = {1st International Conference on Mobile Services, Resources, and Users (MOBILITY 2011)}, year = {2011}, pages = {158-163}, url = {http://www.thinkmind.org/index.php?view=article&articleid=mobility_2011_8_10_40203} } - M. Werner, „Selection and Ordering of Points-of-Interest in Large-Scale Indoor Navigation Systems,“ in IEEE 35th Annual Computer Software and Applications Conference (COMPSAC 2011), 2011, pp. 504-509. doi:10.1109/COMPSAC.2011.71
[BibTeX] [Download PDF]@inproceedings{6032388, title = {Selection and Ordering of Points-of-Interest in Large-Scale Indoor Navigation Systems}, author = {Martin Werner}, booktitle = {IEEE 35th Annual Computer Software and Applications Conference (COMPSAC 2011)}, year = {2011}, pages = {504 -509}, doi = {10.1109/COMPSAC.2011.71}, url = {http://dx.doi.org/10.1109/COMPSAC.2011.71} } - M. Werner, „Datenschutz in ortsbasierten Diensten,“ digma: Zeitschrift für Datenrecht und Informationssicherheit, vol. 11, iss. 2, pp. 54-59, 2011.
[BibTeX] [Download PDF]@article{datenschutz, title = {Datenschutz in ortsbasierten Diensten}, author = {Martin Werner}, journal = {digma: Zeitschrift für Datenrecht und Informationssicherheit}, year = {2011}, number = {2}, pages = {54 - 59}, volume = {11}, publisher = {Schulthess Juristische Medien AG}, url = {http://www.schulthess.com} } - M. Werner, „Simulation WLAN-basierter Indoor-Positionierung unter Verwendung von CAD-Plänen,“ in 8. GI/KuVS-Fachgespräches „Ortsbezogene Anwendungen und Dienste“, 2011.
[BibTeX] [Download PDF]@inproceedings{indoorsim, title = {Simulation WLAN-basierter Indoor-Positionierung unter Verwendung von CAD-Plänen}, author = {Martin Werner}, booktitle = {8. GI/KuVS-Fachgespräches "Ortsbezogene Anwendungen und Dienste"}, year = {2011}, url = {http://www.logos-verlag.de/cgi-bin/buch/isbn/3041} } - M. Werner, „Privacy-protected communication for location-based services,“ Security and Communication Networks, 2011. doi:10.1002/sec.330
[BibTeX] [Download PDF]@article{ppcomm, title = {Privacy-protected communication for location-based services}, author = {Werner, Martin}, journal = {Security and Communication Networks}, year = {2011}, doi = {10.1002/sec.330}, issn = {1939-0122}, keywords = {location-based services, privacy}, owner = {mwerner}, publisher = {John Wiley \& Sons, Ltd}, timestamp = {2011.05.13}, url = {http://dx.doi.org/10.1002/sec.330} } - M. Werner, „Efficiently Using Bitmap Floorplans for Indoor Navigation on Mobile Phones,“ in 7th International Conference on Wireless and Mobile Communications (ICWMC 2011), 2011, pp. 225-230.
[BibTeX] [Download PDF]@inproceedings{werner2011efficiently, title = {Efficiently Using Bitmap Floorplans for Indoor Navigation on Mobile Phones}, author = {Werner, Martin}, booktitle = {7th International Conference on Wireless and Mobile Communications (ICWMC 2011)}, year = {2011}, pages = {225-230}, url = {http://www.thinkmind.org/index.php?view=article&articleid=icwmc_2011_10_40_20064} } - M. Werner, M. Kessel, and C. Marouane, „Indoor positioning using smartphone camera,“ in International Conference on Indoor Positioning and Indoor Navigation (IPIN 2011), 2011, pp. 1-6. doi:10.1109/IPIN.2011.6071954
[BibTeX] [Download PDF]@inproceedings{werner2011indoor, title = {Indoor positioning using smartphone camera}, author = {Martin Werner and Moritz Kessel and Chadly Marouane}, booktitle = {International Conference on Indoor Positioning and Indoor Navigation (IPIN 2011)}, year = {2011}, pages = {1-6}, publisher = {IEEE}, doi = {10.1109/IPIN.2011.6071954}, url = {http://dx.doi.org/10.1109/IPIN.2011.6071954} }
2010
- M. Dürr, M. Werner, and M. Maier, „Re-Socializing Online Social Networks,“ in 2010 IEEE/ACM International Conference on Green Computing and Communications (GreenCom 2010) & International Conference on Cyber, Physical and Social Computing (CPSCom 2010), 2010, pp. 786-791. doi:10.1109/GreenCom-CPSCom.2010.18
[BibTeX] [Download PDF]@inproceedings{resocial, title = {Re-Socializing Online Social Networks}, author = {Michael Dürr and Martin Werner and Marco Maier}, booktitle = {2010 IEEE/ACM International Conference on Green Computing and Communications (GreenCom 2010) \& International Conference on Cyber, Physical and Social Computing (CPSCom 2010)}, year = {2010}, month = {Dec.}, pages = {786 -791}, doi = {10.1109/GreenCom-CPSCom.2010.18}, url = {http://dx.doi.org/10.1109/GreenCom-CPSCom.2010.18} } - M. Werner, „A Privacy-Enabled Architecture for Location-Based Services,“ in Security and Privacy in Mobile Information and Communication Systems, Springer Berlin Heidelberg, 2010, vol. 47, pp. 80-90.
[BibTeX] [Download PDF]@incollection{privacyarchitecture, title = {A Privacy-Enabled Architecture for Location-Based Services}, author = {Martin Werner}, booktitle = {Security and Privacy in Mobile Information and Communication Systems}, publisher = {Springer Berlin Heidelberg}, year = {2010}, pages = {80-90}, series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering}, volume = {47}, affiliation = {Institute for Informatics of LMU, Mobile and Distributed Systems Group, Munich, Germany}, isbn = {978-3-642-17502-2}, keyword = {Computer Science}, url = {http://dx.doi.org/10.1007/978-3-642-17502-2_7} } - M. Werner and M. Kessel, „Organisation of Indoor Navigation data from a data query perspective,“ in Ubiquitous Positioning Indoor Navigation and Location Based Service (UPINLBS 2010), 2010. doi:10.1109/UPINLBS.2010.5653981
[BibTeX] [Abstract] [Download PDF]
Indoor Navigation is becoming a more and more important topic. It is a key tool for the integration of disabled people into environments which they are not familiar with. With this paper we want to address the problem of indoor navigation being much more complex than outdoor navigation with a thorough modelling of queries which a indoor navigation GIS database shall be able to answer quickly and present an organisation of indoor navigation data tailored to scalable and flexible indoor navigation.
@inproceedings{indoororga, title = {Organisation of Indoor Navigation data from a data query perspective}, author = {Martin Werner and Moritz Kessel}, booktitle = {Ubiquitous Positioning Indoor Navigation and Location Based Service (UPINLBS 2010)}, year = {2010}, abstract = {Indoor Navigation is becoming a more and more important topic. It is a key tool for the integration of disabled people into environments which they are not familiar with. With this paper we want to address the problem of indoor navigation being much more complex than outdoor navigation with a thorough modelling of queries which a indoor navigation GIS database shall be able to answer quickly and present an organisation of indoor navigation data tailored to scalable and flexible indoor navigation.}, doi = {10.1109/UPINLBS.2010.5653981}, url = {http://dx.doi.org/10.1109/UPINLBS.2010.5653981} } - M. Werner, S. A. W. Verclas, and C. Linnhoff-Popien, „A Workflow Definition Language for Business Integration of Mobile Devices,“ in Mobile Wireless Middleware, Operating Systems, and Applications, Springer Berlin Heidelberg, 2010, vol. 48, pp. 353-362.
[BibTeX] [Download PDF]@incollection{Werner2010, title = {A Workflow Definition Language for Business Integration of Mobile Devices}, author = {Martin Werner and Stephan A. W. Verclas and Claudia Linnhoff-Popien}, booktitle = {Mobile Wireless Middleware, Operating Systems, and Applications}, publisher = {Springer Berlin Heidelberg}, year = {2010}, pages = {353-362}, series = {Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering}, volume = {48}, affiliation = {Mobile and Distributed Systems Group, Ludwig-Maximilians University, Munich, Germany}, isbn = {978-3-642-17758-3}, keyword = {Computer Science}, url = {http://dx.doi.org/10.1007/978-3-642-17758-3_27} }
