Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Yll Haxhimusa"'
Autor:
Axel Pinz, Horst Bischof, Walter Kropatsch, Gerald Schweighofer, Yll Haxhimusa, Andreas Opelt, Adrian Ion
Publikováno v:
ELCVIA Electronic Letters on Computer Vision and Image Analysis, Vol 7, Iss 2 (2008)
The emerging discipline of cognitive vision requires a proper representation of visual information including spatial and temporal relationships, scenes, events, semantics and context. This review article summarizes existing representational schemes i
Externí odkaz:
https://doaj.org/article/13cafcf9f72d4bc29311cf11a564bb6e
Publikováno v:
Machine Vision and Applications. 27:647-661
In this work, we propose an image-based phenotyping framework for the determination of quantitative traits from mature Arabidopsis thaliana plants. Two-dimensional (2D) images taken from the dried and flattened plants are analyzed regarding their geo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6d215763bdec7fcba22be84e0346850a
https://doi.org/10.1007/s00138-015-0720-z
https://doi.org/10.1007/s00138-015-0720-z
Autor:
Bhanu Prasad, Bohdan Kuz, Roman Kutelmakh, Roman Bazylevych, Rémy Dupas, Lubov Bazylevych, Yll Haxhimusa
Publikováno v:
International Journal of Information Technology and Computer Science(IJITCS)
International Journal of Information Technology and Computer Science(IJITCS), IJIT, 2016, 8 (5), pp.1-12. ⟨10.5815/ijitcs.2016.05.01⟩
International Journal of Information Technology and Computer Science(IJITCS), IJIT, 2016, 8 (5), pp.1-12. ⟨10.5815/ijitcs.2016.05.01⟩
A parallel approach for solving a large-scale Traveling Salesman Problem (TSP) is presented. The problem is solved in four stages by using the following sequence of procedures: decomposing the input set of points into two or more clusters, solving th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::211b1ced027daf98e67e8e20e9fc2bfb
https://hal.archives-ouvertes.fr/hal-01695200
https://hal.archives-ouvertes.fr/hal-01695200
Publikováno v:
Image and Vision Computing. 27:887-896
The traveling salesman problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution for an input with a large number of cities, the problem is transformed into a simpler form containing smaller
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27d6a9ed641bc3fe235f50371ac28713
https://doi.org/10.1016/j.imavis.2008.06.016
https://doi.org/10.1016/j.imavis.2008.06.016
Publikováno v:
Advances in Visual Computing ISBN: 9783319278568
ISVC (1)
ISVC (1)
Building facade classification by architectural styles allows categorization of large databases of building images into semantic categories belonging to certain historic periods, regions and cultural influences. Image databases sorted by architectura
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07f0a8d453369eb20095cf522643af44
https://doi.org/10.1007/978-3-319-27857-5_26
https://doi.org/10.1007/978-3-319-27857-5_26
Publikováno v:
Computer Vision-ECCV 2014 Workshops ISBN: 9783319162195
ECCV Workshops (4)
ECCV Workshops (4)
The image-based phenotyping of mature plants faces several challenges from the image acquisition to the determination of quantitative characteristics describing their appearance. In this work a framework to extract geometrical and topological traits
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0638de7a874779708894ab5c3082fe29
https://doi.org/10.1007/978-3-319-16220-1_17
https://doi.org/10.1007/978-3-319-16220-1_17
Publikováno v:
Pattern Recognition Letters. 26:319-337
In irregular pyramids, their vertical structure is not determined beforehand as in regular pyramids. We present three methods, all based on maximal independent sets from graph theory, with the aim to simulate the major sampling properties of the regu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e564fc70cfc6b5febf2ca4e946b5e5c
https://doi.org/10.1016/j.patrec.2004.10.026
https://doi.org/10.1016/j.patrec.2004.10.026
This book constitutes the refereed proceedings of the 9th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2013, held in Vienna, Austria, in May 2013. The 24 papers presented in this volume were carefully
Publikováno v:
Graph-Based Representations in Pattern Recognition ISBN: 9783642382208
GbRPR
GbRPR
In this paper, we investigate the Max-Cut problem and propose a probabilistic heuristic to address its classic and weighted version. Our approach is based on the Estimation of Distribution Algorithm (EDA) that creates a population of individuals capa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89d51ee0d4012dac0a72f94a564e01eb
https://doi.org/10.1007/978-3-642-38221-5_26
https://doi.org/10.1007/978-3-642-38221-5_26
Computer vision systems have to deal with thousands, sometimes millions of pixel values from each frame, and the computational complexity of many problems related to the interpretation of image data is very high. The task becomes especially difficult
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a2a481f083e0b4ee0dc068ab761886e
https://doi.org/10.4018/978-1-4666-2672-0.ch022
https://doi.org/10.4018/978-1-4666-2672-0.ch022