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: LSA based object discovery methods
Views: 1293, Unique: 527 
Subscribers: 0
What's
this?
Printer-Friendly Page
Subscribe to get & post, or stop messages by email Subscribe
All messages    << 3-10  2-2 of 10  1-1 >>
About these ads
Who | When
Messagessort recent-bottom   
Post a new message
 
Nik Melchior  2
02-05-2006 11:40 PM ET (US)
re: Fei-Fei and Perona

This approach seems very principled and appears to get decent results, although 64% is not astounding in itself. Even though results are reported for categorization success if the top two choices are included, I would be more interested in knowing a different statistic: how many levels must you climb in the dendrogram in order to interpret a categorization as successful? Although I am not clear on the pseudo-Euclidean distance metric used, I think this would provide an interesting counterpart to the confusion matrix in showing that miscategorizations tend to mistake indoor scenes for other indoor categories, for example.

I'm intrigued by the prominent peak in the plot of figure 10(c), showing number of codewords vs. performance. Given their model, I don't understand why additional codewords can decrease performance. It's interesting to see how figure 11(a) shows a definite ceiling in the number of codewords which can obtain significance.

It would be interesting to see the performance of this algorithm using a set of codewords chosen a priori rather than learned, such as those detected by the human visual system, or a commonly used filter bank.
RSS link What's this?
All messages    << 3-10  2-2 of 10  1-1 >>
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.