• Title/Summary/Keyword: space filtering

Search Result 346, Processing Time 0.029 seconds

A Implementation of Iris recognition system using scale-space filtering (Scale-space filtering을 이용한 홍채인식 보안시스템 구현)

  • Joo, Sang-Hyun;Kang, Tae-Gil;Yang, Woo-Suk
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.5
    • /
    • pp.175-181
    • /
    • 2009
  • In this paper, we introduce the implementation of the security system using iris recognition. This system acquires images with infrared camera and extracts the 2D code from a infrared image which uses scale-space filtering and concavity. We examine the system by (i) extract 2D code and (ii) compare the code that stored on the server (iii) mearsure FAR and FRR using pattern matching. Experiment results show that the proposed method is very suitable.

  • PDF

Monitoring of Chemical Processes Using Modified Scale Space Filtering and Functional-Link-Associative Neural Network (개선된 스케일 스페이스 필터링과 함수연결연상 신경망을 이용한 화학공정 감시)

  • Park, Jung-Hwan;Kim, Yoon-Sik;Chang, Tae-Suk;Yoon, En-Sup
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.6 no.12
    • /
    • pp.1113-1119
    • /
    • 2000
  • To operate a process plant safely and economically, process monitoring is very important. Process monitoring is the task to identify the state of the system from sensor data. Process monitoring includes data acquisition, regulatory control, data reconciliation, fault detection, etc. This research focuses on the data recon-ciliation using scale-space filtering and fault detection using functional-link associative neural networks. Scale-space filtering is a multi-resolution signal analysis method. Scale-space filtering can extract highest frequency factors(noise) effectively. But scale-space filtering has too large calculation costs and end effect problems. This research reduces the calculation cost of scale-space filtering by applying the minimum limit to the gaussian kernel. And the end-effect that occurs at the end of the signal of the scale-space filtering is overcome by using extrapolation related with the clustering change detection method. Nonlinear principal component analysis methods using neural network have been reviewed and the separately expanded functional-link associative neural network is proposed for chemical process monitoring. The separately expanded functional-link associative neural network has better learning capabilities, generalization abilities and short learning time than the exiting-neural networks. Separately expanded functional-link associative neural network can express a statistical model similar to real process by expanding the input data separately. Combining the proposed methods-modified scale-space filtering and fault detection method using the separately expanded functional-link associative neural network-a process monitoring system is proposed in this research. the usefulness of the proposed method is proven by its application a boiler water supply unit.

  • PDF

ENHANCEMENT AND SMOOTHING OF HYPERSPECTAL REMOTE SENSING DATA BY ADVANCED SCALE-SPACE FILTERING

  • Konstantinos, Karantzalos;Demetre, Argialas
    • Proceedings of the KSRS Conference
    • /
    • v.2
    • /
    • pp.736-739
    • /
    • 2006
  • While hyperspectral data are very rich in information, their processing poses several challenges such as computational requirements, noise removal and relevant information extraction. In this paper, the application of advanced scale-space filtering to selected hyperspectral bands was investigated. In particular, a pre-processing tool, consisting of anisotropic diffusion and morphological leveling filtering, has been developed, aiming to an edge-preserving smoothing and simplification of hyperspectral data, procedures which are of fundamental importance during feature extraction and object detection. Two scale space parameters define the extent of image smoothing (anisotropic diffusion iterations) and image simplification (scale of morphological levelings). Experimental results demonstrated the effectiveness of the developed scale space filtering for the enhancement and smoothing of hyperspectral remote sensing data and their advantage against watershed over-segmentation problems and edge detection.

  • PDF

A Study on the Size of 2D Iris Codes for Personal Identification (신분인식을 위한 2D 홍채코드 크기에 관한 연구)

  • Joo, Sang-Hyun;Yang, Woo-Suk
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.2
    • /
    • pp.113-118
    • /
    • 2011
  • This paper has analyzed recognizing performance depending on the size of iris codes extracting by iris recognition algorithm using scale-space filtering. The iris images were created through pre-processing, the features were extracted by scale-space filtering, and the codes of 16 sizes were generated. The generated code's performance was compared for each code to calculate FAR and FRR by matching method utilizing Hamming distance. Every code had little overlapping portion between same person and other persons group so that the proposed algorithm's superiority was proved, and the performance of iris codes was analyzed for each size focused on convenience to use when implementing in realization. In addition, the iris codes suitable to iris recognition system that is high-reliable and is able to reduce user's inconvenience due to mis-rejection has been presented considering for commercialization.

IMAGE PROCESSING TECHNIC USING MEDIAN FILTERING FOR COMET (미디안 필터링을 이용한 혜성의 이미지 처리기법)

  • Park, Y.S.;Lee, C.U.;Jin, H.;Park, J.H.;Han, W.Y.
    • Publications of The Korean Astronomical Society
    • /
    • v.22 no.4
    • /
    • pp.183-187
    • /
    • 2007
  • The detection and measurement of faint features in cometary image is generally troublesome due to the high value of the ratio of the brightness of the nucleus to the tail, the large size and low surface brightness of the coma and tail and the disturbing presence of field stars trails. The image processing is based on background removal by median filtering. Sample results are shown for the case study of comet 73P/Schwassmann-Wachmann 3.

A Sequential Monte Carlo inference for longitudinal data with luespotted mud hopper data (짱뚱어 자료로 살펴본 장기 시계열 자료의 순차적 몬테 칼로 추론)

  • Choi, Il-Su
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.6
    • /
    • pp.1341-1345
    • /
    • 2005
  • Sequential Monte Carlo techniques are a set of powerful and versatile simulation-based methods to perform optimal state estimation in nonlinear non-Gaussian state-space models. We can use Monte Carlo particle filters adaptively, i.e. so that they simultaneously estimate the parameters and the signal. However, Sequential Monte Carlo techniques require the use of special panicle filtering techniques which suffer from several drawbacks. We consider here an alternative approach combining particle filtering and Sequential Hybrid Monte Carlo. We give some examples of applications in fisheries(luespotted mud hopper data).

Decentralized Filters for the Formation Flight

  • Song, Eun-Jung
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.3 no.1
    • /
    • pp.19-29
    • /
    • 2002
  • Decentralized filtering for a formation flight instrumentation system by INS/GPS integration is considered in this paper. An elaborate tuning method of the measurement noise covariance is suggested to compensate modeling errors caused by decentralizing the extended Kalman filter. It does not require large data transfer between formation vehicles. Covariance analysis exhibits the superior performance of the proposed approach when compared with the existent decentralized filter and the global filter, which has the target-filter performance.

Feature point extraction using scale-space filtering and Tracking algorithm based on comparing texturedness similarity (스케일-스페이스 필터링을 통한 특징점 추출 및 질감도 비교를 적용한 추적 알고리즘)

  • Park, Yong-Hee;Kwon, Oh-Seok
    • Journal of Internet Computing and Services
    • /
    • v.6 no.5
    • /
    • pp.85-95
    • /
    • 2005
  • This study proposes a method of feature point extraction using scale-space filtering and a feature point tracking algorithm based on a texturedness similarity comparison, With well-defined operators one can select a scale parameter for feature point extraction; this affects the selection and localization of the feature points and also the performance of the tracking algorithm. This study suggests a feature extraction method using scale-space filtering, With a change in the camera's point of view or movement of an object in sequential images, the window of a feature point will have an affine transform. Traditionally, it is difficult to measure the similarity between correspondence points, and tracking errors often occur. This study also suggests a tracking algorithm that expands Shi-Tomasi-Kanade's tracking algorithm with texturedness similarity.

  • PDF

Improving Collaborative Filtering with Rating Prediction Based on Taste Space (협업 필터링 추천시스템에서의 취향 공간을 이용한 평가 예측 기법)

  • Lee, Hyung-Dong;Kim, Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.34 no.5
    • /
    • pp.389-395
    • /
    • 2007
  • Collaborative filtering is a popular technique for information filtering to reduce information overload and widely used in application such as recommender system in the E-commerce domain. Collaborative filtering systems collect human ratings and provide Predictions based on the ratings of other people who share the same tastes. The quality of predictions depends on the number of items which are commonly rated by people. Therefore, it is difficult to apply pure collaborative filtering algorithm directly to dynamic collections where items are constantly added or removed. In this paper we suggest a method for managing dynamic collections. It creates taste space for items using a technique called Singular Vector Decomposition (SVD) and maintains clusters of core items on the space to estimate relevance of past and future items. To evaluate the proposed method, we divide database of user ratings into those of old and new items and analyze predicted ratings of the latter. And we experimentally show our method is efficiently applied to dynamic collections.