| dc.contributor.advisor | Dupej, Ján | |
| dc.creator | Hmíra, Peter | |
| dc.date.accessioned | 2017-06-01T09:34:35Z | |
| dc.date.available | 2017-06-01T09:34:35Z | |
| dc.date.issued | 2015 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.11956/77687 | |
| dc.description.abstract | Väčšina algoritmov zaoberajúcich sa detekciou črtov, nemá dostatočnú robustnosť voči šumu alebo nezvládajú vhodne spoje na povrchu v tvare písmena T. Prináša to nové výzvy navrhnúť taký algoritmus, ktorý nielen nájde črty na zašumených 3D-dátach získaných pomocou 3D-skenera. Dnešné algoritmy aj keď sú dostatočne robustné voči šumu, v okolí spojov v tvare T stratia dôležité informácie o črtoch, nakoľko trojicu čiar alebo kriviek vyhodnotia ako rovinu. Powered by TCPDF (www.tcpdf.org) | cs_CZ |
| dc.description.abstract | Most current algorithms typically lack in robustness to noise or do not handle T-shaped curve joining properly. There is a challenge to not only detect features in the noisy 3D-data obtained from the digital scanners. Moreover, most of the algorithms even when they are robust to noise, they lose the feature information near the T-shaped junctions as the triplet of lines ``confuses'' the algorithm so it treats it as a plane. Powered by TCPDF (www.tcpdf.org) | en_US |
| dc.language | English | cs_CZ |
| dc.language.iso | en_US | |
| dc.publisher | Univerzita Karlova, Matematicko-fyzikální fakulta | cs_CZ |
| dc.subject | povrchový model | cs_CZ |
| dc.subject | detekce křivek | cs_CZ |
| dc.subject | robustní metody | cs_CZ |
| dc.subject | diferenciální geometrie | cs_CZ |
| dc.subject | surface models | en_US |
| dc.subject | curve detection | en_US |
| dc.subject | robust methods | en_US |
| dc.subject | differential geometry | en_US |
| dc.title | Robust feature curve detection in 3D surface models | en_US |
| dc.type | diplomová práce | cs_CZ |
| dcterms.created | 2015 | |
| dcterms.dateAccepted | 2015-09-09 | |
| dc.description.department | Department of Software and Computer Science Education | en_US |
| dc.description.department | Katedra softwaru a výuky informatiky | cs_CZ |
| dc.description.faculty | Matematicko-fyzikální fakulta | cs_CZ |
| dc.description.faculty | Faculty of Mathematics and Physics | en_US |
| dc.identifier.repId | 166932 | |
| dc.title.translated | Detekce významných křivek na 3D povrchových modelech | cs_CZ |
| dc.contributor.referee | Pelikán, Josef | |
| dc.identifier.aleph | 002026193 | |
| thesis.degree.name | Mgr. | |
| thesis.degree.level | navazující magisterské | cs_CZ |
| thesis.degree.discipline | Softwarové systémy | cs_CZ |
| thesis.degree.discipline | Software Systems | en_US |
| thesis.degree.program | Informatika | cs_CZ |
| thesis.degree.program | Computer Science | en_US |
| uk.thesis.type | diplomová práce | cs_CZ |
| uk.taxonomy.organization-cs | Matematicko-fyzikální fakulta::Katedra softwaru a výuky informatiky | cs_CZ |
| uk.taxonomy.organization-en | Faculty of Mathematics and Physics::Department of Software and Computer Science Education | en_US |
| uk.faculty-name.cs | Matematicko-fyzikální fakulta | cs_CZ |
| uk.faculty-name.en | Faculty of Mathematics and Physics | en_US |
| uk.faculty-abbr.cs | MFF | cs_CZ |
| uk.degree-discipline.cs | Softwarové systémy | cs_CZ |
| uk.degree-discipline.en | Software Systems | en_US |
| uk.degree-program.cs | Informatika | cs_CZ |
| uk.degree-program.en | Computer Science | en_US |
| thesis.grade.cs | Výborně | cs_CZ |
| thesis.grade.en | Excellent | en_US |
| uk.abstract.cs | Väčšina algoritmov zaoberajúcich sa detekciou črtov, nemá dostatočnú robustnosť voči šumu alebo nezvládajú vhodne spoje na povrchu v tvare písmena T. Prináša to nové výzvy navrhnúť taký algoritmus, ktorý nielen nájde črty na zašumených 3D-dátach získaných pomocou 3D-skenera. Dnešné algoritmy aj keď sú dostatočne robustné voči šumu, v okolí spojov v tvare T stratia dôležité informácie o črtoch, nakoľko trojicu čiar alebo kriviek vyhodnotia ako rovinu. Powered by TCPDF (www.tcpdf.org) | cs_CZ |
| uk.abstract.en | Most current algorithms typically lack in robustness to noise or do not handle T-shaped curve joining properly. There is a challenge to not only detect features in the noisy 3D-data obtained from the digital scanners. Moreover, most of the algorithms even when they are robust to noise, they lose the feature information near the T-shaped junctions as the triplet of lines ``confuses'' the algorithm so it treats it as a plane. Powered by TCPDF (www.tcpdf.org) | en_US |
| uk.file-availability | V | |
| uk.publication.place | Praha | cs_CZ |
| uk.grantor | Univerzita Karlova, Matematicko-fyzikální fakulta, Katedra softwaru a výuky informatiky | cs_CZ |
| dc.identifier.lisID | 990020261930106986 | |
