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. Top-k inverse queries are widely used in real life. Currently, the most efficient algorithm for computing top-k inverse sets i...

Full description

Saved in:
Bibliographic Details
Published inApplied bionics and biomechanics Vol. 2022; pp. 1 - 7
Main Authors Zhang, Haixia, Peng, Qingxiu
Format Journal Article
LanguageEnglish
Published Egypt Hindawi 03.03.2022
John Wiley & Sons, Inc
Wiley
Subjects
Algorithms
Annotations
Design
Efficiency
Equipment and supplies
Image databases
Image processing
Image retrieval
Information retrieval
Multimedia
Optimization
Queries
Query processing
Retrieval performance measures
Semantics
Online AccessGet full text
ISSN1176-2322
1754-2103
DOI10.1155/2022/3365161

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ObjectType-Correction/Retraction-3
Academic Editor: Fahd Abd Algalil
ISSN:1176-2322
1754-2103
DOI:10.1155/2022/3365161