Naga Venkata Sai Prakash Nagulapati, Sudharsan Reddy Venati, Vishal Chandran, Subramani R
{"title":"基于卡尔曼滤波的行人检测与跟踪","authors":"Naga Venkata Sai Prakash Nagulapati, Sudharsan Reddy Venati, Vishal Chandran, Subramani R","doi":"10.1109/ESCI53509.2022.9758215","DOIUrl":null,"url":null,"abstract":"There are a lot of challenges associated with - autonomous driving, and one such challenge is pedestrian detection and tracking, especially in this complex world, multiple people are involved in complicated and cluttered backgrounds. In this paper a novel method is proposed to detect, track and predict pedestrians based on Histograms of Oriented Gradients (HOG) algorithm and the Camshift algorithm respectively. These two algorithms run on top of the Kalman filtering framework. The Kalman filter is used as a tracker for precisely localizing and tracking the pedestrians. Then triangle similarity is used to calculate distance.","PeriodicalId":436539,"journal":{"name":"2022 International Conference on Emerging Smart Computing and Informatics (ESCI)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Pedestrian Detection and Tracking Through Kalman Filtering\",\"authors\":\"Naga Venkata Sai Prakash Nagulapati, Sudharsan Reddy Venati, Vishal Chandran, Subramani R\",\"doi\":\"10.1109/ESCI53509.2022.9758215\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There are a lot of challenges associated with - autonomous driving, and one such challenge is pedestrian detection and tracking, especially in this complex world, multiple people are involved in complicated and cluttered backgrounds. In this paper a novel method is proposed to detect, track and predict pedestrians based on Histograms of Oriented Gradients (HOG) algorithm and the Camshift algorithm respectively. These two algorithms run on top of the Kalman filtering framework. The Kalman filter is used as a tracker for precisely localizing and tracking the pedestrians. Then triangle similarity is used to calculate distance.\",\"PeriodicalId\":436539,\"journal\":{\"name\":\"2022 International Conference on Emerging Smart Computing and Informatics (ESCI)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-03-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Emerging Smart Computing and Informatics (ESCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ESCI53509.2022.9758215\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Emerging Smart Computing and Informatics (ESCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ESCI53509.2022.9758215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Pedestrian Detection and Tracking Through Kalman Filtering
There are a lot of challenges associated with - autonomous driving, and one such challenge is pedestrian detection and tracking, especially in this complex world, multiple people are involved in complicated and cluttered backgrounds. In this paper a novel method is proposed to detect, track and predict pedestrians based on Histograms of Oriented Gradients (HOG) algorithm and the Camshift algorithm respectively. These two algorithms run on top of the Kalman filtering framework. The Kalman filter is used as a tracker for precisely localizing and tracking the pedestrians. Then triangle similarity is used to calculate distance.