• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.333-342
• /
• 2005

This paper proposes a method, which recognizes student's identification card by using image processing and recognition technology and can manage student information on the web. The presented scheme sets up an average brightness as a threshold, based on the brightest Pixel and the least bright one for the source image of the ID card. It is converting to binary image, applies a horizontal histogram, and extracts student number through its location. And, it removes the noise of the student number region by the mode smoothing with 3$\times$3 mask. After removing noise from the student number region, each number is extracted using vertical histogram and normalized. Using the enhanced ART1 algorithm recognized the extracted student number region. In this study, we propose the enhanced ART1 algorithm different from the conventional ART1 algorithm by the dynamical establishment of the vigilance parameter. which shows a tolerance limit of unbalance between voluntary and stored patterns for clustering. The Experiment results showed that the recognition rate of the proposed ART1 algorithm was improved much more than that of the conventional ART1 algorithm. So, we develop an educational matters administration system by using the proposed recognition method of the student's identification card.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3369-3385
• /
• 2019

There are various research challenges in vehicular ad hoc networks (VANETs) that need to be focused until an extensive deployment of it becomes conceivable. Design and development of a scalable routing algorithm for VANETs is one of the critical issue due to frequent path disruptions caused by the vehicle's mobility. This study aims to provide a novel road-aware routing protocol for vehicular networks named as Two-level hierarchical Hybrid Road-Aware (THERA) routing for vehicular ad hoc networks. The proposed protocol is designed explicitly for inter-vehicle communication. In THERA, roads are distributed into non-overlapping road segments to reduce the routing overhead. Unlike other protocols, discovery process does not flood the network with packet broadcasts. Instead, THERA uses the concept of Gateway Vehicles (GV) for the discovery process. In addition, a route between source and destination is flexible to changing topology, as THERA only requires road segment ID and destination ID for the communication. Furthermore, Road-Aware routing reduces the traffic congestion, bypasses the single point of failure, and facilitates the network management. Finally yet importantly, this paper also proposes a probabilistical model to estimate a path duration for each road segment using the highway mobility model. The flexibility of the proposed protocol is evaluated by performing extensive simulations in NS3. We have used SUMO simulator to generate real time vehicular traffic on the roads of Gangnam, South Korea. Comparative analysis of the results confirm that routing overhead for maintaining the network topology is smaller than few previously proposed routing algorithms.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.228-242
• /
• 2005

The projected clustering seeks to find clusters in different subspaces within a high dimensional dataset. We propose an algorithm to discover near optimal projected clusters without user specified parameters such as the number of output clusters and the average cardinality of subspaces of projected clusters. The objective function of the algorithm computes projected energy, quality, and the number of outliers in each process of clustering. In order to minimize the projected energy and to maximize the quality in clustering, we start to find best subspace of each cluster on the density of input points by comparing standard deviations of the full dimension. The weighting factor for each dimension of the subspace is used to get id of probable error in measuring projected distances. Our extensive experiments show that our algorithm discovers projected clusters accurately and it is scalable to large volume of data sets.

• Journal of Navigation and Port Research
• /
• v.47 no.2
• /
• pp.75-84
• /
• 2023

Ships need to ensure safety during their navigation, which makes route determination highly important. It must be accompanied by a route following controller that can accurately follow the route. This study proposes a method for automatically generating the ship route based on deep reinforcement learning algorithm and following it using a route following controller. To generate a ship route, under keel clearance was applied to secure the ship's safety and navigation chart information was used to apply ship navigation related regulations. For the experiment, a target ship with a draft of 8.23 m was designated. The target route in this study was to depart from Busan port and arrive at the pilot boarding place of the Ulsan port. As a route following controller, a velocity type fuzzy P ID controller that could compensate for the limitation of a linear controller was applied. As a result of using the deep Q network, a route with a total distance of 62.22 km and 81 waypoints was generated. To simplify the route, the Douglas-Peucker algorithm was introduced to reduce the total distance to 55.67 m and the number of way points to 3. After that, an experiment was conducted to follow the path generated by the target ship. Experiment results revealed that the velocity type fuzzy P ID controller had less overshoot and fast settling time. In addition, it had the advantage of reducing the energy loss of the ship because the change in rudder angle was smooth. This study can be used as a basic study of route automatic generation. It suggests a method of combining ship route generation with the route following control.

• Journal of Broadcast Engineering
• /
• v.2 no.1
• /
• pp.36-44
• /
• 1997

We propose 3D perspective display using elevation matrix data with 2D information overlay. This algorithm is based on ID scan-line method and we used color index of the newly developed raster map, VRRG(Vector Restored Raster Graphics). The proposed method allows the fast generation of perspective view of 3D data with 2D overlay and the fast selective display of the features of 2D overlay.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.3
• /
• pp.305-312
• /
• 2012

This paper aims at improving the accuracy and computational efficiency in reconstructing building boundaries from airborne Lidar points. We proposed an adaptive convex hull algorithm, which is a modified version of local convex hull algorithm in three ways. The candidate points for boundary are first selected to improve efficiency depending on their local density. Second, a searching-space is adjusted adaptively, based on raw data structure, to extract boundary points more robustly. Third, distance between two points and their IDs are utilized in detecting the seed points of inner boundary to distinguish between inner yards and inner holes due to errors or occlusions. The practicability of the approach were evaluated on two urban areas where various buildings exist. The proposed method showed less shape-dissimilarity(8.5%) and proved to be two times more efficient than the other method.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.584-586
• /
• 2007

3D virtual modeling such as creation of a cyber city or landscape, or making a 3D GIS requires realistic textures. Automatic texture extraction using close range images is not yet efficient or easy in terms of data acquisition and processing. In this paper, common problems associated with automatic texture extraction from aerial photographs are explored. The ZI-buffer, which has depth and facet ID fields, is proposed to remove hidden pixels. The ZI-buffer algorithm reduces memory burden and identifies visible facets. The correct spatial resolution for facet gridding is tested. Error pixels in the visibility map were removed by filtering.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.12
• /
• pp.1775-1784
• /
• 2002

Fingerprint recognition technology is used in many biometrics field accordingly essential feature of fingerprint image and the study is progressing. However development is not perfect in performance of the fingerprint recognition and application of the usual life. In the paper, we study various necessity of preprocessing according to algorithm and circumstances of authentication system in automatic information machine. We prove that system circumstance and optation of fingerprints image effectively is the important factor by using optical fingerprint input device and scanning the fingerprint in ID card. And then we present correct and fast computation method for improving image and feature extraction of fingerprint. Also we study effective algorithm implementation of total system.

• Asia pacific journal of information systems
• /
• v.6 no.2
• /
• pp.5-17
• /
• 1996

There are various cases that we vote for making a decision or combining ideas (i.e. human being's opinions) in group meetings. Group Decision Support System(GDSS) provides us with a number of voting methods for decision making or aggregation of the ideas. It is generally difficult to select a voting method appropriate for given a meeting situation, without any aid of experts or computers having a knowledge on voting. In this paper we propose a supporting system for selecting an appropriate voting method. Since the selected method is recommended to the facilitator of GDSS, a part of time and effort related with the voting would be reduced. The knowledge in the system is represented as rules that are inductively generated from examples of voting. We used UNiK-INDUCE with ID3 algorithm so as to learn, which is a tool of developing expert systems.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.841-848
• /
• 2010

Conventional filters using email header and body information equally judge whether an incoming email is spam or not. However this is unrealistic in everyday life because each person has different criteria to judge what is spam or not. To resolve this problem, we consider user preference information as well as email category information derived from the email content. In this paper, we have developed a personalized anti-spam system using ontologies constructed from rules derived in a data mining process. The reason why traditional content-based filters are not applicable to the proposed experimental situation is described. In also, several experiments constructing classifiers to decide email category and comparing classification rule learners are performed. Especially, an ID3 decision tree algorithm improved the overall accuracy around 17% compared to a conventional SVM text miner on the decision of email category. Some discussions about the axioms generated from the experimental dataset are given too.