LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

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

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.… Click to show full 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.

Keywords: inverse; inverse queries; design branch; top inverse; branch definition

Journal Title: Applied Bionics and Biomechanics
Year Published: 2022

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.