DCU Linking Runs at MediaEval 2014: Search and Hyperlinking Task

The calculated V isualSimilarity was used to modify the final score of the segment in the retrieval for a particular query segment as follows (the W eight parameter was tuned on

We examined how different retrieval models interact with different text processing techniques such as word stemming and stopword removal, on subtitles and

Given the fact that the baseline system can be beaten on the training set, results over the test set suggest that models optimised on MRR, mGAP, and MASP for a known-item

The Search and Hyperlinking Task at MediaEval 2013 envisioned the following scenario: a user is searching for a segment of video that they know to be contained in a video

The retrieved keyframes associated with an anchor require a further processing to generate a ranked list of temporal video segments.. Our approach is based on the assumption that

• part-sc-C: Partial scenes search from shot boundary using textual and visual cues following three steps: filtering of the list of videos; querying for shots inside each video;

For search, we compute word- based similarity (from transcript and metadata) between queries and all segments in the collection, using a vector space model based and TF-IDF

Then, for each possible beginning, we identified the segment end (from the set of possible segment ends) which lay closest to 50.111 seconds (which is the aver- age segment length