Volume 19, Issue No.1

KEY WORDS

Visibility graphs, image processing, materials science, intelligent systems.

ABSTRACT

Graphs are structures that have a long history in mathematics and have been applied in almost every scientific and engineering field. Use of graphs has become very influential in computer science and has led to many applications in denoising, enhancement, restoration, and object extraction. Accounting for the wide variety of problems being solved with graphs in image processing and computer vision. We have two goals for this article. Firstly, we make this work selfcontained by reviewing the basic concepts and notations for visibility graphs in 3D space that are used process of robot laser hardening. In process of robot laser hardening we have many open problems. One of most difficul problem is how to analyze SEM images of microstructure of robot laser hardenend specimens and make prediction of topographycal properties with image properties. Second, we connect these concepts to image processing and analysis from a conceptual level and discuss implementation details. 3D visibility computations are central to any computer graphics application. Drawing graphs as nodes connected by links in 3D space is visually compelling but computationally difficult. In computational geometry and robot motion planning, a visibility graph is a graph of intervisible locations, typically for a set of points and obstacles in the Euclidean plane. Each node in the graph represents a point location, and each edge represents a visible connection between them. That is, if the line segment connecting two locations does not pass through any obstacle, an edge is drawn between them in the graph. Thus, we use method of construction of visibility graphs in 3D space in SEM images of microstructure of robot laser hardenend specimens. At the end we use method of intelligent systems to predict topographical property of robot laser hardened specimens. With intelligent system we increase production of process of laser hardening, because we decrease time of process and increase topographical property of materials.

CITATION INFORMATION

Acta Mechanica Slovaca. Volume 19, Issue 1, Pages 28–35, ISSN 1335-2393

DOWNLOAD

 New Method for Image Analyze using Mathematical ...

REFERENCES

[1] Ben-Moshe, O. Hall-Holt, M.J. Katz and J.S.B. Mitchell. (2004). Computing the Visibility Graph of Points within a Polygon, Proc. 20th ACM Symp. on Computational Geometry, 27-35.

[2] Berg, Mark; van Kreveld, Marc; Overmars, Mark; Schwarzkopf, Otfried (2000), "Chapter 15: Visibility Graphs", Computational Geometry (2nd ed.), Springer-Verlag, pp. 307–317, ISBN 3-540-65620-0.

[3] Lozano-Pérez, Tomás; Wesley, Michael A. (1979), An algorithm for planning collision-free paths among polyhedral obstacles, Communications of the ACM 22 (10): 560–570, doi:10.1145/359156.359164.

[4] A. Chambolle , R. A. DeVore , N.-Y. Lee and Β. J. Lucier "Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage", IEEE Trans. Image Processings, vol. 7, no. 33, pp.319 -335 1998

[5] M. Babič, M. Milfelner, S. Stepišnik, Laser hardening metals. In: Perme, T., Švetak, D., Balič, J. (eds.), IRT Industrial Forum, Portoroz, 7–8 June 2010. Source of knowledge and experience for the profession: Proceedings of the Forum. Skofljica: Profidtp.

[6] Babič, Matej, Kokol, Peter, Belič, Igor, Panjan, Peter, Kovačič, Miha, Balič, Jože, Verbovšek, Timotej. Prediction of the hardness of hardened specimens with a neural network = Napoved trdote kaljenih vzorcev z nevronskimi mrežami. Materiali in tehnologije, ISSN 1580-2949. [2014, let. 48, št. 3, str. 409-414, ilustr. http://mit.imt.si/Revija/.

[7] Hutter, M. (2012). "One Decade of Universal Artificial Intelligence". Theoretical Foundations of Artificial General Intelligence. Atlantis Thinking Machines 4. doi:10.2991/978-94-91216-62-6_5. ISBN 978-94-91216-61-9.

[8] Matej Babič. Doctoral dissertation. 2014.

[9] Nooy, Wouter de, Andrej Mrvar, Vladimir Batagelj. (2005). ExploratorySocial Network Analysis with Pajek. New York: CambridgeUniversity Press.

[10] Koza, John (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: MIT Press. ISBN 978-0262111706.

[11] Bäck, T.; Hammel, U.; Schwefel, H.-P. Evolutionary computation: Comments on the history and current state. IEEE Transaction on Evolutionary Computation 1 (1997) 1, 3–17

[12] Graves, Alex; and Schmidhuber, Jürgen; Offline Handwriting Recognition with Multidimensional Recurrent Neural Networks, in Bengio, Yoshua; Schuurmans, Dale; Lafferty, John; Williams, Chris K. I.; and Culotta, Aron (eds.), Advances in Neural Information Processing Systems 22 (NIPS'22), December 7th–10th, 2009, Vancouver, BC, Neural Information Processing Systems (NIPS) Foundation, 2009, pp. 545–552.

[13] Box, G. E. P. (1954). "Some Theorems on Quadratic Forms Applied in the Study of Analysis of Variance Problems, I. Effect of Inequality of Variance in the One-Way Classification". The Annals of Mathematical Statistics 25 (2): 290. doi:10.1214/aoms/1177728786.

Latest Issue

ams 2 2016

Download