Multi-target tracking in multiple non-overlapping cameras using constrained dominant sets

YT Tesfaye, E Zemene, A Prati, M Pelillo… - arXiv preprint arXiv …, 2017 - arxiv.org
In this paper, a unified three-layer hierarchical approach for solving tracking problems in
multiple non-overlapping cameras is proposed. Given a video and a set of detections …

Multi-target tracking in multiple non-overlapping cameras using fast-constrained dominant sets

YT Tesfaye, E Zemene, A Prati, M Pelillo… - International Journal of …, 2019 - Springer
In this paper, a unified three-layer hierarchical approach for solving tracking problem in a
multiple non-overlapping cameras setting is proposed. Given a video and a set of detections …

Dominant sets for “constrained” image segmentation

EZ Zemene, LT Alemu, M Pelillo - IEEE Transactions on Pattern …, 2018 - ieeexplore.ieee.org
Image segmentation has come a long way since the early days of computer vision, and still
remains a challenging task. Modern variations of the classical (purely bottom-up) approach …

Constrained dominant sets for retrieval

E Zemene, LT Alemu, M Pelillo - 2016 23rd International …, 2016 - ieeexplore.ieee.org
Learning new global relations based on an initial affinity of the database objects has shown
significant improvements in similarity retrievals. Locally constrained diffusion process is one …

Simultaneous clustering and outlier detection using dominant sets

E Zemene, YT Tesfaye, A Prati… - 2016 23rd International …, 2016 - ieeexplore.ieee.org
We present a unified approach for simultaneous clustering and outlier detection in data. We
utilize some properties of a family of quadratic optimization problems related to dominant …

Clustering through probability distribution analysis along eigenpaths

W Yang, C Hui, D Sun, X Sun… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
Data clustering is one of the most fundamental techniques in exploratory data analysis. It is
widely used for determining the underlying data structure, classifying natural data and …

Density based clustering via dominant sets

J Hou, W Liu, XE - Artificial Neural Networks in Pattern Recognition: 7th …, 2016 - Springer
While density based clustering algorithms are able to detect clusters of arbitrary shapes,
their clustering results usually rely heavily on some user-specified parameters. In order to …

Constrained Dominant sets and Its applications in computer vision

AL Tesfaye - arXiv preprint arXiv:2002.06028, 2020 - arxiv.org
In this thesis, we present new schemes which leverage a constrained clustering method to
solve several computer vision tasks ranging from image retrieval, image segmentation and …

Applications of a graph theoretic based clustering framework in computer vision and pattern recognition

YT Tesfaye - arXiv preprint arXiv:1802.02181, 2018 - arxiv.org
Recently, several clustering algorithms have been used to solve variety of problems from
different discipline. This dissertation aims to address different challenging tasks in computer …

A Continuous-Time Quantum Walk for Attributed Graphs Matching

T Chekole - arXiv preprint arXiv:1801.10339, 2018 - arxiv.org
Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now. In specific,
Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated …