• 제목/요약/키워드: Index of similarity

검색결과 667건 처리시간 0.024초

낙동강 하구 간석지에서 분리된 세균의 층별 종조성 및 특성에 관하여 (Vertical composition and character analysis of saprophytic bacteria isolated from the mudflat of Nakdong river estuary)

  • 홍순우;김상종;이윤;최성찬
    • 미생물학회지
    • /
    • 제23권2호
    • /
    • pp.157-165
    • /
    • 1985
  • Bacterial identification was performed with morphological, physiological and biochemical tests to the isolates from the mudflat of 30cm depth sampled in Nakdong river estuary in March and June, 1985. Flavobacterium and Cnterobacteriaceae were regarded as dominants. Pseudomonas, Bacillus, Micrococcus, Vibrio, Aerococcus, Aerononas, Acinetobacter and Staphylococcus were founded in various depth. Vertical composition of bacterial genera in March was more diversiform than that of June. Character analysis was carried out with the calculation of similarity index (S). At a level of 85% similarity, the isolates were clustered into 5 groups and ungrouped 2 strains. Classifying groups of bacterial strains with determination schemes and groups from similarity index were in good agreement.

  • PDF

Color Image Enhancement Based on Adaptive Nonlinear Curves of Luminance Features

  • Cho, Hosang;Kim, Geun-Jun;Jang, Kyounghoon;Lee, Sungmok;Kang, Bongsoon
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제15권1호
    • /
    • pp.60-67
    • /
    • 2015
  • This paper proposes an image-dependent color image enhancement method that uses adaptive luminance enhancement and color emphasis. It effectively enhances details of low-light regions while maintaining well-balanced luminance and color information. To compare the structure similarity and naturalness, we used the tone mapped image quality index (TMQI). The proposed method maintained better structure similarity in the enhanced image than did the space-variant luminance map (SVLM) method or the adaptive and integrated neighborhood dependent approach for nonlinear enhancement (AINDANE). The proposed method required the smallest computation time among the three algorithms. The proposed method can be easily implemented using the field-programmable gate array (FPGA), with low hardware resources and with better performance in terms of similarity.

유사도 기반 해양 자켓 구조물 손상추정 (Similarity-based Damage Detection in Offshore Jacket Structures)

  • 민천홍;김형우;박상현;오재원;남보우
    • 한국해양공학회지
    • /
    • 제30권4호
    • /
    • pp.287-293
    • /
    • 2016
  • This paper presents an effective damage detection method for offshore jackets using natural frequency change ratios. Two parameters, cosine similarity and magnitude index, are considered to estimate the location and severity of the damage in the structure. A numerical jacket structure model is considered to verify the performance of the proposed method. As observed through analysis, the damages in the structure are detected accurately.

Parentage Identification of 'Daebong' Grape (Vitis spp.) Using RAPD Analysis

  • Kim, Seung-Heui;Jeong, Jae-Hun;Kim, Seon-Kyu;Paek, Kee-Yoeup
    • Journal of Plant Biotechnology
    • /
    • 제4권2호
    • /
    • pp.67-70
    • /
    • 2002
  • The RAPD data were used to assess genetic similarity among f grape cultivars. Of the 100 random primers tested on genomic DNA, 10 primers could be selected for Benetic analysis, and the selected primers generated a total of 115 distinct amplification fragments. A similarity matrix was constructed on the basis of the presence or absence of bands. The 7 grape cultivars analyzed with UPGMA were clustered into two groups of A and B. The similarity coefficient value of cultivars was high. The mean similarity index for all pairwise comparisons was 0.851, and ranged from 0.714 ('Rosaki' and 'Black Olympia') to 0.988 ('Kyoho' and 'Daebong'). After due consideration of differences in cultural and morphological characteristics of these two theoretically identical cultivars, it could be deduced that 'Daebong' is a bud sport of 'Kyoho' cultivar.

SSF: Sentence Similar Function Based on word2vector Similar Elements

  • Yuan, Xinpan;Wang, Songlin;Wan, Lanjun;Zhang, Chengyuan
    • Journal of Information Processing Systems
    • /
    • 제15권6호
    • /
    • pp.1503-1516
    • /
    • 2019
  • In this paper, to improve the accuracy of long sentence similarity calculation, we proposed a sentence similarity calculation method based on a system similarity function. The algorithm uses word2vector as the system elements to calculate the sentence similarity. The higher accuracy of our algorithm is derived from two characteristics: one is the negative effect of penalty item, and the other is that sentence similar function (SSF) based on word2vector similar elements doesn't satisfy the exchange rule. In later studies, we found the time complexity of our algorithm depends on the process of calculating similar elements, so we build an index of potentially similar elements when training the word vector process. Finally, the experimental results show that our algorithm has higher accuracy than the word mover's distance (WMD), and has the least query time of three calculation methods of SSF.

Community Discovery in Weighted Networks Based on the Similarity of Common Neighbors

  • Liu, Miaomiao;Guo, Jingfeng;Chen, Jing
    • Journal of Information Processing Systems
    • /
    • 제15권5호
    • /
    • pp.1055-1067
    • /
    • 2019
  • In view of the deficiencies of existing weighted similarity indexes, a hierarchical clustering method initialize-expand-merge (IEM) is proposed based on the similarity of common neighbors for community discovery in weighted networks. Firstly, the similarity of the node pair is defined based on the attributes of their common neighbors. Secondly, the most closely related nodes are fast clustered according to their similarity to form initial communities and expand the communities. Finally, communities are merged through maximizing the modularity so as to optimize division results. Experiments are carried out on many weighted networks, which have verified the effectiveness of the proposed algorithm. And results show that IEM is superior to weighted common neighbor (CN), weighted Adamic-Adar (AA) and weighted resources allocation (RA) when using the weighted modularity as evaluation index. Moreover, the proposed algorithm can achieve more reasonable community division for weighted networks compared with cluster-recluster-merge-algorithm (CRMA) algorithm.

A Text Similarity Measurement Method Based on Singular Value Decomposition and Semantic Relevance

  • Li, Xu;Yao, Chunlong;Fan, Fenglong;Yu, Xiaoqiang
    • Journal of Information Processing Systems
    • /
    • 제13권4호
    • /
    • pp.863-875
    • /
    • 2017
  • The traditional text similarity measurement methods based on word frequency vector ignore the semantic relationships between words, which has become the obstacle to text similarity calculation, together with the high-dimensionality and sparsity of document vector. To address the problems, the improved singular value decomposition is used to reduce dimensionality and remove noises of the text representation model. The optimal number of singular values is analyzed and the semantic relevance between words can be calculated in constructed semantic space. An inverted index construction algorithm and the similarity definitions between vectors are proposed to calculate the similarity between two documents on the semantic level. The experimental results on benchmark corpus demonstrate that the proposed method promotes the evaluation metrics of F-measure.

Newly-designed adaptive non-blind deconvolution with structural similarity index in single-photon emission computed tomography

  • Kyuseok Kim;Youngjin Lee
    • Nuclear Engineering and Technology
    • /
    • 제55권12호
    • /
    • pp.4591-4596
    • /
    • 2023
  • Single-photon emission computed tomography SPECT image reconstruction methods have a significant influence on image quality, with filtered back projection (FBP) and ordered subset expectation maximization (OSEM) being the most commonly used methods. In this study, we proposed newly-designed adaptive non-blind deconvolution with a structural similarity (SSIM) index that can take advantage of the FBP and OSEM image reconstruction methods. After acquiring brain SPECT images, the proposed image was obtained using an algorithm that applied the SSIM metric, defined by predicting the distribution and amount of blurring. As a result of the contrast to noise ratio (CNR) and coefficient of variation evaluation (COV), the resulting image of the proposed algorithm showed a similar trend in spatial resolution to that of FBP, while obtaining values similar to those of OSEM. In addition, we confirmed that the CNR and COV values of the proposed algorithm improved by approximately 1.69 and 1.59 times, respectively, compared with those of the algorithm involving an inappropriate deblurring process. To summarize, we proposed a new type of algorithm that combines the advantages of SPECT image reconstruction techniques and is expected to be applicable in various fields.

Some new similarity based approaches in approximate reasoning and their applications to pattern recognition

  • Swapan Raha;Nikhil R. Pal;Ray, Kumar-Sankar
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
    • /
    • pp.719-724
    • /
    • 1998
  • This paper presents a systematic developement of a formal approach to inference in approximate reasoning. We introduce some measures of similarity and discuss their properties. Using the concept of similarity index we formulate two methods for inferring from vague knowledge. In order to illustrate the effectiveness of the proposed technique we use it to develop a vowel recognition system.

  • PDF

데이터베이스에서 유사도 질의 처리 비용 감소 방법 (A Method of Reducing the Processing Cost of Similarity Queries in Databases)

  • 김선경;박지수;손진곤
    • 정보처리학회논문지:소프트웨어 및 데이터공학
    • /
    • 제11권4호
    • /
    • pp.157-162
    • /
    • 2022
  • 오늘날 대부분의 데이터는 데이터베이스(database: DB)에 저장된다. 이러한 DB 환경에서 사용자는 자신이 원하는 데이터를 찾아줄 것을 DB에게 요청하게 된다. DB 질의 중 유사도 질의는 DB 사용자가 원하는 조건으로 유사도가 포함되어 있는 것을 말한다. 그러나 유사도 질의를 처리하기 위한 과정은 처리 레코드의 범위를 줄일 수 있는 색인을 이용하기 힘들어 테이블의 전체 레코드에 대해서 매번 유사도를 계산하는 비용이 높다. 본 논문은 이러한 문제점을 해결하기 위하여 경량 유사도 함수를 정의한다. 경량 유사도 함수는 유사도 함수에 비해 데이터를 여과하는 정확도는 떨어지지만 비용이 유사도 함수에 비하여 적게 소모되는 특징이 있다. 이러한 경량 유사도 함수의 특징을 이용하여 유사도 질의 처리 비용 감소 방법을 제시한다. 그리고 유클리드 거리 함수에 경량 유사도 함수로 체비쇼프 거리를 제시하고 기존의 유사도 함수를 이용하는 질의와 경량 유사도 함수를 이용하는 질의의 처리 비용을 비교한다. 그리고 실험을 통하여 유클리드 유사도에 대한 경량 유사도 함수로 체비쇼프 거리를 적용하였을 때 유사도 질의 처리 비용이 감소하는 것을 확인한다.