default search action
Nenad Markus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Nenad Markus, Mirko Suznjevic:
Theoretical and Empirical Analysis of a Fast Algorithm for Extracting Polygons from Signed Distance Bounds. Algorithms 17(4): 137 (2024) - [c4]Nikolina Roso, Sara Vlahovic, Nenad Markus, Mirko Suznjevic:
Exploring Conversations with AI NPCs: The Impact of Token Latency on QoE and Player Experience in a Text-Based Game. QoMEX 2024: 258-261 - 2021
- [i6]Nenad Markus:
Theoretical and empirical analysis of a fast algorithm for extracting polygons from signed distance bounds. CoRR abs/2111.05778 (2021)
2010 – 2019
- 2019
- [j3]Nenad Markus, Igor S. Pandzic, Jörgen Ahlberg:
Learning Local Descriptors by Optimizing the Keypoint-Correspondence Criterion: Applications to Face Matching, Learning From Unlabeled Videos and 3D-Shape Retrieval. IEEE Trans. Image Process. 28(1): 279-290 (2019) - 2018
- [c3]Nenad Markus, Ivan Gogic, Igor S. Pandzic, Jörgen Ahlberg:
Memory-efficient Global Refinement of Decision-Tree Ensembles and its Application to Face Alignment. BMVC 2018: 162 - 2017
- [b1]Nenad Markus:
Pattern recognition with pixel intensity comparisons organized in decision trees ; Raspoznavanje uzoraka zasnovano na usporedbama piksela posloženima u stabla odlučivanja. University of Zagreb, Croatia, 2017 - [i5]Nenad Markus, Ivan Gogic, Igor S. Pandzic, Jörgen Ahlberg:
Memory-Efficient Global Refinement of Decision-Tree Ensembles and its Application to Face Alignment. CoRR abs/1702.08481 (2017) - 2016
- [c2]Nenad Markus, Igor S. Pandzic, Jörgen Ahlberg:
Learning local descriptors by optimizing the keypoint-correspondence criterion. ICPR 2016: 2380-2385 - [i4]Nenad Markus, Igor S. Pandzic, Jörgen Ahlberg:
Learning Local Descriptors by Optimizing the Keypoint-Correspondence Criterion. CoRR abs/1603.09095 (2016) - 2015
- [j2]Nenad Markus, Marco Fratarcangeli, Igor S. Pandzic, Jörgen Ahlberg:
Fast Rendering of Image Mosaics and ASCII Art. Comput. Graph. Forum 34(6): 251-261 (2015) - [i3]Nenad Markus, Igor S. Pandzic, Jörgen Ahlberg:
Constructing Binary Descriptors with a Stochastic Hill Climbing Search. CoRR abs/1501.04782 (2015) - 2014
- [j1]Nenad Markus, Miroslav Frljak, Igor S. Pandzic, Jörgen Ahlberg, Robert Forchheimer:
Eye pupil localization with an ensemble of randomized trees. Pattern Recognit. 47(2): 578-587 (2014) - [i2]Nenad Markus, Miroslav Frljak, Igor S. Pandzic, Jörgen Ahlberg, Robert Forchheimer:
Fast Localization of Facial Landmark Points. CoRR abs/1403.6888 (2014) - 2013
- [i1]Nenad Markus, Miroslav Frljak, Igor S. Pandzic, Jörgen Ahlberg, Robert Forchheimer:
A method for object detection based on pixel intensity comparisons. CoRR abs/1305.4537 (2013) - 2012
- [c1]Nenad Markus, Miroslav Frljak, Igor S. Pandzic, Jörgen Ahlberg, Robert Forchheimer:
High-performance face tracking. FAA 2012: 1:1
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-02 19:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint