• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.891-894
• /
• 2004

This paper proposes an improved image segmentation algorithm by the watershed algorithm based on the local adaptive threshold on local minima search and the fixing threshold on label allocation. The previous watershed algorithm generates the problem of over-segmentation. The over-segmentation makes the boundary in the inaccuracy region by occurring around the object. In order to solve those problems we quantize the input color image by the vector quantization, remove noise and find the gradient image. We sorted local minima applying the local adaptive threshold on local minima search of the input color image. The simulation results show that the proposed algorithm controls over-segmentation and makes the fine boundary around segmented region applying the fixing threshold based on sorted local minima on label allocation.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.2
• /
• pp.358-363
• /
• 2009

Text region detection from the natural scene images used in a variety of applications, many research are needed in this field. Recent research methods is to detect the text region using various algorithm which it is combination of edge based and connected component based. Therefore, this paper proposes an text region detection using edge and regional minima/maxima transformation algorithm from natural scene images, and then detect the connected components of edge and regional minima/maxima, labeling edge and regional minima/maxima connected components. Analysis the labeled regions and then detect a text candidate regions, each of detected text candidates combined and create a single text candidate image, Final text region validated by comparing the similarity and adjacency of individual characters, and then as the final text regions are detected. As the results of experiments, proposed algorithm improved the correctness of text regions detection using combined edge and regional minima/maxima connected components detection methods.

• Korean Journal of Social Welfare
• /
• v.59 no.3
• /
• pp.75-97
• /
• 2007

The purpose of this article is to explore French 'minima sociaux', focusing its scheme, benefit determination rule and its level appreciation. First, on the its structure domain, French 'minima sociaux' presents the plural system in which there is eight categorical benefits and one general benefit. Il is the representation of the intention to guarantee minimum income for the dead zone people out of the social insurance application and also a historical product in different period, by different logic of benefits implementation. Second, comparing nine benefits based on the benefit determination rule, level of benefits for the poor without work ability is higher than one for the poor with work ability. Il represents one polarized perception toward for the poor according to have or not its work ability. Third, comparing level of 'minima sociaux' with relative poverty line, the level of the most 'minima sociaux' is placed under the poverty line. Nevertheless, it must not forget that 'minima sociaux' plays its role as the fundamental alternative for poverty alleviation, but not the only alternative. Fourth and finally, comparing with minimum income guarantee(SMIC in french), level of RMI benefit is estimated merely on the 50% of SMIC. We can consider that it is the result of the interaction of the complex factors, as the limited role of the state toward the minimum income guarantee for the RMI beneficiary and the intervention the logic of status instead of the logic of need, etc..

• Communications of the Korean Mathematical Society
• /
• v.10 no.1
• /
• pp.215-233
• /
• 1995

• Journal of Microbiology
• /
• v.40 no.2
• /
• pp.129-133
• /
• 2002

The fungus, Emericellopsis minima W2, capable of degrading poly(3-hydroxybutyrate) (PHB) was isolated from a waste water sample. Production of the PHB depolymerase from E. minima W2 (PhaZ/ sub Emi/) was significantly repressed in the presence of glucose. PhaZ/ sub Emi/ was purified by column chromatography on Octyl-Sepharose CL-4B and Sephadex G-100. The molecular mass of the PhaZ/ sub Emi/), which consisted of a single polypeptide chain, was estimated to be 48.0 kDa by SDS-PAGE and its pI vague was 4.4. The maximum activity of the PhaZ/ sub Emi/ was observed at pH 9.0 and 55$\^{C}$. It was significantly inactivated by 1mM dithiothreitol, 2mM diisopropyl fluorphosphate, 0.1mM Tween 80, and 0.1 mM Triton X-l00, but insensitive to phenylmethylsulfonyl fluoride and N-ethylmaleimide. The PhaZ/ sub Emi/ efficiently hydrolyzed PHB and its copolyester with 30 mol% 3-hydroxyvalerate, but did not act on poly(3-hydroxyoctanoate). It also hydrolyzed p-nitrophenylacetate and p-nitrophenylbutyrate but hardly affected the longer-chain forms. The main hydrolysis product of PHB was identified as a dimer of 3-hydroxybutyrate.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2008.11a
• /
• pp.23-27
• /
• 2008

In this study, Real Coded Genetic Algorithm(RCGA) and Artificial Neural Network(ANN) are used for developing the defect diagnostics of the aircraft turbo-shaft engine. ANN accompanied with large amount data has a most serious problem to fall in the local minima. Because of this weak point, it becomes very difficult to obtain good convergence ratio and high accuracy. To solve this problem, GA based ANN has been suggested. GA is able to search the global minima better than ANN. GA based ANN has shown the RMS defect error of 5% less in single and dual defect cases.

• Journal of Species Research
• /
• v.10 no.3
• /
• pp.237-245
• /
• 2021

Tidal flats are well developed in and around the Yellow Sea of Northeast Asia, and benthic diatoms are the most important primary producers in corresponding habitats. In the present study, the taxonomy and distribution of small negligible diatom species from Northeast Asian tidal flats are investigated for better understanding of the diversity of Korean marine benthic diatoms. The presence of Plagiogrammopsis minima and Diploneis aestuarii, which may have been ignored and/or misidentified due to their small size, were identified by both means of light microscopy (LM) and scanning electron microscopy (SEM). Plagiogrammopsis minima has never been reported from Korea before the present study, while Diploneis aestuarii was only once mentioned without any photographic information. Accordingly, we provide the morphological characteristics of the two species in detail with LM and SEM observation. Information on the regional distribution of the two species is also provided. Results of the present study contribute to the better understanding of the biodiversity of the Korean marine benthic diatoms.

• Journal of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1047-1065
• /
• 2022

For two dimensional lattices, a Gaussian basis achieves all two successive minima. For dimension larger than two, constructing a pairwise Gaussian basis is useful to compute short vectors of the lattice. For three dimensional lattices, Semaev showed that one can convert a pairwise Gaussian basis to a basis achieving all three successive minima by one simple reduction. A pairwise Gaussian basis can be obtained from a given basis by executing Gauss algorithm for each pair of basis vectors repeatedly until it returns a pairwise Gaussian basis. In this article, we prove a necessary and sufficient condition for a pairwise Gaussian basis to achieve the first k successive minima for three dimensional lattices for each k ∈ {1, 2, 3} by modifying Semaev's condition. Our condition directly checks whether a pairwise Gaussian basis contains the first k shortest independent vectors for three dimensional lattices. LLL is the most basic lattice basis reduction algorithm and we study how to use LLL to compute a pairwise Gaussian basis. For δ ≥ 0.9, we prove that LLL(δ) with an additional simple reduction turns any basis for a three dimensional lattice into a pairwise SV-reduced basis. By using this, we convert an LLL reduced basis to a pairwise Gaussian basis in a few simple reductions. Our result suggests that the LLL algorithm is quite effective to compute a basis with all three successive minima for three dimensional lattices.

• Journal of rehabilitation welfare engineering & assistive technology
• /
• v.11 no.4
• /
• pp.363-370
• /
• 2017

In this paper, we proposed a low-complexity speech enhancement algorithm based on a improved minima controlled recursive averaging (IMCRA) and log minimum mean square error (logMMSE). The IMCRA algorithm track the minima value of input power within buffers in local window and identify the speech presence using ratio between input power and its minima value. In this process, many number of operations are required. To reduce the number of operations of IMCRA algorithm, minima value is tracked using time-varying frequency-dependent smoothing based on speech presence probability. The proposed algorithm enhanced speech quality by 2.778%, 3.481%, 2.980% and 2.162% in 0, 5, 10 and 15dB SNR respectively and reduced computational complexity by average 9.570%.

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.5
• /
• pp.256-261
• /
• 2008

In this paper, we propose a novel approach to improve the performance of minima controlled recursive averaging (MCRA) which is based on the conditional maximum a posteriori criterion. A crucial component of a practical speech enhancement system is the estimation of the noise power spectrum. One state-of-the-art approach is the minima controlled recursive averaging (MCRA) technique. The noise estimate in the MCRA technique is obtained by averaging past spectral power values based on a smoothing parameter that is adjusted by the signal presence probability in frequency subbands. We improve the MCRA using the speech presence probability which is the a posteriori probability conditioned on both the current observation the speech presence or absence of the previous frame. With the performance criteria of the ITU-T P.862 perceptual evaluation of speech quality (PESQ) and subjective evaluation of speech quality, we show that the proposed algorithm yields better results compared to the conventional MCRA-based scheme.