• Title/Summary/Keyword: 유클리디안 거리

Search Result 102, Processing Time 0.026 seconds

Partially Evaluated Genetic Algorithm based on Fuzzy Clustering (퍼지 클러스터링 기반의 국소평가 유전자 알고리즘)

  • Yoo Si-Ho;Cho Sung-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.9
    • /
    • pp.1246-1257
    • /
    • 2004
  • To find an optimal solution with genetic algorithm, it is desirable to maintain the population sire as large as possible. In some cases, however, the cost to evaluate each individual is relatively high and it is difficult to maintain large population. To solve this problem we propose a novel genetic algorithm based on fuzzy clustering, which considerably reduces evaluation number without any significant loss of its performance by evaluating only one representative for each cluster. The fitness values of other individuals are estimated from the representative fitness values indirectly. We have used fuzzy c-means algorithm and distributed the fitness using membership matrix, since it is hard to distribute precise fitness values by hard clustering method to individuals which belong to multiple groups. Nine benchmark functions have been investigated and the results are compared to six hard clustering algorithms with Euclidean distance and Pearson correlation coefficients as fitness distribution method.

Watermarking Algorithm using Power of Subbands Decomposed by Wavelet Packet and QIM (웨이블릿 패킷 변환한 후의 대역별 에너지와 QIM을 이용한 워터마킹 알고리즘)

  • Seo, Ye-Jin;Cho, Sang-Jin;Chong, Ui-Pil
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.11
    • /
    • pp.1431-1437
    • /
    • 2011
  • This paper proposes a novel watermarking algorithm that protects digital copyrights and is robust to attacks. Watermarks are embedded in the subband including the significant part of the signal such as a pitch. Generally, the subband containing the pitch has the biggest energy. In order to find this subband, wavelet packet transform is used to decompose the subbands and their energy are calculated. The signal of the selected subbands is transformed in frequency domain using FFT. The watermarks are embedded using QIM for samples higher than a certain threshold. The blind detection uses the Euclidean distance. The proposed method shows less than 5% BER in the audio watermark benchmarking.

Audio Watermarking Using Quantization Index Modulation on Significant Peaks in Frequency Domain (주파수 영역에서 주요 피크에 QIM을 적용한 오디오 워터마킹)

  • Kang, Jung-Sun;Cho, Sang-Jin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.30 no.6
    • /
    • pp.303-307
    • /
    • 2011
  • This paper describes an audio watermarking using Quantization Index Modulation (QIM) on significant peaks in frequency domain. The audio signal is broken up into L samples length frames with non-overlapping and rectangular window. The zero-crossing rate of each frame is calculated for decision whether it is proper to be watermarked or not. If the frame is legitimate, frequency magnitude response is computed by discrete Fourier transform. For the QIM, we set the quantization step size based on maximum value of frequency magnitude response and select n significant peaks with w samples around them in frequency domain, totally $n{\times}(w+1)$ samples. Finally, watermark embedding is performed. Decoder extract watermarks based on Euclidean distance, that is a blind detection. The proposed method is robust against many attacks of watermark benchmark.

A New Similarity Measure based on RMF and It s Application to Linguistic Approximation (상대적 소수 함수에 기반을 둔 새로운 유사성 측도와 언어 근사에의 응용)

  • Choe, Dae-Yeong
    • The KIPS Transactions:PartB
    • /
    • v.8B no.5
    • /
    • pp.463-468
    • /
    • 2001
  • We propose a new similarity measure based on relative membership function (RMF). In this paper, the RMF is suggested to represent the relativity between fuzzy subsets easily. Since the shape of the RMF is determined according to the values of its parameters, we can easily represent the relativity between fuzzy subsets by adjusting only the values of its parameters. Hence, we can easily reflect the relativity among individuals or cultural differences when we represent the subjectivity by using the fuzzy subsets. In this case, these parameters may be regarded as feature points for determining the structure of fuzzy subset. In the sequel, the degree of similarity between fuzzy subsets can be quickly computed by using the parameters of the RMF. We use Euclidean distance to compute the degree of similarity between fuzzy subsets represented by the RMF. In the meantime, we present a new linguistic approximation method as an application area of the proposed similarity measure and show its numerical example.

  • PDF

Design and Performance Evaluation of DAPSK System Using Efficient Constellation Assignment (효율적 성좌도 배치법을 사용하는 DAPSK 시스템 설계와 성능 평가)

  • An, Changyoung;Ryu, Sang-Burm;Lee, Sang-Gyu;Ryu, Heung-Gyoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.29 no.9
    • /
    • pp.668-676
    • /
    • 2018
  • In satellite communications, a modulation technique with a low peak-to-average power ratio, high transmission efficiency, and low bit error rate(BER) is required, and differential amplitude and phase shift keying(DAPSK) modulation technique has been appraised as a technology that meets these requirements. However, because conventional DAPSK modulation uses a regular constellation diagram, the Euclidean distance between the symbols in the inner concentric circles of the constellation are quite short. Such a characteristic degrades the BER. In this paper, we propose a DAPSK system that uses an efficient constellation assignment to improve the performance of existing DAPSK systems and evaluate the performance of the proposed scheme. From the simulation results, we confirm that the proposed 16-DAPSK system achieves an signal-to-noise ratio gain of 0.8 dB over the conventional approach at a BER condition of $10^{-4}$ when the number of symbols used in the symbol detector of the receiver is 2.

A study on Similarity analysis of National R&D Programs using R&D Project's technical classification (R&D과제의 기술분류를 이용한 사업간 유사도 분석 기법에 관한 연구)

  • Kim, Ju-Ho;Kim, Young-Ja;Kim, Jong-Bae
    • Journal of Digital Contents Society
    • /
    • v.13 no.3
    • /
    • pp.317-324
    • /
    • 2012
  • Recently, coordination task of similarity between national R&D programs is emphasized on view from the R&D investment efficiency. But the previous similarity search method like text-based similarity search which using keyword of R&D projects has reached the limit due to deviation of document's quality. For the solve the limitations of text-based similarity search using the keyword extraction, in this study, utilization of R&D project's technical classification will be discussed as a new similarity search method when analyzed of similarity between national R&D programs. To this end, extracts the Science and Technology Standard Classification of R & D projects which are collected when national R&D Survey & analysis, and creates peculiar vector model of each R&D programs. Verify a reliability of this study by calculate the cosine-based and Euclidean distance-based similarity and compare with calculated the text-based similarity.

A Study on Face Recognition System Using LDA and SVM (LDA와 SVM을 이용한 얼굴 인식 시스템에 관한 연구)

  • Lee, Jung-Jai
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.10 no.11
    • /
    • pp.1307-1314
    • /
    • 2015
  • This study proposed a more stable robust recognition algorithm which detects faces reliably even in cases where there are changes in lighting and angle of view, as well it satisfies efficiency in calculation and detection performance. The algorithm proposed detects the face area alone after normalization through pre-processing and obtains a feature vector using (PCA). Also, by applying the feature vector obtained for SVM, face areas can be tested. After the testing, the feature vector is applied to LDA and using Euclidean distance in the 2nd dimension, the final analysis and matching is performed. The algorithm proposed in this study could increase the stability and accuracy of recognition rates and as a large amount of calculation was not necessary due to the use of two dimensions, real-time recognition was possible.

Algorithm of Face Region Detection in the TV Color Background Image (TV컬러 배경영상에서 얼굴영역 검출 알고리즘)

  • Lee, Joo-Shin
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.4
    • /
    • pp.672-679
    • /
    • 2011
  • In this paper, detection algorithm of face region based on skin color of in the TV images is proposed. In the first, reference image is set to the sampled skin color, and then the extracted of face region is candidated using the Euclidean distance between the pixels of TV image. The eye image is detected by using the mean value and standard deviation of the component forming color difference between Y and C through the conversion of RGB color into CMY color model. Detecting the lips image is calculated by utilizing Q component through the conversion of RGB color model into YIQ color space. The detection of the face region is extracted using basis of knowledge by doing logical calculation of the eye image and lips image. To testify the proposed method, some experiments are performed using front color image down loaded from TV color image. Experimental results showed that face region can be detected in both case of the irrespective location & size of the human face.

A Study on Rotating Object Classification using Deep Neural Networks (깊은신경망을 이용한 회전객체 분류 연구)

  • Lee, Yong-Kyu;Lee, Yill-Byung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.5
    • /
    • pp.425-430
    • /
    • 2015
  • This paper is a study to improve the classification efficiency of rotating objects by using deep neural networks to which a deep learning algorithm was applied. For the classification experiment of rotating objects, COIL-20 is used as data and total 3 types of classifiers are compared and analyzed. 3 types of classifiers used in the study include PCA classifier to derive a feature value while reducing the dimension of data by using Principal Component Analysis and classify by using euclidean distance, MLP classifier of the way of reducing the error energy by using error back-propagation algorithm and finally, deep learning applied DBN classifier of the way of increasing the probability of observing learning data through pre-training and reducing the error energy through fine-tuning. In order to identify the structure-specific error rate of the deep neural networks, the experiment is carried out while changing the number of hidden layers and number of hidden neurons. The classifier using DBN showed the lowest error rate. Its structure of deep neural networks with 2 hidden layers showed a high recognition rate by moving parameters to a location helpful for recognition.

Quantification of 3D Pore Structure in Glass Bead Using Micro X-ray CT (Micro X-ray CT를 이용한 글라스 비드의 3차원 간극 구조 정량화)

  • Jung, Yeon-Jong;Yun, Tae-Sup
    • Journal of the Korean Geotechnical Society
    • /
    • v.27 no.11
    • /
    • pp.83-92
    • /
    • 2011
  • The random and heterogeneous pore structure is a significant factor that dominates physical and mechanical behaviors of soils such as fluid flow and geomechanical responses driven by loading. The characterization method using non-destructive testing such as micro X-ray CT technique which has a high resolution with micrometer unit allows to observe internal structure of soils. However, the application has been limited to qualitatively observe 2D and 3D CT images and to obtain the void ratio at macro-scale although the CT images contain enormous information of materials of interests. In this study, we constructed the 3D particle and pore structures based on sequentially taken 2D images of glass beads and quantitatively defined complex pore structure with void cell and void channel. This approach was enabled by implementing image processing techniques that include coordinate transformation, binarization, Delaunay Triangulation, and Euclidean Distance Transform. It was confirmed that the suggested algorithm allows to quantitatively evaluate the distribution of void cells and their connectivity of heterogeneous pore structures for glass beads.