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

Publisher： Edp Sciences

E-ISSN： 2271-2097|12|issue|05006-05006

ISSN： 2271-2097

Source： ITM Web of conferences, Vol.12, Iss.issue, 2017-09, pp. : 05006-05006

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Non-convex polygons clustering algorithm

By  

ITM Web of conferences, Vol. 8, Iss. issue, 2016-11 ,pp. : 01008-01008

Edp Sciences

Access to resources Recommend Favorite

Imprimitive non-powerful sign pattern matrices with maximum base

By Ma Hongping   Miao Zhengke  

Linear and Multilinear Algebra, Vol. 59, Iss. 4, 2011-04 ,pp. : 371-390

Taylor & Francis Ltd

Access to resources Recommend Favorite

Topological graph clustering with thin position

By Johnson Jesse  

Geometriae Dedicata, Vol. 169, Iss. 1, 2014-04 ,pp. : 165-173

Springer Publishing Company

Access to resources Recommend Favorite

How the result of graph clustering methods depends on the construction of the graph

By Maier Markus   von Luxburg Ulrike   Hein Matthias  

ESAIM: Probability and Statistics, Vol. 17, Iss. issue, 2013-05 ,pp. : 370-418

Edp Sciences

Access to resources Recommend Favorite

Designs associated with maximum independent sets of a graph

By Walikar H.   Acharya B.   Shirkol Shailaja  

Designs, Codes and Cryptography, Vol. 57, Iss. 1, 2010-10 ,pp. : 91-105

Springer Publishing Company

Access to resources Recommend Favorite