• The Journal of Information Technology
• /
• v.6 no.1
• /
• pp.71-84
• /
• 2003

In this paper, it is presented the efficient system for data recognition using the proposed binary code images. The proposed algorithm finds the position of binary image. Through the process of the block region classification, it is classified each block with the edge region using the value of gray level only. Each block region is divided horizontal and vertical edge region. If horizontal edge region blocks are classified over six blocks in any region, the proposed algorithm should search the vertical edge region in the start point of the horizontal edge region. If vertical edge region blocks were found over ten blocks in vertical region, the code image would found. Practical code region is acquired from the rate of the total edge region that is computed from the binary image that is processed with the average value. In case of the wrong rate, it is restarted the code search in the point after start point and the total process is followed. It has a short time than the before process time because it had classified block information. The block processing is faster thant the total process. The proposed system acquires the image from the digital camera and makes binary image from the acquired image. Finally, the proposed system extracts various characters from the binary image.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1026-1033
• /
• 2016

Path-finding on a grid map is a problem generally addressed in the fields of robotics, intelligent agents, and computer games. As technology advances, virtual game worlds tend to be represented more accurately and more realistically, resulting in an excessive increase in the number of grid tiles and in path-search time. In this study, we propose a path-finding algorithm that allows a prompt response to real-time queries by constructing a reduced state space and by precomputing all possible paths in an offline preprocessing stage. In the preprocessing stage, we vertically decompose free space on the grid map, construct a connectivity graph where nodes are the decomposed regions, and store paths between all pairs of nodes in matrix form. In the real-time query stage, we first find the nodes containing the query points and then retrieve the corresponding stored path. The proposed method is simulated for a set of maps that has been used as a benchmark for grid-based path finding. The simulation results show that the state space and the search time decrease significantly.

• The Magazine of the IEIE
• /
• v.28 no.4
• /
• pp.89-96
• /
• 2001

The LCD monitor market enjoyed rapid growth in 1999 but only experienced modest growth in 2000. It is now poised for rapid growth from 2001 to 2005 as prices and costs decline. Price reductions will enable LCD monitors to move beyond limited vertical markets and extend into the broader consumer markets. This article will examine the future outlook for LCD monitors and provide a growth forecast.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2525-2532
• /
• 2009

In this paper, a fast sphere decoder is proposed for the joint detection of phase-shift keying (PSK) signals in uncoded Vertical Bell Laboratories Layered Space Time (V-BLAST) systems. The proposed decoder, PSD, consists of preprocessing stage and search stage. The search stage of PSD relies on the depth-first branch-and-bound (BB) algorithm with "best-first" orders stored in lookup tables. Simulation results show that the PSD is able to provide the system with the maximum likelihood (ML) performance at low complexity.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.3
• /
• pp.98-105
• /
• 2009

It is important for firms to help customers find the products or information they need in order to increase sales and promote return visits to their websites. Hence, the presentation of product information is very important in e-commerce websites. In this research, we study how disposition styles can influence browsing patterns. The test results show that people are inclined to use feature information paths in the vertical disposition style and product information paths in the horizontal disposition style. With vertical disposition, users are more likely to follow feature information paths which may help them focus on comparisons across products.

• Atmosphere
• /
• v.25 no.3
• /
• pp.529-541
• /
• 2015

Korea Institute of Atmospheric Prediction System (KIAPS) has been developing a global numerial prediction model and data assimilation system. We has implemented LETKF (Local Ensemble Transform Kalman Filter, Hunt et al., 2007) data assimilation system to NCAR CAM-SE (National Center for Atmospheric Research Community Atmosphere Model with Spectral Element dynamical core, Dennis et al., 2012) that has cubed-sphere grid, known as the same grid system of KIAPS Integrated Model (KIM) now developing. In this study, we have assimilated Global Positioning System Radio Occultation (GPS-RO) bending angle measurements in addition to conventional data within ensemble-based data assimilation system. Before assimilating bending angle data, we performed a vertical unit conversion. The information of vertical localization for GPS-RO data is given by the unit of meter, but the vertical localization method in the LETKF system is based on pressure unit. Therefore, with a clever conversion of the vertical information, we have conducted experiments to search for the best vertical localization scale on GPS-RO data under the Observing System Simulation Experiments (OSSEs). As a result, we found the optimal setting of vertical localization for the GPS-RO bending angle data assimilation. We plan to apply the selected localization strategy to the LETKF system implemented to KIM which is expected to give better analysis of GPS-RO data assimilation due to much higher model top.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.6 no.4
• /
• pp.76-85
• /
• 1998

Recently, Genetic Algorithm(GA) is widely adopted into a search procedure for structural optimization, which is a stochastic direct search strategy that mimics the process of genetic evolution. This methods consist of three genetics operations maned selection, crossover and mutation. Contrast to traditional optimal design techniques which use design sensitivity analysis results, GA, being zero-order method, is very simple. So, they can be easily applicable to wide area of design optimization problems. Also, owing to multi-point search procedure, they have higher probability of converge to global optimum compared to traditional techniques which take one-point search method. In this study, a method of finding the optimum values of suspension parameters is proposed by using the GA. And vehicle is modelled as planar vehicle having 5 degree-of-freedom. The generalized coordinates are vertical motion of passenger seat, sprung mass and front and rear unsprung mass and rotate(pitch) motion of sprung mass. For rapid converge and precluding local optimum, share function which distribute chromosomes over design bound is introduced. Elitist survival model, remainder stochastic sampling without replacement method, multi-point crossover method are adopted. In the sight of the improvement of ride comfort, good result can be obtained in 5-D.O.F. vehicle model by using GA.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.806-811
• /
• 2005

The robot to search and rescue is used in narrow space where human cannot approach. In case of this robot, it can overcome obstacles such as wrecks or stairs etc. Also, this robot can do various locomotion for each object. In this reason, an articulated robot has advantages comparing with one module robot. However, the existing articulated robot has limits to overcome vertical passages. For expanding contacted territory of robot, a novel mechanism is demanded. In this paper, the novel mechanism of articulated mobile robot is designed for moving level ground and vertical passages. This paper proposes to change wheel alignment. The robot needs two important motions for passing vertical passages like pipe. One is a motion to press wheels at wall for not falling into gravity direction. The other is a motion that wheels contact a vertical direction of wall's tangential direction for reducing loss of force. The mechanism of the robot focused that two motions can be acted to use just one motor. Length of each link of robot is optimized that wheels contact a vertical direction of wall's tangential direction through kinematic modeling of each link. The force of pressing wall of robot is calculated through dynamic modeling. This robot composes four modules. This mechanism is confirmed by dynamic simulation using ADAMS program. The articulated mobile robot is elaborated based on the results of kinematic modeling and dynamic simulation.

• Journal of Digital Contents Society
• /
• v.9 no.2
• /
• pp.305-315
• /
• 2008

Pre-proposed AHHS(Adaptive Hierarchical Hexagon Search) is a kind of the fast hierarchical block matching algorithm based on the AHS(Adaptive Hexagon Search). It is characterized as keeping the merits of the AHS capable of fast estimating motion vectors and also adaptively reducing the local minima often occurred in the video sequences with higher spatio-temporal motion activity. The objective of this paper is to propose the method effectively extending the horizontal biased pattern and the vertical biased pattern of the AHHS to improve its predictive image quality. In the paper, based on computer simulation results for multiple video sequences with different motion characteristics, the performance of the proposed method was analysed and assessed in terms of the predictive image quality and the computational time. The simulation results indicated that the proposed method was both suitable for (quasi-) stationary and large motion searches. While the proposed method increased the computational load on the process extending the hexagon search patterns, it could improve the predictive image quality so as to cancel out the increase of the computational load.

• The Journal of Korea Robotics Society
• /
• v.18 no.1
• /
• pp.1-9
• /
• 2023

This paper presents an optimal path planning strategy for aerial searching and surveying of a user-designated area using multiple Unmanned Aerial Vehicles (UAVs). The method is designed to deal with a single unseparated polygonal area, regardless of polygonal convexity. By defining the search area into a set of grids, the algorithm enables UAVs to completely search without leaving unsearched space. The presented strategy consists of two main algorithmic steps: cellular decomposition and path planning stages. The cellular decomposition method divides the area to designate a conflict-free subsearch-space to an individual UAV, while accounting the assigned flight velocity, take-off and landing positions. Then, the path planning strategy forms paths based on every point located in end of each grid row. The first waypoint is chosen as the closest point from the vehicle-starting position, and it recursively updates the nearest endpoint set to generate the shortest path. The path planning policy produces four path candidates by alternating the starting point (left or right edge), and the travel direction (vertical or horizontal). The optimal-selection policy is enforced to maximize the search efficiency, which is time dependent; the policy imposes the total path-length and turning number criteria per candidate. The results demonstrate that the proposed cellular decomposition method improves the search-time efficiency. In addition, the candidate selection enhances the algorithmic efficacy toward further mission time-duration reduction. The method shows robustness against both convex and non-convex shaped search area.