Fast Shape Matching Using Statistical Features of Shape Contexts
Summary :
A novel fast algorithm for shape matching using statistical features of shape contexts is presented. By pruning the candidate shapes using the moment-based statistical features of shape contexts, the required number of matching processes is dramatically reduced with negligible performance degradation. Experimental results demonstrate that the proposed algorithm reduces the pruning time up to 1/(r·n) compared with the conventional RSC algorithm while maintaining a similar or better performance, where n is the number of sampled points of a shape and r is the number of randomly selected representative shape contexts for the query shape.
- Publication
- IEICE TRANSACTIONS on Information Vol.E94-D No.10 pp.2056-2058
- Publication Date
- 2011/10/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E94.D.2056
- Type of Manuscript
- LETTER
- Category
- Image Recognition, Computer Vision
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Moon-Jai LIM, Chan-Hee HAN, Si-Woong LEE, Yun-Ho KO, "Fast Shape Matching Using Statistical Features of Shape Contexts" in IEICE TRANSACTIONS on Information,
vol. E94-D, no. 10, pp. 2056-2058, October 2011, doi: 10.1587/transinf.E94.D.2056.
Abstract: A novel fast algorithm for shape matching using statistical features of shape contexts is presented. By pruning the candidate shapes using the moment-based statistical features of shape contexts, the required number of matching processes is dramatically reduced with negligible performance degradation. Experimental results demonstrate that the proposed algorithm reduces the pruning time up to 1/(r·n) compared with the conventional RSC algorithm while maintaining a similar or better performance, where n is the number of sampled points of a shape and r is the number of randomly selected representative shape contexts for the query shape.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E94.D.2056/_p
Copy
@ARTICLE{e94-d_10_2056,
author={Moon-Jai LIM, Chan-Hee HAN, Si-Woong LEE, Yun-Ho KO, },
journal={IEICE TRANSACTIONS on Information},
title={Fast Shape Matching Using Statistical Features of Shape Contexts},
year={2011},
volume={E94-D},
number={10},
pages={2056-2058},
abstract={A novel fast algorithm for shape matching using statistical features of shape contexts is presented. By pruning the candidate shapes using the moment-based statistical features of shape contexts, the required number of matching processes is dramatically reduced with negligible performance degradation. Experimental results demonstrate that the proposed algorithm reduces the pruning time up to 1/(r·n) compared with the conventional RSC algorithm while maintaining a similar or better performance, where n is the number of sampled points of a shape and r is the number of randomly selected representative shape contexts for the query shape.},
keywords={},
doi={10.1587/transinf.E94.D.2056},
ISSN={1745-1361},
month={October},}
Copy
TY - JOUR
TI - Fast Shape Matching Using Statistical Features of Shape Contexts
T2 - IEICE TRANSACTIONS on Information
SP - 2056
EP - 2058
AU - Moon-Jai LIM
AU - Chan-Hee HAN
AU - Si-Woong LEE
AU - Yun-Ho KO
PY - 2011
DO - 10.1587/transinf.E94.D.2056
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E94-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2011
AB - A novel fast algorithm for shape matching using statistical features of shape contexts is presented. By pruning the candidate shapes using the moment-based statistical features of shape contexts, the required number of matching processes is dramatically reduced with negligible performance degradation. Experimental results demonstrate that the proposed algorithm reduces the pruning time up to 1/(r·n) compared with the conventional RSC algorithm while maintaining a similar or better performance, where n is the number of sampled points of a shape and r is the number of randomly selected representative shape contexts for the query shape.
ER -
English
