• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.7
• /
• pp.647-654
• /
• 2010

In this study, an efficient ornithopter aerodynamic model, which is applicable to ornithopter wing design considering fluid-structure interaction or ornithopter flight dynamics and control simulation, was proposed and experimentally validated through the wind tunnel experiments. Due to the ornithopter aerodynamics governed by unsteady low Reynolds number flow, an experimental device was specially designed and developed. A part of the experimental device, 2-axis loadcell, was situated in the non-inertial frame; the dynamic calibration method was established to compensate the inertial load for pure aerodynamic load measurements. The characteristics of proposed aerodynamic model were compared with the experimental data in terms of mean and root-mean-square values of lift and drag coefficients with respect to the flow speed, flapping frequency, and fixed angle of attack.

• Journal of Korean Neurosurgical Society
• /
• v.29 no.12
• /
• pp.1577-1583
• /
• 2000

Objectives : Among the various types of minimally invasive spine surgeries, thoracoscopic surgery is becoming more widely accepted and increasingly utilized. This report delineates our clinical experience using thoracoscopy to resect herniated thoracic discs in 16 patients who suffered from myelopathy or intolerable radiculopathy. Patients and Methods : Between Mar. 1997 and Sep. 1999, 16 consecutive patients underwent thoracoscopic discectomy for treatment of herniated thoracic discs. There were 12 men and 4 women(mean age 43.5 years ; range 18-61 years). Eleven patients presented with myelopathic signs and symptoms from spinal cord compression and 5 patients had incapacitating thoracic radicular pain without myelopathy. The surgical level was varied between T3 and T12. The pathology of specimen were 11 hard discs and 5 soft discs herniations. Thoracoscopic techniques were performed with long narrow spine instruments and high speed drill through 3 or 4 ports under one lung ventilated general anesthesia. During the operation three patients were converted to open thoracotomy due to intolerable one lung ventilation, excessive bleeding and inadequate operation field. The mean operation time was 264min.(range : 100-420min.), and postoperative mean admission period was 11 days. Results : Clinical and neurological outcomes were good in all patients(mean follow-up period 20 months). Among the eleven myelopathic patients, 8 improved neurologically, and 3 stabilized. Among the five radiculopathic patients, 4 recovered completely and no patient had worsened. Postoperative complications were pleural effusion in one case, intercostal neuralgia in one, delayed hemopneumothorax in one, prolonged air leakage in one and pneumonia in one case. Conclusions : Thoracoscopic discectomy needs a steep learning curve to be familiar to anatomical space and handling of endoscopic instruments. However, it is technically feasible and can be effectively performed with acceptable results.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.5
• /
• pp.2067-2078
• /
• 2017

In this paper, a new face tracking algorithm is proposed. The CamShift (Continuously adaptive mean SHIFT) algorithm shows unstable tracking when there exist objects with similar color to that of face in the background. This drawback of the CamShift is resolved by the proposed algorithm using Kinect's pixel-by-pixel depth information and the skin detection method to extract candidate skin regions in HSV color space. Additionally, even when the target face is disappeared, or occluded, the proposed algorithm makes it robust to this occlusion by the feature point matching. Through experimental results, it is shown that the proposed algorithm is superior in tracking performance to that of existing TLD (Tracking-Learning-Detection) algorithm, and offers faster processing speed. Also, it overcomes all the existing shortfalls of CamShift with almost comparable processing time.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.579-583
• /
• 2001

In the area of data clustering in high dimensional space, one of the difficulties is the time-consuming process for computing vector similarities. It becomes worse in the case of the agglomerative algorithm with the group-average link and mean centroid method, because the cluster similarity must be recomputed whenever the cluster center moves after the merging step. As a solution of this problem, we present an incremental method of similarity computation, which substitutes the scalar calculation for the time-consuming calculation of vector similarity with several measures such as the squared distance, inner product, cosine, and minimum variance. Experimental results show that it makes clustering speed significantly fast for very high dimensional data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9C
• /
• pp.743-747
• /
• 2010

This paper presents an iterative adaptive hybrid image restoration algorithm for fast convergence. The local variance, mean, and maximum value are used to constrain the solution space. These parameters are computed at each iteration step using partially restored image at each iteration, and they are used to impose the degree of local smoothness on the solution. The resulting iterative algorithm exhibits increased convergence speed and better performance than typical regularized constrained least squares (RCLS) approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.232-238
• /
• 2003

In this paper, we propose a spatially adaptive image restoration algorithm using local statistics. The local mean, variance, and maximum values are utilized to constrain the solution space, and these parameters are computed at each iteration step using partially restored image. A parameter defined by the user determines the degree of local smoothness imposed on the solution. The resulting iterative algorithm exhibits increased convergence speed when compared to the non-adaptive algorithm. In addition, a smooth solution with a controlled degree of smoothness is obtained. Experimental results demonstrate the capability of the proposed algorithm.

• Journal of the Semiconductor & Display Technology
• /
• v.10 no.3
• /
• pp.53-59
• /
• 2011

This paper proposes a new method of traffic signal detection and recognition in an RGB color model. The proposed method firstly processes RGB-filtering in order to detect traffic signal candidates. Secondly, it performs adaptive threshold processing and then analyzes connected components of the binary image. The connected component of a traffic signal has to be satisfied with both a bounding box rate and an area rate that are defined in this paper. The traffic signal recognition system is implemented using C language in an embedded Linux system for a high-speed real-time image processing. Experiment results show that the proposed algorithms are quite successful.

• Journal of Biosystems Engineering
• /
• v.33 no.2
• /
• pp.83-93
• /
• 2008

In order to save labor and cost, direct seeding has been considered as an important alternative to the machine transplanting in rice cultivation. Current direct seeding machines for rice in Korea drill irregularly under various operating conditions. This study was conducted to develope a precision seeder which enables the accurate, even-spaced in row placement of rice seeds at uniform depths of 3-4 cm on dry paddy. Design, construction and performance evaluation of the precision seeder were carried out. The tractor rear-mounted type 8-rows precision seeder which performs seeding in addition to fertilizing, ditching, and rotary tilling works on dry paddy was developed. Main components of the seeder were ditcher and leveller, rotary tiller, powered roller type furrow opener, seeding device, powered roller type furrow covering and firming device, hydraulic unit, seeding speed control system, power transmission system, hitch and frame. Ditching, furrow opening, and seed covering and firming performances were good and seeding depths of 2-4 cm could be maintained. Planting accuracies and planting precisions were within 13.6%, and 31.2%, respectively, for planting space of 15 cm, and seeding velocity of 0.5 m/s. These mean variations of average planting space were within 2.1 cm, and 90% of seeds in a hill were seeded within 4.7 cm of hill length, respectively. Error ratios between setting planting space and measured average planting space were shown within 6.7%. Therefore the seeder showed good planting performance up to seeding velocity of 0.5 m/s in field tests. And field capacity of the seeder was about 0.28 ha/hour.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1042-1050
• /
• 2014

The performance of underwater acoustic(UWA) communication system is sensitive to the Inter-Symbol Interference(ISI) due to delay spread develop of multipath signal propagation. And due to limited frequency using acoustic wave, UWA is a low transmission rate. Thus, it is necessary technique of Space-time code, equalizer and channel code to improve transmission speed and eliminate ISI. In this paper, UWA communication system were analyzed by simulation using these techniques. In the result of simulation, the proposed Turbo Equalization method based on layered Space Time Codes has improved performance compared to conventional UWA communication.

• Journal of the Korean earth science society
• /
• v.40 no.4
• /
• pp.353-381
• /
• 2019

The general world model for homogeneous and isotropic universe has been proposed. For this purpose, we introduce a global and fiducial system of reference (world reference frame) constructed on a (4+1)-dimensional space-time, and assume that the universe is spatially a 3-dimensional hypersurface embedded in the 4-dimensional space. The simultaneity for the entire universe has been specified by the global time coordinate. We define the line element as the separation between two neighboring events on the expanding universe that are distinct in space and time, as viewed in the world reference frame. The information that determines the kinematics of the geometry of the universe such as size and expansion rate has been included in the new metric. The Einstein's field equations with the new metric imply that closed, flat, and open universes are filled with positive, zero, and negative energy, respectively. The curvature of the universe is determined by the sign of mean energy density. We have demonstrated that the flat universe is empty and stationary, equivalent to the Minkowski space-time, and that the universe with positive energy density is always spatially closed and finite. In the closed universe, the proper time of a comoving observer does not elapse uniformly as judged in the world reference frame, in which both cosmic expansion and time-varying light speeds cannot exceed the limiting speed of the special relativity. We have also reconstructed cosmic evolution histories of the closed world models that are consistent with recent astronomical observations, and derived useful formulas such as energy-momentum relation of particles, redshift, total energy in the universe, cosmic distance and time scales, and so forth. The notable feature of the spatially closed universe is that the universe started from a non-singular point in the sense that physical quantities have finite values at the initial time as judged in the world reference frame. It has also been shown that the inflation with positive acceleration at the earliest epoch is improbable.