Zhang H, Peng Q. Design of Branch Definition Algorithm for Top-
k Inverse Queries for Image Processing.
Appl Bionics Biomech 2022;
2022:3365161. [PMID:
35280125 PMCID:
PMC8913124 DOI:
10.1155/2022/3365161]
[Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 01/27/2022] [Revised: 02/15/2022] [Accepted: 02/17/2022] [Indexed: 11/17/2022] Open
Abstract
Images are the main way for human beings to obtain and exchange information, and they play a crucial role in the process of human understanding and exploration of the world. Top-k inverse queries are widely used in real life. Currently, the most efficient algorithm for computing top-k inverse sets is the inverse top-k algorithm. Our algorithm is significantly limited when dealing with top-k inverse queries. To address these limitations, an intuitive branch-and-bound algorithm is proposed to efficiently handle top-k inverse queries, and novel optimization methods are discussed to mention its high performance. Experimental evaluation shows that the algorithm is far more efficient than the inverse top-k algorithm.
Collapse