• Bulletin of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.935-949
• /
• 2013

In this paper, we study surfaces in $\mathb{E}^3$ whose Gauss map G satisfies the equation ${\Box}G=f(G+C)$ for a smooth function $f$ and a constant vector C, where ${\Box}$ stands for the Cheng-Yau operator. We focus on surfaces with constant Gaussian curvature, constant mean curvature and constant principal curvature with such a property. We obtain some classification and characterization theorems for these kinds of surfaces. Finally, we give a characterization of surfaces whose Gauss map G satisfies the equation ${\Box}G={\lambda}(G+C)$ for a constant ${\lambda}$ and a constant vector C.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2451-2453
• /
• 2002

In this paper, we present an infrared sensors aided map building method for mobile robot using genetic algorithm and fuzzy logic. Existing Bayesian update model using ultrasonic sensors only has a problem of the quality of map being degraded in the wall with irregularity which is caused by the wide beam width of sonar waves and Gaussian probability distribution. In order to solve this problem we propose an improved method of map building using supplementary infrared sensors. In the method, wide beam width of sonar waves is divided by infrared sensors and probability is distributed according to infrared sensors' information using fuzzy logic and genetic algorithm.

• Korean Journal of Remote Sensing
• /
• v.23 no.5
• /
• pp.455-464
• /
• 2007

Lee(2007) suggested the Point-Jacobian iteration MAP estimation(PJIMAP) for noise removal of the images that are corrupted by multiplicative speckle noise. It is to find a MAP estimation of noisy-free imagery based on a Bayesian model using the lognormal distribution for image intensity and an MRF for image texture. 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. The MRF is incorporated into digital image analysis by viewing pixel types as states of molecules in a lattice-like physical system. In this study, the MAP estimation is computed by the Point-Jacobian iteration using adaptive parameters. At each iteration, the parameters related to the Bayesian model are adaptively estimated using the updated information. The results of the proposed scheme were compared to them of PJIMAP with SAR simulation data generated by the Monte Carlo method. The experiments demonstrated an improvement in relaxing speckle noise and estimating noise-free intensity by using the adaptive parameters for the Ponit-Jacobian iteration.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.3
• /
• pp.249-255
• /
• 2013

In this paper, we propose an algorithm to detect scale invariant object from IR image obtained in the sea environment. We create horizontal edge (HL), vertical edge (LH), diagonal edge (HH) of images through 2-D discrete Haar wavelet transform (DHWT) technique after noise reduction using morphology operations. Considering the sea environment, Gaussian blurring to the horizontal and vertical edge images at each level of wavelet is performed and then saliency map is generated by multiplying the blurred horizontal and vertical edges and combining into one image. Then we extract object candidate region by performing a binarization to saliency map. A small area in the object candidate region are removed to produce final result. Experiment results show the feasibility of the proposed algorithm.

• Progress in Medical Physics
• /
• v.22 no.1
• /
• pp.42-51
• /
• 2011

Nuclear medicine images (SPECT, PET) were widely used tool for assessment of myocardial viability and perfusion. However it had difficult to define accurate myocardial infarct region. The purpose of this study was to investigate methodological approach for automatic measurement of rat myocardial infarct size using polar map with adaptive threshold. Rat myocardial infarction model was induced by ligation of the left circumflex artery. PET images were obtained after intravenous injection of 37 MBq $^{18}F$-FDG. After 60 min uptake, each animal was scanned for 20 min with ECG gating. PET data were reconstructed using ordered subset expectation maximization (OSEM) 2D. To automatically make the myocardial contour and generate polar map, we used QGS software (Cedars-Sinai Medical Center). The reference infarct size was defined by infarction area percentage of the total left myocardium using TTC staining. We used three threshold methods (predefined threshold, Otsu and Multi Gaussian mixture model; MGMM). Predefined threshold method was commonly used in other studies. We applied threshold value form 10% to 90% in step of 10%. Otsu algorithm calculated threshold with the maximum between class variance. MGMM method estimated the distribution of image intensity using multiple Gaussian mixture models (MGMM2, ${\cdots}$ MGMM5) and calculated adaptive threshold. The infarct size in polar map was calculated as the percentage of lower threshold area in polar map from the total polar map area. The measured infarct size using different threshold methods was evaluated by comparison with reference infarct size. The mean difference between with polar map defect size by predefined thresholds (20%, 30%, and 40%) and reference infarct size were $7.04{\pm}3.44%$, $3.87{\pm}2.09%$ and $2.15{\pm}2.07%$, respectively. Otsu verse reference infarct size was $3.56{\pm}4.16%$. MGMM methods verse reference infarct size was $2.29{\pm}1.94%$. The predefined threshold (30%) showed the smallest mean difference with reference infarct size. However, MGMM was more accurate than predefined threshold in under 10% reference infarct size case (MGMM: 0.006%, predefined threshold: 0.59%). In this study, we was to evaluate myocardial infarct size in polar map using multiple Gaussian mixture model. MGMM method was provide adaptive threshold in each subject and will be a useful for automatic measurement of infarct size.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.117-122
• /
• 2006

In this paper, we present a simple and general soft bit decision expression for a Gray coded PAM signal over additive white Gaussian noise(AWGN) channel with the log likelihood ratio(LLR). In order to reduce the complexity of the LLR calculation, we make the bitwise LLR expression simple by replacing the mathematical max functions of the conventional Max-Log-MAP expression with simple arithmetic functions associated with some deterministic parameters, such as a received value and distance between symbols on a signal space. Taking the implementation issues, like the area of silicon, the power consumption, the timing latency, and so on, into consideration, we submit that the proposed method is a promising alternative way to conventional methods for reconfigurable systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2078-2093
• /
• 2019

Visual smoke recognition is a challenging task due to large variations in shape, texture and color of smoke. To improve performance, we propose a novel smoke recognition method by combining dual-encoded features that are extracted from both spatial and Curvelet domains. A Curvelet transform is used to filter an image to generate fifty sub-images of Curvelet coefficients. Then we extract Local Binary Pattern (LBP) maps from these coefficient maps and aggregate histograms of these LBP maps to produce a histogram map. Afterwards, we encode the histogram map again to generate Dual-encoded Local Binary Patterns (Dual-LBP). Histograms of Dual-LBPs from Curvelet domain and Completed Local Binary Patterns (CLBP) from spatial domain are concatenated to form the feature for smoke recognition. Finally, we adopt Gaussian Kernel Optimization (GKO) algorithm to search the optimal kernel parameters of Support Vector Machine (SVM) for further improvement of classification accuracy. Experimental results demonstrate that our method can extract effective and reasonable features of smoke images, and achieve good classification accuracy.

• Journal of Broadcast Engineering
• /
• v.25 no.1
• /
• pp.48-57
• /
• 2020

Recently, with the rapid development of image recognition technology, the demand for object analysis in road CCTV videos is increasing. In this paper, we propose a method that can adaptively find the counting line for traffic analysis in road CCTV videos. First, vehicles on the road are detected, and the corresponding positions of the detected vehicles are modeled as the two-dimensional pointwise Gaussian map. The paths of vehicles are estimated by accumulating pointwise Gaussian maps on successive video frames. Then, we apply clustering and linear regression to the accumulated Gaussian map to find the principal direction of the road, which is highly relevant to the counting line. Experimental results show that the proposed method for detecting the counting line is effective in various situations.

• Smart Media Journal
• /
• v.4 no.4
• /
• pp.18-23
• /
• 2015

In this paper, we propose a method for detecting the number of clusters. This method can improve the performance of a gaussian mixture model function in conventional markov random field method by using the tensor voting. The key point of the proposed method is that extracts the number of the center through the continuity of saliency map of the input data of the tensor voting token. At first, we separate the foreground and background region candidate in a given natural images. After that, we extract the appropriate cluster number for each separate candidate regions by applying the tensor voting. We can make accurate modeling a gaussian mixture model by using a detected number of cluster. We can return the result of natural binary text image by calculating the unary term and the pairwise term of markov random field. After the experiment, we can confirm that the proposed method returns the optimal cluster number and text binarization results are improved.

• Journal of information and communication convergence engineering
• /
• v.9 no.1
• /
• pp.59-63
• /
• 2011

Conventional noise reduction filtering schemes realize limited improvements of the peak signal-to-noise ratio (PSNR) in the low-level noisy images. The flatness degree and the edge information are effectively used to estimate the noise volume. We propose a noise estimator for reducing noise in the AWGN (additive white gaussian noise) corrupted images using three intermediate image maps (FGM(flatness gray map), FIM(flatness index map), NEM(noise estimate map)). The proposed noise estimator is fed into the conventional noise reduction filters as a pre-processor. The performance of noise reduction is tested in the various AWGN corrupted images.