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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Applied Bionics and Biomechanics |
| Online Access: | http://dx.doi.org/10.1155/2022/3365161 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| 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. |
|---|---|
| ISSN: | 1754-2103 |