|
|
Searching for Similar 3D Models
Šťáva, Zdeněk ; Veľas, Martin (referee) ; Španěl, Michal (advisor)
This paper deals with searching similar 3D models in a database containing up to thousands of models. It focuses in particular on the comparison of existing descriptors used to describe 3D models and the subsequent evaluation of similarity between models. In particular, the descriptors Rotation Invariant Spherical Harmonics and 3D Zernike Descriptor are compared. It also describes the use of libraries to extract these descriptors and to design of various experiments with these libraries over several object databases. It examines the effect of scale, translation, deformation and rotation of different 3D models on the resulting descriptor and the overall accuracy of both selected methods. These results compare.
|
|
|
Searching for Similar 3D Models
Rachler, Ivan ; Čižmarik, Roman (referee) ; Španěl, Michal (advisor)
This paper deals with searching 3D models based on their similarity. The input model is compared to all models available in a database and then has its similarity to each of them evaluated. Specifically in this paper, the similarity is evaluated based on the model's shape descriptor, which is extracted by a trained neural network called PointNet. It also takes a closer look at the performance of this network and at how well it compares with other existing networks.
|
|
|
Supercharging design for a 1.6L SI Engine
Švábíková, Anna ; Bazala, Jiří (referee) ; Beran, Martin (advisor)
This master’s thesis focuses on the problematics of supercharging of SI engines aiming on performance boost. The aim of this thesis is to propose a suitable turbocharger for reaching defined performance goals. A method of successive SI engine modelling process is proposed, using the GT-Power platform. The choice of suitable turbocharger is based on a analytic calculation of required turbocharger parameters. The cooperation of the engine with the chosen turbocharger is verified by simulations. An important part of this thesis is sensitivity analysis, which purpose is to determine the impact of changing chosen parameters on maximum pressure in the combustion chamber and on the exhaust gas temperature.
|
|
|
Circuits and matchings in graphs
Tesař, Karel ; Pangrác, Ondřej (advisor) ; Šámal, Robert (referee)
O grafu řekneme, že je k-linkovaný, pokud pro každých k dvojic jeho vrchol· existují navzájem disjunktní cesty, které dané dvojice spojují. Existuje vztah mezi k-linkovaností a vrcholovou souvislostí grafu. V této práci hledáme vztah mezi vrcholovou souvislostí grafu a vlastností, že každých k jeho disjunktních hran leží na společné kružnici. Tento problém se dá řešit pomocí k-linkovanosti. Naším cílem je dosáhnout lepších odhad· na souvislost, resp. jiných postačujících podmínek než těch, které jsou známe pro k-linkovanost. 1
|
|
|
Searching for Similar 3D Models
Sálus, Ondřej ; Beran, Vítězslav (referee) ; Španěl, Michal (advisor)
Goal of this paper is development of aplication for comparing of 3D models. It deals with extraction od descriptors suitable for comparing of 3D models and enables to find models similar to users query. For extraction of descriptors application uses Reeb graph method. This paper also describes usage of libraries that implements Reeb graph method and some experiments with speed and quality over pre prepared models database.
|
|
|
Similar Photo Searching
Rosa, Štěpán ; Mlích, Jozef (referee) ; Beran, Vítězslav (advisor)
This paper describes the way to realization such an application, where a user chooses a photo database to working with and enters a photo into the system. The system using a visual vocabulary finds the most similar photos from the database and offers tags of the searched photo with a suitable form based on the tag statistical analysis of this photo.
|
|
|
Searching for Similar 3D Models
Šťáva, Zdeněk ; Veľas, Martin (referee) ; Španěl, Michal (advisor)
This paper deals with searching similar 3D models in a database containing up to thousands of models. It focuses in particular on the comparison of existing descriptors used to describe 3D models and the subsequent evaluation of similarity between models. In particular, the descriptors Rotation Invariant Spherical Harmonics and 3D Zernike Descriptor are compared. It also describes the use of libraries to extract these descriptors and to design of various experiments with these libraries over several object databases. It examines the effect of scale, translation, deformation and rotation of different 3D models on the resulting descriptor and the overall accuracy of both selected methods. These results compare.
|
|
|
Low noise amplifier for UHF band
Horký, Stanislav ; Baran, Ondřej (referee) ; Kasal, Miroslav (advisor)
The subject of this bachelor's thesis is description and design of low-noise RF amplifiers. This work is also focused on design and simulations of amplifier in Ansoft Designer software. In this thesis is in detail described design of amplifier ATF 54143, mainly focused on stability, biasing and noise matching. For the needs of RF applications are described a few types of filters, with his design and realization
|
|
|
Construction of Gray codes with special properties
Novotný, Tomáš ; Dvořák, Tomáš (advisor) ; Fink, Jiří (referee)
A (cyclic) Gray code is a (cyclic) sequence of all n-bit strings in which consecutive strings differ in a single bit. Ruskey and Savage in 1993 asked whether every matching in a hypercube can be extended to a cyclic Gray code. An affirmative answer is known for perfect matchings (Fink, 2007) while the ge- neral case is still open. The main contribution of this thesis is a generalization of Fink's result to Gray codes with prescribed ends. The characterization of perfect matchings extendable in this way is verified for n = 5 with the assistance of a com- puter, which is useful as a basis for the inductive proof of the general statement. The other part of the thesis is focused on smallest maximal matchings in hyper- cubes which could possibly form especially hard instances of the Ruskey-Savage problem. We devise a novel method which provides - in particular for small di- mensions - maximal matchings of smaller size than the classical asymptotically optimal construction (Forcade, 1973). An adjusted program from the first part is then applied to test the Ruskey-Savage problem over these matchings, however, the extending Gray code is always discovered. 1
|
|
|
Circuits and matchings in graphs
Tesař, Karel ; Pangrác, Ondřej (advisor) ; Šámal, Robert (referee)
O grafu řekneme, že je k-linkovaný, pokud pro každých k dvojic jeho vrchol· existují navzájem disjunktní cesty, které dané dvojice spojují. Existuje vztah mezi k-linkovaností a vrcholovou souvislostí grafu. V této práci hledáme vztah mezi vrcholovou souvislostí grafu a vlastností, že každých k jeho disjunktních hran leží na společné kružnici. Tento problém se dá řešit pomocí k-linkovanosti. Naším cílem je dosáhnout lepších odhad· na souvislost, resp. jiných postačujících podmínek než těch, které jsou známe pro k-linkovanost. 1
|
guest ::
