Material Detail

Eliminating the Back-Tracking Step in the Longest Common Subsequence (LCSS) Algorithm for Video Sequence Matching

Eliminating the Back-Tracking Step in the Longest Common Subsequence (LCSS) Algorithm for Video Sequence Matching

This video was recorded at Semantic and Digital Media Technologies. The growth, distribution of and access to multimedia material, i.e. recorded images, audio, video or 3D/4D recorded material as well as computer generated 2D, 3D and 4D content, is so huge that these resources now constitute the major share of internet traffic as well as a huge share of data stored on any kind of electronic devices. With their success, the multimedia contents become ever harder to manage, to find and to access by the private users and the public or commercial organizations that created them. The conference series SAMT, the international conference on semantic and digital media technologies, has been installed in 2006 in order to tackle this problem by recurring to the semantics and pragmatics of multimedia generation, management and access. more about conference: > http://samt2008.uni-koblenz.de/

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Browse...

Disciplines with similar materials as Eliminating the Back-Tracking Step in the Longest Common Subsequence (LCSS) Algorithm for Video Sequence Matching
Other materials like Eliminating the Back-Tracking Step in the Longest Common Subsequence (LCSS) Algorithm for Video Sequence Matching

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.