• Title/Summary/Keyword: Gaussian Distance Function

Search Result 67, Processing Time 0.032 seconds

Small Target Detection using Morphology and Gaussian Distance Function in Infrared Images (적외선 영상에서 모폴로지와 가우시안 거리함수를 이용한 소형표적 검출)

  • Park, Jun-Jae;Ahn, Sang-Ho;Kim, Jong-Ho;Kim, Sang-Kyoon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.4
    • /
    • pp.61-70
    • /
    • 2012
  • We propose a method that finds candidate targets based on morphology and detects a small target from them using modified gaussian distance function. The existing small target detection methods use predictive filters or morphology. The methods using predictive filters take long to approach least errors. The methods using morphology are weak at clutters and need to consider size of a small target when selecting size of structure elements. We propose a robust method for small target detection to complete the existing methods. First, the proposed method deletes clutters using a median filter. Next, it does closing and opening operation using various size of structure elements, and figures target candidate pixels with subtraction operation between the results of closing and opening operation. It detects an exact small target using a gaussian distance function from the candidates target areas. The proposed method is less sensitive to clutters, and shows a detection rate of 98%.

On the Radial Basis Function Networks with the Basis Function of q-Normal Distribution

  • Eccyuya, Kotaro;Tanaka, Masaru
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.26-29
    • /
    • 2002
  • Radial Basis Function (RBF) networks is known as efficient method in classification problems and function approximation. The basis function of RBF networks is usual adopted normal distribution like the Gaussian function. The output of the Gaussian function has the maximum at the center and decrease as increase the distance from the center. For learning of neural network, the method treating the limited area of input space is sometimes more useful than the method treating the whole of input space. The q-normal distribution is the set of probability density function include the Gaussian function. In this paper, we introduce the RBF networks with the basis function of q-normal distribution and actually approximate a function using the RBF networks.

  • PDF

STATISTICAL GAUSSIAN DISTRIBUTION FUNCTION AS A DISTANCE INDICATOR TO STELLAR GROUPS

  • Abdel-Rahman, H.I.;Issa, I.A.;Sharaf, M.A.;Nouh, M.I.;Bakry, A.;Osman, A.I.;Saad, A.S.;Kamal, F.Y.;Essam, Essam
    • Journal of The Korean Astronomical Society
    • /
    • v.42 no.4
    • /
    • pp.71-79
    • /
    • 2009
  • In this paper, statistical distribution functions are developed for distance determination of stellar groups. This method depends on the assumption that absolute magnitudes and apparent magnitudes follow a Gaussian distribution function. Due to the limits of the integrands of the frequency function of apparent and absolute magnitudes, we introduce Case A, B, and C Gaussian distributions. The developed approaches have been implemented to determine distances to some clusters and stellar associations. The comparison with the distances derived by different authors reveals good agreement.

Lane Detection Using Gaussian Function Based RANSAC (가우시안 함수기반 RANSAC을 이용한 차선검출 기법)

  • Choi, Yeongyu;Seo, Eunyoung;Suk, Soo-Young;Park, Ju H.;Jung, Ho-Youl
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.13 no.4
    • /
    • pp.195-204
    • /
    • 2018
  • Lane keeping assist and departure prevention system are the key functions of ADAS. In this paper, we propose lane detection method which uses Gaussian function based RANSAC. The proposed method consists mainly of IPM (inverse perspective mapping), Canny edge detector, and Gaussian function based RANSAC (Random Sample Consensus). The RANSAC uses Gaussian function to extract the parameters of straight or curved lane. The proposed RANSAC is different from the conventional one, in the following two aspects. One is the selection of sample with different probability depending on the distance between sample and camera. Another is the inlier sample score that assigns higher weights to samples near to camera. Through simulations, we show that the proposed method can achieve good performance in various of environments.

Blind Nonlinear Channel Equalization by Performance Improvement on MFCM (MFCM의 성능개선을 통한 블라인드 비선형 채널 등화)

  • Park, Sung-Dae;Woo, Young-Woon;Han, Soo-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.11
    • /
    • pp.2158-2165
    • /
    • 2007
  • In this paper, a Modified Fuzzy C-Means algorithm with Gaussian Weights(MFCM_GW) is presented for nonlinear blind channel equalization. The proposed algorithm searches the optimal channel output states of a nonlinear channel from the received symbols, based on the Bayesian likelihood fitness function and Gaussian weighted partition matrix instead of a conventional Euclidean distance measure. Next, the desired channel states of a nonlinear channel are constructed with the elements of estimated channel output states, and placed at the center of a Radial Basis Function(RBF) equalizer to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with those of a simplex genetic algorithm(GA), a hybrid genetic algorithm(GA merged with simulated annealing(SA): GASA), and a previously developed version of MFCM. It is shown that a relatively high accuracy and fast search speed has been achieved.

Data Clustering Method Using a Modified Gaussian Kernel Metric and Kernel PCA

  • Lee, Hansung;Yoo, Jang-Hee;Park, Daihee
    • ETRI Journal
    • /
    • v.36 no.3
    • /
    • pp.333-342
    • /
    • 2014
  • Most hyper-ellipsoidal clustering (HEC) approaches use the Mahalanobis distance as a distance metric. It has been proven that HEC, under this condition, cannot be realized since the cost function of partitional clustering is a constant. We demonstrate that HEC with a modified Gaussian kernel metric can be interpreted as a problem of finding condensed ellipsoidal clusters (with respect to the volumes and densities of the clusters) and propose a practical HEC algorithm that is able to efficiently handle clusters that are ellipsoidal in shape and that are of different size and density. We then try to refine the HEC algorithm by utilizing ellipsoids defined on the kernel feature space to deal with more complex-shaped clusters. The proposed methods lead to a significant improvement in the clustering results over K-means algorithm, fuzzy C-means algorithm, GMM-EM algorithm, and HEC algorithm based on minimum-volume ellipsoids using Mahalanobis distance.

언덕형 다중모우드 광섬유에 전송되는 광의 TNF 형태로부터 광파워 분포 및 정상상태 측정

  • Jeon, Yeong-Yun;An, Jong-Pyeong;Kim, Yong-Hwan;Park, Hui-Gap
    • ETRI Journal
    • /
    • v.7 no.4
    • /
    • pp.3-10
    • /
    • 1985
  • After the light from an incoherent LED was transmitted through the multimode fibers which were linked over 10 km, the nearfield power distribution reached the steady-state independent of launching conditions. It has been also found that the steady-state output power distribution showed the pattern of Gaussian function. In this steady-state Gaussian function pattern, the measured losses of fibers were very repeatable values. In case of using LD source, the speckle phenomena in near -field power distribution appeared until the distance of 10 km. And the output power distribution did not reach the steady-state shown in LED even over 20km on account of the coherence and the nonuniform lasing modes of LD. But the measured losses of fibers were nearly stable in this long distance.

  • PDF

Accurate application of Gaussian process regression for cosmology

  • Hwang, Seung-gyu;L'Huillier, Benjamin
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.46 no.1
    • /
    • pp.48.1-48.1
    • /
    • 2021
  • Gaussian process regression (GPR) is a powerful method used for model-independent analysis of cosmological observations. In GPR, it is important to decide an input mean function and hyperparameters that affect the reconstruction results. Depending on how the input mean function and hyperparameters are determined in the literature, I divide into four main applications for GPR and compare their results. In particular, a zero mean function is commonly used as an input mean function, which may be inappropriate for reconstructing cosmological observations such as the distance modulus. Using mock data based on Pantheon compilation of type Ia supernovae, I will point out the problem of using a zero input and suggest a new way to deal with the input mean function.

  • PDF

Distance Measure for Biased Probability Density Functions and Related Equalizer Algorithms for Non-Gaussian Noise (편이 확률밀도함수 사이의 거리측정 기준과 비 가우시안 잡음 환경을 위한 등화 알고리듬)

  • Kim, Namyong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.12
    • /
    • pp.1038-1042
    • /
    • 2012
  • In this paper, a new distance measure for biased PDFs is proposed and a related equalizer algorithm is also derived for supervised adaptive equalization for multipath channels with impulsive and time-varying DC bias noise. From the simulation results in the non-Gaussian noise environments, the proposed algorithm has proven not only robust to impulsive noise but also to have the capability of cancelling time-varying DC bias noise effectively.

Euclidean Distance of Biased Error Probability for Communication in Non-Gaussian Noise (비-가우시안 잡음하의 통신을 위한 바이어스된 오차 분포의 유클리드 거리)

  • Kim, Namyong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.3
    • /
    • pp.1416-1421
    • /
    • 2013
  • In this paper, the Euclidean distance between the probability density functions (PDFs) for biased errors and a Dirac-delta function located at zero on the error axis is proposed as a new performance criterion for adaptive systems in non-Gaussian noise environments. Also, based on the proposed performance criterion, a supervised adaptive algorithm is derived and applied to adaptive equalization in the shallow-water communication channel distorted by severe multipath fading, impulsive and DC-bias noise. The simulation results compared with the performance of the existing MEDE algorithm show that the proposed algorithm yields over 5 dB of MSE enhancement and the capability of relocating the mean of the error PDF to zero on the error axis.