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: Interactive Graph Cuts for Optimal Boundary and Region Segmentation
Views: 1862, Unique: 583 
Subscribers: 0
What's
this?
Printer-Friendly Page
Subscribe to get & post, or stop messages by email Subscribe
All messages    << 5-8  4-4 of 8  1-3 >>
About these ads
Who | When
Messagessort recent-bottom   
Post a new message
 
Rasit Topaloglu  4
10-21-2004 12:02 PM ET (US)
Edited by author 10-21-2004 12:15 PM
It seems to me that the hard constraints can be overruled, as they are not assigned an infinite cost. But if this is the case, the user assigned bits are not believed to be 100% true. It is interesting that the algorithm doesn't trust the user.

Also, why separating two objects from each other is not an issue but we are only interested in separation of background from objects (I think because it is more difficult)?
RSS link What's this?
All messages    << 5-8  4-4 of 8  1-3 >>
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.