• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1994년도 추계학술대회 논문집
• /
• pp.481-486
• /
• 1994

An image processing and pattern recognition program was developed in order to recognize the nummerinc displays on gas flow meters. the testing process of the accuracy of gas flow meters are to be automated, using the developed software. There are already many known pattern recognition algorithms for recognition of the letters. To upgrade the recognization accuracy, four different algorithms are applied in sequentially in the software. An calculation method to assign the weighting factors for the result of each algorithm was developed. It showed 98% accuracy by the pattern recognition of displaying numbers of gas mwters of 33 differnt types. This pattern recognition system is to be integrated in a industry.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권9호
• /
• pp.4527-4548
• /
• 2017

This paper proposes a method to generate panoramic images by combining conventional feature extraction algorithms (e.g., SIFT, SURF, MPEG-7 CDVS) with sensed data from inertia sensors to enhance the stitching results. The challenge of image stitching increases when the images are taken from two different mobile phones with no posture calibration. Using inertia sensor data obtained by the mobile phone, images with different yaw, pitch, and roll angles are preprocessed and adjusted before performing stitching process. Performance of stitching (e.g., feature extraction time, inlier point numbers, stitching accuracy) between conventional feature extraction algorithms is reported along with the stitching performance with/without using the inertia sensor data. In addition, the stitching accuracy of video data was improved using the same sensed data, with discrete calculation of homograph matrix. The experimental results for stitching accuracies and speed using sensed data are presented in this paper.

• 한국원자력학회:학술대회논문집
• /
• 한국원자력학회 1997년도 추계학술발표회논문집(1)
• /
• pp.97-102
• /
• 1997

A new method based on the alternating conditional expectation (ACE) algorithm is developed to calculate axial shape index (ASI) for the 3-level excore detector. The ACE algorithm, a type of non-parametric regression algorithms, yields an optimal relationship between a dependent variable and multiple independent variables. In this study, the simple correlation between ASI and excore detector signals is developed using the Younggwang nuclear power plant unit 3 (YGN-3) data without any preprocessing on the relationships between independent variables and dependent variable. The numerical results show that simple correlations exist between the three excore signals and ASI of the core. The accuracy of the new method is much better than those of the current CPC and COLSS algorithms.

• 반도체디스플레이기술학회지
• /
• 제15권1호
• /
• pp.47-51
• /
• 2016

Human visual system infers 3D vision through stereo disparity in the stereoscopic images, and stereo visioning are recently being used in consumer electronics which has resulted in much research in the application field. Basically, stereo vision system consists of four processes, which are cost computation, cost aggregation, disparity calculation, and disparity refinement. In this paper, we present and evaluate the existing various methods, focusing on cost aggregation for stereo vision system to comparatively analyze the performance of their algorithms for a given set of resources. Experiments show that Normalized Cross Correlation and Zero-Mean Normalized Cross Correlation provide higher accuracy, however they are computationally heavy for embedded system in the real time systems. Sum of Absolute Difference and Sum of Squared Difference are more suitable selection for embedded system, but they should be required on improvement to apply to the real world system.

• 한국수자원학회논문집
• /
• 제36권2호
• /
• pp.251-261
• /
• 2003

여러 가지 토양수분의 예측인자에 대한 해상도 문제를 고찰하였다. 다양한 인자에 대한 민감도는 통계적인 분석을 기반으로 논의되었다. 수치지형모형에서 세 가지 흐름 결정 알고리즘의 해상도에 대한 통계적인 분석이 수행되었다. 단방향 흐름알고리즘으로 계산한 상부사면 기여면적은 다른 두 알고리즘(다방향 알고리즘, DEMON)보다 더욱 민감한 것으로 나타났다. 습윤지수의 경우는 해상도나 계산과정의 변화에 상대적으로 민감도가 미소한 것으로 나타났다.

• 대한전기학회논문지
• /
• 제34권3호
• /
• pp.107-114
• /
• 1985

This paper presents the iterative algorithm for obtaining the ME PSE(Maximum Entropy Power Spectral Estimation) of 2-dimensional signals. This problem involves a correction matching power spectral estimate that can be represented as the reciprocal of the spectral of 2-dimensional signals. This requires two matrix inversion every iterations. Thus, we compensate the matrix to be constantly positive definite with relaxational parameters. Using Row/Column decomposition Discrete Fourier Transform, we can decrease a calculation quantity. Using Lincoln data and white noise, this paper examines ME PSE algorithms. Finally, the results output at the graphic display device. The 2-dimensional data have the 3-dimensional axis components, and, this paper develops 3-dimensional graphic output algorithms using 2-dimensional DGL(Device Independent Graphic Library) which is prepared for HP-1000 F-series computer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권9호
• /
• pp.4349-4371
• /
• 2019

Moldable parallel tasks are widely used in different areas, such as weather forecast, biocomputing, mechanical calculation, and so on. Considering the deadline and the speedup, scheduling moldable parallel tasks becomes a difficulty. Past work majorly focuses on the LA (List Algorithms) or OMA (Optimizing the Middle Algorithms). Different from prior work, our work normalizes execution time and makes all tasks have the same scope in normalized execution time: [0,1], and then according to the normalized execution time, a method is used to search for the reference execution time without considering the deadline of tasks. According to the reference execution time, we get an initial scheduling result based on AFCFS (Adaptive First Comes First Served) policy. Finally, a heuristic approach is used to improve the performance of the initial scheduling result. We call our method HSRET (a Heuristic Scheduling method based on Reference Execution Time). Comparisons to other methods show that HSRET has good performance in AWT (Average Waiting Time), AET (Average Execution Time), and PUT (Percentages of Unfinished Tasks).

• 한국CDE학회논문집
• /
• 제12권1호
• /
• pp.1-7
• /
• 2007

In this paper, we present a machining time estimation algorithm for 5-axis high-speed machining. Estimation of machining time plays an important role in process planning and production scheduling of a shop. In contrast to the rapid evolution of machine tools and controllers, machining time calculation is still based on simple algorithms of tool path length divided by input feedrates of NC data, with some additional factors from experience. We propose an algorithm based on 5-axis machine behavior in order to predict machining time more exactly. For this purpose, we first investigated the operational characteristics of 5-axis machines. Then, we defined some dominant factors, including feed angle that is an independent variable for machining speed. With these factors, we have developed a machining time calculation algorithm that has a good accuracy not only in 3-axis machining, but also in 5-axis high-speed machining.

• Journal of Electrical Engineering and Technology
• /
• 제10권2호
• /
• pp.676-687
• /
• 2015

Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.589-598
• /
• 2006

The rectilinear Steiner tree problem is to find a minimum-length rectilinear interconnection of a set of terminals in the plane. It is well known that the solution to this problem will be the minimal spanning tree (MST) on some set Steiner points. A hybrid evolutionary algorithm is introduced based upon the Prim algorithm. The Prim algorithm for the fitness evaluation requires heavy calculation time. The fitness value of parents is inherited to their child and the fitness value of child is estimated by the inherited structure of tree. We introduce four alternative evolutionary algorithms, Experiment result shows that the calculation time is reduced to 25% without loosing the solution quality by using the fitness estimation.