• Title/Summary/Keyword: global similarity

Search Result 241, Processing Time 0.023 seconds

Comparing the Performance of Global Query Expansion according to Similarity Measures (유사계수에 따른 전역적 질의확장 검색 성능 비교)

  • 이재윤
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.526-528
    • /
    • 2003
  • 공기빈도를 이용한 전역적 질의확장 검색에서 공기유사도를 판정하는데 이용되는 유사계수의 특성에 따른 질의확장 성능을 비교해보았다. 먼저 각 유사계수의 통계적인 특성을 말뭉치와 검색실험 문서집단을 대상으로 살펴본 결과 코사인 계수, 자카드 계수는 고빈도어 선호경향을 보이고 상호정보량과 율의 Y는 저빈도어 선호경향을 보이는 것으로 나타났다. 질의확장 검색실험에서는 고빈도어 선호경향을 가진 유사계수에 비해서 저빈도어 선호경향을 가진 유사계수률 이용할 때 더 종은 성능이 나타났다. 특히 율의 Y는 질의어의 DF가 1에 가깝게 매우 낮을 때 다른 유사계수와 달리 고빈도어를 선호함으로써 항상 저빈도어를 선호하는 상호정보량에 비해서 질의확장 검색에 유리함을 알 수가 있었다.

  • PDF

PCR Detection of Ranavirus in Gold-spotted Pond Frogs (Rana plancyi chosenica) from Korea

  • Kim, Suk;Sim, Mi-Yeong;Eom, Ahn-Heum;Park, Dae-Sik;Ra, Nam-Yong
    • Korean Journal of Environmental Biology
    • /
    • v.27 no.1
    • /
    • pp.110-113
    • /
    • 2009
  • In recent years, there has been a rapid global decline in amphibian populations, and infectious diseases have been associated with this decline. Diseased Gold-spotted pond frogs (Rana plancyi chosenica) were collected from a frog farm in Korea and identified using morphological and molecular analysis to identify the disease. The typical symptoms of ranaviral infection were observed in the tadpoles and adults frogs. The nucleotide sequence analysis revealed that the sequences showed the closest similarity with sequences to Frog virus 3, which belongs to the genus Ranavirus.

Optimization of Multimodal Function Using An Enhanced Genetic Algorithm and Simplex Method (향상된 유전알고리듬과 Simplex method을 이용한 다봉성 함수의 최적화)

  • Kim, Young-Chan;Yang, Bo-Suk
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2000.11a
    • /
    • pp.587-592
    • /
    • 2000
  • The optimization method based on an enhanced genetic algorithms is proposed for multimodal function optimization in this paper. This method is consisted of two main steps. The first step is global search step using the genetic algorithm(GA) and function assurance criterion(FAC). The belonging of an population to initial solution group is decided according to the FAC. The second step is to decide the similarity between individuals, and to research the optimum solutions by simplex method in reconstructive search space. Two numerical examples are also presented in this paper to comparing with conventional methods.

  • PDF

The Improved Joint Bayesian Method for Person Re-identification Across Different Camera

  • Hou, Ligang;Guo, Yingqiang;Cao, Jiangtao
    • Journal of Information Processing Systems
    • /
    • v.15 no.4
    • /
    • pp.785-796
    • /
    • 2019
  • Due to the view point, illumination, personal gait and other background situation, person re-identification across cameras has been a challenging task in video surveillance area. In order to address the problem, a novel method called Joint Bayesian across different cameras for person re-identification (JBR) is proposed. Motivated by the superior measurement ability of Joint Bayesian, a set of Joint Bayesian matrices is obtained by learning with different camera pairs. With the global Joint Bayesian matrix, the proposed method combines the characteristics of multi-camera shooting and person re-identification. Then this method can improve the calculation precision of the similarity between two individuals by learning the transition between two cameras. For investigating the proposed method, it is implemented on two compare large-scale re-ID datasets, the Market-1501 and DukeMTMC-reID. The RANK-1 accuracy significantly increases about 3% and 4%, and the maximum a posterior (MAP) improves about 1% and 4%, respectively.

Transformer-based dense 3D reconstruction from RGB images (RGB 이미지에서 트랜스포머 기반 고밀도 3D 재구성)

  • Xu, Jiajia;Gao, Rui;Wen, Mingyun;Cho, Kyungeun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.11a
    • /
    • pp.646-647
    • /
    • 2022
  • Multiview stereo (MVS) 3D reconstruction of a scene from images is a fundamental computer vision problem that has been thoroughly researched in recent times. Traditionally, MVS approaches create dense correspondences by constructing regularizations and hand-crafted similarity metrics. Although these techniques have achieved excellent results in the best Lambertian conditions, traditional MVS algorithms still contain a lot of artifacts. Therefore, in this study, we suggest using a transformer network to accelerate the MVS reconstruction. The network is based on a transformer model and can extract dense features with 3D consistency and global context, which are necessary to provide accurate matching for MVS.

Automatic Coastline Extraction and Change Detection Monitoring using LANDSAT Imagery (LANDSAT 영상을 이용한 해안선 자동 추출과 변화탐지 모니터링)

  • Kim, Mi Kyeong;Sohn, Hong Gyoo;Kim, Sang Pil;Jang, Hyo Seon
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.21 no.4
    • /
    • pp.45-53
    • /
    • 2013
  • Global warming causes sea levels to rise and global changes apparently taking place including coastline changes. Coastline change due to sea level rise is also one of the most significant phenomena affected by global climate change. Accordingly, Coastline change detection can be utilized as an indicator of representing global climate change. Generally, Coastline change has happened mainly because of not only sea level rise but also artificial factor that is reclaimed land development by mud flat reclamation. However, Arctic coastal areas have been experienced serious change mostly due to sea level rise rather than other factors. The purposes of this study are automatic extraction of coastline and identifying change. In this study, in order to extract coastline automatically, contrast of the water and the land was maximized utilizing modified NDWI(Normalized Difference Water Index) and it made automatic extraction of coastline possibile. The imagery converted into modified NDWI were applied image processing techniques in order that appropriate threshold value can be found automatically to separate the water and land. Then the coastline was extracted through edge detection algorithm and changes were detected using extracted coastlines. Without the help of other data, automatic extraction of coastlines using LANDSAT was possible and similarity was found by comparing NLCD data as a reference data. Also, the results of the study area that is permafrost always frozen below $0^{\circ}C$ showed quantitative changes of the coastline and verified that the change was accelerated.

Application of Spatial Autocorrelation for the Spatial Distribution Pattern Analysis of Marine Environment - Case of Gwangyang Bay - (해양환경 공간분포 패턴 분석을 위한 공간자기상관 적용 연구 - 광양만을 사례 지역으로 -)

  • Choi, Hyun-Woo;Kim, Kye-Hyun;Lee, Chul-Yong
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.10 no.4
    • /
    • pp.60-74
    • /
    • 2007
  • For quantitative analysis of spatio-temporal distribution pattern on marine environment, spatial autocorrelation statistics on the both global and local aspects was applied to the observed data obtained from Gwangyang Bay in South Sea of Korea. Global indexes such as Moran's I and General G were used for understanding environmental distribution pattern in the whole study area. LISAs (local indicators of spatial association) such as Moran's I ($I_i$) and $G_i{^*}$ were considered to find similarity between a target feature and its neighborhood features and to detect hot spot and/or cold spot. Additionally, the significance test on clustered patterns by Z-scores was carried out. Statistical results showed variations of spatial patterns quantitatively in the whole year. Then all of general water quality, nutrients, chlorophyll-a and phytoplankton had strong clustered pattern in summer. When global indexes showed strong clustered pattern, the front region with a negative $I_i$ which means a strong spatial variation was observed. Also, when global indexes showed random pattern, hot spot and/or cold spot were/was found in the small local region with a local index $G_i{^*}$. Therefore, global indexes were useful for observing the strength and time series variations of clustered patterns in the whole study area, and local indexes were useful for tracing the location of hot spot and/or cold spot. Quantification of both spatial distribution pattern and clustering characteristics may play an important role to understand marine environment in depth and to find the reasons for spatial pattern.

  • PDF

Bacterial Community Structure Shift Driven by Salinity: Analysis of DGGE Band Patterns from Freshwater to Seawater of Hyeongsan River, Korea (염도의 변화에 따른 미생물 군집의 변화: 경북 형산강 하류 미생물 군집 변화의 DGGE pattern 분석)

  • Beck, Bo Ram;Holzapfel, Wilhelm;Hwang, Cher Won;Do, Hyung Ki
    • Journal of Life Science
    • /
    • v.23 no.3
    • /
    • pp.406-414
    • /
    • 2013
  • The influence of a gradual increase in salinity on the diversity of aquatic bacterial in rivers was demonstrated. The denaturing gradient gel electrophoresis (DGGE) was used to analyze the bacterial community shift downstream in the Hyeongsan River until it joins the open ocean. Four water samples were taken from the river showing the salinity gradients of 0.02%, 1.48%, 2.63%, and 3.62%. The samples were collected from four arbitrary stations in 2.91 km intervals on average, and a DGGE analysis was performed. Based on the results of this analysis, phylogenetic similarity identification, tree analysis, and a comparison of each station were performed. The results strongly suggested that the response of the bacterial community response was concomitant to gradual changes in salinity, which implies that salt concentration is a major factor in shifting the microbiota in aquatic habitats. The results also imply a huge diversity in a relatively small area upstream from the river mouth, compared to that in open oceans or coastal regions. Therefore, areas downstream towards a river mouth or delta are could be good starting points in the search for new bacterial species and strains ("biotypes").

Generating Pylogenetic Tree of Homogeneous Source Code in a Plagiarism Detection System

  • Ji, Jeong-Hoon;Park, Su-Hyun;Woo, Gyun;Cho, Hwan-Gue
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.6
    • /
    • pp.809-817
    • /
    • 2008
  • Program plagiarism is widespread due to intelligent software and the global Internet environment. Consequently the detection of plagiarized source code and software is becoming important especially in academic field. Though numerous studies have been reported for detecting plagiarized pairs of codes, we cannot find any profound work on understanding the underlying mechanisms of plagiarism. In this paper, we study the evolutionary process of source codes regarding that the plagiarism procedure can be considered as evolutionary steps of source codes. The final goal of our paper is to reconstruct a tree depicting the evolution process in the source code. To this end, we extend the well-known bioinformatics approach, a local alignment approach, to detect a region of similar code with an adaptive scoring matrix. The asymmetric code similarity based on the local alignment can be considered as one of the main contribution of this paper. The phylogenetic tree or evolution tree of source codes can be reconstructed using this asymmetric measure. To show the effectiveness and efficiency of the phylogeny construction algorithm, we conducted experiments with more than 100 real source codes which were obtained from East-Asia ICPC(International Collegiate Programming Contest). Our experiments showed that the proposed algorithm is quite successful in reconstructing the evolutionary direction, which enables us to identify plagiarized codes more accurately and reliably. Also, the phylogeny construction algorithm is successfully implemented on top of the plagiarism detection system of an automatic program evaluation system.

PageRank Algorithm Using Link Context (링크내역을 이용한 페이지점수법 알고리즘)

  • Lee, Woo-Key;Shin, Kwang-Sup;Kang, Suk-Ho
    • Journal of KIISE:Databases
    • /
    • v.33 no.7
    • /
    • pp.708-714
    • /
    • 2006
  • The World Wide Web has become an entrenched global medium for storing and searching information. Most people begin at a Web search engine to find information, but the user's pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is Web spamming as Google bombing that is based on the PageRank algorithm, one of the most famous Web structuring techniques. In this paper, we regard the Web as a directed labeled graph that Web pages represent nodes and the corresponding hyperlinks edges. In the present work, we define the label of an edge as having a link context and a similarity measure between link context and the target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. A motivating example is investigated in terms of the Singular Value Decomposition with which our algorithm can outperform to filter the Web spamming pages effectively.