Search Results for author: Azadeh Alavi

Found 13 papers, 2 papers with code

Self-Supervised Learning for Time Series: Contrastive or Generative?

1 code implementation14 Mar 2024 Ziyu Liu, Azadeh Alavi, Minyi Li, Xiang Zhang

In this paper, we will present a comprehensive comparative study between contrastive and generative methods in time series.

Model Optimization Representation Learning +2

Hybrid Classical-Quantum method for Diabetic Foot Ulcer Classification

no code implementations5 Oct 2021 Azadeh Alavi, Hossein Akhoundi

As such, we merge the pre-trained Xception network with a multi-class variational classifier.

Classification Transfer Learning

Deep Subspace analysing for Semi-Supervised multi-label classification of Diabetic Foot Ulcer

no code implementations5 Oct 2021 Azadeh Alavi

In order to develop a self monitoring mobile application, in this work, we propose a novel deep subspace analysis pipeline for semi-supervised diabetic foot ulcer mulit-label classification.

Data Augmentation Multi-Label Classification +1

KEPLER: Keypoint and Pose Estimation of Unconstrained Faces by Learning Efficient H-CNN Regressors

no code implementations16 Feb 2017 Amit Kumar, Azadeh Alavi, Rama Chellappa

In this paper, we show that without using any 3D information, KEPLER outperforms state of the art methods for alignment on challenging datasets such as AFW and AFLW.

Face Alignment Head Pose Estimation +3

DCNNs on a Diet: Sampling Strategies for Reducing the Training Set Size

no code implementations14 Jun 2016 Maya Kabkab, Azadeh Alavi, Rama Chellappa

Large-scale supervised classification algorithms, especially those based on deep convolutional neural networks (DCNNs), require vast amounts of training data to achieve state-of-the-art performance.

General Classification

Triplet Probabilistic Embedding for Face Verification and Clustering

2 code implementations19 Apr 2016 Swami Sankaranarayanan, Azadeh Alavi, Carlos Castillo, Rama Chellappa

Despite significant progress made over the past twenty five years, unconstrained face verification remains a challenging problem.

Clustering Face Verification

Optimized Kernel-based Projection Space of Riemannian Manifolds

no code implementations10 Feb 2016 Azadeh Alavi, Vishal M. Patel, Rama Chellappa

Recently, it was shown that embedding such manifolds into a Random Projection Spaces (RPS), rather than RKHS or tangent space, leads to higher classification and clustering performance.

Classification Clustering +2

Triplet Similarity Embedding for Face Verification

no code implementations10 Feb 2016 Swami Sankaranarayanan, Azadeh Alavi, Rama Chellappa

In this work, we present an unconstrained face verification algorithm and evaluate it on the recently released IJB-A dataset that aims to push the boundaries of face verification methods.

Face Verification

Efficient Clustering on Riemannian Manifolds: A Kernelised Random Projection Approach

no code implementations18 Sep 2015 Kun Zhao, Azadeh Alavi, Arnold Wiliem, Brian C. Lovell

We then validate our framework on several computer vision applications by comparing against popular clustering methods on Riemannian manifolds.

Clustering

Multi-Shot Person Re-Identification via Relational Stein Divergence

no code implementations4 Mar 2014 Azadeh Alavi, Yan Yang, Mehrtash Harandi, Conrad Sanderson

The use of similarity vectors is in contrast to the traditional approach of embedding manifolds into tangent spaces, which can suffer from representing the manifold structure inaccurately.

General Classification Person Re-Identification

Random Projections on Manifolds of Symmetric Positive Definite Matrices for Image Classification

no code implementations4 Mar 2014 Azadeh Alavi, Arnold Wiliem, Kun Zhao, Brian C. Lovell, Conrad Sanderson

Recent advances suggest that encoding images through Symmetric Positive Definite (SPD) matrices and then interpreting such matrices as points on Riemannian manifolds can lead to increased classification performance.

Face Recognition General Classification +3

Cannot find the paper you are looking for? You can Submit a new open access paper.