Md Jan Nordin

Dr. Md Jan Nordin


Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
5 March 2014 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
AAAmir Hossein Ashtari
Amir Hossein Ashtari
MNMd Jan Nordin
Md Jan Nordin
MFMahmood Fathy
Mahmood Fathy
In this paper, an Iranian vehicle license plate recognition system based on a new localization approach, which is modified to reflect the local context, is proposed, along with a hybrid classifier that recognizes license plate characters. The method presented here is based on a modified template-matching technique by the analysis of target color pixels to detect the location of a vehicle’s license plate. A modified strip search enables localization of the standard color-geometric template utilized in Iran and several European countries. This approach uses periodic strip search to find the hue of each pixel on demand. In addition, when a group of target pixels is detected, it is analyzed to verify that its shape and aspect ratio match those of the standard license plate. In addition to being scale and rotation invariant, this method avoids time-consuming image algorithms and transformations for the whole image pixels, such as resizing and Hough, Fourier, and wavelet transforms, thereby cutting down the detection response time. License plate characters are recognized by a hybrid classifier that comprises a decision tree and a support vector machine with a homogeneous fifth-degree polynomial kernel. The performance detection rate and the overall system performance achieved are 96% and 94%, respectively.

22 April 2021 in Electronics
Verified
Journal Article
Open access
PDF file
NANorshakirah Aziz
Norshakirah Aziz
MNMd Jan Nordin
Md Jan Nordin
SAsaid Jadid Abdulkadir
said Jadid Abdulkadir
MSMuhammad Muhaimin M. Salih
Muhammad Muhaimin M. Salih
The advancement of technology has enabled powerful microprocessors to render high-quality graphics for computer gaming. Despite being intended for leisure purposes, several components of the games alongside the gamer’s environmental factors have resulted in digital addiction (DA) towards computer games such as massively multiplayer online games (MMOG). Excessive gaming among adolescents has various negative impacts on an individual. However, only a few researchers have addressed the impact of DA on physical health. Thus, the primary objective of this research is to study the impact of DA on physical health among Malaysian adolescents. This study focuses on Malaysian adolescents of ages 12–18 years old who are addicted to computer games, specifically the MMOG. The methodology used for the study involves focus group discussions (FGD) and extensive literature study. The FGD sessions have involved both medical experts and game experts. The outcome of FGD discussion is recorded and justified with the existing relevant literature from high-impact journals, theses, conferences, books, and reports. This paper provides evidence of five physical health impacts of DA associated with adolescents. The factors of DA, the addiction components existing in MMOG computer games, and the DA health risk assessment are presented in the results section. Based on the study, it is concluded that DA among Malaysian adolescents can cause various impacts on physical health such as obesity, back pain, and neck pain, orthopaedic/joint muscle, eyesight problem, hearing problem, as well as physical inactivity.

29 August 2019 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
SKSeyed M. M. Kahaki
Seyed M. M. Kahaki
MNMd Jan Nordin
Md Jan Nordin
NANazatul S. Ahmad
Nazatul S. Ahmad
MAMahir Arzoky
Mahir Arzoky
WIWaidah Ismail
Waidah Ismail

1 January 2014 in The Scientific World Journal
Verified
Journal Article
Open access
PDF file
ASAli Soleymani
Ali Soleymani
MNMd Jan Nordin
Md Jan Nordin
Elankovan SundararajanElankovan Sundararajan
Elankovan Sundararajan
The rapid evolution of imaging and communication technologies has transformed images into a widespread data type. Different types of data, such as personal medical information, official correspondence, or governmental and military documents, are saved and transmitted in the form of images over public networks. Hence, a fast and secure cryptosystem is needed for high-resolution images. In this paper, a novel encryption scheme is presented for securing images based on Arnold cat and Henon chaotic maps. The scheme uses Arnold cat map for bit- and pixel-level permutations on plain and secret images, while Henon map creates secret images and specific parameters for the permutations. Both the encryption and decryption processes are explained, formulated, and graphically presented. The results of security analysis of five different images demonstrate the strength of the proposed cryptosystem against statistical, brute force and differential attacks. The evaluated running time for both encryption and decryption processes guarantee that the cryptosystem can work effectively in real-time applications.

28 February 2014 in Sensors
Verified
Journal Article
Open access
PDF file
SKSeyed M. M. Kahaki
Seyed M. M. Kahaki
MNMd Jan Nordin
Md Jan Nordin
AAAmir Hossein Ashtari
Amir Hossein Ashtari
Image corner detection is a fundamental task in computer vision. Many applications require reliable detectors to accurately detect corner points, commonly achieved by using image contour information. The curvature definition is sensitive to local variation and edge aliasing, and available smoothing methods are not sufficient to address these problems properly. Hence, we propose Mean Projection Transform (MPT) as a corner classifier and parabolic fit approximation to form a robust detector. The first step is to extract corner candidates using MPT based on the integral properties of the local contours in both the horizontal and vertical directions. Then, an approximation of the parabolic fit is calculated to localize the candidate corner points. The proposed method presents fewer false-positive (FP) and false-negative (FN) points compared with recent standard corner detection techniques, especially in comparison with curvature scale space (CSS) methods. Moreover, a new evaluation metric, called accuracy of repeatability (AR), is introduced. AR combines repeatability and the localization error (Le) for finding the probability of correct detection in the target image. The output results exhibit better repeatability, localization, and AR for the detected points compared with the criteria in original and transformed images.

17 March 2016 in PLOS ONE
Verified
Journal Article
Open access
PDF file
SKSeyed M. M. Kahaki
Seyed M. M. Kahaki
MNMd Jan Nordin
Md Jan Nordin
AAAmir H. Ashtari
Amir H. Ashtari
SZSophia J. Zahra
Sophia J. Zahra
An invariant feature matching method is proposed as a spatially invariant feature matching approach. Deformation effects, such as affine and homography, change the local information within the image and can result in ambiguous local information pertaining to image points. New method based on dissimilarity values, which measures the dissimilarity of the features through the path based on Eigenvector properties, is proposed. Evidence shows that existing matching techniques using similarity metrics—such as normalized cross-correlation, squared sum of intensity differences and correlation coefficient—are insufficient for achieving adequate results under different image deformations. Thus, new descriptor’s similarity metrics based on normalized Eigenvector correlation and signal directional differences, which are robust under local variation of the image information, are proposed to establish an efficient feature matching technique. The method proposed in this study measures the dissimilarity in the signal frequency along the path between two features. Moreover, these dissimilarity values are accumulated in a 2D dissimilarity space, allowing accurate corresponding features to be extracted based on the cumulative space using a voting strategy. This method can be used in image registration applications, as it overcomes the limitations of the existing approaches. The output results demonstrate that the proposed technique outperforms the other methods when evaluated using a standard dataset, in terms of precision-recall and corner correspondence.