National Repository of Grey Literature 47 records found  beginprevious38 - 47  jump to record: Search took 0.00 seconds. 
Acceleration of Lattice-Boltzmann Algorithms for Bloodflow Modeling
Kompová, Radmila ; Kešner, Filip (referee) ; Jaroš, Jiří (advisor)
This thesis aims to explore possible implementations and optimizations of the lattice-Boltzmann method. This method allows modeling of fluid flow using a simulation of fictive particles. The thesis focuses on possible improvements of the existing tool HemeLB which  is designed and optimized for bloodflow modeling. Several vectorization and paralellization approaches that could be included in this tool are explored. An application focused on comparing chosen algorithms including optimizations for the lattice-Boltzmann method was implemented as a part of the thesis. A group of tests focused on comparing this algorithms according to performance, cache usage and overall memory usage was performed. The best performance achieved was 150 millions of lattice site updates per second.
Algorithms for browsing 2D maze
Chvíla, Lukáš ; Jelínek, Aleš (referee) ; Žalud, Luděk (advisor)
This thesis describes an automatic path finding method in a 2D maze defined by bitmap evidence grids. The problem was solved in the programming language C# with the help of the straight line decomposition algorithm used for creating a network of potential routes. The algorithm assumes approximation of obstacles by vector polygons. The resulting path was found by the means of algorithm A*. The result is a path described by line segments. After some modifications, the path could be used for robot navigation.
Algorithms for browsing 2D maze
Chvíla, Lukáš ; Jelínek, Aleš (referee) ; Žalud, Luděk (advisor)
This thesis describes an automatic path finding method in a 2D maze defined by bitmap evidence grids. The problem was solved in the programming language C# with the help of the straight line decomposition algorithm used for creating a network of potential routes. The algorithm assumes approximation of obstacles by vector polygons. The resulting path was found by the means of algorithm A*. The result is a path described by line segments. After some modifications, the path could be used for robot navigation.
Conversion of Raster-Curve into Vector Representation
Král, Jiří ; Sumec, Stanislav (referee) ; Beran, Vítězslav (advisor)
In my process of tracing I deal with converting an input grayscale image into a vector one trying to keep as big similarity with the input image as possible. Tracing is carried out with the help of curve approximation even if the approximation is possible only with line elements, that is to say the curve in raster. Therefore it is necessary to extract the line elements from the input image. We can do it in two different ways according to two different objects in the image. The first group is represented by thin, ablong objects which are substituted by their skeleton. The second group is represented by large objects which are susbstituted by their contour. The found lines are then divided into such parts which can be easily curve approximated. Resulting curves are then only depicted into the output by suitable raster method.
Raster to Vector Conversion
Siblík, Jan ; Venera, Jiří (referee) ; Šilhavá, Jana (advisor)
This bachelors thesis inspects an issue of converting a raster image into vector representation. It describes theoretical basis for image preprocessing techniques, theory and means of edge detection and some possible techniques of image vectorization. It also desribes designing and realization of a demostrative aplicetion, which is the programming part of this thesis.
Ray-Tracing Using SSE
Kučera, Jiří ; Herout, Adam (referee) ; Havel, Jiří (advisor)
This thesis describes the acceleration technique of ray-tracing method using SSE instruction set. Choosing the parallel tracing of four rays enclosed in one beam turned to be the best way of using SSE effectively. Also the vectorization of algorithms which are used in ray-tracing method was implemented. The solution of beam splitting was designed and implemented too. The time for rendering image was monitored in the tests - one for case when the beam includes all the rays and one for case when there is just one ray in the beam.
Survey of village Kotvrdovice for renewal of cadastral documentation
Hlávka, Miroslav ; Zvolská, Hana (referee) ; Berková, Alena (advisor)
This thesis deals with the renewal of the cadastral documentation by reprocessing in part of cadastral area Kotvrdovice. In this part of the building is anticipated to shift existing cadastral map, for reasons of historical development during the Second World War. There are described the various processing activities and problems that have occurred during processing. For processing was used software VKM2.
Intel Integrated Performance Primitives and their use in application development
Machač, Jiří ; Přinosil, Jiří (referee) ; Malý, Jan (advisor)
The aim of the presented work is to demonstrate and evaluate the contribution of computing system SIMD especially units MMX, SSE, SSE2, SSE3, SSSE3 and SSE4 from Intel company, by creation of demostrating applications with using Intel Integrated Performance Primitives library. At first, possibilities of SIMD programming using intrinsic function, vektorization and libraries Intel Integrated Performance Primitives are presented, as next are descibed options of evaluation of particular algorithms. Finally procedure of programing by using Intel Integrated Performance Primitives library are ilustrated.
Ortophotomap creation in the PhotoMod System
Sládková, Veronika ; Hanzl,, Vlastimil (referee) ; Kalvoda, Petr (advisor)
The subject of bachelor’s thesis was creating orthophotomap in the locality of Brno - Slatina. Processing of the entire project was made in software Photomod 4.3, which is a product of Russian company Racurs. For the process of making was neccesary to do aerotriangulation and adjust of aerial photographs, to create a digital model of the relief and from that the resulting orthophotomap. The overall result of the work has been compared with geodetic surveying.
Prepairing graphic data in IS applications - testing of transposition forms of bitmap and vector graphics
Parma, Lukáš ; Šedivá, Zuzana (advisor) ; Horný, Stanislav (referee)
Abstract This work is focused mainly on testing software (further referred to as only SW) for transposition of bitmap and vector graphics. The work is split in two parts. Basic types of graphics, differences between them, usage, advantages and disadvantages are introduced in the theoretical part. The best known formats are described for each type of graphics. Also, fundamentals of transposition between the formats and the different types of graphics are introduced. Similarly, the principle of rasterization and vectorization is introduced. The practical part of the work mainly focuses on vectorization. In total, five programs for bitmap and vector graphics transposition are tested here. Four different types of graphics were defined and chosen for the testing. A way of multi-criteria evaluation was used to compare the SW. The SW is evaluated in two ways. The first one compares the functioning of the SW, the second one focuses on the results of the vectorization process. Used methodology and the choice of evaluation criteria result from a subjective point of view of given problematics. The resume of the work brings detailed results of research along with comments to every evaluated SW.

National Repository of Grey Literature : 47 records found   beginprevious38 - 47  jump to record:
Interested in being notified about new results for this query?
Subscribe to the RSS feed.