QuickTopic (SM) free message boards QuickTopic (SM) free message boards
Skip to Messages
  Sign In to access your topic list  |New Topic |My Topics|Profile
Upgrade to Pro   Customize, show pictures, add an intro, and more:   QuickTopic Pro...and check out QuickThreadSM
Topic: Scalable recognition with a vocabulary tree
Views: 1502, Unique: 678 
Subscribers: 2
What's
this?
Printer-Friendly Page
Subscribe to get & post, or stop messages by email Subscribe
All messages    << 6-15  5-5 of 15  1-4 >>
About these ads
Who | When
Messagessort recent-top   
Post a new message
 
Deborah  5
09-28-2006 12:17 PM ET (US)
1. " With our vocabulary tree apporach, the representation of an image patch is simply one or two integers, which should be contrasted to the hundreds of bytes or floats used for a descriptor vector."

then on the next page...

" For D-dimensional descriptors represented as char the size of the tree is Dk^L bytes. With our current implementation, a tree with D = 128, L= 6, and k= 10, ..., uses 143MB of memory."

I am confused of what the descriptor vectors consist of. I thought it was only 1 or 2 integers per image patch. Does dimension of the descriptor vector (e.g D = 128) mean the number of pixels in the image patch, and the 128 elements of descriptor vector take the value of one of the 2 integers.. ? Thank you for clarifying.
RSS link What's this?
All messages    << 6-15  5-5 of 15  1-4 >>
QuickTopicSM message boards
Over 200,000 topics served
Learn more Frequently asked questions  Acknowledgements
What they're saying about QuickTopic
 Questions, comments, or suggestions? Contact Us
Read our use policy before beginning. We value your privacy; please read our privacy statement.
Copyright ©1999-2008 Internicity Inc. All rights reserved.