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: Normalized cuts and image segmentation
Views: 524, Unique: 395 
Subscribers: 0
What's
this?
Printer-Friendly Page
Subscribe to get & post, or stop messages by email Subscribe
All messages    << 6-7  5-5 of 7  1-4 >>
About these ads
Who | When
Messagessort recent-top   
Post a new message
 
Ian Fasel  5
10-09-2001 01:43 PM ET (US)
I have two questions:

1) I was wondering if other similarity measures have been used in this problem (as well as in the Pilu paper). The algorithms presented do a remarkable job using these simple similarity measures, but they are not perfect. Certainly, as argued in the paper, an attempt can be made to have a higher level combine the results of these algorithms into a single object (e.g., combining the zebra pieces into a zebra), however is this a better approach than having a better (but more complex) similarity measure at the lower level? So the first question is, how about using a very complex similarity measure, such as distance between Gabor jets (vectors composed of coefficients of dot products of the image at each location with a rosette of Gabor wavelets), or, to be even more complex, using a set of ICA derived filters instead of Gabors?

Also, this leads me to the second question:
2) Do recognition algorithms that first do segmentation and then do recognition perform better than algorithms that don't include segmentation as an explicit step? Where else has segmentation followed by some other algorithm proven to be more effective than the best a non-segmentation-using algorithm can do?
RSS link What's this?
All messages    << 6-7  5-5 of 7  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.