• 제목/요약/키워드: Graph Matching

검색결과 141건 처리시간 0.023초

A Comparison of Global Feature Extraction Technologies and Their Performance for Image Identification (영상 식별을 위한 전역 특징 추출 기술과 그 성능 비교)

  • Yang, Won-Keun;Cho, A-Young;Jeong, Dong-Seok
    • Journal of Korea Multimedia Society
    • /
    • 제14권1호
    • /
    • pp.1-14
    • /
    • 2011
  • While the circulation of images become active, various requirements to manage increasing database are raised. The content-based technology is one of methods to satisfy these requirements. The image is represented by feature vectors extracted by various methods in the content-based technology. The global feature method insures fast matching speed because the feature vector extracted by the global feature method is formed into a standard shape. The global feature extraction methods are classified into two categories, the spatial feature extraction and statistical feature extraction. And each group is divided by what kind of information is used, color feature or gray scale feature. In this paper, we introduce various global feature extraction technologies and compare their performance by accuracy, recall-precision graph, ANMRR, feature vector size and matching time. According to the experiments, the spatial features show good performance in non-geometrical modifications, and the extraction technologies that use color and histogram feature show the best performance.

STK Feature Tracking Using BMA for Fast Feature Displacement Convergence (빠른 피쳐변위수렴을 위한 BMA을 이용한 STK 피쳐 추적)

  • Jin, Kyung-Chan;Cho, Jin-Ho
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • 제36S권8호
    • /
    • pp.81-87
    • /
    • 1999
  • In general, feature detection and tracking algorithms is classified by EBGM using Garbor-jet, NNC-R and STK algorithm using pixel eigenvalue. In those algorithms, EBGM and NCC-R detect features with feature model, but STK algorithm has a characteristics of an automatic feature selection. In this paper, to solve the initial problem of NR tracking in STK algorithm, we detected features using STK algorithm in modelled feature region and tracked features with NR method. In tracking, to improve the tracking accuracy for features by NR method, we proposed BMA-NR method. We evaluated that BMA-NR method was superior to NBMA-NR in that feature tracking accuracy, since BMA-NR method was able to solve the local minimum problem due to search window size of NR.

  • PDF

An application of wave equation analysis program to pile dynamic formulae

  • Tokhi, H.;Ren, G.;Li, J.
    • Geomechanics and Engineering
    • /
    • 제9권3호
    • /
    • pp.345-360
    • /
    • 2015
  • Wave equation analysis programs (WEAP) such as GRLWEAP and TNOWave were primarily developed for pre-driving analysis. They can also be used for post-driving measurement applications with some refinements. In the case of pre-driving analysis, the programs are used for the purpose of selecting the right equipment for a given ground condition and controlling stresses during pile driving processes. Recently, the program is increasingly used for the post-driving measurement application, where an assessment based on a variety of input parameters such as hammer, driving system and dynamic behaviour of soil is carried out. The process of this type of analysis is quite simple and it is performed by matching accurately known parameters, such as from CAPWAP analysis, to the parameters used in GRLWEAP analysis. The parameters that are refined in the typical analysis are pile stresses, hammer energy, capacity, damping and quakes. Matching of these known quantities by adjusting hammer, cushion and soil parameters in the wave equation program results in blow counts or sets and stresses for other hammer energies and capacities and cushion configuration. The result of this analysis is output on a Bearing Graph that establishes a relationship between ultimate capacity and net set per blow. A further application of this refinement method can be applied to the assessment of dynamic formulae, which are extensively used in pile capacity calculation during pile driving process. In this paper, WEAP analysis is carried out to establish the relationship between the ultimate capacities and sets using the various parameters and using this relationship to recalibrate the dynamic formula. The results of this analysis presented show that some of the shortcoming of the dynamic formula can be overcome and the results can be improved by the introduction of a correction factor.

Timeline Tag Cloud Generation for Broadcasting Contents using Blog Postings (블로그 포스팅을 이용한 방송 콘텐츠 영상의 타임라인 단위 태그 클라우드 생성)

  • Son, Jeong-Woo;Kim, Hwa-Suk;Kim, Sun-Joong;Cho, Keeseong
    • Journal of KIISE
    • /
    • 제42권5호
    • /
    • pp.637-641
    • /
    • 2015
  • Due to the recent increasement of user created contents like SNS, blog posts, and so on, broadcast contents are actively re-construction by its users. Especially, on some genres like drama, movie, various information from cars and film sites to clothes and watches in a content is spreaded out to other users through blog postings. Since such information can be an additional information for the content, they can be used for providing high-quality broadcast services. For this purpose, in this paper, we propose timeline tag cloud generation method for broadcasting contents. In the proposed method, blog postings on the target contents are first gathered and then, images and words around images are extracted from a blog post as a tag set. An extracted tag set is tagged on a specific timeline of the target content. In experiments, to prove the efficiency of the proposed method, we evaluated the performances of the proposed image matching and tag cloud generation methods.

A system for recommending audio devices based on frequency band analysis of vocal component in sound source (음원 내 보컬 주파수 대역 분석에 기반한 음향기기 추천시스템)

  • Jeong-Hyun, Kim;Cheol-Min, Seok;Min-Ju, Kim;Su-Yeon, Kim
    • Journal of Korea Society of Industrial Information Systems
    • /
    • 제27권6호
    • /
    • pp.1-12
    • /
    • 2022
  • As the music streaming service and the Hi-Fi market grow, various audio devices are being released. As a result, consumers have a wider range of product choices, but it has become more difficult to find products that match their musical tastes. In this study, we proposed a system that extracts the vocal component from the user's preferred sound source and recommends the most suitable audio device to the user based on this information. To achieve this, first, the original sound source was separated using Python's Spleeter Library, the vocal sound source was extracted, and the result of collecting frequency band data of manufacturers' audio devices was shown in a grid graph. The Matching Gap Index (MGI) was proposed as an indicator for comparing the frequency band of the extracted vocal sound source and the measurement data of the frequency band of the audio devices. Based on the calculated MGI value, the audio device with the highest similarity with the user's preference is recommended. The recommendation results were verified using equalizer data for each genre provided by sound professional companies.

Graph-based ISA/instanceOf Relation Extraction from Category Structure (그래프 구조를 이용한 카테고리 구조로부터 상하위 관계 추출)

  • Choi, Dong-Hyun;Choi, Key-Sun
    • Journal of KIISE:Software and Applications
    • /
    • 제37권6호
    • /
    • pp.464-469
    • /
    • 2010
  • In this paper, we propose a method to extract isa/instanceOf relation from category structure. Existing researches use lexical patterns to get isa/instanceOf relation from the category structure, e.g. head word matching, to determine whether the given category link is isa/instanceOf relation or not. In this paper, we propose a new approach which analyzes other category links related to the given category link to determine whether the given category link is isa/instanceOf relation or not. The experimental result shows that our algorithm can cover many cases which the existing algorithms were not able to deal with.

A Study for Distribution Methods Between Superelevation and Side Friction Factor Reflecting Ergonomic Characteristics by Increasing Design Speed (설계속도 상향에 따른 인간공학적 특성을 반영한 편경사와 횡방향마찰계수 분배방법에 관한 연구)

  • Jeong, Seungwon;Kim, Sangyoup;Choi, Jaisung;Kim, Hongjin;Jang, Taeyoun
    • International Journal of Highway Engineering
    • /
    • 제15권3호
    • /
    • pp.103-115
    • /
    • 2013
  • PURPOSES: The purpose of this study is to develop a method for distribution between superelevation and side friction factor by increasing design speed. METHODS: First of all, a method for distribution between superelevation and side friction factor and a theory for the functional formula of side friction factor in compliance with horizontal radius applied in South Korea and the United States are considered. Especially, design speed of 140km/h and numerical value of design elements are applied to the theory for the functional formula of side friction factor in AASHTO's methods. Also, the anxiety EEG upon running speed is measured to reflect ergonomic characteristics through field experiments at seven curve sections of the West Coast Freeway, and this data is applied to graph for the functional formula of side friction factor. RESULTS : Matching side friction factor against the anxiety EEG, the results that a critical points of driver's anxiety EEG sharply increase locate under existing parabola are figured out. CONCLUSIONS : Therefore, we could get a new type of the functional formula that driver's driving comfortability is guaranteed if the existing the functional formula of side friction factor goes down under boundary of the critical points of the anxiety EEG.

Fault diagnosis using FCM and TAM recall process (FCM과 TAM recall 과정을 이용한 고장진단)

  • 이기상;박태홍;정원석;최낙원
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
    • /
    • pp.233-238
    • /
    • 1993
  • In this paper, two diagnosis algorithms using the simple fuzzy, cognitive map (FCM) that is an useful qualitative model are proposed. The first basic algorithm is considered as a simple transition of Shiozaki's signed directed graph approach to FCM framework. And the second one is an extended version of the basic algorithm. In the extension, three important concepts, modified temporal associative memory (TAM) recall, temporal pattern matching algorithm and hierarchical decomposition are adopted. As the resultant diagnosis scheme takes short computation time, it can be used for on-line fault diagnosis of large scale and complex processes that conventional diagnosis methods cannot be applied. The diagnosis system can be trained by the basic algorithm and generates FCM model for every experienced process fault. In on-line application, the self-generated fault model FCM generates predicted pattern sequences, which are compared with observed pattern sequences to declare the origin of fault. In practical case, observed pattern sequences depend on transport time. So if predicted pattern sequences are different from observed ones, the time weighted FCM with transport delay can be used to generate predicted ones. The fault diagnosis procedure can be completed during the actual propagation since pattern sequences of tvo different faults do not coincide in general.

  • PDF

Ontology Knowledge based Information Retrieval for User Query Interpretation (사용자 질의 의미 해석을 위한 온톨로지 지식 기반 검색)

  • Kim, Nanju;Pyo, Hyejin;Jeong, Hoon;Choi, Euiin
    • Journal of Digital Convergence
    • /
    • 제12권6호
    • /
    • pp.245-252
    • /
    • 2014
  • Semantic search promises to provide more accurate result than present-day keyword matching-based search by using the knowledge base represented logically. But, the ordinary users don't know well the complex formal query language and schema of the knowledge base. So, the system should interpret the meaning of user's keywords. In this paper, we describe a user query interpretation system for the semantic retrieval of multimedia contents. Our system is ontological knowledge base-driven in the sense that the interpretation process is integrated into a unified structure around a knowledge base, which is built on domain ontologies.

Speedup Analysis Model for High Speed Network based Distributed Parallel Systems (고속 네트웍 기반의 분산병렬시스템에서의 성능 향상 분석 모델)

  • 김화성
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제26권12C호
    • /
    • pp.218-224
    • /
    • 2001
  • The objective of Distributed Parallel Computing is to solve the computationally intensive problems, which have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. In this paper, we propose a computational model including the generalized graph representation method of distributed parallel systems for speedup analysis, and analyze how the super-linear speedup is achieved when scheduling of programs with diverse embedded parallelism modes onto a distributed heterogeneous supercomputing network environment. The proposed representation method can also be applied to simple homogeneous or heterogeneous systems whose components are heterogeneous only in terms of the processor speed. In order to obtain the core speedup, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled while minimizing the communication overhead.

  • PDF