Scalable near-duplicate video stream monitoring

In this paper, we present a simple but effective algorithm to address the efficiency problem of video stream near-duplicate monitoring in a large-scale repository. In the algorithm, a similarity upper bound between two sequences is calculated incrementally and served as a rough filter to avoid time-consuming computation for the true sequence similarity. It makes the scan process more efficient and guarantees no true positive is missed. Our experiments demonstrate the proposed algorithm yields accurate retrieval result and efficient execution time.