• East Asian mathematical journal
• /
• v.32 no.1
• /
• pp.93-100
• /
• 2016

The generalized Gaussian image of a spacelike surface in $L^n$ lies in the indefinite positive quadric ${\mathbb{Q}}_+^{n-2}$ in the open submanifold ${\mathbb{C}}P_+^{n-1}$ of the complex projective space ${\mathbb{C}}P^{n-1}$. The purpose of this paper is to find out detailed information about ${\mathbb{Q}}_+^{n-2}{\subset}{\mathbb{C}}P_+^{n-1}$.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.27-29
• /
• 2004

This paper presents a sensor model design based on Monte Carlo Localization method. First, we define the measurement error of each sample using a map matching method by 2-D laser scanners and a pre-constructed grid-map of the environment. Second, samples are assigned probabilities due to matching errors from the gaussian probability density function considered of the sample's convergence. Simulation using real environment data shows good localization results by the designed sensor model.

• International Journal of Contents
• /
• v.12 no.2
• /
• pp.42-48
• /
• 2016

We present efficient algorithms for computing centroid directions for each of the three types of monotonicity in a polyhedron: strong, weak, and directional monotonicity, which can be used for optimizing directions in many 3D manufacturing processes. Strongly- and directionally-monotone directions are the poles of great circles separating a set of spherical polygons on the unit sphere, the centroids of which are shown to be obtained by applying the previous result for determining the maximum intersection of the set of their dual spherical polygons. Especially in this paper, we focus on developing an efficient method for approximating the weakly-monotone centroid, which is the pole of one of the great circles intersecting a set of spherical polygons on the unit sphere. The original problem is approximately reduced into computing the intersection of great bands for avoiding complicated computational complexity of non-convex objects on the unit sphere, which can be realized with practical linear-time operations.

• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.609-617
• /
• 2010

This paper is concerned with the use of a selforganizing map (SOM) to estimate the desired channel states of an unknown digital communication channel for blind equalization. The modification of SOM is accomplished by using the Bayesian likelihood fitness function and the relation between the desired channel states and channel output states. At the end of each clustering epoch, a set of estimated clusters for an unknown channel is chosen as a set of pre-defined desired channel states, and used to extract the channel output states. Next, all of the possible desired channel states are constructed by considering the combinations of extracted channel output states, and a set of the desired states characterized by the maximal value of the Bayesian fitness is subsequently selected for the next SOM clustering epoch. This modification of SOM makes it possible to search the optimal desired channel states of an unknown channel. In simulations, binary signals are generated at random with Gaussian noise, and both linear and nonlinear channels are evaluated. The performance of the proposed method is compared with those of the "conventional" SOM and an existing hybrid genetic algorithm. Relatively high accuracy and fast search speed have been achieved by using the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.958-964
• /
• 2007

In this paper, we derive the relationship between the bit error probability (BEP) of maximum a posteriori (MAP) bit detection and the bit minimum mean square error (MMSE), that is, the BEP is greater than a quarter of the bit USE and less than a half of the bit MMSE. By using this result, the lower and upper bounds of the derivative of the mutual information are derived from the BEP and the lower and upper bounds are easily obtained in the multiple-input multiple-output (MIMO) communication systems with the bit-linear linear-dispersion (BLLD) codes in the Gaussian channel.

• Korean Journal of Remote Sensing
• /
• v.23 no.1
• /
• pp.33-42
• /
• 2007

In this paper, an iterative MAP approach using a Bayesian model based on the lognormal distribution for image intensity and a GRF for image texture is proposed for despeckling the SAR images that are corrupted by multiplicative speckle noise. When the image intensity is logarithmically transformed, the speckle noise is approximately Gaussian additive noise, and it tends to a normal probability much faster than the intensity distribution. MRFs have been used to model spatially correlated and signal-dependent phenomena for SAR speckled images. The MRF is incorporated into digital image analysis by viewing pixel types as slates of molecules in a lattice-like physical system defined on a GRF Because of the MRF-SRF equivalence, the assignment of an energy function to the physical system determines its Gibbs measure, which is used to model molecular interactions. The proposed Point-Jacobian Iterative MAP estimation method was first evaluated using simulation data generated by the Monte Carlo method. The methodology was then applied to data acquired by the ESA's ERS satellite on Nonsan area of Korean Peninsula. In the extensive experiments of this study, The proposed method demonstrated the capability to relax speckle noise and estimate noise-free intensity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.861-866
• /
• 2007

A clustering algorithm for Gaussian Probability Distribution Function (GPDF) data called Centroid Neural Network with a Bhattacharyya Kernel (BK-CNN) is proposed in this paper. The proposed BK-CNN is based on the unsupervised competitive Centroid Neural Network (CNN) and employs a kernel method for data projection. The kernel method adopted in the proposed BK-CNN is used to project data from the low dimensional input feature space into higher dimensional feature space so as the nonlinear problems associated with input space can be solved linearly in the feature space. In order to cluster the GPDF data, the Bhattacharyya kernel is used to measure the distance between two probability distributions for data projection. With the incorporation of the kernel method, the proposed BK-CNN is capable of dealing with nonlinear separation boundaries and can successfully allocate more code vector in the region that GPDF data are densely distributed. When applied to GPDF data in an image classification probleml, the experiment results show that the proposed BK-CNN algorithm gives 1.7%-4.3% improvements in average classification accuracy over other conventional algorithm such as k-means, Self-Organizing Map (SOM) and CNN algorithms with a Bhattacharyya distance, classed as Bk-Means, B-SOM, B-CNN algorithms.

• Journal of Digital Convergence
• /
• v.10 no.8
• /
• pp.211-217
• /
• 2012

Conventional GrabCut algorithm is semi-automatic algorithm that user must be set rectangle window surrounds the object. This paper studied automatic object detection to solve these problem by detecting salient region based on Human Visual System. Saliency map is computed using Lab color space which is based on color opposing theory of 'red-green' and 'blue-yellow'. Then Saliency Points are computed from the boundaries of Low-Frequency region that are extracted from Saliency Map. Finally, Rectangle windows are obtained from coordinate value of Saliency Points and these windows are used in GrabCut algorithm to extract objects. Through various experiments, the proposed algorithm computing rectangle windows of salient region and extracting objects has been proved.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.10
• /
• pp.970-976
• /
• 2012

In this paper, a single LRF has been used to produce a 3D map for the mobile robot navigation. The 2D laser scanners are used for mobile robots navigation, where the laser scanner is applied to detect a certain level of area by the straight beam. Therefore it is limited to the usages of 2D obstacle detection and avoidance. In this research, it is designed to complement a mobile robot system to move up and down a single LRF along the yaw axis. During the up and down motion, the 2D data are stacked and manipulated to build a 3D map. Often a single LRF data are mixed with Gaussian and impulse noises. The impulse noises are removed out by the hybrid median filter designed in this research. The 2D data which are improved by deleting the impulse noises are layered to build the 3D map. Removing impulse noises while preserving the boundary is a main advantages of the hybrid median filter which has been used widely to improve the quality of images. The effectiveness of this hybrid median filter for rejecting the impulse noises has been verified through the real experiments. The performance of the hybrid median filter is evaluated in terms of PSNR (Peak Signal to Noise Ratio) and the processing time.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.11a
• /
• pp.104-107
• /
• 2018

최근 촬영 기기의 기술발전으로 인해 디지털 영상의 해상도가 증가함에 따라 선명한 디지털 영상에 대한 요구가 증가하고 있다. 이러한 요구에도 불구하고 디지털 영상 내 가우시안 잡음 (gaussian noise)은 촬영기기를 통해 영상 획득 및 처리 과정에서 발생하여 화질을 열화 시킨다. 디지털 이미지에서 발생하는 가우시안 잡음을 제거하기 위해서 기존의 저대역 통과 필터 (low-pass filter: LPF)를 사용하면 잡음은 제거되지만, 블러링 현상 (blurring phenomenon)이 나타난다. 이러한 문제점을 개선하기 위해 소벨 연산자 (sobel operator)를 사용하여 영상 내 에지 맵 (edge-map)을 생성하여 에지 영역과 동질 영역을 구분한다. 에지영역에서는 약한 저역 필터 (weak low-pass filter)를 사용하고, 그 외의 이미지 영역에서는 강한 저역 필터 (strong low-pass filter)를 사용하는 알고리듬을 제안하였다. 그리고 다양한 이미지에 대하여 기존 알고리듬과 제안한 알고리듬의 적용한 결과를 통해 주관적 화질 비교하였고 객관적 지표로 최대 신호 대 잡음비 (peak signal-to noise ratio: PSNR)와 구조 유사성 (structural similarity: SSIM)을 사용하여 성능을 평가하였다. 실험결과를 통해 제안된 알고리듬이 잡음 제거 및 외곽선 보존의 우수함을 확인하였다.