File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-642-15558-1_25
- Scopus: eid_2-s2.0-78149304828
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Learning shape detector by quantizing curve segments with multiple distance metrics
Title | Learning shape detector by quantizing curve segments with multiple distance metrics |
---|---|
Authors | |
Issue Date | 2010 |
Citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, v. 6313 LNCS, n. PART 3, p. 342-355 How to Cite? |
Abstract | In this paper, we propose a very efficient method to learn shape models using local curve segments with multiple types of distance metrics. Our learning approach includes two key steps: feature generation and model pursuit. In the first step, for each category, we first extract a massive number of local "prototype" curve segments from a few roughly aligned shape instances. Then we quantize these curve segments with three types of distance metrics corresponding to different shape deformations. In each metric space, the quantized curve segments are further grown (spanned) into a large number of ball-like manifolds, and each of them represents a equivalence class of shape variance. In the second step of shape model pursuit, using these manifolds as features, we propose a fast greedy learning algorithm based on the information projection principle. The algorithm is guided by a generative model, and stepwise selects the features that have maximum information gain. The advantage of the proposed method is identified on several public datasets and summarized as follows. (1) Our models consisting of local curve segments with multiple distance metrics are robust to the various shape deformations, and thus enable us to perform robust shape classification and detect shapes against background clutter. (2) The auto-generated curve-based features are very general and convenient, rather than designing specific features for each category. © 2010 Springer-Verlag. |
Persistent Identifier | http://hdl.handle.net/10722/273502 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Luo, Ping | - |
dc.contributor.author | Lin, Liang | - |
dc.contributor.author | Chao, Hongyang | - |
dc.date.accessioned | 2019-08-12T09:55:46Z | - |
dc.date.available | 2019-08-12T09:55:46Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, v. 6313 LNCS, n. PART 3, p. 342-355 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/273502 | - |
dc.description.abstract | In this paper, we propose a very efficient method to learn shape models using local curve segments with multiple types of distance metrics. Our learning approach includes two key steps: feature generation and model pursuit. In the first step, for each category, we first extract a massive number of local "prototype" curve segments from a few roughly aligned shape instances. Then we quantize these curve segments with three types of distance metrics corresponding to different shape deformations. In each metric space, the quantized curve segments are further grown (spanned) into a large number of ball-like manifolds, and each of them represents a equivalence class of shape variance. In the second step of shape model pursuit, using these manifolds as features, we propose a fast greedy learning algorithm based on the information projection principle. The algorithm is guided by a generative model, and stepwise selects the features that have maximum information gain. The advantage of the proposed method is identified on several public datasets and summarized as follows. (1) Our models consisting of local curve segments with multiple distance metrics are robust to the various shape deformations, and thus enable us to perform robust shape classification and detect shapes against background clutter. (2) The auto-generated curve-based features are very general and convenient, rather than designing specific features for each category. © 2010 Springer-Verlag. | - |
dc.language | eng | - |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.title | Learning shape detector by quantizing curve segments with multiple distance metrics | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-642-15558-1_25 | - |
dc.identifier.scopus | eid_2-s2.0-78149304828 | - |
dc.identifier.volume | 6313 LNCS | - |
dc.identifier.issue | PART 3 | - |
dc.identifier.spage | 342 | - |
dc.identifier.epage | 355 | - |
dc.identifier.eissn | 1611-3349 | - |
dc.identifier.issnl | 0302-9743 | - |