Browsing by Subject "matching"
Now showing 1 - 10 of 10
- Results Per Page
- Sort Options
Item type:Article, Access status: Open Access , Analiza możliwości wykorzystania funkcji biblioteki »OpenCV 1.0« do automatycznego dopasowania zdjęć lotniczych(Wydawnictwa AGH, 2007) Gryboś, Paweł; Mikrut, SławomirIn this paper the way of using functions from open source library to image processing in matching algorithm is presented. The correlation algorithm which use library functions useful to image matching is describe, take into problems and advantages came from air images. During the experiments optimal size of template and value of correlation coefficient decided if matching is correct were established. The research was done on real images and different texture. The method of the generated before grid was tested too. Matching points covered the area of stereograms and are located evenly on the stereograms, which is necessary in relative orientation process.Item type:Thesis, Access status: Restricted , Generowanie chmur punktów na podstawie zdjęć IR oraz RGB - analiza porównawcza(Data obrony: 2016-01-22) Gronek, Justyna
Wydział Geodezji Górniczej i Inżynierii ŚrodowiskaItem type:Thesis, Access status: Restricted , O skojarzeniach w grafach(Data obrony: 2011-07-07) Żupnik, Magdalena; Uzar, Jakub; Widuch, Justyna
Wydział Matematyki StosowanejItem type:Thesis, Access status: Restricted , O skojarzeniach w grafach(Data obrony: 2011-07-07) Widuch, Justyna; Uzar, Jakub; Żupnik, Magdalena
Wydział Matematyki StosowanejItem type:Thesis, Access status: Restricted , O skojarzeniach w grafach(Data obrony: 2011-07-07) Uzar, Jakub; Widuch, Justyna; Żupnik, Magdalena
Wydział Matematyki StosowanejItem type:Thesis, Access status: Restricted , Opracowanie oraz implementacja modułu korelacji obrazów stereoskopowych z wykorzystaniem miary wzajemnej entropii(Data obrony: 2018-01-22) Bytnar, Krystian
Wydział Informatyki, Elektroniki i TelekomunikacjiItem type:Article, Access status: Open Access , Porównanie dokładności metod wyznaczania punktów charakterystycznych na parach zdjęć lotniczych(Wydawnictwa AGH, 2007) Pawlik, Piotr; Mikrut, SławomirTo solve the problem with two corresponding points on digital air images some different algorithms were developed. In this paper the authors tried to compare some methods. The methods such as: SIFT, Harris, Hesjan were tested and implemented. The experiments were based on real air images (air photography), which have been taken in two different scales. To estimation the accuracy, the parameters such as : mean parallax on the model, number of matching points and their position, were used. The results show the similarity between the methods, but depending on kind of photography (the texture of the image).Item type:Article, Access status: Open Access , The hardness of the independence and matching clutter of a graph(2016) Ambarcumân, Sasun; Mkrtčân, Vahan V.; Musoân, Vahe L.; Sargsân, HovhannesA clutter (or antichain or Sperner family) $L$ is a pair $(V,E)$, where $V$ is a finite set and $E$ is a family of subsets of $V$ none of which is a subset of another. Usually, the elements of $V$ are called vertices of $L$, and the elements of $E$ are called edges of $L$. A subset se of an edge e of a clutter is called recognizing for e, if $s_e$ is not a subset of another edge. The hardness of an edge $e$ of a clutter is the ratio of the size of $e$'s smallest recognizing subset to the size of $e$. The hardness of a clutter is the maximum hardness of its edges. We study the hardness of clutters arising from independent sets and matchings of graphs.Item type:Thesis, Access status: Restricted , Tworzenie modelu obiektu zabytkowego z wykorzystaniem gęstego matchingu oraz skanowania laserowego(Data obrony: 2021-01-19) Hejduk, Michał
Wydział Geodezji Górniczej i Inżynierii ŚrodowiskaItem type:Thesis, Access status: Restricted , Warunek typu Meyniela na hamiltonowskość digrafów dwudzielnych(Data obrony: 2016-10-28) Kłosowski, Adrian
Wydział Matematyki Stosowanej
