You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi shurans,
I found there was another paper about sliding shape, sliding shape(2014ECCV), there is a section about feature visualization. Can you give me some detail about your 4 features(point density,3D normal, TSDF, 3D shape),what is the physical or geometric meaning?
Thank u very much.
The text was updated successfully, but these errors were encountered:
Here you can find more information about that paper: http://slidingshapes.cs.princeton.edu/
And there is a stand alone code to compute 3D feature from one depth map that can help you understand the feature.
@shurans thanks shurans, I have already found this useful information about this paper, I have still have a question, in this paper, you gave a codebook, 50 cluster centers obtained by k-means, the input to k-means is your 500 NYU training datas, and using the algorithm presented 'fast approximate nearest neighbors' to obtain your 50 cluster centers? Did I get it? Thank you very much!!
Hi shurans,
I found there was another paper about sliding shape, sliding shape(2014ECCV), there is a section about feature visualization. Can you give me some detail about your 4 features(point density,3D normal, TSDF, 3D shape),what is the physical or geometric meaning?
Thank u very much.
The text was updated successfully, but these errors were encountered: