Uma Versão Intervalar do Método de Segmentação de Imagens Utilizando o K-means
Abstract
Full Text:
PDF (Português (Brasil))References
[1] B.R.C. Bedregal e B.M. Acióly, A Quasi-metric Topology Compatible with Inclusion Monotonicity on Interval Space, International Journal Realiable Computing, 3 (1997), 305-310.
G.B. Coleman e H.C. Andrew, Image Segmentation by Clustering, em “Procedings of IEEE”, pp. 773-785, 1979.
V. Faber, Clustering and the Continuous K-means Algorithm, em “los Alamos Science”, Vol. 22, pp. 138-144,, 1994.
D.A. Forsyth e J Ponce, “Computer Vision: A Modern Approach”, Prentice Hall, 2002.
R.C. Gonzalez e R.E. Woods, “Processamento de Imagens Digitais”, Edgard Blucher Ltda, 2000.
T. Kanungo, D.M. Mount, N.S. Netanyahu, R. Silverman, C. Piatko e A.Y. Wu, The Analysis of a Simple K-means Clustering Algorithm, em “Proceeding of the Sixteent Annual Symposium on Computational Geometry”, pp. 100-200, 2000.
V. Kreinovich, A. Lakeyev, J. Rohn e P. Kahl, “Computational Complexity and Feasibility of Data Processing and Interval Computations”, Kluwer Academic Publishers, 1998.
S.P. Lloyd, Least Square Quantization in PCM, IEEE Transactions on Information Theory, 28 (1982), 129-137.
DOI: https://doi.org/10.5540/tema.2005.06.02.0315
Article Metrics
Metrics powered by PLOS ALM
Refbacks
- There are currently no refbacks.
Trends in Computational and Applied Mathematics
A publication of the Brazilian Society of Applied and Computational Mathematics (SBMAC)
Indexed in: