Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts (2020)
Bejar, Hans H. C 
; Guimaraes, Silvio Jamil Ferzoli ; Miranda, Paulo André Vechiatto de
Fonte: Pattern Recognition Letters. Unidade: IME
Assuntos: INTERPOLAÇÃO, APROXIMAÇÃO POR POLINÔMIOS, CAD
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BEJAR, Hans H. C e GUIMARAES, Silvio Jamil Ferzoli e MIRANDA, Paulo André Vechiatto de. Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts. Pattern Recognition Letters, v. 131, p. 185-192, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.patrec.2020.01.008. Acesso em: 09 nov. 2025.APA
Bejar, H. H. C., Guimaraes, S. J. F., & Miranda, P. A. V. de. (2020). Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts. Pattern Recognition Letters, 131, 185-192. doi:10.1016/j.patrec.2020.01.008NLM
Bejar HHC, Guimaraes SJF, Miranda PAV de. Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts [Internet]. Pattern Recognition Letters. 2020 ; 131 185-192.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2020.01.008Vancouver
Bejar HHC, Guimaraes SJF, Miranda PAV de. Efficient hierarchical graph partitioning for image segmentation by optimum oriented cuts [Internet]. Pattern Recognition Letters. 2020 ; 131 185-192.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.patrec.2020.01.008
