no code implementations • 25 Sep 2019 • Nicholas I-Hsien Kuo, Mehrtash T. Harandi, Nicolas Fourrier, Gabriela Ferraro, Christian Walder, Hanna Suominen
This paper contrasts the two canonical recurrent neural networks (RNNs) of long short-term memory (LSTM) and gated recurrent unit (GRU) to propose our novel light-weight RNN of Extrapolated Input for Network Simplification (EINS).
no code implementations • 27 Sep 2018 • Nicholas I.H. Kuo, Mehrtash T. Harandi, Hanna Suominen, Nicolas Fourrier, Christian Walder, Gabriela Ferraro
It is unclear whether the extensively applied long-short term memory (LSTM) is an optimised architecture for recurrent neural networks.
no code implementations • CVPR 2015 • Masoud Faraki, Mehrtash T. Harandi, Fatih Porikli
This paper takes a step forward in image and video coding by extending the well-known Vector of Locally Aggregated Descriptors (VLAD) onto an extensive space of curved Riemannian manifolds.
no code implementations • 11 Aug 2014 • Sareh Shirazi, Conrad Sanderson, Chris McCool, Mehrtash T. Harandi
We propose an adaptive tracking algorithm where the object is modelled as a continuously updated bag of affine subspaces, with each subspace constructed from the object's appearance over several consecutive frames.
no code implementations • 4 Jul 2014 • Mehrtash T. Harandi, Mathieu Salzmann, Sadeep Jayasumana, Richard Hartley, Hongdong Li
Modeling videos and image-sets as linear subspaces has proven beneficial for many visual recognition tasks.
no code implementations • 4 Jul 2014 • Mehrtash T. Harandi, Mathieu Salzmann, Richard Hartley
In particular, we search for a projection that yields a low-dimensional manifold with maximum discriminative power encoded via an affinity-weighted similarity measure based on metrics on the manifold.
no code implementations • CVPR 2014 • Mahsa Baktashmotlagh, Mehrtash T. Harandi, Brian C. Lovell, Mathieu Salzmann
Here, we propose to make better use of the structure of this manifold and rely on the distance on the manifold to compare the source and target distributions.
no code implementations • 5 Mar 2014 • Andres Sanin, Conrad Sanderson, Mehrtash T. Harandi, Brian C. Lovell
For covariance-based image descriptors, taking into account the curvature of the corresponding feature space has been shown to improve discrimination performance.
no code implementations • 3 Mar 2014 • Sareh Shirazi, Mehrtash T. Harandi, Brian C. Lovell, Conrad Sanderson
A robust visual tracking system requires an object appearance model that is able to handle occlusion, pose, and illumination variations in the video stream.
no code implementations • CVPR 2013 • Shaokang Chen, Conrad Sanderson, Mehrtash T. Harandi, Brian C. Lovell
We show that by minimising the sparse representation reconstruction error, we approach the nearest point on a Grassmann manifold.
1 code implementation • 16 Apr 2013 • Mehrtash T. Harandi, Conrad Sanderson, Richard Hartley, Brian C. Lovell
Recent advances suggest that a wide range of computer vision problems can be addressed more appropriately by considering non-Euclidean geometry.
no code implementations • 25 Mar 2013 • Andres Sanin, Conrad Sanderson, Mehrtash T. Harandi, Brian C. Lovell
We propose a new action and gesture recognition method based on spatio-temporal covariance descriptors and a weighted Riemannian locality preserving projection approach that takes into account the curved space formed by the descriptors.
Ranked #2 on Hand Gesture Recognition on Cambridge
no code implementations • 12 Mar 2013 • Conrad Sanderson, Mehrtash T. Harandi, Yongkang Wong, Brian C. Lovell
In contrast to comparing faces via single exemplars, matching sets of face images increases robustness and discrimination performance.
no code implementations • 7 Mar 2013 • Yongkang Wong, Mehrtash T. Harandi, Conrad Sanderson
Thorough experiments on AR, FERET, exYaleB, BANCA and ChokePoint datasets show that the proposed local SR approach obtains considerably better and more robust performance than several previous state-of-the-art holistic SR methods, in both verification and closed-set identification problems.