CONTOUR POLYGONAL APPROXIMATION USING THE SHORTEST PATH IN NETWORKS

Autor(es)

Backes, Andre Ricardo ^[1] ; Casanova, Dalcimar ^[2] ; Bruno, Odemir Martinez ^[2]

Afiliação do(s) autor(es)

^[1] Univ Fed Uberlandia, Fac Comp Facom, BR-38408100 Uberlandia, MG - Brazil

^[2] Univ Sao Paulo, Sao Carlos Inst Phys IFSC, Sci Comp Grp, BR-13566590 Sao Carlos, SP - Brazil

• Tipo de documento: Artigo Científico
• Fonte: INTERNATIONAL JOURNAL OF MODERN PHYSICS C; v. 25, n. 2 FEB 2014.
• Citações Web of Science: 1

Resumo

Contour polygonal approximation is a simplified representation of a contour by line segments so that the main characteristics of the contour remain in a small number of line segments. This paper presents a novel method for polygonal approximation based on the Complex Networks theory. We convert each point of the contour into a vertex so that a regular network can be modeled. Then we transform this network into a Small-World Complex Network by applying some transformations over its edges. We compute the polygonal approximation analyzing the network properties, especially the geodesic path. The paper presents the main characteristics of the method, as well as its functionality. We evaluate the proposed method using benchmark contours and compare its results with other polygonal approximation methods. (AU)

• Processo FAPESP: 11/01523-1 - Métodos de visão computacional aplicados à identificação e análise de plantas
• Beneficiário: Odemir Martinez Bruno
• Linha de fomento: Auxílio à Pesquisa - Regular