• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.10
• /
• pp.933-939
• /
• 2012

In general, the three-dimensional(3D) coordinates of the manufactured ship blocks are measured using the laser measuring equipment by ship engineers. But, many deflections between the measured coordinates in manufactured step and the designed coordinates in the design step are occurred because of the measuring process of ship blocks manually. Thus, the ship engineer should conform the consistency between the measured coordinates and the designed coordinates step by step, and it largely causes the loss of manpower and time. In this paper, the automated pattern matching algorithm of 3D coordinates for quality control in ship blocks is suggested in order to solve this problem, and the performance of the algorithm is analyzed using the 3D coordinates simulation software developed by our research laboratory. The coordinates matching rate of the measured coordinates in the single/multi ship block(s) is about 90.2% under the tolerated distance error range is 20~25cm.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.489-498
• /
• 2005

For better performance over a noisy channel, mobile wireless networks transmit packets with forward error correction (FEC) code to recover corrupt bits without retransmission. The static determination of the FEC code size, however, degrades their performance since the evaluation of the underlying channel state is hardly accurate and even widely varied. Our measurements over a wireless sensor network, for example, show that the average bit error rate (BER) per second or per minute continuously changes from 0 up to $10^{-3}$. Under this environment, wireless networks waste their bandwidth since they can't deterministically select the appropriate size of FEC code matching to the fluctuating channel BER. This paper proposes an adaptive FEC technique called adaptive FEC code control (AFECCC), which dynamically tunes the amount of FEC code per packet based on the arrival of acknowl­edgement packets without any specific information such as signal to noise ratio (SNR) or BER from receivers. Our simulation experiments indicate that AFECCC performs better than any static FEC algorithm and some conventional dynamic hybrid FEC/ARQ algorithms when wireless channels are modeled with two-state Markov chain, chaotic map, and traces collected from real sensor networks. Finally, AFECCC implemented in sensor motes achieves better performance than any static FEC algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.2021-2030
• /
• 2012

Premature ventricular contraction(PVC) is the most common disease among arrhythmia and it may cause serious situations such as ventricular fibrillation and ventricular tachycardia. Particularly, in the healthcare system that must continuously monitor patient's situation, it is necessary to process ECG (Electrocardiography) signal in realtime. In other words, the design of algorithm that exactly detects R wave using minimal computation and classifies PVC by analyzing the persons's physical condition and/or environment is needed. Thus, the patient adaptive pattern matching algorithm for the classification of PVC is presented in this paper. For this purpose, we detected R wave through the preprocessing method, adaptive threshold and window. Also, we applied pattern matching method to classify each patient's normal cardiac behavior through the Hash function. The performance of R wave detection and abnormal beat classification is evaluated by using MIT-BIH arrhythmia database. The achieved scores indicate the average of 99.33% in R wave detection and the rate of 0.32% in abnormal beat classification error.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2003.07b
• /
• pp.1188-1191
• /
• 2003

In this paper, we focus our attention on the improvement of locking time and jitter parameter and propose the new structure of PLL which combined with the FVC, FOVI Matcher(FVC-Output and VCO-input Matching Circuit), Control Circuit and the conventional charge pump PLL. Using fast operation characteristics of the FVC, the circuit matching FVC-Output and VCO-input (FOVI Matcher) made to synchronize very fast. Fast locking time is usually required for application where the PLL has to settle rapidly if they switch from an idle mode to a normal mode and to track high-frequency data bit rate in data recovery systems. After a fast acqusition is achieved by the using the FVC, the conventional PLL operates for removing the phase error between the reference signal and the feedback signal. Therefore this structure can improve the trade-off between acquisition behavior and locked behavior.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.12
• /
• pp.2619-2625
• /
• 2011

The GPS technique widely used recently in car navigation system has two problems that are unavailability in urban canyons and inherent positional error rate. The one has been studied and solved in many literatures. However, the other still leads to incorrect locational information in some area, especially parallel roads. This paper proposes and implements a system to recognize lane of moving vehicle based on images obtained from in-vehicle networks or other devices. The proposed system utilizes a real-time image matching algorithm which determines the direction of moving vehicle in parallel section of road. It also employs a method for accuracy improvement. The results obtained from experimental test on real-time navigation show that the proposed systems works well and the accuracy increases.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.10
• /
• pp.2121-2128
• /
• 2012

This paper proposed the real time face area detection using Wavelet transform and the strong detection algorithm that satisfies the efficiency of computation and detection performance at the same time was proposed. The detected face image recognizes the face by configuring the low-dimensional face symbol through the principal component analysis. The proposed method is well suited for real-time system construction because it doesn't require a lot of computation compared to the existing geometric feature-based method or appearance-based method and it can maintain high recognition rate using the minimum amount of information. In addition, in order to reduce the wrong recognition or recognition error occurred during face recognition, the input symbol of Hidden Markov Model is used by configuring the feature values projected to the unique space as a certain symbol through clustering algorithm. By doing so, any input face will be recognized as a face model that has the highest probability. As a result of experiment, when comparing the existing method Euclidean and Mahananobis, the proposed method showed superior recognition performance in incorrect matching or matching error.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.129-137
• /
• 2001

Matching pursuit algorithm was successfully demonstrated useful in low bit-rate video coding, However, one of the practical concerns related to applying the matching pursuit algorithm to application is its massive computation required for finding bases whose weighted sum best approximates the given input image. The main contribution of this paper is that we provide a new method that can drastically reduce the computational load without any degradation of image quality. Its main idea is based on reducing the number of inner product calculation required for finding best bases because the complexity of matching pursuit algorithm is due to the exhaustive local inner product calculation. As the first step, we compute a matrix which is the 1-D inner product of the given motion-compensated error input image with the 1-D vertical Gabor functions using the separable property of Gabor bases. In the second step, we calculate length of each vector in the matrix that corresponds to 1-D horizontal Gabor function, and compare the length with the current maximum absolute inner product value so far. According to the result of this comparison, one can decide whether or not to calculate the inner product. Since most of them do not need to calculate the inner product value, one can significantly reduce the computational load. Experimental results show that proposed method reduces about 70% of inner product calculation compared to the Neff's fast algorithm without any degradation of image quality.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.89-98
• /
• 2016

In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.

• The KIPS Transactions:PartB
• /
• v.9B no.5
• /
• pp.571-578
• /
• 2002

In this paper, we propose a video sequence coding scheme called AMV (Auxiliary Motion Vector) to minimize error propagation caused by transmission errors over the Internet. Unlike the conventional coding schemes the AMY coder, for a macroblock in a frame, selects two best matching blocks among several preceding frames. The best matching block, called a primary block, is used for motion compensation of the destination macroblock. The other block, called an auxiliary block, replaces the primary block in case of its loss at the decoder. When a primary block is corrupted or lost during transmission, the decoder can efficiently and simply suppress error propagation to the subsequent frames by replacing the block with an auxiliary block. This scheme has an advantage of reducing both the number and the impact of error propagations. We implemented the proposed coder by modifying H.263 standard coding and evaluated the performance of our proposed scheme in the simulation. The simulation results show that AMV coder is more efficient than the H.263 baseline coder at the high packet loss rate.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.48 no.2
• /
• pp.165-173
• /
• 2012

Nationally, flatfish vaccination has been performed manually, and is a laborious and time-consuming procedure with low accuracy. The handling requirement also makes it prone to contamination. With a view to eliminating these drawbacks, we designed an automatic vaccine system in which the injection is delivered by a Cartesian coordinate robot guided by a vision system. The automatic vaccine injection system is driven by an injection site location algorithm that uses a template-matching technique. The proposed algorithm was designed to derive the time and possible angles of injection by comparing a search area with a template. The algorithm is able to vaccinate various sizes of flatfish, even when they are loaded at different angles. We validated the performance of the proposed algorithm by analyzing the injection error under randomly generated loading angles. The proposed algorithm allowed an injection rate of 2000 per hour on average. Vaccination of flatfish with a body length of up to 500mm was possible, even when the orientation of the fish was random. The injection errors in various sizes of flatfish were very small, ranging from 0 to 0.6mm.