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: A direct method for stereo correspondence based on singular value decomposition
Views: 628, Unique: 436 
Subscribers: 5
What's
this?
Printer-Friendly Page
Subscribe to get & post, or stop messages by email Subscribe
All messages    << 6-6  5-5 of 6  1-4 >>
About these ads
Who | When
Messagessort recent-top   
Post a new message
 
Markus Herrgard  5
10-01-2001 08:41 PM ET (US)
I think the SVD-based method itself appears to be pretty interesting mainly due to its simplicity and because there is a straightforward linear algebra solution. However, I read the Pilu paper first and was amazed that he just describes the steps of the method and does not even try to explain why the method works (i.e. the pairing matrix P obtained is the orthogonal matrix that maximizes the inner product of P and G). He also doesn't even bother trying to explain the method in his own words, but cites full sentences from the original Scott & Longuet-Higgins paper.

OK. So much for complaining about the papers. I actually have a real question on what replacing the matrix D (which has singular values on the diagonal) with the matrix E (which has ones on the diagonal) in SVD will do in general? Especially if you think of SVD from the PCA viewpoint, you are amplifying the components with low singular values compared to those with high singular values. I'm not quite sure how to interpret this.
RSS link What's this?
All messages    << 6-6  5-5 of 6  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.