Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
