• International Journal of Computer Science & Network Security
• /
• v.21 no.7
• /
• pp.273-283
• /
• 2021

The aim of this paper is to review the current knowledge management (KM) practices and their importance in the public sector of Saudi Arabia. Using the term "knowledge management in public sector", a search for available works was done in Google Scholar. In the first stage, the search for literature published under anytime choice was done in the first 10 pages of the search engine. Then another nine pages of Goggle Scholar were searched for more recent works published setting the time as 2014 to 2018. The search yielded 37 usable works for this review. The results of this literature search and review indicated that out of the 37 works reviewed, only three works were related to Saudi Arabia. Number of papers on factors of KM were maximum, many of them giving diagrammatic presentation of their results. KM modelling itself is not easy as only very few papers on KM modelling were available. Problems of too much reliance on qualitative data and hypotheses not matching with the literature backgrounds for them were also found. Considering the works related to KM, the number of papers in various categories may indicate the dimensions of KM to be considered when KM is implemented or evaluated in any public sector of any country. This applies to Saudi Arabian public sector organizations also. There is a fertile ground of research waiting to be investigated by researchers in Saudi Arabia.

• International Journal of Computer Science & Network Security
• /
• v.22 no.11
• /
• pp.121-126
• /
• 2022

The number of vehicles has increased exponentially over the past 20 years due to technological advancements. It is becoming almost impossible to manually control and manage the traffic in a city like Karachi. Without license plate recognition, traffic management is impossible. The Framework for License Plate Detection & Recognition to overcome these issues is proposed. License Plate Detection & Recognition is primarily performed in two steps. The first step is to accurately detect the license plate in the given image, and the second step is to successfully read and recognize each character of that license plate. Some of the most common algorithms used in the past are based on colour, texture, edge-detection and template matching. Nowadays, many researchers are proposing methods based on deep learning. This research proposes a framework for License Plate Detection & Recognition using a custom YOLOv5 Object Detector, image segmentation techniques, and Tesseract's optical character recognition OCR. The accuracy of this framework is 0.89.

• International Journal of Computer Science & Network Security
• /
• v.23 no.9
• /
• pp.166-176
• /
• 2023

A scenario known as conflict in face recognition may arise as a result of some disparity-related issues (such as expression, distortion, occlusion and others) leading to a compromise of someone's identity or contradiction of the intended message. However, addressing this requires the determination and application of appropriate procedures among the various conflict theories both in terms of concepts as well as resolution strategies. Theories such as Marxist, Game theory (Prisoner's dilemma, Penny matching, Chicken problem), Lanchester theory and Information theory were analyzed in relation to facial images conflict and these were made possible by trying to provide answers to selected questions as far as resolving facial conflict is concerned. It has been observed that the scenarios presented in the Marxist theory agree with the form of resolution expected in the analysis of conflict and its related issues as they relate to face recognition. The study observed that the issue of conflict in facial images can better be analyzed using the concept introduced by the Marxist theory in relation to the Information theory. This is as a result of its resolution strategy which tends to seek a form of balance as result as opposed to the win or lose case scenarios applied in other concepts. This was also consolidated by making reference to the main mechanisms and result scenario applicable in Information theory.

• International Journal of Computer Science & Network Security
• /
• v.24 no.5
• /
• pp.79-88
• /
• 2024

The information retrieval domain deals with the retrieval of unstructured data such as text documents. Searching documents is a main component of the modern information retrieval system. Locality Sensitive Hashing (LSH) is one of the most popular methods used in searching for documents in a high-dimensional space. The main benefit of LSH is its theoretical guarantee of query accuracy in a multi-dimensional space. More enhancement can be achieved to LSH by adding a bit to its steps. In this paper, a new Dynamic Locality Sensitive Hashing (DLSH) algorithm is proposed as an improved version of the LSH algorithm, which relies on employing the hierarchal selection of LSH parameters (number of bands, number of shingles, and number of permutation lists) based on the similarity achieved by the algorithm to optimize searching accuracy and increasing its score. Using several tampered file structures, the technique was applied, and the performance is evaluated. In some circumstances, the accuracy of matching with DLSH exceeds 95% with the optimal parameter value selected for the number of bands, the number of shingles, and the number of permutations lists of the DLSH algorithm. The result makes DLSH algorithm suitable to be applied in many critical applications that depend on accurate searching such as forensics technology.

• Journal of Intelligence and Information Systems
• /
• v.12 no.1
• /
• pp.1-15
• /
• 2006

In Korea, a resident registration card has various personal information such as a present address, a resident registration number, a face picture and a fingerprint. A plastic-type resident card currently used is easy to forge or alter and tricks of forgery grow to be high-degree as time goes on. So, whether a resident card is forged or not is difficult to judge by only an examination with the naked eye. This paper proposed an automatic recognition method of a resident card which recognizes a resident registration number by using a refined ART2-based RBF network newly proposed and authenticates a face picture by a template image matching method. The proposed method, first, extracts areas including a resident registration number and the date of issue from a resident card image by applying Sobel masking, median filtering and horizontal smearing operations to the image in turn. To improve the extraction of individual codes from extracted areas, the original image is binarized by using a high-frequency passing filter and CDM masking is applied to the binaried image fur making image information of individual codes better. Lastly, individual codes, which are targets of recognition, are extracted by applying 4-directional contour tracking algorithm to extracted areas in the binarized image. And this paper proposed a refined ART2-based RBF network to recognize individual codes, which applies ART2 as the loaming structure of the middle layer and dynamicaly adjusts a teaming rate in the teaming of the middle and the output layers by using a fuzzy control method to improve the performance of teaming. Also, for the precise judgement of forgey of a resident card, the proposed method supports a face authentication by using a face template database and a template image matching method. For performance evaluation of the proposed method, this paper maked metamorphoses of an original image of resident card such as a forgey of face picture, an addition of noise, variations of contrast variations of intensity and image blurring, and applied these images with original images to experiments. The results of experiment showed that the proposed method is excellent in the recognition of individual codes and the face authentication fur the automatic recognition of a resident card.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.8
• /
• pp.1-6
• /
• 1992

This paper proposed a neural computer architecture for the learning of script character pattern recognition categories. Oriented filter with complex cells preprocess about the input script character, abstracts contour from the character. This contour normalized and inputed to the ART. Top-down attentional and matching mechanisms are critical in self-stabilizing of the code learning process. The architecture embodies a parallel search scheme that updates itself adaptively as the learning process unfolds. After learning ART self-stabilizes, recognition time does not grow as a function of code complexity. Vigilance level shows the similarity between learned patterns and new input patterns. This character recognition system is designed to adaptable. The simulation of this system showed satisfied result in the recognition of the hand written characters.

• Journal of the Korean Society for Library and Information Science
• /
• v.47 no.1
• /
• pp.39-55
• /
• 2013

It is a difficult problem to use keyword retrieval for low-quality Korean document images because these include adjacent characters that are connected. In addition, images that are created from various fonts are likely to be distorted during acquisition. In this paper, we propose and test a keyword retrieval system, using a support vector machine (SVM) for the retrieval of low-quality Korean document images. We propose a keyword retrieval method using an SVM to discriminate the similarity between two word images. We demonstrated that the proposed keyword retrieval method is more effective than the accumulated Optical Character Recognition (OCR)-based searching method. Moreover, using the SVM is better than Bayesian decision or artificial neural network for determining the similarity of two images.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.11
• /
• pp.97-105
• /
• 1996

This paper is a study on the implementation of speech recognition mobile robot to which the interactive speech recognition techniques is applied. The speech command uttered the sentential connected word and is asserted through the wireless mic system. This speech signal transferred LPC-cepstrum and shorttime energy which are computed from the received signal on the DSP board to notebook PC. In notebook PC, DP matching technique is used for recognizer and the recognition results are transferred to the motor control unit which output pulse signals corresponding to the recognized command and drive the stepping motor. Grammar network applied to reduce the recognition speed of the recogniger, so that real time recognition is realized. The misrecognized command is revised by interface revision through the conversation with mobile robot. Therefore, user can move the mobile robot to the direction which user wants.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.12 no.2
• /
• pp.139-149
• /
• 2012

A 3D stacked IC is made by multiple dies (possibly) with heterogeneous process technologies. Therefore, die-to-die variation in 2D chips renders on-package variation (OPV) in a 3D chip. In spite of the different variation effect in 3D chips, generally, 3D die stacking can produce high yield due to the smaller individual die area and the averaging effect of variation on data path. However, 3D clock network can experience unintended huge clock skew due to the different clock propagation routes on multiple stacked dies. In this paper, we analyze the on-package variation effect on 3D clock networks and show the necessity of a post silicon management method such as body biasing technique for the OPV induced 3D clock skew control in 3D stacked IC designs. Then, we present a parametric yield improvement method to mitigate the OPV induced 3D clock skew.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.20 no.5
• /
• pp.708-716
• /
• 2017

We deal with the target selection in seeker-detection image through network, using the detection information from aerial vehicle and the target information from surveillance and reconnaissance system. Especially, we constrain the sea battle environment, where it is difficult to perform scene-matching rather than land. In this paper, we suggest the target selection algorithm based on the confidence estimation with respect to distance and size. In detail, we propose the generation method of reference point for distance evaluation, and we investigate the effect of pixel margin and target course for size evaluation. Finally, the proposed algorithm is simulated and analyzed through several scenarios.