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!
|
| _version_ | 1832558343502168064 |
|---|---|
| author | Haixia Zhang Qingxiu Peng |
| author_facet | Haixia Zhang Qingxiu Peng |
| author_sort | Haixia Zhang |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-c5db8528f0624a0ab85e0344da895182 |
| institution | Kabale University |
| issn | 1754-2103 |
| language | English |
| publishDate | 2022-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Applied Bionics and Biomechanics |
| spelling | doaj-art-c5db8528f0624a0ab85e0344da8951822025-02-03T01:32:37ZengWileyApplied Bionics and Biomechanics1754-21032022-01-01202210.1155/2022/3365161Design of Branch Definition Algorithm for Top-k Inverse Queries for Image ProcessingHaixia Zhang0Qingxiu Peng1School of ScienceCollege of Economics and ManagementImages 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.http://dx.doi.org/10.1155/2022/3365161 |
| spellingShingle | Haixia Zhang Qingxiu Peng Design of Branch Definition Algorithm for Top-k Inverse Queries for Image Processing Applied Bionics and Biomechanics |
| title | Design of Branch Definition Algorithm for Top-k Inverse Queries for Image Processing |
| title_full | Design of Branch Definition Algorithm for Top-k Inverse Queries for Image Processing |
| title_fullStr | Design of Branch Definition Algorithm for Top-k Inverse Queries for Image Processing |
| title_full_unstemmed | Design of Branch Definition Algorithm for Top-k Inverse Queries for Image Processing |
| title_short | Design of Branch Definition Algorithm for Top-k Inverse Queries for Image Processing |
| title_sort | design of branch definition algorithm for top k inverse queries for image processing |
| url | http://dx.doi.org/10.1155/2022/3365161 |
| work_keys_str_mv | AT haixiazhang designofbranchdefinitionalgorithmfortopkinversequeriesforimageprocessing AT qingxiupeng designofbranchdefinitionalgorithmfortopkinversequeriesforimageprocessing |