• Title/Summary/Keyword: part-matching

Search Result 461, Processing Time 0.026 seconds

Implementation of Intelligent Expert System for Color Measuring/Matching (칼라 매저링/매칭용 지능형 전문가 시스템의 구현)

  • An, Tae-Cheon;Jang, Gyeong-Won;O, Seong-Gwon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.7
    • /
    • pp.589-598
    • /
    • 2002
  • The color measuring/matching expert system is implemented with a new color measuring method that combines intelligent algorithms with image processing techniques. Color measuring part of the proposed system preprocesses the scanned original color input images to eliminate their distorted components by means of the image histogram technique of image pixels, and then extracts RGB(Red, Green, Blue)data among color information from preprocessed color input images. If the extracted RGB color data does not exist on the matching recipe databases, we can measure the colors for the user who want to implement the model that can search the rules for the color mixing information, using the intelligent modeling techniques such as fuzzy inference system and adaptive neuro-fuzzy inference system. Color matching part can easily choose images close to the original color for the user by comparing information of preprocessed color real input images with data-based measuring recipe information of the expert, from the viewpoint of the delta Eformula used in practical process.

A Fast String Matching Scheme without using Buffer for Linux Netfilter based Internet Worm Detection (리눅스 넷필터 기반의 인터넷 웜 탐지에서 버퍼를 이용하지 않는 빠른 스트링 매칭 방법)

  • Kwak, Hu-Keun;Chung, Kyu-Sik
    • The KIPS Transactions:PartC
    • /
    • v.13C no.7 s.110
    • /
    • pp.821-830
    • /
    • 2006
  • As internet worms are spread out worldwide, the detection and filtering of worms becomes one of hot issues in the internet security. As one of implementation methods to detect worms, the Linux Netfilter kernel module can be used. Its basic operation for worm detection is a string matching where coming packet(s) on the network is/are compared with predefined worm signatures(patterns). A worm can appear in a packet or in two (or more) succeeding packets where some part of worm is in the first packet and its remaining part is in its succeeding packet(s). Assuming that the maximum length of a worm pattern is less than 1024 bytes, we need to perform a string matching up to two succeeding packets of 2048 bytes. To do so, Linux Netfilter keeps the previous packet in buffer and performs matching with a combined 2048 byte string of the buffered packet and current packet. As the number of concurrent connections to be handled in the worm detection system increases, the total size of buffer (memory) increases and string matching speed becomes low In this paper, to reduce the memory buffer size and get higher speed of string matching, we propose a string matching scheme without using buffer. The proposed scheme keeps the partial matching result of the previous packet with signatures and has no buffering for previous packet. The partial matching information is used to detect a worm in the two succeeding packets. We implemented the proposed scheme by modifying the Linux Netfilter. Then we compared the modified Linux Netfilter module with the original Linux Netfilter module. Experimental results show that the proposed scheme has 25% lower memory usage and 54% higher speed compared to the original scheme.

Performance Analysis of Matching Cost Functions of Stereo Matching Algorithm for Making 3D Contents (3D 콘텐츠 생성에서의 스테레오 매칭 알고리즘에 대한 매칭 비용 함수 성능 분석)

  • Hong, Gwang-Soo;Jeong, Yeon-Kyu;Kim, Byung-Gyu
    • Convergence Security Journal
    • /
    • v.13 no.3
    • /
    • pp.9-15
    • /
    • 2013
  • Calculating of matching cost is an important for efficient stereo matching. To investigate the performance of matching process, the concepts of the existing methods are introduced. Also we analyze the performance and merits of them. The simplest matching costs assume constant intensities at matching image locations. We consider matching cost functions which can be distinguished between pixel-based and window-based approaches. The Pixel-based approach includes absolute differences (AD) and sampling-intensitive absolute differences (BT). The window-based approach includes the sum of the absolute differences, the sum of squared differences, the normalized cross-correlation, zero-mean normalized cross-correlation, census transform, and the absolute differences census transform (AD-Census). We evaluate matching cost functions in terms of accuracy and time complexity. In terms of the accuracy, AD-Census method shows the lowest matching error ratio (the best solution). The ZNCC method shows the lowest matching error ratio in non-occlusion and all evaluation part. But it performs high matching error ratio at the discontinuities evaluation part due to blurring effect in the boundary. The pixel-based AD method shows a low complexity in terms of time complexity.

A Study on the Design of Operation and Control Solution for IED based Digital Switchgear Panel (IED기반 디지털 수배전반의 운전제어 솔루션 설계)

  • Ko, Yun-Seok
    • Proceedings of the KIEE Conference
    • /
    • 2006.07a
    • /
    • pp.141-142
    • /
    • 2006
  • In this paper, DSPOCS(Digital Switchgear Panel Operation and Control Solution) is designed, which is the intelligent inference operation and control solution of substation based on IED. DSPOCS is designed as a scheduled monitoring and control task and a real-time alarm inference task, and is interlinked with BRES in the required case. The intelligent alarm inference task consists of the alarm knowledge generation part and the real-time pattern matching part The alarm knowledge generation part generates automatically alarm knowledge from DB and saves it in alarm KB. On the other hand, the pattern matching part inferences the real-time event by comparing the real-time event information furnished from IEDs of substation with the patterns of the saved alarm knowledge base.

  • PDF

Fixture Planning Using Case-Based Reasoning (사례기반 추론방법을 이용한 치공구의 선정)

  • 현상필;이홍희
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.22 no.51
    • /
    • pp.129-138
    • /
    • 1999
  • The aim of this research is the development of an automated fixture planning system for prismatic parts using the case-based reasoning (CBR). CBR is the problem solving paradigm that uses the similarity between a new problem and old cases to solve the new problem. This research uses CBR for the fixture planning. A case is composed with the information of the part, the components of fixture and the method of fixing for the part. The basic procedure is the retrieval and adaptation for the case, and this research presents the method of retrieval that selects most similar case to the new situation. The retrieval-step is divided into an index matching and an aggregated matching. The adaptation is accomplished by the modification, which transforms the selected case to the solution of the situation of the input part by the specified CBR algorithm. The components of fixture and the method of fixing are determined for a new part by the procedure.

  • PDF

A Fast Digital Elevation Model Extraction Algorithm Using Gradient Correlation (Gradient Correlation을 이용한 고속 수치지형표고 모델 추출 방법)

  • Chul Soo Ye;Byung Min Jeon;Kwae Hi Lee
    • Korean Journal of Remote Sensing
    • /
    • v.14 no.3
    • /
    • pp.250-261
    • /
    • 1998
  • The purpose of this paper is to extract fast DEM (Digital Elevation Model) using satellite images. DEM extraction consists of three parts. First part is the modeling of satellite position and attitude, second part is the matching of two images to find corresponding points of them and third part is to calculate the elevation of each point by using the results of the first and second part. The position and attitude modeling of satellite is processed by using GCPs. A area based matching method is used to find corresponding points between the stereo satellite images. The elevation of each point is calculated using the exterior orientation parameters obtained from modeling and conjugate points from matching. In the DEM generation system, matching procedure holds most of a processing time, therefore to reduce the time for matching, a new fast matching algorithm using gradient correlation and fast similarity measure calculation method is proposed. In this paper, the SPOT satellite images, level 1A 6000$\times$6000 panchromatic images are used to extract DEM. The experiment result shows the possibility of fast DEM extraction with the satellite images.

Web-based Information System Construction of Animal Manure Matching Service for Recycling Agriculture (경축순환농업을 위한 가축분뇨 자원화 웹기반 정보은행 구축)

  • Ryoo, Jong-Won;Choi, Deog-Cheon
    • Korean Journal of Organic Agriculture
    • /
    • v.21 no.1
    • /
    • pp.1-18
    • /
    • 2013
  • Animal and crop production systems were integrated on a single farm. This integrated farming system recycled nutrients on the farm. The separation of animal and crop production with the introduction of cheap commercial fertilizers, farms were not used land-applied manure. The on-line manure matching is one of the emerging business in the achievement of recycling and resource recovery. The manure matching actively promotes the reuse and recycling of by-products and manure. This study constructs to manure matching information system to solve the exchange problems between herders and croppers. Manure matching web sites designed. This paper introduces a web-based animal manure matching system. A manure matching service, part of the manure transport, links farmers who produce excess manure with farmers who can use the manure. Farmers registered with the service have requested manure. The manure matching service supports the transport project by linking farmers with excess manure with those farmers who can utilize the manure safely as a nutrient source. The goal of the service is to protect water quality by fostering efficient land application. Benefits to those who use the manure network include reduced disposal costs, lower purchase costs and recycling of manure. The manure matching is based on the principle that 'one persons waste is another person's fertilizer.' It provides a free online matchmaking service for environmentally safe manure recycling management system.

Effectiveness Evaluations of Subsequence Matching Methods Using KOSPI Data (한국 주식 데이터를 이용한 서브시퀀스 매칭 방법의 효과성 평가)

  • Yoo Seung Keun;Lee Sang Ho
    • The KIPS Transactions:PartD
    • /
    • v.12D no.3 s.99
    • /
    • pp.355-364
    • /
    • 2005
  • Previous researches on subsequence matching have been focused on how to make indexes in order to speed up the matching time, and do not take into account the effectiveness issues of subsequence matching methods. This paper considers the effectiveness of subsequence matching methods and proposes two metrics for effectiveness evaluations of subsequence matching algorithms. We have applied the proposed metrics to Korean stock data and five known matching algorithms. The analysis on the empirical data shows that two methods (i.e., the method supporting normalization, and the method supporting scaling and shifting) outperform the others in terms of the effectiveness of subsequence matching.

The Characteristics of Electromagnetic Wave Absorption in Sintered and Composite Ni-Zn Ferrites (니켈-아연 페라이트 소결체와 복합체의 전파흡수특성)

  • 조성백;오재희
    • Journal of the Korean Ceramic Society
    • /
    • v.32 no.1
    • /
    • pp.25-30
    • /
    • 1995
  • The frequenc dependence of magnetic permeability($\mu$r) and dielectric constant($\varepsilon$r) in MHz-GHz frequency range and their relationships with microwave absorbing properties were investigated in sintered and composite Ni-Zn ferrites, respectively. It was confirmed that zero reflection condition was required the real parts of permeability and permittivity in sintered specimen, and the complex permeability, permittivity and dielectric loss tangent in composite specimen. The real part of permittivity varied with the replacement of nickel by manganese in sintered Ni-Zn ferrite. Therefore, we could control the matching frequency and matching thickness.

  • PDF