Difference between revisions of "Publications/royer.17.icdar"
From LRDE
(4 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
{{Publication |
{{Publication |
||
− | | published = |
+ | | published = true |
| date = 2017-07-04 |
| date = 2017-07-04 |
||
| title = Benchmarking Keypoint Filtering Approaches for Document Image Matching |
| title = Benchmarking Keypoint Filtering Approaches for Document Image Matching |
||
| authors = E Royer, J Chazalon, M Rusiñol, F Bouchara |
| authors = E Royer, J Chazalon, M Rusiñol, F Bouchara |
||
| booktitle = Proceedings of the 14th International Conference on Document Analysis and Recognition (ICDAR) |
| booktitle = Proceedings of the 14th International Conference on Document Analysis and Recognition (ICDAR) |
||
+ | | pages = 343 to 348 |
||
+ | | address = Kyoto, Japan |
||
| abstract = Reducing the amount of keypoints used to index an image is particularly interesting to control processing time and memory usage in real-time document image matching applications, like augmented documents or smartphone applications. This paper benchmarks two keypoint selection methods on a task consisting of reducing keypoint sets extracted from document images, while preserving detection and segmentation accuracy. We first study the different forms of keypoint filtering, and we introduce the use of the CORE selection method on keypoints extracted from document images. Then, we extend a previously published benchmark by including evaluations of the new method, by adding the SURF-BRISK detection/description scheme, and by reporting processing speeds. Evaluations are conducted on the publicly available dataset of ICDAR2015 SmartDOC challenge 1. Finally, we prove that reducing the original keypoint set is always feasible and can be beneficial not only to processing speed but also to accuracy. |
| abstract = Reducing the amount of keypoints used to index an image is particularly interesting to control processing time and memory usage in real-time document image matching applications, like augmented documents or smartphone applications. This paper benchmarks two keypoint selection methods on a task consisting of reducing keypoint sets extracted from document images, while preserving detection and segmentation accuracy. We first study the different forms of keypoint filtering, and we introduce the use of the CORE selection method on keypoints extracted from document images. Then, we extend a previously published benchmark by including evaluations of the new method, by adding the SURF-BRISK detection/description scheme, and by reporting processing speeds. Evaluations are conducted on the publicly available dataset of ICDAR2015 SmartDOC challenge 1. Finally, we prove that reducing the original keypoint set is always feasible and can be beneficial not only to processing speed but also to accuracy. |
||
| lrdepaper = http://www.lrde.epita.fr/dload/papers/royer.17.icdar.pdf |
| lrdepaper = http://www.lrde.epita.fr/dload/papers/royer.17.icdar.pdf |
||
Line 10: | Line 12: | ||
| lrdekeywords = Image |
| lrdekeywords = Image |
||
| lrdenewsdate = 2017-07-04 |
| lrdenewsdate = 2017-07-04 |
||
− | | note = To appear |
||
| type = inproceedings |
| type = inproceedings |
||
| id = royer.17.icdar |
| id = royer.17.icdar |
||
+ | | identifier = doi:10.1109/ICDAR.2017.64 |
||
| bibtex = |
| bibtex = |
||
@InProceedings<nowiki>{</nowiki> royer.17.icdar, |
@InProceedings<nowiki>{</nowiki> royer.17.icdar, |
||
Line 22: | Line 24: | ||
Document Analysis and Recognition (ICDAR)<nowiki>}</nowiki>, |
Document Analysis and Recognition (ICDAR)<nowiki>}</nowiki>, |
||
year = <nowiki>{</nowiki>2017<nowiki>}</nowiki>, |
year = <nowiki>{</nowiki>2017<nowiki>}</nowiki>, |
||
+ | month = nov, |
||
+ | pages = <nowiki>{</nowiki>343--348<nowiki>}</nowiki>, |
||
+ | address = <nowiki>{</nowiki>Kyoto, Japan<nowiki>}</nowiki>, |
||
abstract = <nowiki>{</nowiki>Reducing the amount of keypoints used to index an image is |
abstract = <nowiki>{</nowiki>Reducing the amount of keypoints used to index an image is |
||
particularly interesting to control processing time and |
particularly interesting to control processing time and |
||
Line 40: | Line 45: | ||
keypoint set is always feasible and can be beneficial not |
keypoint set is always feasible and can be beneficial not |
||
only to processing speed but also to accuracy.<nowiki>}</nowiki>, |
only to processing speed but also to accuracy.<nowiki>}</nowiki>, |
||
− | + | doi = <nowiki>{</nowiki>10.1109/ICDAR.2017.64<nowiki>}</nowiki> |
|
<nowiki>}</nowiki> |
<nowiki>}</nowiki> |
||
Latest revision as of 17:01, 27 May 2021
- Authors
- E Royer, J Chazalon, M Rusiñol, F Bouchara
- Where
- Proceedings of the 14th International Conference on Document Analysis and Recognition (ICDAR)
- Place
- Kyoto, Japan
- Type
- inproceedings
- Projects
- Olena
- Keywords
- Image
- Date
- 2017-07-04
Abstract
Reducing the amount of keypoints used to index an image is particularly interesting to control processing time and memory usage in real-time document image matching applications, like augmented documents or smartphone applications. This paper benchmarks two keypoint selection methods on a task consisting of reducing keypoint sets extracted from document images, while preserving detection and segmentation accuracy. We first study the different forms of keypoint filtering, and we introduce the use of the CORE selection method on keypoints extracted from document images. Then, we extend a previously published benchmark by including evaluations of the new method, by adding the SURF-BRISK detection/description scheme, and by reporting processing speeds. Evaluations are conducted on the publicly available dataset of ICDAR2015 SmartDOC challenge 1. Finally, we prove that reducing the original keypoint set is always feasible and can be beneficial not only to processing speed but also to accuracy.
Documents
Bibtex (lrde.bib)
@InProceedings{ royer.17.icdar, title = {Benchmarking Keypoint Filtering Approaches for Document Image Matching}, author = {E. Royer and J. Chazalon and M. Rusi{\~n}ol and F. Bouchara}, booktitle = {Proceedings of the 14th International Conference on Document Analysis and Recognition (ICDAR)}, year = {2017}, month = nov, pages = {343--348}, address = {Kyoto, Japan}, abstract = {Reducing the amount of keypoints used to index an image is particularly interesting to control processing time and memory usage in real-time document image matching applications, like augmented documents or smartphone applications. This paper benchmarks two keypoint selection methods on a task consisting of reducing keypoint sets extracted from document images, while preserving detection and segmentation accuracy. We first study the different forms of keypoint filtering, and we introduce the use of the CORE selection method on keypoints extracted from document images. Then, we extend a previously published benchmark by including evaluations of the new method, by adding the SURF-BRISK detection/description scheme, and by reporting processing speeds. Evaluations are conducted on the publicly available dataset of ICDAR2015 SmartDOC challenge 1. Finally, we prove that reducing the original keypoint set is always feasible and can be beneficial not only to processing speed but also to accuracy.}, doi = {10.1109/ICDAR.2017.64} }