Nenad Markus

Orcid: 0000-0002-4689-0956

According to our database1, Nenad Markus authored at least 13 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Theoretical and Empirical Analysis of a Fast Algorithm for Extracting Polygons from Signed Distance Bounds.
Algorithms, April, 2024

Exploring Conversations with AI NPCs: The Impact of Token Latency on QoE and Player Experience in a Text-Based Game.
Proceedings of the 16th International Conference on Quality of Multimedia Experience, 2024

2021
Theoretical and empirical analysis of a fast algorithm for extracting polygons from signed distance bounds.
CoRR, 2021

2019
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., 2019

2018
Memory-efficient Global Refinement of Decision-Tree Ensembles and its Application to Face Alignment.
Proceedings of the British Machine Vision Conference 2018, 2018

2017
Pattern recognition with pixel intensity comparisons organized in decision trees ; Raspoznavanje uzoraka zasnovano na usporedbama piksela posloženima u stabla odlučivanja.
PhD thesis, 2017

2016
Learning local descriptors by optimizing the keypoint-correspondence criterion.
Proceedings of the 23rd International Conference on Pattern Recognition, 2016

2015
Constructing Binary Descriptors with a Stochastic Hill Climbing Search.
CoRR, 2015

Fast Rendering of Image Mosaics and ASCII Art.
Comput. Graph. Forum, 2015

2014
Eye pupil localization with an ensemble of randomized trees.
Pattern Recognit., 2014

Fast Localization of Facial Landmark Points.
CoRR, 2014

2013
A method for object detection based on pixel intensity comparisons
CoRR, 2013

2012
High-performance face tracking.
Proceedings of the Facial Analysis and Animation 2012, 2012


  Loading...