Abstract
The pseudo relevance feedback mechanism has come to improve the performance of the CBIR systems before visualising the final results and without any user assistance. In this paper, we show the superiority of our proposed a pseudo relevance feedback scheme 'majority voting algorithm'. The algorithm is compared to other approaches of the literature of that clustering materialised on two well known clustering algorithms namely: hierarchical agglomerative clustering method (HACM) and K-means and pseudo query reformulation materialised on pseudo query point movement, pseudo standard Rocchio formula and pseudo adaptive shifting query. Experiments are conducted on the heterogeneous Wang (COREL-1K) database and Google image engine using the colour moments as a signature. This work enables us to compare some pseudo relevance feedback techniques of the literature while the obtained results show the clear superiority of our proposed algorithm.
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.
