• The Journal of the Acoustical Society of Korea
• /
• v.43 no.2
• /
• pp.234-242
• /
• 2024

We propose a passive sonar signal classification algorithm using Graph Neural Network (GNN). The proposed algorithm segments spectrograms into image patches and represents graphs through connections between adjacent image patches. Subsequently, Graph Convolutional Network (GCN) is trained using the represented graphs to classify signals. In experiments with publicly available underwater acoustic data, the proposed algorithm represents the line frequency features of spectrograms in graph form, achieving an impressive classification accuracy of 92.50 %. This result demonstrates a 8.15 % higher classification accuracy compared to conventional Convolutional Neural Network (CNN).

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.710-718
• /
• 2017

As graphs are becoming increasingly large, the costs for storing and managing data are increasing continuously. Shortest path discovery over a large graph requires long running time due to frequent disk I/Os and high complexity of the graph data. Recently, graph summarization techniques have been studied, which reduce the size of graph data and disk I/Os by representing highly dense subgraphs as a single super-node. Decompressing should be minimized for efficient shortest path discovery over the summarized graph. In this paper, we analyze the decompression performance of a summarized graph and propose an approximate technique that discovers the shortest path quickly with a minimum error ratio. We also propose an exact technique that efficiently discovered the shortest path by exploiting an index built on paths containing super-nodes. In our experiments, we showed that the proposed technique based on the summarized graph can reduce the running time by up to 70% compared with the existing techniques performed on the original graph.

• The Korean Journal of Applied Statistics
• /
• v.28 no.1
• /
• pp.49-60
• /
• 2015

Various kinds of ordination methods such as correspondence analysis and canonical correspondence analysis are used in community ecology to visualize relationships among species, sites, and environmental variables. Ter Braak (1986), Jackson and Somers (1991), Parmer (1993), compared the ordination methods using eigenvalue and distance graph. However, these methods did not show the relationship between population and biplot because they are only based on surveyed data. In this paper, a method that measures the extent to show population information to biplot was introduced to compare ordination methods objectively.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1222-1230
• /
• 2015

Segmentation of the anterior cruciate ligament (ACL) in knee MRI remains a challenging task due to its inhomogeneous signal intensity and low contrast with surrounding soft tissues. In this paper, we propose a multi-atlas-based segmentation of the ACL in knee MRI with locally-aligned probabilistic atlas (PA) in an iterative graph cuts framework. First, a novel PA generation method is proposed with global and local multi-atlas alignment by means of rigid registration. Second, with the generated PA, segmentation of the ACL is performed by maximum-aposteriori (MAP) estimation and then by graph cuts. Third, refinement of ACL segmentation is performed by improving shape prior through mask-based PA generation and iterative graph cuts. Experiments were performed with a Dice similarity coefficients of 75.0%, an average surface distance of 1.7 pixels, and a root mean squared distance of 2.7 pixels, which increased accuracy by 12.8%, 22.7%, and 22.9%, respectively, from the graph cuts with patient-specific shape constraints.

• Journal of Environmental Health Sciences
• /
• v.27 no.4
• /
• pp.99-105
• /
• 2001

도로교통소음은 많은 지역에 산재해 있으며 특히 주도로변에 거주하는 사람들에게 환경과 관련하여 매우 중요하다. 도로교통으로부터 소음수준을 계산하는데 몇가지 다른 방법들이 이용되고 있다. 이 방법들은 계산방법과 그래프식 그리고 컴퓨터 모델링 기술 등이다. 교통과 교통소음의 영향으로부터 소음을 계산하는 간단한 기술의 예측방법은 여기에 나타내었다. 이 TNS (traffic Noise Screening) 방법은 서로 다른 도로유형에 대한 일련의 도로교통소음레벨의 예측그래프로 전개된 것이다. 이 그래프는 Federal Highway Administration (FHWA) STAMINA 2.0을 이용하여 다양한 시나리오에 대한 소음 예측모델을 계산한 결과를 기초하였다. TNS에 도로의 기하학적 형태, 교통량 주행속도 그리고 도로중앙선의 거리등의 데이터를 입력시킨다. TNS 그래프는 소음영향과 연관된 교통소음예측에서 사용하는 경우 교통소음레벨의 계산을 쉽게 한다. 이 TNS 방법은 STAMINA 2.0과 같은 상세 모델링을 대신하지는 못하지만 상세 모델을 필요로 할 때 도움을 주는 도구이다 만약 소음계산들이 중요하거나 또는 시나리오가 보다 복잡하고 부가된다면 보다 상세한 모델링이 수행되어져 스크린 결과들이 나타난다.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.01a
• /
• pp.293-296
• /
• 2023

본 논문에서는 고속도로의 교통망의 연결성을 분석하고 예측하기 위하여 그래프 이론을 이용하여 접근성 지표의 알고리즘을 제안한다. 먼저 2025년 고속도로 교통망을 그래프로 나타낸 운송네트워크를 구한다. 그리고 그래프 이론의 연결수, 비교거리, 접근지표, 연결도, 산포지수, 지름 등의 개념을 이용하여 2025년 고속도로 교통망의 연결성을 분석하고 예측하기 위하여 주어진 운송네트워크로부터 다양한 접근성 지표를 쉽게 얻을 수 있는 알고리즘을 제시한다. 이를 통하여 고속도로의 운송네트워크에서 교통의 중심이 되는 도시를 찾을 수 있다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.11
• /
• pp.871-875
• /
• 2009

A software birthmark is inherent characteristics that can be used to identify a program. In this paper, we propose a new Java birthmark based on control flow graph (CFG) matching. The CFG matching consists of node matching and edge matching. To get similarities of nodes and edges of two CFGs, we apply a sequence alignment algorithm and a shortest path algorithm, respectively. To evaluate the proposed birthmark, we perform experiments on Java programs that implement various algorithms. In the experiments, the proposed birthmark shows not only high credibility and resilience but also fast runtime performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.220-223
• /
• 2018

스마트폰의 GPS 기능으로 위치 정보를 수집하여 사용자에게 서비스를 제공하는 시스템이 많아지고 있다. 이러한 GPS 기능은 위성에서 송신된 신호로 위도와 경도를 측정하여 위치를 계산한다. 하지만, 이러한 기능은 사용자가 실외에 있을 경우에만 사용이 가능한 것으로, 실내에서는 사용이 불가능하다는 단점이 있다. 최근 상용화 되고 있는 UWB 레이더 센서는 실내외에서 사용이 가능하고, 객체 탐지 및 거리측정이 간단함과 동시에 저렴하다는 장점이 있다. 본 논문에서는 UWB 레이더 센서와 표준편차를 이용하여 거리 측정 방법을 제시하고자 한다. 제시하고 있는 방법은 레이더 센서에서 나오는 raw data를 그래프화 하여 최대 탐지 거리가 몇 m 인지 파악하고, 파악된 최대 감지 거리를 일정 구간으로 나누어 구간별 거리를 측정한다. 그 후 표준편차 공식을 이용하여 객체의 유무를 판단한다. 실험 결과에서는 제시하는 방법으로 최대 거리 9.7m에서 최대 오차 0.27m 이내로 측정되는 것을 확인하였다.

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.4
• /
• pp.23-28
• /
• 2000

We introduce a new method for constructing a dynamic Delaunay triangulation for a set S of n sites in the plane under the $L_{\infty}(L_1)$ metric. We find that the quadrant neighbor graph is contained in the Delaunay triangluation and that at least one edge of each triangle in the Delaunay triangulation is contained in the quadrant neighbor graph. By using these observations and employing a range tree scheme, we present a method that dynamically maintains the $L_{\infty}(L_1)$ Delaunay triangulation under insertions and deletions in $O(log^2n)$ amortized time and O(log n) expected time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.157-162
• /
• 2011

In this paper, we propose enhanced methods of path finding based on an abstract graph with extension of search space to improve the quality of path. The proposed methods that are called simple buffering method, velocity constrained method and distance constrained method are to extract buffering-cells for using search space with valid-cells. The simple buffering method is to extract adjacent cells of valid-cells as buffering-cells. velocity constrained method and distance constrained method are based on simple buffering method, these eliminate buffering-cells through each of threshold. In experiment, proposed methods can improve the quality of path. The proposed methods are applicable to develop various kinds of telematics application, such as path finding and logistics.