{"title":"立体视觉信念传播的CUDA实现","authors":"Young-kyu Choi","doi":"10.1109/ITSC.2010.5625284","DOIUrl":null,"url":null,"abstract":"Measuring distance to obstacles is an important process for intelligent vehicles (IV). With accurate measurement, IV can make appropriate maneuver to avoid such obstacles. To obtain highly accurate result, we used a Markov random field model-based global energy minimization algorithm called belief propagation (BP). However, BP has high computational complexity which makes it difficult for real-time processing. To solve this issue, we took massively parallel approach using Compute Unified Device Architecture (CUDA). In this paper, we first provide profiling result to find the performance bottleneck of BP. Next, we explain CUDA-specific optimization techniques to enhance the performance. We propose a new parallelization technique to speed up the message computation, which takes up the longest time in BP. The experimental result shows that we were able to obtain accurate distance estimation result in real time.","PeriodicalId":176645,"journal":{"name":"13th International IEEE Conference on Intelligent Transportation Systems","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"CUDA implementation of belief propagation for stereo vision\",\"authors\":\"Young-kyu Choi\",\"doi\":\"10.1109/ITSC.2010.5625284\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Measuring distance to obstacles is an important process for intelligent vehicles (IV). With accurate measurement, IV can make appropriate maneuver to avoid such obstacles. To obtain highly accurate result, we used a Markov random field model-based global energy minimization algorithm called belief propagation (BP). However, BP has high computational complexity which makes it difficult for real-time processing. To solve this issue, we took massively parallel approach using Compute Unified Device Architecture (CUDA). In this paper, we first provide profiling result to find the performance bottleneck of BP. Next, we explain CUDA-specific optimization techniques to enhance the performance. We propose a new parallelization technique to speed up the message computation, which takes up the longest time in BP. The experimental result shows that we were able to obtain accurate distance estimation result in real time.\",\"PeriodicalId\":176645,\"journal\":{\"name\":\"13th International IEEE Conference on Intelligent Transportation Systems\",\"volume\":\"96 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"13th International IEEE Conference on Intelligent Transportation Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITSC.2010.5625284\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"13th International IEEE Conference on Intelligent Transportation Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2010.5625284","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
CUDA implementation of belief propagation for stereo vision
Measuring distance to obstacles is an important process for intelligent vehicles (IV). With accurate measurement, IV can make appropriate maneuver to avoid such obstacles. To obtain highly accurate result, we used a Markov random field model-based global energy minimization algorithm called belief propagation (BP). However, BP has high computational complexity which makes it difficult for real-time processing. To solve this issue, we took massively parallel approach using Compute Unified Device Architecture (CUDA). In this paper, we first provide profiling result to find the performance bottleneck of BP. Next, we explain CUDA-specific optimization techniques to enhance the performance. We propose a new parallelization technique to speed up the message computation, which takes up the longest time in BP. The experimental result shows that we were able to obtain accurate distance estimation result in real time.