|
|
|
|
| LEADER |
01000caa a22002652c 4500 |
| 001 |
NLM254358942 |
| 003 |
DE-627 |
| 005 |
20250219080037.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2015 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2015.2424863
|2 doi
|
| 028 |
5 |
2 |
|a pubmed25n0847.xml
|
| 035 |
|
|
|a (DE-627)NLM254358942
|
| 035 |
|
|
|a (NLM)26539843
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Bai, Xiang
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a 3D Shape Matching via Two Layer Coding
|
| 264 |
|
1 |
|c 2015
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 09.02.2016
|
| 500 |
|
|
|a Date Revised 06.11.2015
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a View-based 3D shape retrieval is a popular branch in 3D shape analysis owing to the high discriminative property of 2D views. However, many previous works do not scale up to large 3D shape databases. We propose a two layer coding (TLC) framework to conduct shape matching much more efficiently. The first layer coding is applied to pairs of views represented as depth images. The spatial relationship of each view pair is captured with so-called eigen-angle, which is the planar angle between the two views measured at the center of the 3D shape. Prior to the second layer coding, the view pairs are divided into subsets according to their eigen-angles. Consequently, view pairs that differ significantly in their eigen-angles are encoded with different codewords, which implies that spatial arrangement of views is preserved in the second layer coding. The final feature vector of a 3D shape is the concatenation of all the encoded features from different subsets, which is used for efficient indexing directly. TLC is not limited to encode the local features from 2D views, but can be also applied to encoding 3D features. Exhaustive experimental results confirm that TLC achieves state-of-the-art performance in both retrieval accuracy and efficiency
|
| 650 |
|
4 |
|a Journal Article
|
| 650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
| 650 |
|
4 |
|a Research Support, U.S. Gov't, Non-P.H.S.
|
| 700 |
1 |
|
|a Bai, Song
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Zhu, Zhuotun
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Latecki, Longin Jan
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 37(2015), 12 vom: 21. Dez., Seite 2361-73
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnas
|
| 773 |
1 |
8 |
|g volume:37
|g year:2015
|g number:12
|g day:21
|g month:12
|g pages:2361-73
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2015.2424863
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 37
|j 2015
|e 12
|b 21
|c 12
|h 2361-73
|