BRISK: Binary Robust invariant scalable keypoints. Leutenegger, S., Chli, M., & Siegwart, R., Y. Proceedings of the IEEE International Conference on Computer Vision, 2011. doi abstract bibtex Effective and efficient generation of keypoints from an image is a well-studied problem in the literature and forms the basis of numerous Computer Vision applications. Established leaders in the field are the SIFT and SURF algorithms which exhibit great performance under a variety of image transformations, with SURF in particular considered as the most computationally efficient amongst the high-performance methods to date. In this paper we propose BRISK 1, a novel method for keypoint detection, description and matching. A comprehensive evaluation on benchmark datasets reveals BRISK's adaptive, high quality performance as in state-of-the-art algorithms, albeit at a dramatically lower computational cost (an order of magnitude faster than SURF in cases). The key to speed lies in the application of a novel scale-space FAST-based detector in combination with the assembly of a bit-string descriptor from intensity comparisons retrieved by dedicated sampling of each keypoint neighborhood. © 2011 IEEE.
@article{
title = {BRISK: Binary Robust invariant scalable keypoints},
type = {article},
year = {2011},
pages = {2548-2555},
id = {c230a7bf-c0fc-3c98-ac24-ceead0bda901},
created = {2022-09-19T09:01:26.291Z},
file_attached = {true},
profile_id = {276016a7-2c9d-3507-8888-093db7c54774},
group_id = {5ec9cc91-a5d6-3de5-82f3-3ef3d98a89c1},
last_modified = {2022-09-19T09:02:46.130Z},
read = {false},
starred = {false},
authored = {false},
confirmed = {true},
hidden = {false},
folder_uuids = {02fb5526-03ff-44ad-8d5c-42bd496c3100},
private_publication = {false},
abstract = {Effective and efficient generation of keypoints from an image is a well-studied problem in the literature and forms the basis of numerous Computer Vision applications. Established leaders in the field are the SIFT and SURF algorithms which exhibit great performance under a variety of image transformations, with SURF in particular considered as the most computationally efficient amongst the high-performance methods to date. In this paper we propose BRISK 1, a novel method for keypoint detection, description and matching. A comprehensive evaluation on benchmark datasets reveals BRISK's adaptive, high quality performance as in state-of-the-art algorithms, albeit at a dramatically lower computational cost (an order of magnitude faster than SURF in cases). The key to speed lies in the application of a novel scale-space FAST-based detector in combination with the assembly of a bit-string descriptor from intensity comparisons retrieved by dedicated sampling of each keypoint neighborhood. © 2011 IEEE.},
bibtype = {article},
author = {Leutenegger, Stefan and Chli, Margarita and Siegwart, Roland Y.},
doi = {10.1109/ICCV.2011.6126542},
journal = {Proceedings of the IEEE International Conference on Computer Vision}
}
Downloads: 0
{"_id":"TnAnD7wktPjRjKtGb","bibbaseid":"leutenegger-chli-siegwart-briskbinaryrobustinvariantscalablekeypoints-2011","downloads":0,"creationDate":"2015-09-03T07:18:47.560Z","title":"BRISK: Binary Robust invariant scalable keypoints","author_short":["Leutenegger, S.","Chli, M.","Siegwart, R., Y."],"year":2011,"bibtype":"article","biburl":"https://bibbase.org/service/mendeley/bfbbf840-4c42-3914-a463-19024f50b30c","bibdata":{"title":"BRISK: Binary Robust invariant scalable keypoints","type":"article","year":"2011","pages":"2548-2555","id":"c230a7bf-c0fc-3c98-ac24-ceead0bda901","created":"2022-09-19T09:01:26.291Z","file_attached":"true","profile_id":"276016a7-2c9d-3507-8888-093db7c54774","group_id":"5ec9cc91-a5d6-3de5-82f3-3ef3d98a89c1","last_modified":"2022-09-19T09:02:46.130Z","read":false,"starred":false,"authored":false,"confirmed":"true","hidden":false,"folder_uuids":"02fb5526-03ff-44ad-8d5c-42bd496c3100","private_publication":false,"abstract":"Effective and efficient generation of keypoints from an image is a well-studied problem in the literature and forms the basis of numerous Computer Vision applications. Established leaders in the field are the SIFT and SURF algorithms which exhibit great performance under a variety of image transformations, with SURF in particular considered as the most computationally efficient amongst the high-performance methods to date. In this paper we propose BRISK 1, a novel method for keypoint detection, description and matching. A comprehensive evaluation on benchmark datasets reveals BRISK's adaptive, high quality performance as in state-of-the-art algorithms, albeit at a dramatically lower computational cost (an order of magnitude faster than SURF in cases). The key to speed lies in the application of a novel scale-space FAST-based detector in combination with the assembly of a bit-string descriptor from intensity comparisons retrieved by dedicated sampling of each keypoint neighborhood. © 2011 IEEE.","bibtype":"article","author":"Leutenegger, Stefan and Chli, Margarita and Siegwart, Roland Y.","doi":"10.1109/ICCV.2011.6126542","journal":"Proceedings of the IEEE International Conference on Computer Vision","bibtex":"@article{\n title = {BRISK: Binary Robust invariant scalable keypoints},\n type = {article},\n year = {2011},\n pages = {2548-2555},\n id = {c230a7bf-c0fc-3c98-ac24-ceead0bda901},\n created = {2022-09-19T09:01:26.291Z},\n file_attached = {true},\n profile_id = {276016a7-2c9d-3507-8888-093db7c54774},\n group_id = {5ec9cc91-a5d6-3de5-82f3-3ef3d98a89c1},\n last_modified = {2022-09-19T09:02:46.130Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {true},\n hidden = {false},\n folder_uuids = {02fb5526-03ff-44ad-8d5c-42bd496c3100},\n private_publication = {false},\n abstract = {Effective and efficient generation of keypoints from an image is a well-studied problem in the literature and forms the basis of numerous Computer Vision applications. Established leaders in the field are the SIFT and SURF algorithms which exhibit great performance under a variety of image transformations, with SURF in particular considered as the most computationally efficient amongst the high-performance methods to date. In this paper we propose BRISK 1, a novel method for keypoint detection, description and matching. A comprehensive evaluation on benchmark datasets reveals BRISK's adaptive, high quality performance as in state-of-the-art algorithms, albeit at a dramatically lower computational cost (an order of magnitude faster than SURF in cases). The key to speed lies in the application of a novel scale-space FAST-based detector in combination with the assembly of a bit-string descriptor from intensity comparisons retrieved by dedicated sampling of each keypoint neighborhood. © 2011 IEEE.},\n bibtype = {article},\n author = {Leutenegger, Stefan and Chli, Margarita and Siegwart, Roland Y.},\n doi = {10.1109/ICCV.2011.6126542},\n journal = {Proceedings of the IEEE International Conference on Computer Vision}\n}","author_short":["Leutenegger, S.","Chli, M.","Siegwart, R., Y."],"biburl":"https://bibbase.org/service/mendeley/bfbbf840-4c42-3914-a463-19024f50b30c","bibbaseid":"leutenegger-chli-siegwart-briskbinaryrobustinvariantscalablekeypoints-2011","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0},"search_terms":["brisk","binary","robust","invariant","scalable","keypoints","leutenegger","chli","siegwart"],"keywords":[],"authorIDs":[],"dataSources":["y8en6y5RHukfeLuPH","ya2CyA73rpZseyrZ8","2252seNhipfTmjEBQ"]}