• Title/Summary/Keyword: graph similarity

Search Result 142, Processing Time 0.025 seconds

A Java Birthmark Based on Similarity Between Instructions of Control Flow Graph (제어 흐름 그래프의 명령어 유사성에 기반한 자바 버스마크)

  • Park, Heewan;Lim, Hyun-il;Choi, Seokwoo;Han, Taisook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.424-427
    • /
    • 2009
  • 소프트웨어 버스마크는 프로그램을 식별하는데 사용될 수 있는 프로그램의 고유한 특징을 말한다. 본 논문에서는 자바 메소드의 제어 흐름 그래프 유사도에 기반한 자바 버스마크를 제안한다. 제어 흐름 그래프 유사도는 노드의 유사도와 에지의 유사도로 나누어 계산하였다. 노드의 유사도는 인접 노드의 유사도를 함께 고려했으며, 에지 유사도는 이미 매칭된 노드들 사이의 거리를 측정하는 방법을 사용했다. 본 논문에서 제안한 버스마크를 평가하기 위해서 서로 다른 프로그램을 구별할 수 있는 신뢰도와 프로그램 최적화나 난독화에 견딜 수 있는 강인도에 대한 실험을 하였다. 실험 결과로부터 본 논문에서 제안하는 버스마크가 기존의 정적 버스마크보다 신뢰도가 높으면서도 난독화나 컴파일러 변경에 강인하다는 것을 확인하였다.

Floop: An efficient video coding flow for unmanned aerial vehicles

  • Yu Su;Qianqian Cheng;Shuijie Wang;Jian Zhou;Yuhe Qiu
    • ETRI Journal
    • /
    • v.45 no.4
    • /
    • pp.615-626
    • /
    • 2023
  • Under limited transmission conditions, many factors affect the efficiency of video transmission. During the flight of an unmanned aerial vehicle (UAV), frequent network switching often occurs, and the channel transmission condition changes rapidly, resulting in low-video transmission efficiency. This paper presents an efficient video coding flow for UAVs working in the 5G nonstandalone network and proposes two bit controllers, including time and spatial bit controllers, in the flow. When the environment fluctuates significantly, the time bit controller adjusts the depth of the recursive codec to reduce the error propagation caused by excessive network inference. The spatial bit controller combines the spatial bit mask with the channel quality multiplier to adjust the bit allocation in space to allocate resources better and improve the efficiency of information carrying. In the spatial bit controller, a flexible mini graph is proposed to compute the channel quality multiplier. In this study, two bit controllers with end-to-end codec were combined, thereby constructing an efficient video coding flow. Many experiments have been performed in various environments. Concerning the multi-scale structural similarity index and peak signal-to-noise ratio, the performance of the coding flow is close to that of H.265 in the low bits per pixel area. With an increase in bits per pixel, the saturation bottleneck of the coding flow is at the same level as that of H.264.

Hierarchical Organization of Embryo Data for Supporting Efficient Search (배아 데이터의 효율적 검색을 위한 계층적 구조화 방법)

  • Won, Jung-Im;Oh, Hyun-Kyo;Jang, Min-Hee;Kim, Sang-Wook
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.2
    • /
    • pp.16-27
    • /
    • 2011
  • Embryo is a very early stage of the development of multicellular organism such as animals and plants. It is an important research target for studying ontogeny because the fundamental body system of multicellular organism is determined during an embryo state. Researchers in the developmental biology have a large volume of embryo image databases for studying embryos and they frequently search for an embryo image efficiently from those databases. Thus, it is crucial to organize databases for their efficient search. Hierarchical clustering methods have been widely used for database organization. However, most of previous algorithms tend to produce a highly skewed tree as a result of clustering because they do not simultaneously consider both the size of a cluster and the number of objects within the cluster. The skewed tree requires much time to be traversed in users' search process. In this paper, we propose a method that effectively organizes a large volume of embryo image data in a balanced tree structure. We first represent embryo image data as a similarity-based graph. Next, we identify clusters by performing a graph partitioning algorithm repeatedly. We check constantly the size of a cluster and the number of objects, and partition clusters whose size is too large or whose number of objects is too high, which prevents clusters from growing too large or having too many objects. We show the superiority of the proposed method by extensive experiments. Moreover, we implement the visualization tool to help users quickly and easily navigate the embryo image database.

Normalized Cross Correlation-based Multiview background Subtraction for 3D Object Reconstruction (3차원 객체 복원을 위한 정규 상관도 기반 다중 시점 배경 차분 기법)

  • Paeng, Kyunghyun;Hwang, Sung Soo;Kim, Hee-Dong;Kim, Sujung;Yoo, Jisung;Kim, Seong Dae
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.6
    • /
    • pp.228-237
    • /
    • 2013
  • In this paper, we propose a normalized cross correlation(NCC)-based multiview background subtraction method which is robust when an object and background have similar color. When the background of the capturing environment is not artificially composed, the regions in the background images which would be occluded by an object tends to have difference colors. The colors of those regions, however, becomes similar when an object enters the capturing environment. Based on this assumption, this paper proposes a concept of GoNCC(Graph of Normalized Cross Correlation). GoNCC is the distribution of NCC between a pixel in an image and pixels related by epipolar constraints with the pixel. The proposed multiview background subtraction method is performed by comparing GoNCC of the current images with the background images. To reduce computational complexity, we perform multiview background subtraction only to the pixels undetermined by single view background subtraction. Experimental results show that the proposed method is more robust to color similarity between an object and background than a single-view background subtraction method and a previous multiview background subtraction method.

Metamorphic Malware Detection using Subgraph Matching (행위 그래프 기반의 변종 악성코드 탐지)

  • Kwon, Jong-Hoon;Lee, Je-Hyun;Jeong, Hyun-Cheol;Lee, Hee-Jo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.2
    • /
    • pp.37-47
    • /
    • 2011
  • In the recent years, malicious codes called malware are having shown significant increase due to the code obfuscation to evade detection mechanisms. When the code obfuscation technique is applied to malwares, they can change their instruction sequence and also even their signature. These malwares which have same functionality and different appearance are able to evade signature-based AV products. Thus, AV venders paid large amount of cost to analyze and classify malware for generating the new signature. In this paper, we propose a novel approach for detecting metamorphic malwares. The proposed mechanism first converts malware's API call sequences to call graph through dynamic analysis. After that, the callgraph is converted to semantic signature using 128 abstract nodes. Finally, we extract all subgraphs and analyze how similar two malware's behaviors are through subgraph similarity. To validate proposed mechanism, we use 273 real-world malwares include obfuscated malware and analyze 10,100 comparison results. In the evaluation, all metamorphic malwares are classified correctly, and similar module behaviors among different malwares are also discovered.

Building change detection in high spatial resolution images using deep learning and graph model (딥러닝과 그래프 모델을 활용한 고해상도 영상의 건물 변화탐지)

  • Park, Seula;Song, Ahram
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.40 no.3
    • /
    • pp.227-237
    • /
    • 2022
  • The most critical factors for detecting changes in very high-resolution satellite images are building positional inconsistencies and relief displacements caused by satellite side-view. To resolve the above problems, additional processing using a digital elevation model and deep learning approach have been proposed. Unfortunately, these approaches are not sufficiently effective in solving these problems. This study proposed a change detection method that considers both positional and topology information of buildings. Mask R-CNN (Region-based Convolutional Neural Network) was trained on a SpaceNet building detection v2 dataset, and the central points of each building were extracted as building nodes. Then, triangulated irregular network graphs were created on building nodes from temporal images. To extract the area, where there is a structural difference between two graphs, a change index reflecting the similarity of the graphs and differences in the location of building nodes was proposed. Finally, newly changed or deleted buildings were detected by comparing the two graphs. Three pairs of test sites were selected to evaluate the proposed method's effectiveness, and the results showed that changed buildings were detected in the case of side-view satellite images with building positional inconsistencies.

Ontology-based Approach to Analyzing Commonality and Variability of Features in the Software Product Line Engineering (소프트웨어 제품 계열 공학의 온톨로지 기반 휘처 공동성 및 가변성 분석 기법)

  • Lee, Soon-Bok;Kim, Jin-Woo;Song, Chee-Yang;Kim, Young-Gab;Kwon, Ju-Hum;Lee, Tae-Woong;Kim, Hyun-Seok;Baik, Doo-Kwon
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.3
    • /
    • pp.196-211
    • /
    • 2007
  • In the Product Line Engineering (PLE), current studies about an analysis of the feature have uncertain and ad-hoc criteria of analysis based on developer’s intuition or domain expert’s heuristic approach and difficulty to extract explicit features from a product in a product line because the stakeholders lack comprehensive understanding of the features in feature modeling. Therefore, this paper proposes a model of the analyzing commonality and variability of the feature based on the Ontology. The proposed model in this paper suggests two approaches in order to solve the problems mentioned above: First, the model explicitly expresses the feature by making an individual feature attribute list based on the meta feature modeling to understand common feature. Second, the model projects an analysis model of commonality and variability using the semantic similarity between features based on the Ontology to the stakeholders. The main contribution of this paper is to improve the reusability of distinguished features on developing products of same line henceforth.

Fabrication of Three-Dimensional Scanning System for Inspection of Mineshaft Using Multichannel Lidar (다중채널 Lidar를 이용한 수직갱도 조사용 3차원 형상화 장비 구현)

  • Soolo, Kim;Jong-Sung, Choi;Ho-Goon, Yoon;Sang-Wook, Kim
    • Tunnel and Underground Space
    • /
    • v.32 no.6
    • /
    • pp.451-463
    • /
    • 2022
  • Whenever a mineshaft accidentally collapses, speedy risk assessment is both required and crucial. But onsite safety diagnosis by humans is reportedly difficult considering the additional risk of collapse of the unstable mineshaft. Generally, drones equipped with high-speed lidar sensors can be used for such inspection. However, the drone technology is restrictively applicable at very shallow depth, failing in mineshafts with depths of hundreds of meters because of the limit of wireless communication and turbulence inside the mineshaft. In previous study, a three-dimensional (3D) scanning system with a single channel lidar was fabricated and operated using towed cable in a mineshaft to a depth of 200 m. The rotation and pendulum movement errors of the measuring unit were compensated for by applying the data of inertial measuring unit and comparing the similarity between the scan data of the adjacent depths (Kim et al., 2020). However, the errors grew with scan depth. In this paper, a multi-channel lidar sensor to obtain a continuous cross-sectional image of the mineshaft from a winch system pulled from bottom upward. In this new approach, within overlapped region viewed by the multi-channel lidar, rotation error was compensated for by comparing the similarity between the scan data at the same depth. The fabricated system was applied to scan 0-165 m depth of the mineshaft with 180 m depth. The reconstructed image was depicted in a 3D graph for interpretation.

A Study on Comparing algorithms for Boxing Motion Recognition (권투 모션 인식을 위한 알고리즘 비교 연구)

  • Han, Chang-Ho;Kim, Soon-Chul;Oh, Choon-Suk;Ryu, Young-Kee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.6
    • /
    • pp.111-117
    • /
    • 2008
  • In this paper, we describes the boxing motion recognition which is used in the part of games, animation. To recognize the boxing motion, we have used two algorithms, one is principle component analysis, the other is dynamic time warping algorithm. PCA is the simplest of the true eigenvector-based multivariate analyses and often used to reduce multidimensional data sets to lower dimensions for analysis. DTW is an algorithm for measuring similarity between two sequences which may vary in time or speed. We introduce and compare PCA and DTW algorithms respectively. We implemented the recognition of boxing motion on the motion capture system which is developed in out research, and depict the system also. The motion graph will be created by boxing motion data which is acquired from motion capture system, and will be normalized in a process. The result has implemented in the motion recognition system with five actors, and showed the performance of the recognition.

  • PDF

An Empirical Comparison of Statistical Models for Pre-service Teachers' Help Networks using Binary and Valued Exponential Random Graph Models (예비교원의 도움 네트워크에 관한 통계 모형의 경험적 비교: 이항 및 가중 ERGM을 중심으로)

  • Kim, Sung-Yeun;Kim, Chong Min
    • The Journal of the Korea Contents Association
    • /
    • v.20 no.4
    • /
    • pp.658-672
    • /
    • 2020
  • The purpose of this study is to empirically compare statistical models for pre-service teachers' help networks. We identified similarities and differences based on the results of the binary and valued ERGM. Research questions are as follows: First, what are the similarities of factors influencing the binary/valued help network for pre-service teachers? Second, what are differences of factors influencing the binary/valued help network for pre-service teachers? We measured 42 pre-service teachers with focus on their help and friend networks, happiness, and personal characteristics. Results indicated that, first, the similar factors influencing the binary and valued help network of pre-service teachers were local dependencies (reciprocity, transitivity), similarity (major, gender), activity (early childhood education, negative emotion), popularity (early childhood education) and multiplicity (friend network). Second, the difference between factors affecting pre-service teacher's binary and valued help network was the effect of activity (physical education) and popularity (GPA, negative emotion). Based on these findings, we presented implications.