• Title/Summary/Keyword: Structure-based search

Search Result 747, Processing Time 0.029 seconds

Deinterlacing Method for improving Motion Estimator based on multi arithmetic Architecture (다중연산구조기반의 고밀도 성능향상을 위한 움직임추정의 디인터레이싱 방법)

  • Lee, Kang-Whan
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.1
    • /
    • pp.49-55
    • /
    • 2007
  • To improved the multi-resolution fast hierarchical motion estimation by using de-interlacing algorithm that is effective in term of both performance and VLSI implementation, is proposed so as to cover large search area field-based as well as frame based image processing in SoC design. In this paper, we have simulated a various picture mode M=2 or M=3. As a results, the proposed algorithm achieved the motion estimation performance PSNR compare with the full search block matching algorithm, the average performance degradation reached to -0.7dB, which did not affect on the subjective quality of reconstructed images at all. And acquiring the more desirable to adopt design SoC for the fast hierarchical motion estimation, we exploit foreground and background search algorithm (FBSA) base on the dual arithmetic processor element(DAPE). It is possible to estimate the large search area motion displacement using a half of number PE in general operation methods. And the proposed architecture of MHME improve the VLSI design hardware through the proposed FBSA structure with DAPE to remove the local memory. The proposed FBSA which use bit array processing in search area can improve structure as like multiple processor array unit(MPAU).

Genetically Optimized Neurofuzzy Networks: Analysis and Design (진화론적 최적 뉴로퍼지 네트워크: 해석과 설계)

  • 박병준;김현기;오성권
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.8
    • /
    • pp.561-570
    • /
    • 2004
  • In this paper, new architectures and comprehensive design methodologies of Genetic Algorithms(GAs) based Genetically optimized Neurofuzzy Networks(GoNFN) are introduced, and a series of numeric experiments are carried out. The proposed GoNFN is based on the rule-based Neurofuzzy Networks(NFN) with the extended structure of the premise and the consequence parts of fuzzy rules being formed within the networks. The premise part of the fuzzy rules are designed by using space partitioning in terms of fuzzy sets defined in individual variables. In the consequence part of the fuzzy rules, three different forms of the regression polynomials such as constant, linear and quadratic are taken into consideration. The structure and parameters of the proposed GoNFN are optimized by GAs. GAs being a global optimization technique determines optimal parameters in a vast search space. But it cannot effectively avoid a large amount of time-consuming iteration because GAs finds optimal parameters by using a given space. To alleviate the problems, the dynamic search-based GAs is introduced to lead to rapidly optimal convergence over a limited region or a boundary condition. In a nutshell, the objective of this study is to develop a general design methodology o GAs-based GoNFN modeling, come up a logic-based structure of such model and propose a comprehensive evolutionary development environment in which the optimization of the model can be efficiently carried out both at the structural as well as parametric level for overall optimization by utilizing the separate or consecutive tuning technology. To evaluate the performance of the proposed GoNFN, the models are experimented with the use of several representative numerical examples.

The Multimedia Contents Search System based on Ontology (온톨로지 기반의 멀티미디어 콘텐츠 검색 시스템)

  • Hwang, Chi-Gon;Moon, Seok-Jae;Lee, Daesung;Yoon, Chang-Pyo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.6
    • /
    • pp.1354-1359
    • /
    • 2013
  • With the development of multimedia and network technology, the production of multimedia contents is rapidly increasing. Meanwhile, the technology to search and use the contents is still insufficient. There are standards for multimedia contents to address the problem, but they cannot fully support diverse multimedia data types or ensure their interoperability. In this paper, an ontology-based content search system is proposed to ensure the interoperability of multimedia contents. The ontology is configured by presenting the rules for it using the schema structure of the multimedia description scheme (MDS) of MPEG-7. Based on this ontology, This paper extend multimedia relationship based on ontology, thus established the semantic retrieval system.

Identification of Fuzzy Inference Systems Using a Multi-objective Space Search Algorithm and Information Granulation

  • Huang, Wei;Oh, Sung-Kwun;Ding, Lixin;Kim, Hyun-Ki;Joo, Su-Chong
    • Journal of Electrical Engineering and Technology
    • /
    • v.6 no.6
    • /
    • pp.853-866
    • /
    • 2011
  • We propose a multi-objective space search algorithm (MSSA) and introduce the identification of fuzzy inference systems based on the MSSA and information granulation (IG). The MSSA is a multi-objective optimization algorithm whose search method is associated with the analysis of the solution space. The multi-objective mechanism of MSSA is realized using a non-dominated sorting-based multi-objective strategy. In the identification of the fuzzy inference system, the MSSA is exploited to carry out parametric optimization of the fuzzy model and to achieve its structural optimization. The granulation of information is attained using the C-Means clustering algorithm. The overall optimization of fuzzy inference systems comes in the form of two identification mechanisms: structure identification (such as the number of input variables to be used, a specific subset of input variables, the number of membership functions, and the polynomial type) and parameter identification (viz. the apexes of membership function). The structure identification is developed by the MSSA and C-Means, whereas the parameter identification is realized via the MSSA and least squares method. The evaluation of the performance of the proposed model was conducted using three representative numerical examples such as gas furnace, NOx emission process data, and Mackey-Glass time series. The proposed model was also compared with the quality of some "conventional" fuzzy models encountered in the literature.

Splog Detection Using Post Structure Similarity and Daily Posting Count (포스트의 구조 유사성과 일일 발행수를 이용한 스플로그 탐지)

  • Beak, Jee-Hyun;Cho, Jung-Sik;Kim, Sung-Kwon
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.2
    • /
    • pp.137-147
    • /
    • 2010
  • A blog is a website, usually maintained by an individual, with regular entries of commentary, descriptions of events, or other material such as graphics or video. Entries are commonly displayed in reverse chronological order. Blog search engines, like web search engines, seek information for searchers on blogs. Blog search engines sometimes output unsatisfactory results, mainly due to spam blogs or splogs. Splogs are blogs hosting spam posts, plagiarized or auto-generated contents for the sole purpose of hosting advertizements or raising the search rankings of target sites. This thesis focuses on splog detection. This thesis proposes a new splog detection method, which is based on blog post structure similarity and posting count per day. Experiments based on methods proposed a day show excellent result on splog detection tasks with over 90% accuracy.

Development of Reliability-Based Optimum Design of High-Speed Railway Bridges Considering Structure-Rail Longitudinal Interaction and Structure-Vehicle Interaction Using Heuristic Decision Method (Heuristic Decision Method를 이용하여 구조물-궤도 종방향 상호작용 및 구조물-차량 상호작용을 고려한 고속철도 교량의 신뢰성 최적설계 기법 개발)

  • Ihm, Yeong-Rok
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.10 no.3
    • /
    • pp.31-38
    • /
    • 2010
  • In this study, it is suggested that it has to reliability-based design methodology with respect to bridge structure-rail longitudinal interaction and bridge structure-vehicle interaction. For the structural analysis, commercial package, ABAQUS, are used for a three-dimensional finite element analysis. The optimization process utilizes a well-known optimizer, ADS(Automated Design Synthesis). Optimization technique is utilized the ALM-BFGS method for global area search and Golden Section Method for 1-D search. In general, ALM-BFGS method don't need the 1-D search, and that algorithm converge a 0.1~0.2 of Push-Off factor. But in this study, value of Push-Off factor is used 90, therefore 1-D search should be needed for effective convergency. That algorithm contains the "heuristic decision method". As a result of optimum design of 2-main steel girder birdge with 5${\times}$(1@50m), design methodology suggested in this study was demonstrated more economic and efficient than existing design and LCC optimization not considering bridge-rail longitudinal interaction and bridge-vehicle interaction.

Protein Backbone Torsion Angle-Based Structure Comparison and Secondary Structure Database Web Server

  • Jung, Sunghoon;Bae, Se-Eun;Ahn, Insung;Son, Hyeon S.
    • Genomics & Informatics
    • /
    • v.11 no.3
    • /
    • pp.155-160
    • /
    • 2013
  • Structural information has been a major concern for biological and pharmaceutical studies for its intimate relationship to the function of a protein. Three-dimensional representation of the positions of protein atoms is utilized among many structural information repositories that have been published. The reliability of the torsional system, which represents the native processes of structural change in the structural analysis, was partially proven with previous structural alignment studies. Here, a web server providing structural information and analysis based on the backbone torsional representation of a protein structure is newly introduced. The web server offers functions of secondary structure database search, secondary structure calculation, and pair-wise protein structure comparison, based on a backbone torsion angle representation system. Application of the implementation in pair-wise structural alignment showed highly accurate results. The information derived from this web server might be further utilized in the field of ab initio protein structure modeling or protein homology-related analyses.

Development of Search Method using Semantic technologies about RESTful Web Services (시맨틱 기술을 활용한 RESTful 웹서비스의 검색 기법 개발)

  • Cha, Seung-Jun;Choi, Yun-Jeong;Lee, Kyu-Chul
    • Journal of Korea Spatial Information System Society
    • /
    • v.12 no.1
    • /
    • pp.100-104
    • /
    • 2010
  • Recently with advent of Web 2.0, RESTful Web Services are becoming increasing trend to emphasize Web as platform. There are already many services and the number of service increases in very fast pace. So it is difficult to find the service what we want by keyword based search. To solve this problem, we developed the search method using sem antic technologies about RESTful Web Services. For that, first we define the system structure and model the description format based on the integrated search system for OpenAPIs, and then we add Semantic Markup (tagging, semantic annotation) on the HTML description pages. Next we extract RDF document from them and store it in service repository. Based on the keywords that are extended by means of ontology, the developed system provides more purified and extended results than similarity-based keyword searching system.

A New Pipelined Binary Search Architecture for IP Address Lookup (IP 어드레스 검색을 위한 새로운 pipelined binary 검색 구조)

  • Lim Hye-Sook;Lee Bo-Mi;Jung Yeo-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1B
    • /
    • pp.18-28
    • /
    • 2004
  • Efficient hardware implementation of address lookup is one of the most important design issues of internet routers. Address lookup significantly impacts router performance since routers need to process tens-to-hundred millions of packets per second in real time. In this paper, we propose a practical IP address lookup structure based on the binary tree of prefixes of different lengths. The proposed structure produces multiple balanced trees, and hence it solve the issues due to the unbalanced binary prefix tree of the existing scheme. The proposed structure is implemented using pipelined binary search combined with a small size TCAM. Performance evaluation results show that the proposed architecture requires a 2000-entry TCAM and total 245 kbyte SRAMs to store about 30,000 prefix samples from MAE-WEST router, and an address lookup is achieved by a single memory access. The proposed scheme scales very well with both of large databases and longer addresses as in IPv6.

An Index Structure for Efficiently Handling Dynamic User Preferences and Multidimensional Data (다차원 데이터 및 동적 이용자 선호도를 위한 색인 구조의 연구)

  • Choi, Jong-Hyeok;Yoo, Kwan-Hee;Nasridinov, Aziz
    • Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
    • /
    • v.7 no.7
    • /
    • pp.925-934
    • /
    • 2017
  • R-tree is index structure which is frequently used for handling spatial data. However, if the number of dimensions increases, or if only partial dimensions are used for searching the certain data according to user preference, the time for indexing is greatly increased and the efficiency of the generated R-tree is greatly reduced. Hence, it is not suitable for the multidimensional data, where dimensions are continuously increasing. In this paper, we propose a multidimensional hash index, a new multidimensional index structure based on a hash index. The multidimensional hash index classifies data into buckets of euclidean space through a hash function, and then, when an actual search is requested, generates a hash search tree for effective searching. The generated hash search tree is able to handle user preferences in selected dimensional space. Experimental results show that the proposed method has better indexing performance than R-tree, while maintaining the similar search performance.