• 전기의세계
• /
• v.28 no.3
• /
• pp.57-64
• /
• 1979

The static state estimation are divided into two groups; estimation and detection & identification. This paper centers on detection and identification algorithm. Especially, the identification of line errors is focused on and is performed by the extended W.L.S. algorithm with line swithching states. Here, line switching states mean the discrete values of line admittance which are influenced by unexpected line switching. The numerical results are obtained from the assumption that the noise vector is independent zero mean Gaussian random variables.

• Bulletin of the Korean Chemical Society
• /
• v.20 no.9
• /
• pp.1026-1030
• /
• 1999

The properties of semiflexible polymer brushes are studied by applying the classical limit of mean-field approach for chains with marginal chain stiffness. Using the mean-spherical Gaussian model, the most probable configuration for semiflexible chains is obtained, which reduces to the parabolic brush of Milner et al. [Mac-romolecules 1988, 21, 2610] in the flexible limit. From this configuration, equilibrium brush height as well as interactions between semiflexible brushes are estimated.

• Honam Mathematical Journal
• /
• v.40 no.4
• /
• pp.701-718
• /
• 2018

In this paper, we will study the constant mean curvature (CMC) surfaces foliated by ellipses in three dimensional Euclidean space $E^3$. We prove that: (1): Surfaces foliated by ellipses are CMC surfaces if and only if it is a part of generalized cylinder. (2): All surfaces foliated by ellipses are not minimal surfaces. (3): CMC surfaces foliated by ellipses are developable surfaces. (4): CMC surfaces foliated by ellipses are translation surfaces generated by a straight line and plane curve.

• Journal of KIISE:Software and Applications
• /
• v.36 no.11
• /
• pp.936-946
• /
• 2009

A graph cuts method has recently attracted a lot of attentions for image segmentation, as it can globally minimize energy functions composed of data term that reflects how each pixel fits into prior information for each class and smoothness term that penalizes discontinuities between neighboring pixels. In previous approaches to graph cuts-based automatic image segmentation, GMM(Gaussian mixture models) is generally used, and means and covariance matrixes calculated by EM algorithm were used as prior information for each cluster. However, it is practicable only for clusters with a hyper-spherical or hyper-ellipsoidal shape, as the cluster was represented based on the covariance matrix centered on the mean. For arbitrary-shaped clusters, this paper proposes graph cuts-based image segmentation using mean shift analysis. As a prior information to estimate the data term, we use the set of mean trajectories toward each mode from initial means randomly selected in $L^*u^*{\upsilon}^*$ color space. Since the mean shift procedure requires many computational times, we transform features in continuous feature space into 3D discrete grid, and use 3D kernel based on the first moment in the grid, which are needed to move the means to modes. In the experiments, we investigate the problems of mean shift-based and normalized cuts-based image segmentation methods that are recently popular methods, and the proposed method showed better performance than previous two methods and graph cuts-based automatic image segmentation using GMM on Berkeley segmentation dataset.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.205-208
• /
• 2007

Due to the development and wide use of digital multimedia broadcasting (DMB) and Wireless Broadband Internet (WiBro), the digital contents industry using images has been progressed. Therefore, the image processing has been applied in a variety of fields and in order to transmit and conserve accurate information, the degradation phenomenon for images should be removed. As a representative cause of the degradation phenonenon, noise has become known and Gaussian noise occurs in the process of transmission. Diverse researches for Gaussian noise removal have been implemented and a great number of algorithms have been proposed until now. In this paper, for mage restoration an algorithm using the adaptive threshold value is proposed in Gaussian noise environment and the threshold value is established by using the histogram of edge image. And from simulation results, the noise removal performance of the proposed method is proven using mean square error (MSE) and peak signal to noise ratio (PSNR).

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.11
• /
• pp.3274-3279
• /
• 2009

The elutriation characteristics of particle size distribution were investigated in a gas-solid fluidized bed. Experiments were carried out with the mulit-sized particles of Gaussian distributions. The elutriation rate constant obtained from the experiment was correlated with the standard deviation of particle size and the dimensionless group of the velocity ratio. The standard deviation of pressure fluctuation, mean pressure, major frequency and power spectrum density function were calculated by pressure fluctuation properties. Size distribution of elutriated particles and pressure fluctuations were measured for the particle size distribution of particle system depended largrly on the size distribution. Characteristics of fluidization and elutriation were greatly influenced by the particle size distribution and these characteristics could be interpreted with pressure fluctuation properties.

• Nuclear Engineering and Technology
• /
• v.56 no.2
• /
• pp.715-727
• /
• 2024

During fast neutron imaging, besides the dark current noise and readout noise of the CCD camera, the main noise in fast neutron imaging comes from high-energy gamma rays generated by neutron nuclear reactions in and around the experimental setup. These high-energy gamma rays result in the presence of high-density gamma white spots (GWS) in the fast neutron image. Due to the microscopic quantum characteristics of the neutron beam itself and environmental scattering effects, fast neutron images typically exhibit a mixture of Gaussian noise. Existing denoising methods in neutron images are difficult to handle when dealing with a mixture of GWS and Gaussian noise. Herein we put forward a deep learning approach based on the Swin Transformer UNet (SUNet) model to remove high-density GWS-Gaussian mixture noise from fast neutron images. The improved denoising model utilizes a customized loss function for training, which combines perceptual loss and mean squared error loss to avoid grid-like artifacts caused by using a single perceptual loss. To address the high cost of acquiring real fast neutron images, this study introduces Monte Carlo method to simulate noise data with GWS characteristics by computing the interaction between gamma rays and sensors based on the principle of GWS generation. Ultimately, the experimental scenarios involving simulated neutron noise images and real fast neutron images demonstrate that the proposed method not only improves the quality and signal-to-noise ratio of fast neutron images but also preserves the details of the original images during denoising.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.655-658
• /
• 1999

In this study, We derived Recursive Least Squares(RLS) algorithm with adaptive maximum -likelihood channel estimate for digital pulse amplitude modulated sequence in the presence of intersymbol interference and additive white Gaussian noise. RLS algorithms have better convergence characteristics than conventional algorithms, LMS Least Mean Squares) algorithms.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.08a
• /
• pp.121-124
• /
• 2000

적응 학습 알고리즘으로 가중치를 변화시키는 단층 신경망의 출력부에 Ramp 임계 함수를 적용하여 입력이 zero-mean Gaussian random vector인 경우 가중치의 stationary point를 구하고, 적응 학습 알고리즘을 유도한다.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1132-1137
• /
• 2011

In this paper, we propose Modified Multi CAMShift Algorithm(Modified Multi Continuously Adaptive Mean Shift Algorithm) that extracts skin color area and tracks several human body parts for real-time human tracking system. Skin color area is extracted by filtering input image in predefined RGB value range. These areas are initial search windows of hands and face for tracking. Gaussian background model prevents search window expending because it restricts skin color area. Also when occluding between these areas, we give more weights in occlusion area and move mass center of target area in color probability distribution image. As result, the proposed algorithm performs better than the original CAMShift approach in multiple object tracking and even when occluding of objects with similar colors.