• Journal of Biomedical Engineering Research
• /
• v.19 no.1
• /
• pp.25-32
• /
• 1998

This paper is based on the design and analysis computing model of oxygen saturation with the pulse oximeter using the integral ratio of pulsating components. In our proposed algorithm. we modeled the transmitted optical signal in fingertip or earlobe to DC component $A_{dc}$ pulsating component $A_a\;Sinwt$, noise component $A_{noise}$ and etc.. To separate the pulsating components and DC components efficiently, we defined the signal average to DC components. Also we presented the way to eliminate the noise using integral ratio. To acquire a linearity of correlation graph for pulsating components ratios and non invasive oxygen saturation. we intensively observed on the oxygen saturations in the range of 75-100% in consideration of the error range of simulator. Also, for real time processing we experimented on changing the period of area calculating cycle from 1 to 6. The functional evaluation of the algorithm is compared with the method using the amplitude ratio of pulsating components frequently seen with pulse oximeter. The result was that our algorithm with 4 cycles of area calculating cycle which considered to be best fit by 1% to the existing method. Moreover r , the decision coefficient showing the correlation of regression graph with real data, proved better result of 0.985 than 0.970.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.2
• /
• pp.8-18
• /
• 2020

An Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was developed to enhance the performance of a Harmony Search (HS). EBHS-CGS added two methods to improve the performance of HS. The first method is an improvement of bandwidth (bw) that enhances the local search. This method replaces the existing bw with an exponential bw and reduces the bw value as the iteration proceeds. This form of bw allows for an accurate local search, which enables the algorithm to obtain more accurate values. The second method is to reduce the search range for an efficient global search. This method reduces the search space by considering the best decision variable in Harmony Memory (HM). This process is carried out separately from the global search of the HS by the new parameter, Centralized Global Search Rate (CGSR). The reduced search space enables an effective global search, which improves the performance of the algorithm. The proposed algorithm was applied to a representative optimization problem (math and engineering), and the results of the application were compared with the HS and better Improved Harmony Search (IHS).

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.7
• /
• pp.258-266
• /
• 2013

We propose adaptive detection algorithm to reduce a false alarm by considering the characteristics of the random noise on the detection system based on a seismic sensor. The proposed algorithm consists of the first step detection using kernel function and the second step detection using detection classes. Kernel function of the first step detection is obtained from the threshold of the Neyman-Pearon decision criterion using the probability density functions varied along the noise from the measured signal. The second step detector consists of 4 step detection class by calculating the occupancy time of the footstep using the first detected samples. In order to verify performance of the proposed algorithm, the detection of the footsteps using measured signal of targets (walking and running) are performed experimentally. The detection results are compared with a fixed threshold detector. The first step detection result has the high detection performance of 95% up to 10m area. Also, the false alarm probability is decreased from 40% to 20% when it is compared with the fixed threshold detector. By applying the detection class(second step detector), it is greatly reduced to less than 4%.

• Journal of Broadcast Engineering
• /
• v.4 no.2
• /
• pp.103-118
• /
• 1999

This paper analyzes the performance of symbol timing recovery and equalizer in 8VSB digital terrestrial TV receiver under various multipath signals and proposes equalization techniques which improve indoor reception performance. Data segment sync is used for symbol timing recovery and timing offset is measured for echoes of various delays and amplitudes by using symbol timing detection filter whose pattern is +1. +1. -1. and -1. Measured timing offsets were below 10% for long echoes with more than 5 symbol delay and above 30% for short echoes with around 1 symbol delay. Indoor reception is always more challenging than outdoor reception due to lower signal strength. large and short multipaths. and moving interfering objects. So it is considered to use FSE (Fractionally Spaced Equalizer) which is very robust to timing offset and blind equalizer which can update equalizer tap coefficients even by information data. We compare the performance of conventional DFE (Decision Feedback Equalizer) and FSE-DFE using LMS algorithm and Stop and Go algorithm for the indoor reception. Experiments reveals FSE has excellent performance for large timing offset and Stop and Go algorithm shows good performance for Doppler shift. so we propose to use FSE-DFE structure with Stop and Go algorithm for the reliable indoor reception.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2B
• /
• pp.36-43
• /
• 2005

This paper suggests a method to effectively apply an application model of fuzzy-neural network to the optimal load distribution algorithm, considering the complication and non-linearity of the web server environment. We use the clustering web server in the linux system and it consists of a load balancer that distributes the network loads and some of real servers that processes the load and responses to the client. The previous works considered only with the scrappy decision information such as the connections. That is, since the distribution algorithm depends on the input of the whole network throughput, it was proved inefficient in terms of performance improvement of the web server. With the proposed algorithm, it monitors the whole states of both network input and output. Then, it infers CPU and memory states of each real server and effectively distributes the requests of the clients. In this paper, the proposed model is compared with the previous method through simulations and we analysis the results to develop the optimal and intelligent load balancing model.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.42 no.2
• /
• pp.249-256
• /
• 2022

Various studies are being actively conducted to show that the real-time visualization technology that combines BIM (Building Information Modeling) and AR (Augmented Reality) helps to increase construction management decision-making and processing efficiency. However, when large-capacity BIM data is projected into AR, there are various limitations such as data transmission and connection problems and the image cut-off issue. To improve the high efficiency of visualizing, a mesh optimization algorithm based on the k-nearest neighbors (KNN) classification framework to reconstruct BIM data is proposed in place of existing mesh optimization methods that are complicated and cannot adequately handle meshes with numerous boundaries of the 3D models. In the proposed algorithm, our target BIM model is optimized with the Unity C# code based on triangle centroid concepts and classified using the KNN. As a result, the algorithm can check the number of mesh vertices and triangles before and after optimization of the entire model and each structure. In addition, it is able to optimize the mesh vertices of the original model by approximately 56 % and the triangles by about 42 %. Moreover, compared to the original model, the optimized model shows no visual differences in the model elements and information, meaning that high-performance visualization can be expected when using AR devices.

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.147-157
• /
• 2013

With the advent of the digital environment that can be accessed anytime, anywhere with the introduction of high-speed network, the free distribution and use of digital content were made possible. Ironically this environment is raising a variety of copyright infringement, and product images used in the online shopping mall are pirated frequently. There are many controversial issues whether shopping mall images are creative works or not. According to Supreme Court's decision in 2001, to ad pictures taken with ham products is simply a clone of the appearance of objects to deliver nothing but the decision was not only creative expression. But for the photographer's losses recognized in the advertising photo shoot takes the typical cost was estimated damages. According to Seoul District Court precedents in 2003, if there are the photographer's personality and creativity in the selection of the subject, the composition of the set, the direction and amount of light control, set the angle of the camera, shutter speed, shutter chance, other shooting methods for capturing, developing and printing process, the works should be protected by copyright law by the Court's sentence. In order to receive copyright protection of the shopping mall images by the law, it is simply not to convey the status of the product, the photographer's personality and creativity can be recognized that it requires effort. Accordingly, the cost of making the mall image increases, and the necessity for copyright protection becomes higher. The product images of the online shopping mall have a very unique configuration unlike the general pictures such as portraits and landscape photos and, therefore, the general image watermarking technique can not satisfy the requirements of the image watermarking. Because background of product images commonly used in shopping malls is white or black, or gray scale (gradient) color, it is difficult to utilize the space to embed a watermark and the area is very sensitive even a slight change. In this paper, the characteristics of images used in shopping malls are analyzed and a watermarking technology which is suitable to the shopping mall images is proposed. The proposed image watermarking technology divide a product image into smaller blocks, and the corresponding blocks are transformed by DCT (Discrete Cosine Transform), and then the watermark information was inserted into images using quantization of DCT coefficients. Because uniform treatment of the DCT coefficients for quantization cause visual blocking artifacts, the proposed algorithm used weighted mask which quantizes finely the coefficients located block boundaries and coarsely the coefficients located center area of the block. This mask improves subjective visual quality as well as the objective quality of the images. In addition, in order to improve the safety of the algorithm, the blocks which is embedded the watermark are randomly selected and the turbo code is used to reduce the BER when extracting the watermark. The PSNR(Peak Signal to Noise Ratio) of the shopping mall image watermarked by the proposed algorithm is 40.7~48.5[dB] and BER(Bit Error Rate) after JPEG with QF = 70 is 0. This means the watermarked image is high quality and the algorithm is robust to JPEG compression that is used generally at the online shopping malls. Also, for 40% change in size and 40 degrees of rotation, the BER is 0. In general, the shopping malls are used compressed images with QF which is higher than 90. Because the pirated image is used to replicate from original image, the proposed algorithm can identify the copyright infringement in the most cases. As shown the experimental results, the proposed algorithm is suitable to the shopping mall images with simple background. However, the future study should be carried out to enhance the robustness of the proposed algorithm because the robustness loss is occurred after mask process.

• Journal of Intelligence and Information Systems
• /
• v.26 no.1
• /
• pp.23-45
• /
• 2020

Big data is creating in a wide variety of fields such as medical care, manufacturing, logistics, sales site, SNS, and the dataset characteristics are also diverse. In order to secure the competitiveness of companies, it is necessary to improve decision-making capacity using a classification algorithm. However, most of them do not have sufficient knowledge on what kind of classification algorithm is appropriate for a specific problem area. In other words, determining which classification algorithm is appropriate depending on the characteristics of the dataset was has been a task that required expertise and effort. This is because the relationship between the characteristics of datasets (called meta-features) and the performance of classification algorithms has not been fully understood. Moreover, there has been little research on meta-features reflecting the characteristics of multi-class. Therefore, the purpose of this study is to empirically analyze whether meta-features of multi-class datasets have a significant effect on the performance of classification algorithms. In this study, meta-features of multi-class datasets were identified into two factors, (the data structure and the data complexity,) and seven representative meta-features were selected. Among those, we included the Herfindahl-Hirschman Index (HHI), originally a market concentration measurement index, in the meta-features to replace IR(Imbalanced Ratio). Also, we developed a new index called Reverse ReLU Silhouette Score into the meta-feature set. Among the UCI Machine Learning Repository data, six representative datasets (Balance Scale, PageBlocks, Car Evaluation, User Knowledge-Modeling, Wine Quality(red), Contraceptive Method Choice) were selected. The class of each dataset was classified by using the classification algorithms (KNN, Logistic Regression, Nave Bayes, Random Forest, and SVM) selected in the study. For each dataset, we applied 10-fold cross validation method. 10% to 100% oversampling method is applied for each fold and meta-features of the dataset is measured. The meta-features selected are HHI, Number of Classes, Number of Features, Entropy, Reverse ReLU Silhouette Score, Nonlinearity of Linear Classifier, Hub Score. F1-score was selected as the dependent variable. As a result, the results of this study showed that the six meta-features including Reverse ReLU Silhouette Score and HHI proposed in this study have a significant effect on the classification performance. (1) The meta-features HHI proposed in this study was significant in the classification performance. (2) The number of variables has a significant effect on the classification performance, unlike the number of classes, but it has a positive effect. (3) The number of classes has a negative effect on the performance of classification. (4) Entropy has a significant effect on the performance of classification. (5) The Reverse ReLU Silhouette Score also significantly affects the classification performance at a significant level of 0.01. (6) The nonlinearity of linear classifiers has a significant negative effect on classification performance. In addition, the results of the analysis by the classification algorithms were also consistent. In the regression analysis by classification algorithm, Naïve Bayes algorithm does not have a significant effect on the number of variables unlike other classification algorithms. This study has two theoretical contributions: (1) two new meta-features (HHI, Reverse ReLU Silhouette score) was proved to be significant. (2) The effects of data characteristics on the performance of classification were investigated using meta-features. The practical contribution points (1) can be utilized in the development of classification algorithm recommendation system according to the characteristics of datasets. (2) Many data scientists are often testing by adjusting the parameters of the algorithm to find the optimal algorithm for the situation because the characteristics of the data are different. In this process, excessive waste of resources occurs due to hardware, cost, time, and manpower. This study is expected to be useful for machine learning, data mining researchers, practitioners, and machine learning-based system developers. The composition of this study consists of introduction, related research, research model, experiment, conclusion and discussion.

• The Journal of Korea Robotics Society
• /
• v.3 no.3
• /
• pp.186-193
• /
• 2008

We propose a novel real-time obstacle avoidance method for rescue robots. This method, named the ELA(Emergency Level Around), permits the detection of unknown obstacles and avoids collisions while simultaneously steering the mobile robot toward safe position. In the ELA, we consider two sensor modules, PSD(Position Sensitive Detector) infrared sensors taking charge of obstacle detection in short distance and LMS(Laser Measurement System) in long distance respectively. Hence if a robot recognizes an obstacle ahead by PSD infrared sensors first, and judges impossibility to overcome the obstacle based on driving mode decision process, the order of priority is transferred to LMS which collects data of radial distance centered on the robot to avoid the confronted obstacle. After gathering radial information, the ELA algorithm estimates emergency level around a robot and generates a polar histogram based on the emergency level to judge where the optimal free space is. Finally, steering angle is determined to guarantee rotation to randomly direction as well as robot width for safe avoidance. Simulation results from wandering in closed local area which includes various obstacles and different conditions demonstrate the power of the ELA.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.6
• /
• pp.403-412
• /
• 2013

This study figures out the concepts of container transport, logistical cost and the distribution of a company through studying documents, and to suggest logistical cost reduction approach, focused on the efficiency of transport which occupied the considerable portion of the total logistical cost of the company. We analyze and discuss the container loading of multiple items for multiple places of departure and arrival through a case study on S company in South Korea. We suggest a direction to reduce the logistical cost of the companies, analyzing the conditions of multiple items loading, and rule-based systems including an algorithm which determines container-loading for minimum freight expenses. We use data mining and OLAP tools of MS Analysis Services to produce loading rules for multiple items loading and generate OLAP cube and decision trees to validate the rules.