Abstract
It is inferior in generality enough not to be applied in the system wherein various types of multimedia information are stored. In our study, it was intended to improve VP-tree method which is one of the indexing methods for metric space. VP-tree calculates the distance from object which is linked to the leaf node that reaches from root node to final along the matching node within search range during search and then it checks if a particular node is existed within a search range. We propose a compaction method by using triangle inequality at leaf node within search range. Besides, it is proposed to use a triangle inequality at nearest point as a reference point for the query object. Actual performance test for the system using 10,000 video data revealed that search time for the similar videos could be saved by 5~12% as compared with those of conventional methods.
Sign-in/Register to access full text options 
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.
