• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.231-241
• /
• 2013

In this paper, we propose an average approximation filter which can effectively remove the noises of the images. The noises include impulse noises, gaussian noises and mixed noises. The algorithm is as follows. First, as a step of noise detection, we find whether the difference between the pixel value and the average value is greater than the threshold value or not after getting the average value that removed the minimum and maximum values in the applied mask. If the pixel value is greater than the threshold value, the pixel value is processed as noise. If it is less than or equal to the threshold value, it is processed as non-noise. Next, as the noise reduction step, we output the approximate value in mask as the pixel value and the average value except the minimum and maximum values of the pixel including the noise. As the result of applying this average approximation filter to the mixed noise images, the approximation filter can reduce the noises effectively more than 0.4[dB] as compared with applying the median filter and the average filter, respectively.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.2
• /
• pp.252-261
• /
• 2013

In this paper, a nonlinear adaptive damping controller based on radial basis function neural network (RBFNN), which can infinitely approximate to nonlinear system, is proposed for thyristor controlled series capacitor (TCSC). The proposed TCSC adaptive damping controller can not only have the characteristics of the conventional PID, but adjust the parameters of PID controller online using identified Jacobian information from RBFNN. Hence, it has strong adaptability to the variation of the system operating condition. The effectiveness of the proposed controller is tested on a two-machine five-bus power system and a four-machine two-area power system under different operating conditions in comparison with the lead-lag damping controller tuned by evolutionary algorithm (EA). Simulation results show that the proposed damping controller achieves good robust performance for damping the low frequency oscillations under different operating conditions and is superior to the lead-lag damping controller tuned by EA.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.189-194
• /
• 2004

This paper describes method to distribute much high-dimensional facial expression motion data to 2 dimensional space, and method to create facial expression animation by select expressions that want by realtime as animator navigates this space. In this paper composed expression space using about 2400 facial expression frames. The creation of facial space is ended by decision of shortest distance between any two expressions. The expression space as manifold space expresses approximately distance between two points as following. After define expression state vector that express state of each expression using distance matrix which represent distance between any markers, if two expression adjoin, regard this as approximate about shortest distance between two expressions. So, if adjacency distance is decided between adjacency expressions, connect these adjacency distances and yield shortest distance between any two expression states, use Floyd algorithm for this. To materialize expression space that is high-dimensional space, project on 2 dimensions using Sammon's Mapping. Facial animation create by realtime with animators navigating 2 dimensional space using user interface.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2843-2845
• /
• 2000

A lane detection based on a road model or feature all need correct acquirement of information on the lane in a image, It is inefficient to implement a lane detection algorithm through the full range of a image when being applied to a real road in real time because of the calculating time. This paper defines two searching range of detecting lane in a road, First is searching mode that is searching the lane without any prior information of a road, Second is recognition mode, which is able to reduce the size and change the position of a searching range by predicting the position of a lane through the acquired information in a previous frame. It is allow to extract accurately and efficiently the edge candidates points of a lane as not conducting an unnecessary searching. By means of removing the perspective effect of the edge candidate points which are acquired by using the inverse perspective transformation, we transform the edge candidate information in the Image Coordinate System(ICS) into the plane-view image in the World Coordinate System(WCS). We define linear approximation filter and remove the fault edge candidate points by using it This paper aims to approximate more correctly the lane of an actual road by applying the least-mean square method with the fault-removed edge information for curve fitting.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.6
• /
• pp.71-80
• /
• 2014

Employing PTAS to building minimum spanning tree for a large number of equal distribution input terminal nodes can be a effective way in execution time. But applying PTAS to building minimum spanning tree for tremendous unequal distribution node may lead to performance degradation. In this paper, a partial PTAS reflecting the scheme into specific node dense area is presented. In the environment where 90% of 50,000 input terminal nodes stand close together in specific area, approximate minimum spanning tree by our proposed scheme can show about 88.49% execution time less and 0.86%tree length less than by existing PTAS, and about 87.57%execution time less and 1.18% tree length more than by Prim's naive scheme. Therefore our scheme can go well to many useful applications where a multitude of nodes gathered around specific area should be connected efficiently as soon as possible.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2002.03a
• /
• pp.237-244
• /
• 2002

Televiewer is a logging tool capable of scanning the borehole wall. The tool uses a rotating acoustic beam generator that acts as both a transmitter and receiver. The beams are sent toward the wall. The amplitude of a returning signal from the wall has nearly a linear relationship with the reflection coefficient R of the borehole wall, when the wall is smooth. As R depends only on rock impedance for fixed water impedance, the amplitude is directly associated with mass density and seismic velocity of rock. Meanwhile, the amplitude can be further reduced by wall roughness that may be caused by drilling procedures, differences in rock hardness, because the rough surface can easily scatter the acoustic energy and sometimes the hole becomes elongated in all directions according to the degree of weathering. In this sense, the amplitude is related to the hardness of rocks. For convenience of analysis, the measured amplitude image(2-D data(azimuth ${\times}$ depth)) is converted, with an appropriate algorithm, to the 1-D data(depth), where the amplitude image values along a predetermined fracture signature(sinusoid) are summed up and averaged. The resulting values are subsequently scaled simply by a scalar factor that is possibly consistent with a known strength. This scaled Televiewer reflectivity is named, as a matter of convenience,“Televiewer rock strength”. This paper shows, based on abundant representative case studies from about 8 years of Televiewer surveys, that Televiewer rock strength might be regarded, on a continuous basis with depth, as a quitely robust indicator of rock classification and in most cases as an approximate uniaxial strength that is comparable to the rebound value from Schmidt hammer test.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.343-355
• /
• 2003

Fair bandwidth allocations at routers protect adaptive flows from non-adaptive ones and may simplify end-to end congestion control. However, traditional fair bandwidth allocation mechanisms, like Weighted Fair Queueing and Flow Random Early Drop, maintain state, manage buffera and perform packet scheduling on a per-flow basis. These mechanisms are more complex and less scalable than simple FIFO queueing when they are used in the interi or of a high-speed network. Recently, to overcome the implementation complexity problem and address the scalability and robustness, several fair bandwidth allocation mechanisms without per-flow state in the interior routers are proposed. Core-Stateless Fair Queueing and Rainbow Fair Queuing are approximates fair queueing in the core-stateless networks. In this paper, we proposed simple Layered Fair Queueing (SLFQ), another core-stateless mechanism to approximate fair bandwidth allocation without per-flow state. SLFQ use simple layered scheme for packet labeling and has simpler packet dropping algorithm than other core-stateless fair bandwidth allocation mechanisms. We presente simulations and evaluated the performance of SLFQ in comparison to other schemes. We also discussed other are as to which SLFQ is applicable.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.12
• /
• pp.3710-3717
• /
• 1999

For the development of unmanned autonomous vehicle, it is essential to detect obstacles, especially vehicles, in the forward direction of navigation. In order to reliably exclude regions that do not contain obstacles and save a considerable amount of computational effort, it is often necessary to confine computation only to ROI(region of interest)s. A ROI is usually chosen as the interior region of the lane. We propose a computationally simple and efficient method for the detection of lanes based on Hough transform and quadratic curve fitting. The proposed method first employs Hough transform to get approximate locations of lanes, and then applies quadratic curve fitting to the locations computed by Hough transform. We have experimented the proposed method on real outdoor road scene. Experimental results show that our method gives accurate detection of straight and curve lanes, and is computationally very efficient.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.10a
• /
• pp.869-872
• /
• 2005

This research studied robust design of column part for LCD transfer system. $1^{st}$ DOE(Design of Experiment)was conducted to find out main effect factors. 36 experiments were performed and their results were shows that the geometric parameters(Low-length, Side-length, Upper-thickness, Middle-thickness)are more important than other factors. The main effect plots shows that the maximum deflection of column is minimized with increasing Low-length, Side-length, under-thickness and Middle-thickness. $2^{nd}$ DOE was conducted to obtain RMS(Response Surface Method)equation 25 experiments were conducted. The CCD(Central Composite Design)technique with four factors were used. The coefficient of determination $(R^2)$ for the calculated RSM equation was 0.986. Optimum design was conducted using the RSM equation Multi-island genetic algorithm was used to optimum design. Optimum value for Low-length. Side-length, Upper-thickness and Middle-thickness were 299.8mm, 180.3mm, 21.7mm, 21.9mm respectively. An approximate value of 5.054mm in deflection was expected to be a maximum under the optimum conditions. Six sigma robust design was conducted to find out guideline for control range of design parameter. To acquire six sigma level reliability, the standard deviation of design parameter should be controlled within 2% of average design value.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.98-108
• /
• 2015

This paper introduces the existence of purchase dependence that was identified during the analysis of inventory operations practice at a sales agency of dealing with spare parts for ship engines and generators. Purchase dependence is an important factor in designing an inventory replenishment policy. However, it has remained mostly unaddressed. Purchase dependence is different from demand dependence. Purchase dependence deals with the purchase behavior of customers, whereas demand dependence deals with the relationship between item-demands. In order to deal with purchase dependence in inventory operations practice, this paper proposes (Q, r) models with the consideration of purchase dependence. Through a computer simulation experiment, this paper compares performance of the proposed (Q, r) models to that of a (Q, r) model ignoring purchase dependence. The simulation experiment is conducted for two cases : a case of using a lost sale cost and a case of using a service level. For a case of using a lost sale cost, this paper calculates an order quantity, Q and a reorder point, r using the iterative procedure. However, for a case of using a service level, it is not an easy task to find Q and r. The complexity stems from the interactions among inventory replenishment policies for items. Thus, this paper considers the genetic algorithm (GA) as an optimization method. The simulation results demonstrates that the proposed (Q, r) models incur less inventory operations cost (satisfies better service levels) than a (Q, r) model ignoring purchase dependence. As a result, the simulation results supports that it is important to consider purchase dependence in the inventory operations practice.