Abstract
Image retrieval systems adopt a combination of multiple features and then total distance measures of particular features for ranking the results. Therefore, the top-ranked images with smallest total distance measures are returned to the users. However, images with smallest partial distance measures which are suitable for users’ purpose may not be included in these results. Therefore, partial distance measure should be considered. In this paper, we propose to adopt the Pareto set in the distance measure space. This set assures that the returned results contain not only points with smallest total distance obtained by linear combinations, but also other points have smallest partial distance measures which cannot be found by the linear combination in the distance measure space. Especially, the searching space based on the distance measures is compacted by our algorithm, namely PDFA. This algorithm collects all the Pareto set with different depths, and is efficient for the classification and regression tree (CART). The experimental results on three image collections show the effectiveness of our proposed method.
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 callMore From: Các công trình nghiên cứu, phát triển và ứng dụng Công nghệ Thông tin và Truyền thông
Disclaimer: 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.
