English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Non-maximum suppression is an important step in many object detection and object counting algorithms. In contrast with the extensive studies of object detection, NMS method has not caused too much attention. Although traditional NMS method has demonstrated promising performance in detection tasks, we observe that it is a hard decision approach, which only uses the confidential scores and Intersection-over-Unions (IoUs) to discard proposals. By this way, NMS method would keep many false proposals whose IoU with the ground truth proposal is smaller than the threshold, which indicates that NMS may not suitable for counting the object number in images. To eliminate the limitation on object counting task, we propose a novel algorithm base on graph clustering to replace the NMS method in this paper. Experiments on faster-rcnn and SSD show that our algorithm achieves better performance than that of NMS on the object counting task

A Replacement Algorithm of Non-Maximum Suppression Base on Graph Clustering