{"title":"一种快速霍夫变换逼近及其在条形码定位中的应用","authors":"M. Safran, R. Oktem","doi":"10.1109/SIU.2007.4298852","DOIUrl":null,"url":null,"abstract":"This paper addresses barcode localization in images acquired by wireless cameras. For this purpose, a fast Hough transform approximation by use of a sliding mask is developed. The approximation decomposes the lines at different orientations into distinct bitplanes. Barcode localization is achieved by considering the high density locations in the bitplanes via morphology and profiling. The time complexity of the proposed approximation is lower than the previously proposed fast Hough transform, though it achieves the equal performance in localization of barcodes.","PeriodicalId":315147,"journal":{"name":"2007 IEEE 15th Signal Processing and Communications Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A Fast Hough Transform Approximation and Its Application for Barcode Localization\",\"authors\":\"M. Safran, R. Oktem\",\"doi\":\"10.1109/SIU.2007.4298852\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses barcode localization in images acquired by wireless cameras. For this purpose, a fast Hough transform approximation by use of a sliding mask is developed. The approximation decomposes the lines at different orientations into distinct bitplanes. Barcode localization is achieved by considering the high density locations in the bitplanes via morphology and profiling. The time complexity of the proposed approximation is lower than the previously proposed fast Hough transform, though it achieves the equal performance in localization of barcodes.\",\"PeriodicalId\":315147,\"journal\":{\"name\":\"2007 IEEE 15th Signal Processing and Communications Applications\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE 15th Signal Processing and Communications Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIU.2007.4298852\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE 15th Signal Processing and Communications Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIU.2007.4298852","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Fast Hough Transform Approximation and Its Application for Barcode Localization
This paper addresses barcode localization in images acquired by wireless cameras. For this purpose, a fast Hough transform approximation by use of a sliding mask is developed. The approximation decomposes the lines at different orientations into distinct bitplanes. Barcode localization is achieved by considering the high density locations in the bitplanes via morphology and profiling. The time complexity of the proposed approximation is lower than the previously proposed fast Hough transform, though it achieves the equal performance in localization of barcodes.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
