Philippe Cerfontaine, M. Schirski, Daniel Bündgens, T. Kuhlen
{"title":"虚拟环境中光学跟踪的相机设置优化","authors":"Philippe Cerfontaine, M. Schirski, Daniel Bündgens, T. Kuhlen","doi":"10.2312/EGVE/EGVE06/081-088","DOIUrl":null,"url":null,"abstract":"In this paper we present a method for finding the optimal camera alignment for a tracking system with multiple cameras, by specifying the volume that should be tracked and an initial camera setup. The approach we use is twofold: on the one hand, we use a rather simple gradient based steepest descent method and on the other hand, we also implement a simulated annealing algorithm that features guaranteed optimality assertions. Both approaches are fully automatic and take advantage of modern graphics hardware since we implemented a GPU-based accelerated visibility test. The proposed algorithms can automatically optimize the whole camera setup by adjusting the given set of parameters. The optimization may have different goals depending on the desired application, e.g. one may wish to optimize towards the widest possible coverage of the specified volume, while others would prefer to maximize the number of cameras seeing a certain area to overcome heavy occlusion problems during the tracking process. Our approach also considers parameter constraints that the user may specify according to the local environment where the cameras have to be set up. This makes it possible to simply formulate higher level constraints e.g. all cameras have a vertical up vector. It individually adapts the optimization to the given situation and also asserts the feasibility of the algorithm's output.","PeriodicalId":210571,"journal":{"name":"International Conference on Artificial Reality and Telexistence and Eurographics Symposium on Virtual Environments","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Camera setup optimization for optical tracking in virtual environments\",\"authors\":\"Philippe Cerfontaine, M. Schirski, Daniel Bündgens, T. Kuhlen\",\"doi\":\"10.2312/EGVE/EGVE06/081-088\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present a method for finding the optimal camera alignment for a tracking system with multiple cameras, by specifying the volume that should be tracked and an initial camera setup. The approach we use is twofold: on the one hand, we use a rather simple gradient based steepest descent method and on the other hand, we also implement a simulated annealing algorithm that features guaranteed optimality assertions. Both approaches are fully automatic and take advantage of modern graphics hardware since we implemented a GPU-based accelerated visibility test. The proposed algorithms can automatically optimize the whole camera setup by adjusting the given set of parameters. The optimization may have different goals depending on the desired application, e.g. one may wish to optimize towards the widest possible coverage of the specified volume, while others would prefer to maximize the number of cameras seeing a certain area to overcome heavy occlusion problems during the tracking process. Our approach also considers parameter constraints that the user may specify according to the local environment where the cameras have to be set up. This makes it possible to simply formulate higher level constraints e.g. all cameras have a vertical up vector. It individually adapts the optimization to the given situation and also asserts the feasibility of the algorithm's output.\",\"PeriodicalId\":210571,\"journal\":{\"name\":\"International Conference on Artificial Reality and Telexistence and Eurographics Symposium on Virtual Environments\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Artificial Reality and Telexistence and Eurographics Symposium on Virtual Environments\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2312/EGVE/EGVE06/081-088\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Artificial Reality and Telexistence and Eurographics Symposium on Virtual Environments","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2312/EGVE/EGVE06/081-088","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Camera setup optimization for optical tracking in virtual environments
In this paper we present a method for finding the optimal camera alignment for a tracking system with multiple cameras, by specifying the volume that should be tracked and an initial camera setup. The approach we use is twofold: on the one hand, we use a rather simple gradient based steepest descent method and on the other hand, we also implement a simulated annealing algorithm that features guaranteed optimality assertions. Both approaches are fully automatic and take advantage of modern graphics hardware since we implemented a GPU-based accelerated visibility test. The proposed algorithms can automatically optimize the whole camera setup by adjusting the given set of parameters. The optimization may have different goals depending on the desired application, e.g. one may wish to optimize towards the widest possible coverage of the specified volume, while others would prefer to maximize the number of cameras seeing a certain area to overcome heavy occlusion problems during the tracking process. Our approach also considers parameter constraints that the user may specify according to the local environment where the cameras have to be set up. This makes it possible to simply formulate higher level constraints e.g. all cameras have a vertical up vector. It individually adapts the optimization to the given situation and also asserts the feasibility of the algorithm's output.