Design of Branch Definition Algorithm for Top- k  Inverse Queries for Image Processing | Zendy

Haixia Zhang | Zendy; Qingxiu Peng | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Design of Branch Definition Algorithm for Top-

k

Inverse Queries for Image Processing

Author(s) -

Haixia Zhang,

Qingxiu Peng

Publication year - 2022

Publication title -

applied bionics and biomechanics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.397

H-Index - 23

eISSN - 1754-2103

pISSN - 1176-2322

DOI - 10.1155/2022/3365161

Subject(s) - inverse , algorithm , computer science , process (computing) , inverse problem , image (mathematics) , optimization algorithm , theoretical computer science , mathematics , mathematical optimization , artificial intelligence , geometry , operating system , mathematical analysis

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research