• Journal of Biomedical Engineering Research
• /
• v.34 no.4
• /
• pp.182-188
• /
• 2013

This study aims to develop a practical algorithm which can detect freezing of gait(FOG) in patients with Parkinson's disease(PD). Eighteen PD patients($68.8{\pm}11.1yrs.$) participated in this study, and three($68.7{\pm}4.0yrs.$) of them showed FOG. We suggested two time-domain algorithms(with 1-axis or 3-axes acceleration signals) and compared them with the frequency-domain algorithm in the literature. We measured the acceleration of left foot with a 3-axis accelerometer inserted at the insole of a shoe. In the time-domain method, the root-mean-square(RMS) acceleration was calculated in a moving window of 4s and FOG was defined as the periods during which RMS accelerations located within FOG range. The parameters in each algorithm were optimized for each subject using the simulated annealing method. The sensitivity and specificity were same, i.e., $89{\pm}8%$ for the time-domain method with 1-axis acceleration and were $91{\pm}7%$ and $90{\pm}8%$ for the time-domain method with 3-axes acceleration, respectively. Both performances were better in the time-domain methods than in the frequency-domain method although the results were statistically insignificant. The amount of calculation in the time-domain method was much smaller than in the frequency-domain method. Therefore it is expected that the suggested time domain algorithm would be advantageous in the systematic implementation of FOG detection.

• Journal of Korea Multimedia Society
• /
• v.14 no.3
• /
• pp.403-413
• /
• 2011

In this paper, we proposed a digital image watermarking technique using scrambled binary phase computer generated hologram in the discrete cosine transform(DCT) domain. For the embedding process of watermark. Using simulated annealing algorithm, we would generate a binary phase computer generated hologram(BPCGH) which can reconstruct hidden image perfectly instead of hidden image and encrypt it through the scramble operation. We multiply the encrypted watermark by the weight function and embed it into the DC coefficients in the DCT domain of host image and an inverse DCT is performed. For the extracting process of watermark, we compare the DC coefficients of watermarked image and original host image in the DCT domain and dividing it by the weight function and decrypt it using descramble operation. And we recover the hidden image by inverse Fourier transforming the decrypted watermark. Finally, we compute the correlation between the original hidden image and recovered hidden image to determine if a watermark exits in the host image. The proposed watermarking technique use the hologram information of hidden image which consist of binary values and scramble encryption technique so it is very secure and robust to the various external attacks such as compression, noises and cropping. We confirmed the advantages of the proposed watermarking technique through the computer simulations.

• Journal of Biosystems Engineering
• /
• v.39 no.3
• /
• pp.227-234
• /
• 2014

Purpose: The aim of this research was to develop and evaluate natural hydroxyapatite (HA) ceramics produced from the heat treatment of pig bones. Methods: The properties of natural HA ceramics produced from pig bones were assessed in two parts. Firstly, the raw materials were characterized. A temperature of $1,200^{\circ}C$ was chosen as the calcination temperature. Fine bone powders (BPs) were produced via calcinations and a milling process. Sintered BPs were then characterized using field emission scanning electron microscopy (FE-SEM), X-ray diffraction (XRD), X-ray fluorescence spectroscopy (XRF), energy dispersive X-ray spectroscopy (EDX), Fourier transform infrared (FTIR) spectroscopy, and a 2-year in vitro degradability test. Secondly, an indirect cytotoxicity test was conducted on human osteoblast-like cells, MG63, treated with the BPs. Results: The average particle size of the BPs was $20{\pm}5{\mu}m$. FE-SEM showed a non-uniform distribution of the particle size. The phase obtained from XRD analysis confirmed the structure of HA. Elemental analysis using XRF detected phosphorus (P) and calcium (Ca) with the Ca/P ratio of 1.6. Functional groups examined by FTIR detected phosphate ($PO{_4}^{3-}$), hydroxyl ($OH^-$), and carbonate ($CO{_3}^{2-}$). The EDX, XRF, and FTIR analysis of BPs indicated the absence of organic compounds, which were completely removed after annealing at $1,200^{\circ}C$. The BPs were mostly stable in a simulated body fluid (SBF) solution for 2 years. An indirect cytotoxicity test on natural HA ceramics showed no threat to the cells. Conclusions: In conclusion, the sintering temperature of $1,200^{\circ}C$ affected the microstructure, phase, and biological characteristics of natural HA ceramics consisting of calcium phosphate. The Ca-P-based natural ceramics are bioactive materials with good biocompatibility; our results indicate that the prepared HA ceramics have great potential for agricultural and biological applications.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.1
• /
• pp.155-161
• /
• 2020

In general, optimization problems are difficult to solve simply. The reason is that the given problem is solved as soon as it is simple, but the more complex it is, the very large number of cases. This study is about the optimization of AI neural network. What we are dealing with here is the relief method for constructing AI network. The main topics deal with non-deterministic issues such as the stability and unstability of the overall network state, cost down and energy down. For this one, we discuss associative memory models, that is, a method in which local minimum memory information does not select fake information. The simulated annealing, this is a method of estimating the direction with the lowest possible value and combining it with the previous one to modify it to a lower value. And nonlinear planning problems, it is a method of checking and correcting the input / output by applying the appropriate gradient descent method to minimize the very large number of objective functions. This research suggests a useful approach to relief method as a theoretical approach to solving optimization problems. Therefore, this research will be a good proposal to apply efficiently when constructing a new AI neural network.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.27 no.5
• /
• pp.421-427
• /
• 2014

Most of the structure of the real world is influenced under dynamic loads. However, when structure analysis and the structural optimization is performed, it is assumed that the static load acts on structure. When considering the actual load of dynamic loads in order to take into account a variety of loads, computational resources and time becomes a big burden in terms of cost. However, considering only the simple static load condition is not preferable for structural safety. For this reason, a lot of studies have been conducted trying to compensate this trouble by applying weight factor or replacing dynamic load with the equivalent static load. In this study, structural optimization techniques for structures under dynamic loads is proposed by applying the equivalent static load. From previous study, after determining the positions of equivalent static load based on primary degrees of freedom, the equivalent static load is calculated through the optimization process. In this process, the equivalent static load optimization of previous research is complemented by adding constraints to avoid excessively large load extraction. In numerical examples, dynamic load is applied to the truss structure and the plate. Then, the reliability of the proposed optimization technique is verified by carrying out size optimization with the equivalent static load.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6B
• /
• pp.638-644
• /
• 2002

In this paper, we implemented a three dimensional image display system using stereogram and holographic optical memory techniques which can store many images and reconstruct them automatically. In this system, to store and reconstruct stereo images, incident angle of reference beam must be controlled in real time, so we used BPH(binary phase hologram) and LCD(liquid crystal display) for controlling reference beam. The reference beams are acquired by Fourier transform of BPHs which designed with SA(simulated annealing)algorithm, and the BPHs are represented on the LCD with the 0.05 seconds time interval using application software for reconstructing the stereo images. And input images are represented on the LCD without polarizer/analyzer for maintaining uniform beam intensities regardless of the brightness of input images. The input images and BPHs are edited using application software(Photoshop) with having the same recording scheduled time interval in storing. The reconstructed stereo images are acquired by capturing the output images with CCD camera at the behind of the analyzer which transforms phase information into brightness information of images. In output plane, we used a LCD shutter that is synchronized to a monitor that display alternate left and right eye images for depth perception. We demonstrated optical experiment which store and reconstruct four stereo images in BaTiO$_3$ repeatedly using the proposed holographic optical memory techniques.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.9 no.3
• /
• pp.156-170
• /
• 2006

Determining the best visibility positions on terrain surface has been one of the frequently used analytical issues in GIS visibility analysis and the search for a solution has been carried out effectively using spatial search techniques. However, the spatial search process provides operational and methodological challenges for finding computational algorithms suitable for solving the best visibility site problem. For this problem, current GIS visibility analysis has not been successful due to limited algorithmic structure and operational performance. To meet these challenges, this paper suggests four algorithms explored robust search techniques: an extensive iterative search technique; a conventional solution based on the Tornqvist algorithm; genetic algorithm; and simulated annealing technique. The solution performance of these algorithms is compared on a set of visibility location problems and the experiment results demonstrate the useful feasibility. Finally, this paper presents the potential applicability of the new spatial search techniques for GIS visibility analysis by which the new search algorithms are of particular useful for tackling extensive visibility optimization problems as the next GIS analysis tool.

• Journal of the Korean Geotechnical Society
• /
• v.35 no.4
• /
• pp.27-35
• /
• 2019

This study confirmed the applicability to the field of geotechnical engineering for relatively complicated space and many target design variables in back analysis. The Sharan's equation and the Blum's method were used for the tunnel field and the retaining wall as a model for the multi-variate problem of geotechnical engineering. Optimization methods are generally divided into a deterministic method and a stochastic method. In this study, Simulated Annealing Method (SA) was selected as a deterministic method and Differential Evolution Algorithm (DEA) and Particle Swarm Optimization Method (PSO) were selected as stochastic methods. The three selected optimization methods were compared by applying a multi-variate model. The problem of deterministic method has been confirmed in the multi-variate back analysis of geotechnical engineering, and the superiority of DEA can be confirmed. DEA showed an average error rate of 3.12% for Sharan's solution and 2.23% for Blum's problem. The iteration number of DEA was confirmed to be smaller than the other two optimization methods. SA was confirmed to be 117.39~167.13 times higher than DEA and PSO was confirmed to be 2.43~6.91 times higher than DEA. Applying a DEA to the multi-variate back analysis of geotechnical problems can be expected to improve computational speed and accuracy.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.1
• /
• pp.121-135
• /
• 2013

This paper propose an efficient algorithm for selecting electric bus charging facility location. In nature, the optimal charging facility location problem is similar to Set Covering Problem. Set Covering Problem is the problem of covering all the rows of an $m{\times}n$ matrix of ones and zeros by a subset of columns with a minimal cost. It has many practical applications of modeling of real world problems. The Set Covering Problem has been proven to be NP-Complete. In order to overcome the computational complexity involved in seeking optimal solutions, this paper present an enhanced greedy algorithm and simulated annealing algorithm. In this paper, we apply the developed algorithm to Seoul's public bus system.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.13-27
• /
• 2012

Integer programming-based local search(IPbLS) is a kind of local search based on simple hill-climbing search and adopts integer programming for neighbor generation unlike general local search. According to an existing research [1], IPbLS is known as an effective method for the multidimensional knapsack problem(MKP) which has received wide attention in operations research and artificial intelligence area. However, the existing research has a shortcoming that it verified the superiority of IPbLS targeting only largest-scale problems among MKP test problems in the OR-Library. In this paper, I verify the superiority of IPbLS more objectively by applying it to other problems. In addition, unlike the existing IPbLS that combines simple hill-climbing search and integer programming, I propose methods combining other local search algorithms like hill-climbing search, tabu search, simulated annealing with integer programming. Through the experimental results, I confirmed that IPbLS shows comparable or better performance than the best known heuristic search also for mid or small-scale MKP test problems.