Density independent hydrodynamics model for crowd coherency detection

H Ullah, M Uzair, M Ullah, A Khan, A Ahmad, W Khan - Neurocomputing, 2017 - Elsevier
We propose density independent hydrodynamics model (DIHM) which is a novel and
automatic method for coherency detection in crowded scenes. One of the major advantages …

A group-based image inpainting using patch refinement in MRF framework

M Ghorai, S Mandal, B Chanda - IEEE Transactions on Image …, 2017 - ieeexplore.ieee.org
This paper presents a Markov random field (MRF)-based image inpainting algorithm using
patch selection from groups of similar patches and optimal patch assignment through joint …

Higher-order minimum cost lifted multicuts for motion segmentation

M Keuper - … of the IEEE international conference on …, 2017 - openaccess.thecvf.com
Most state-of-the-art motion segmentation algorithms draw their potential from modeling
motion differences of local entities such as point trajectories in terms of pairwise potentials in …

Dust: Dual union of spatio-temporal subspaces for monocular multiple object 3d reconstruction

A Agudo, F Moreno-Noguer - Proceedings of the IEEE …, 2017 - openaccess.thecvf.com
We present an approach to reconstruct the 3D shape of multiple deforming objects from
incomplete 2D trajectories acquired by a single camera. Additionally, we simultaneously …

Adaptive low-rank kernel subspace clustering

P Ji, I Reid, R Garg, H Li, M Salzmann - arXiv preprint arXiv:1707.04974, 2017 - arxiv.org
In this paper, we present a kernel subspace clustering method that can handle non-linear
models. In contrast to recent kernel subspace clustering methods which use predefined …

[PDF][PDF] Low-rank kernel subspace clustering

P Ji, I Reid, R Garg, H Li… - arXiv preprint arXiv …, 2017 - researchgate.net
Most state-of-the-art subspace clustering methods only work with linear (or affine)
subspaces. In this paper, we present a kernel subspace clustering method that can handle …

Learning the geometric structure of manifolds with singularities using the tensor voting graph

S Deutsch, G Medioni - Journal of Mathematical Imaging and Vision, 2017 - Springer
We present a general framework that addresses manifolds with singularities and multiple
intersecting manifolds, which is also robust against a large number of outliers. We suggest a …

Simultaneous trajectory association and clustering for motion segmentation

Y Wang, Y Liu, E Blasch, H Ling - IEEE Signal Processing …, 2017 - ieeexplore.ieee.org
Trajectory association and clustering are two key problems in motion analysis. While
association links the points of interest to form trajectories, clustering discovers motion …

Weighted median-shift on graphs for geometric model fitting

X Zhou, H Wang, G Xiao, X Wang… - … Conference on Image …, 2017 - ieeexplore.ieee.org
In this paper, we deal with geometric model fitting problems on graphs, where each vertex
represents a model hypothesis, and each edge represents the similarity between two model …

Clustering collaboratif: Principes et mise en oeuvre

P Gançarski, A Cornuéjols, C Wemmert… - BDA (Gestion de …, 2017 - hal.science
Pour tenter de faire sens des masses de données disponibles en quantité croissante, il est
nécessaire de disposer d'outils performants limitant l'implication, souvent chronophage, de …