Dejan Gjorgjevikj

Prof. Dr. Dejan Gjorgjevikj

orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2012 in Pattern Recognition
Verified
Journal Article
Closed access
GMGjorgji Madjarov
Gjorgji Madjarov
Dragi KocevDragi Kocev
Dragi Kocev
Dejan GjorgjevikjDejan Gjorgjevikj
Dejan Gjorgjevikj
SDSašo Džeroski
Sašo Džeroski

1 May 2014
Verified
Conference Paper
Closed access
BDBojan Dikovski
Bojan Dikovski
GMGjorgji Madjarov
Gjorgji Madjarov
Dejan GjorgjevikjDejan Gjorgjevikj
Dejan Gjorgjevikj
Gait is a persons manner of walking. It is a biometric that can be used for identifying humans. Gait is an unobtrusive metric that can be obtained from distance, and this is its main strength compared to other biometrics. In this paper we construct and evaluate feature sets with the purpose of finding out the role of different types of features and body parts in the recognition process. The feature sets were constructed from skeletal images in three dimensions made with a Kinect sensor. The Kinect is a low-cost device that includes RGB, depth and audio sensors. In our work automated gait cycle extraction algorithm was performed on the Kinect recordings. Metrics like angles and distances between joints were aggregated within a gait cycle, and from those aggregations the different feature datasets were constructed. Multilayer perceptron, support vector machine with sequential minimal optimization and J48 algorithms were used for classification on these datasets. At the end we give conclusions on which groups of features and body parts gave the best recognition rates.

1 January 2009
Verified
Book Chapter
Closed access
PDF file
EIElena Ikonomovska
Elena Ikonomovska
João GamaJoão Gama
João Gama
Raquel SebastiãoRaquel Sebastião
Raquel Sebastião
Dejan GjorgjevikjDejan Gjorgjevikj
Dejan Gjorgjevikj

1 May 2009
Verified
Conference Paper
Closed access
GMGjorgji Madzarov
Gjorgji Madzarov
Dejan GjorgjevikjDejan Gjorgjevikj
Dejan Gjorgjevikj
A novel architecture of Support Vector Machine classifiers utilizing binary decision tree (SVM-DTA) for solving multiclass problems is proposed in this paper. A clustering algorithm was used to determine the hierarchy of binary decision subtasks performed by the SVM binary classifiers. The applied clustering model utilizes Mahalanobis distance measures at the kernel space for better consistency with the used SVM kernel. The proposed SVM based Binary Decision Tree architecture takes advantage of both the efficient computation of the decision tree architecture and the high classification accuracy of SVMs. The performance of the proposed SVM-DTA was estimated on a problem of recognition of handwritten digits and letters. The experiments were conducted with samples from Pendigit and Statlog databases of segmented digits and letters. The results of the experiments indicate that the proposed method is faster to be trained than the other methods. Also, due to its Log complexity, the proposed SVM-DTA is much faster than the widely used multi-class SVM methods like ldquoone-against-onerdquo and ldquoone-against-allrdquo, maintaining comparable accuracy. The experiments also showed that this method becomes more favorable as the number of classes in the recognition problem increases.

16 August 2011 in Pattern Recognition
Verified
Journal Article
Closed access
GMGjorgji Madjarov
Gjorgji Madjarov
Dejan GjorgjevikjDejan Gjorgjevikj
Dejan Gjorgjevikj
SDSašo Džeroski
Sašo Džeroski

1 January 2005
Verified
Conference Paper
Closed access
Dejan GjorgjevikjDejan Gjorgjevikj
Dejan Gjorgjevikj
DCD. Cakmakov
D. Cakmakov
Recent results in pattern recognition have shown that SVM (support vector machine) classifiers often have superior recognition rates in comparison to other classification methods. In this paper, a cooperation of four SVM classifiers for handwritten digit recognition, each using different feature set is examined. We investigate the advantages and weaknesses of various cooperation schemes based on classifier decision fusion using statistical reasoning. The obtained results show that it is difficult to exceed the recognition rate of a single, well-tuned SVM classifier applied straightforwardly on all feature sets. In our experiments only one of the cooperation schemes exceeds the recognition rate of a single SVM classifier. However, the classifier cooperation reduces the classifier complexity and need for training samples, decreases classifier training time and sometimes improves the classifier performance