• The KIPS Transactions:PartB
• /
• v.11B no.6
• /
• pp.633-644
• /
• 2004

In this paper, we notice that the original NTSS algorithm can be proposed as the NTSS-3 Level algorithm by the multi-resolution technique. The fast block matching algorithm affects the speed by the patten combination and this paper proposes the block matching algorithm in different levels by multi-resolution technique, quite different from the original NTSS Patten. The block matching algorithm requires the multi-candidate to reduce the occurrence of low-image quality by the local minima problem. The simulation result compared to FS shows search speed 16 times quicker, and the PSNR 0.11-0.12［dB］ gets improved Image quality compared to the original fast block matching algorithm NTSS, and the speed is improved up to 0.1 times for improved image by the search point portion.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1994.10a
• /
• pp.267-272
• /
• 1994

This work presents a method of optimum design for reinforced concrete building frames with rectangular cross sections. The optimization techniques used is based on the principle of divided parameters. The design variable parameters are divided into two groups, external and internal, and the optimization is also divided into external and internal procedure. This principle overcomes difficulties arising from the presence of two materials in one element, the property peculiar to reinforced concrete. Several search algorithms are tested to verify their accuracy for the external optimization. Among them pattern search algorithms has been found consistent. This work proposes a new method, modified pattern search, and a number of sample problems prove its accuracy and usefulness. Exhaustive search for all local minima in the design spaces for two sample problems has been carried out to understand the nature of the problem. The number of local minima identified is quite more than expected and it has become understood that the researcher's task in this field is to find a better local minimum if not global. The designs produced by the method preposed have been found better than those from other method, and they are in full accord with ACI Building Code Requirments(ACI 318-89).

• International Union of Geodesy and Geophysics Korean Journal of Geophysical Research
• /
• v.25 no.1
• /
• pp.23-34
• /
• 1997

Seismic tomography using the graph theoretical method of ray tracing is performed in two synthetic data sets with laterally varying velocity structures. The straight-ray tomography shows so poor results in imaging the laterally varying velocity structure that the ray-traced tomographic techniques should be used. Conventional ray tracing methods have serious drawbacks, i.e. problems of convergence and local minima, when they are applied to seismic tomography. The graph theretical method finds good approximated raypaths in rapidly varying media even in shadow zones, where shooting methods meet with convergence problems. The graph theoretical method ensures the globally minimal traveltime raypath while bending methods often cause local minima problems. Especially, the graph theoretical method is efficient in case that many sources and receivers exist, since it can find the traveltimes and corresponding raypaths to all receivers from a specific source at one time. Moreover, the algorithm of graph theoretical method is easily applicable to the ray tracing in anisotropic media, and even to the three dimensional case. Among the row-active inversion techniques, the conjugate gradient (CG) method is used because of fast convergence and high efficiency. The iterative sequence of the ray tracing by the graph theoretical method and the inversion by the CG method is an efficient and robust algorithm for seismic tomography in laterally varying velocity structures.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.107-117
• /
• 2014

This paper proposed the method of removing baseline drift by eliminating local maxima such as P, R, T-wave signal region and local minima Q, S-wave signal region. We applied morphology-pair operations improved from morphology operation to the ECG signal. To eliminate overshoot in the result of morphology-pair operation, we apply median value operation to the result of morphology-pair operation. We use MIT/BIH database to estimate the proposed algorithm. Experiment result show that proposed algorithm removing baseline drift effectively without orignal ECG signal distortion.

• Korean Journal of Plant Resources
• /
• v.10 no.3
• /
• pp.250-257
• /
• 1997

The relationship of nine Medicago species belonging to four subgenera were analyzed by using SDS-PAGE and restriction fragment length polymorphism (RELP) methodologies. Sixty-eight bands of alcohol and salt soluble proteins and 85-133 RFLP markers were used to estimate the genetic distance among the species. These species were clustered together at around 0.1 to 0.4 level of distance for both kind of markers, indicating that Medicago species have a large genetic similarity. A combined cluster diagram, at a dissimilarity level of 0.3, differentiated nine species in four groups: group 1, M. littoralis , M. truncatulam, M.scutellata and M. rigidula; group 2, M. sativa ; group 3, M. lupulina ; group 4, M. orbicularis, M. radiata and M. minima. All of them, but except for M. minima. corrensponded to the existing four subgenera of the genus Medicago classified by Lesins and Lesins(1979).The most similar species were M. littoralis and M. trucatula and the most dissimilar one was M. lupulina. In separate cluster diagrams based on RFLP and protein markers, some differences were observed. In the case of RFLP or DNA markers, M. sativa (alfalfa) was distantly clustered with other Medicago species. But in the case of protein markers, M. sativa was closely clustered with M. scutellata, M. littorulis and M. truncatula.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.6
• /
• pp.107-115
• /
• 1998

A path planning using potential field method is very useful for the real-time navigation of mobile robots. However, the method needs high modeling cost to calculate the potential field because of complex preprocessing, and mobile robots may get stuck into local minima. In this paper, An efficient path planning algorithm for multiple mobile robots, based on the potential field method, was proposed. In the algorithm. the concepts of subgoals and obstacle priority were introduced. The subgoals can be used to escape local minima, or to design and change the paths of mobile robots in the work space. In obstacle priority, all the objects (obstacles and mobile robots) in the work space have their own priorities, and the object having lower priority should avoid the objects having higher priority than it has. In this paper, first, potential based path planning method was introduced, next an efficient collision-avoidance algorithm for multiple mobile robots, moving in the obstacle environment, was proposed by using subgoals and obstacle priority. Finally, the developed algorithm was demonstrated graphically to show the usefulness of the algorithm.

• Journal of Species Research
• /
• v.9 no.4
• /
• pp.448-454
• /
• 2020

Nine free-living heterotrophic flagellates were cultured from marine intertidal sediments and freshwater sediments from Korea. These species are described with uninterpreted records based on light microscopy of living cells and reported taxonomically for the first time from Korea. Diagnostics of these species are as follows; Notosolenus hemicircularis: 9-11.8 ㎛ long with flagellar reservoir, ventrally flattened and dorsally convex with hyaline semicircular collar around short anterior neck, and 8 ridges on cell surface. Thecamonas tranhens: 4.5-7.1 ㎛ long, plastic with proboscis comprising an anterior flagellum surrounded by membranous sleeve. Bodomorpha minima: 4.5-7.0 ㎛ long, rigid with small rostrum in anterior end and active anterior flagellum. Cercomonas hiberna: 5.6-10.9 ㎛ long, very plastic with pseudopodia, cytoplasmic strand and 1 or 2 contractile vacuoles. Cercomonas pellucida: 7.5-13 ㎛ long, plastic with pseudopodia, cytoplasmic strand and single contractile vacuole. With nucleus closely connected to basal bodies. Eocercomonas echina: 4.7-6.5 ㎛ long, plastic with pseudopodia, cytoplasmic strand and 1 or 2 contractile vacuoles. Paracercomonas astra: 5.7-7.3 ㎛ long, moderately metabolic with pseudopodia, cytoplasmic strand and 1 or 2 contractile vacuoles. Paracercomonas minima: 5-9 ㎛ long, metabolic with pseudopodia, cytoplasmic strand and single contractile vacuole. Paracercomonas producta: 6.1-9.9 ㎛ long, very metabolic with pseudopodia, long cytoplasmic strand and single contractile vacuole.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.10 no.2
• /
• pp.102-109
• /
• 2006

In this Paper, Support Vector Machine(SVM) and Artificial Neural Network(ANN) are used for developing the defect diagnostic algorithm of the aircraft turbo-shaft engine. The system that uses the ANN falls in a local minima when it learns many nonlinear data, and its classification accuracy ratio becomes low. To make up for this risk, the Separate Learning Algorithm(SLA) of ANN has been proposed by using SVM. This is the method that ANN learns selectively after discriminating the defect position by SVM, then more improved performance estimation can be obtained than using ANN only. The proposed SLA can make the higher classification accuracy by decreasing the nonlinearity of the massive data during the training procedure.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.12
• /
• pp.1920-1925
• /
• 2012

In this paper, we propose a novel method to improve the performance of the improved minima controlled recursive averaging (IMCRA) in non-stationary noisy environment. The conventional IMCRA algorithm efficiently estimate the noise power by averaging past spectral power values based on a smoothing parameter that is adjusted by the signal presence probability in frequency subbands. Since the minimum of smoothing parameter is defined as 0.85, it is difficult to obtain the robust estimates of the noise power in non-stationary noisy environments that is rapidly changed the spectral characteristics such as babble noise. For this reason, we proposed the modified IMCRA, which adaptively estimate and updata the noise power according to the noise type classified by the Gaussian mixture model (GMM). The performances of the proposed method are evaluated by perceptual evaluation of speech quality (PESQ) and composite measure under various environments and better results compared with the conventional method are obtained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.12
• /
• pp.2418-2425
• /
• 1994

Although the error backpropagation(EBP) algorithm based on the gradient descent method is a widely-used learning algorithm of neural networks, learning sometimes takes a long time to acquire accuracy. This paper develops a novel learning method to alleviate the problems of EBP algorithm such as local minima, slow speed, and size of structure and thus to improve performance by adopting other new networks. Gaussian Potential Function networks(GPFN), in parallel with multilayer neural networks. Empirical simulations show the efficacy of the proposed algorithm in function approximation, which enables us to train networks faster with the better generalization capabilities.