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: Dynamic textures
Views: 215, Unique: 133 
Subscribers: 1
What's
this?
Printer-Friendly Page
Subscribe to get & post, or stop messages by email Subscribe
All messages    << 3-7  2-2 of 7  1-1 >>
About these ads
Who | When
Messagessort recent-top   
Post a new message
 
Dave KauchakPerson was signed in when posted  2
05-01-2002 06:20 PM ET (US)
I really like the problem that this paper presents and the results (particularly the actual videos online). Unfortunately, I had a tough time understanding the algorithm that was used as I am only a mere mathematical mortal. I really wished the paper had given a better introduction and overview of the algorithm presented so that people without the vision background and mathematical adeptness could have gotten an intuitive understanding of how the algorithm worked.

I would have liked to have seen a more complete experimental section. I liked how they showed how their model could "cluster" related image sequences. I think exploring this in more detail over more samples would have been interesting.

To me, the compression information seemed to be a bit out of place. First, I think they either should have addressed that aspect as a single paper, or at least flushed the idea out a bit more. In looking at the results, I don't necessarily know if this type of system would be optimal for compression since the image sequences that are produced are a bit different from those that are trained on.

One last quick question, what does an equal sign with a dot over it stand for?
RSS link What's this?
All messages    << 3-7  2-2 of 7  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.