Muhammad Usman Ilyas

Muhammad Usman Ilyas

Auto-generated profile, based on publicly available information

Muhammad Usman Ilyas

Department of Computer and Network Engineering, College of Computer Science and Engineering, University of Jeddah, Jeddah, Saudi Arabia

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

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

Representative Publications

View All Publications
1 January 2013
Verified
Conference Paper
Closed access
AAAlvina Anjum
Alvina Anjum
MIMuhammad U. Ilyas
Muhammad U. Ilyas
Motion sensor embedded smartphones have provided a new platform for activity inference. These sensors, initially used for cell phone feature enhancement, are now being used for a variety of applications. Providing cell phone users information about their own physical activity in an understandable format can enable users to make more informed and healthier lifestyle choices. In this work, we built a smartphone application which tracks users' physical activities and provide feedback requiring no user input during routine operation. The application reports estimates of the calories burned, broken up by physical activities. Detectable physical activities include walking, running, climbing stairs, descending stairs, driving, cycling and being inactive. We evaluated a number of classification algorithms from the area of Machine Learning, including Naïve Bayes, Decision Tree, K-Nearest Neighbor and Support Vector Machine classifiers. For training and verification of classifiers, we collected a dataset of 510 activity traces using cell phone sensors. We developed a smartphone app that performs activity recognition that does not require any user intervention. The classifier implemented in the Android app performs at an average true positives rate of greater than 95%, false positives rate of less than 1.5% and an ROC area of greater than 98%.

1 September 2017 in Biomedical Signal Processing and Control
Verified
Journal Article
Closed access
SASayyar Ahmad
Sayyar Ahmad
NUNasim Ullah
Nasim Ullah
NANisar Ahmed
Nisar Ahmed
MIMuhammad Ilyas
Muhammad Ilyas
WKWaqas Khan
Waqas Khan

8 March 2023 in IEEE Access
Verified
Journal Article
Open access
MKMuhammad Murtaza Khan
Muhammad Murtaza Khan
MIMuhammad U. Ilyas
Muhammad U. Ilyas
IKIshtiaq Rasool Khan
Ishtiaq Rasool Khan
SASaleh M. Alshomrani
Saleh M. Alshomrani
SRSusanto Rahardja
Susanto Rahardja
Advances in both parallel processing capabilities because of graphical processing units (GPUs) and computer vision algorithms have led to the development of deep neural networks (DNN) and their utilization in real-world applications. Starting from the LeNet-5 architecture of the 1990s, modern deep neural networks may have tens to hundreds of layers to solve complex problems such as license plate detection or recognition tasks. In this manuscript, we present a review of the state-of-the-art methods related to automatic license plate recognition. Since deep networks have demonstrated a remarkable ability to outperform other machine learning techniques, we focus only on neural network based license plate recognition methods. We highlight the particular types of networks, i.e., convolutional, residual recurrent, or long-short-term-memory, used for the specific tasks of license plate detection, extraction, or recognition in different existing works. The presented summary also highlights some of the most widely used data sets for comparison and shares the results reported in the reviewed papers. We also give an overview of the effects of fog, motion, or the use of synthetic data on license plate recognition. Finally, promising directions for future research in this domain are presented.

1 June 2011
Verified
Conference Paper
Closed access
MIMuhammad U. Ilyas
Muhammad U. Ilyas
HRHayder Radha
Hayder Radha
Identifying the most influential nodes in social networks is a key problem in social network analysis. However, without a strict definition of centrality the notion of what constitutes a central node in a network changes with application and the type of commodity flowing through a network. In this paper we identify social hubs, nodes at the center of influential neighborhoods, in massive online social networks using principal component centrality (PCC). We compare PCC with eigenvector centrality's (EVC), the de facto measure of node influence by virtue of their position in a network. We demonstrate PCC's performance by processing a friendship graph of 70, 000 users of Google's Orkut social networking service and a gaming graph of 143, 020 users obtained from users of Facebook's 'Fighters Club' application.

20 June 2013 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
MSM. Zubair Shafiq
M. Zubair Shafiq
MIMuhammad U. Ilyas
Muhammad U. Ilyas
ALAlex X. Liu
Alex X. Liu
HRHayder Radha
Hayder Radha
Identifying leaders and followers in online social networks is important for various applications in many domains such as advertisement, community health campaigns, administrative science, and even politics. In this paper, we study the problem of identifying leaders and followers in online social networks using user interaction information. We propose a new model, called the Longitudinal User Centered Influence (LUCI) model, that takes as input user interaction information and clusters users into four categories: introvert leaders, extrovert leaders, followers, and neutrals. To validate our model, we first apply it to a data set collected from an online social network called Everything2. Our experimental results show that our LUCI model achieves an average classification accuracy of up to 90.3% in classifying users as leaders and followers, where the ground truth is based on the labeled roles of users. Second, we apply our LUCI model on a data set collected from Facebook consisting of interactions among more than 3 million users over the duration of one year. However, we do not have ground truth data for Facebook users. Therefore, we analyze several important topological properties of the friendship graph for different user categories. Our experimental results show that different user categories exhibit different topological characteristics in the friendship graph and these observed characteristics are in accordance with the expected ones based on the general definition of the four roles.

1 July 2018 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
SSSaad Saleh
Saad Saleh
Junaid QadirJunaid Qadir
Junaid Qadir
MIMuhammad U. Ilyas
Muhammad U. Ilyas