• Title/Summary/Keyword: reference feature

Search Result 426, Processing Time 0.025 seconds

Reference point detection using directional component of fingerprint and feature extraction using filterbank (지문의 방향 성분을 이용한 reference point 검출과 filterbank를 이용한 feature추출 방법)

  • 박준범;고한석
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2002.11a
    • /
    • pp.417-420
    • /
    • 2002
  • 본 논문에서는, 지문인증 시스템에 있어서 방향성분의 통계적 방법을 이용한 reference point 검출 알고리즘과 이 reference point를 중심으로 하여 기존의 filterbank의 단점을 개선한 feature 추출 알고리즘을 소개한다. 제안한 reference point검출 알고리즘은 기존의 Poincare방법의 단점인 세밀한 전처리 과정과 arch type의 지문에 대해 장점을 가지며, 개선한 filterbank방법은 기존의 filterbank방법보다 reference point의 검출 위치에 덜 민감하며, 좀 더 높은 인증률을 보였다.

  • PDF

Reference Feature Based Cell Decomposition and Form Feature Recognition (기준 특징형상에 기반한 셀 분해 및 특징형상 인식에 관한 연구)

  • Kim, Jae-Hyun;Park, Jung-Whan
    • Korean Journal of Computational Design and Engineering
    • /
    • v.12 no.4
    • /
    • pp.245-254
    • /
    • 2007
  • This research proposed feature extraction algorithms as an input of STEP Ap214 data, and feature parameterization process to simplify further design change and maintenance. The procedure starts with suppression of blend faces of an input solid model to generate its simplified model, where both constant and variable-radius blends are considered. Most existing cell decomposition algorithms utilize concave edges, and they usually require complex procedures and computing time in recomposing the cells. The proposed algorithm using reference features, however, was found to be more efficient through testing with a few sample cases. In addition, the algorithm is able to recognize depression features, which is another strong point compared to the existing cell decomposition approaches. The proposed algorithm was implemented on a commercial CAD system and tested with selected industrial product models, along with parameterization of recognized features for further design change.

An Implementation of Markerless Augmented Reality Using Efficient Reference Data Sets (효율적인 레퍼런스 데이터 그룹의 활용에 의한 마커리스 증강현실의 구현)

  • Koo, Ja-Myoung;Cho, Tai-Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.11
    • /
    • pp.2335-2340
    • /
    • 2009
  • This paper presents how to implement Markerless Augmented Reality and how to create and apply reference data sets. There are three parts related with implementation: setting camera, creation of reference data set, and tracking. To create effective reference data sets, we need a 3D model such as CAD model. It is also required to create reference data sets from various viewpoints. We extract the feature points from the mode1 image and then extract 3D positions corresponding to the feature points using ray tracking. These 2D/3D correspondence point sets constitute a reference data set of the model. Reference data sets are constructed for various viewpoints of the model. Fast tracking can be done using a reference data set the most frequently matched with feature points of the present frame and model data near the reference data set.

Adaptive Shot Change Detection using Mean of Feature Value on Variable Reference Blocks and Implementation on PMP

  • Kim, Jong-Nam;Kim, Won-Hee
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.229-232
    • /
    • 2009
  • Shot change detection is an important technique for effective management of video data, so detection scheme requires adaptive detection techniques to be used actually in various video. In this paper, we propose an adaptive shot change detection algorithm using the mean of feature value on variable reference blocks. Our algorithm determines shot change detection by defining adaptive threshold values with the feature value extracted from video frames and comparing the feature value and the threshold value. We obtained better detection ratio than the conventional methods maximally by 15% in the experiment with the same test sequence. We also had good detection ratio for other several methods of feature extraction and could see real-time operation of shot change detection in the hardware platform with low performance was possible by implementing it in TVUS model of HOMECAST Company. Thus, our algorithm in the paper can be useful in PMP or other portable players.

  • PDF

카메라 디포커싱을 이용한 로보트의 시각 서보

  • 신진우;고국현;조형석
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1994.10a
    • /
    • pp.559-564
    • /
    • 1994
  • Recently, a visual servoing for an eye-in-hand robot has become an interesting problem. A distance between a camera and a task object is very useful information for visual servoing. In the previous works for visual servoing, the distance can be obtained from the difference between a reference and a measured feature value of the object such as area on image plane. However, since this feature depends on the object, the reference feature value must be changed when other task object is taken. To overcome this difficulty, this paper presents a novel method for visual servoing. In the proposed method, a blur is used to obtain the distance. The blur, one of the most important features, depends on the focal length of camera. Since it is not affected by the change of object, the reference feature value is not changed although other task object is taken. In this paper, we show a relationship between the distance and the blur, and define the feature jacobian matrix based on camera defocusing to operate the robot. A series of experiments is performed to verify the proposed method.

  • PDF

Matching Of Feature Points using Dynamic Programming (동적 프로그래밍을 이용한 특징점 정합)

  • Kim, Dong-Keun
    • The KIPS Transactions:PartB
    • /
    • v.10B no.1
    • /
    • pp.73-80
    • /
    • 2003
  • In this paper we propose an algorithm which matches the corresponding feature points between the reference image and the search image. We use Harris's corner detector to find the feature points in both image. For each feature point in the reference image, we can extract the candidate matching points as feature points in the starch image which the normalized correlation coefficient goes greater than a threshold. Finally we determine a corresponding feature points among candidate points by using dynamic programming. In experiments we show results that match feature points in synthetic image and real image.

A Study of the Law School Library Design Feature & Spatial Composition (법학전문도서관 디자인 특성 및 공간구성방법에 관한 연구)

  • Choi, Sung-Woo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.6
    • /
    • pp.2812-2825
    • /
    • 2012
  • The purpose of this study was to analyze the spacial composition feature of Law School Library and define the feature in spacial planning of law school library. Through the analysis of characteristics in spacial composition, the basic spacial type of law school library will be proposed as a new law school library design. The spatial composition characteristics of Law school Library are as followings. (1) Entry spatial feature for the user accessibility (2) Reference room spatial planning for carrel user (3) Connectivity of educational & research space and reference room space. As the result of design proposal and analyzing the spacial feature, firstly entry common space of library should be planned with reference room space. Secondly, reading room should be linked to the entry level for the user. Lastly, core space should be planned as the vertical connectivity space for the intimately linkage of educational & research space and reference room. And separated accessibility should be considered for direct connection from outdoor space.

Deep Reference-based Dynamic Scene Deblurring

  • Cunzhe Liu;Zhen Hua;Jinjiang Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.3
    • /
    • pp.653-669
    • /
    • 2024
  • Dynamic scene deblurring is a complex computer vision problem owing to its difficulty to model mathematically. In this paper, we present a novel approach for image deblurring with the help of the sharp reference image, which utilizes the reference image for high-quality and high-frequency detail results. To better utilize the clear reference image, we develop an encoder-decoder network and two novel modules are designed to guide the network for better image restoration. The proposed Reference Extraction and Aggregation Module can effectively establish the correspondence between blurry image and reference image and explore the most relevant features for better blur removal and the proposed Spatial Feature Fusion Module enables the encoder to perceive blur information at different spatial scales. In the final, the multi-scale feature maps from the encoder and cascaded Reference Extraction and Aggregation Modules are integrated into the decoder for a global fusion and representation. Extensive quantitative and qualitative experimental results from the different benchmarks show the effectiveness of our proposed method.

An Implementation of Markerless Augmented Reality and Creation and Application of Efficient Reference Data Sets (마커리스 증강현실의 구현과 효율적인 레퍼런스 데이터 그룹의 생성 및 활용)

  • Koo, Ja-Myoung;Cho, Tai-Hoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.204-207
    • /
    • 2009
  • This paper presents how to implement Markerless Augmented Reality and how to create and apply reference data sets. There are three parts related with implementation: setting camera, creation of reference data set, and tracking. To create effective reference data sets, we need a 3D model such as CAD model. It is also required to create reference data sets from various viewpoints. We extract the feature points from the model image and then extract 3D positions corresponding to the feature points using ray tracking. These 2D/3D correspondence point sets constitute a reference data set of the model. Reference data sets are constructed for various viewpoints of the model. Fast tracking can be done using a reference data set the most frequently matched with feature points of the present frame and model data near the reference data set.

  • PDF

Statistical Image Feature Based Block Motion Estimation for Video Sequences (비디오 영상에서 통계적 영상특징에 의한 블록 모션 측정)

  • Bae, Young-Lae;Cho, Dong-Uk;Chun, Byung-Tae
    • The Journal of the Korea Contents Association
    • /
    • v.3 no.1
    • /
    • pp.9-13
    • /
    • 2003
  • We propose a block motion estimation algorithm based on a statistical image feature for video sequences. The statistical feature of the reference block is obtained, then applied to select the candidate starting points (SPs) in the regular starting points pattern (SPP) by comparing the statistical feature of reference block with that of blocks which are spread ower regular SPP. The final SPs are obtained by their Mean Absolute Difference(MAD) value among the candidate SPs. Finally, one of conventional fast search algorithms, such as BRGDS, DS, and three-step search (TSS), has been applied to generate the motion vector of reference block using the final SPs as its starting points. The experimental results showed that the starting points from fine SPs were as dose as to the global minimum as we expected.

  • PDF