• 제목/요약/키워드: Point Features

검색결과 1,431건 처리시간 0.03초

A Robust Fingerprint Matching System Using Orientation Features

  • Kumar, Ravinder;Chandra, Pravin;Hanmandlu, Madasu
    • Journal of Information Processing Systems
    • /
    • 제12권1호
    • /
    • pp.83-99
    • /
    • 2016
  • The latest research on the image-based fingerprint matching approaches indicates that they are less complex than the minutiae-based approaches when it comes to dealing with low quality images. Most of the approaches in the literature are not robust to fingerprint rotation and translation. In this paper, we develop a robust fingerprint matching system by extracting the circular region of interest (ROI) of a radius of 50 pixels centered at the core point. Maximizing their orientation correlation aligns two fingerprints that are to be matched. The modified Euclidean distance computed between the extracted orientation features of the sample and query images is used for matching. Extensive experiments were conducted over four benchmark fingerprint datasets of FVC2002 and two other proprietary databases of RFVC 2002 and the AITDB. The experimental results show the superiority of our proposed method over the well-known image-based approaches in the literature.

ARM 프로세서를 위한 실시간 모니터 (A Real-Time Monitor for ARM Processors)

  • 이은향;장원순;김형환;은성배
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 하계종합학술대회 논문집(3)
    • /
    • pp.67-70
    • /
    • 2000
  • In a distributed real-time system(DRTS), testing and debugging are difficult and critical procedures since they implies several problems like probe effects, nondeterminism, and complex communication patterns. In this paper, we describe the design and implementation of a real-time monitor for ARM processors which are frequently used for embedded applications. The focus of design is to help users debug real-time programs while minimizing the probe effect. Our monitor provides cross debugging features like down-loading from host, break-point based debugging features, and watch-point debugging features for real-time applications. We developed the debugger for ARM processor and debugger has been used for kernel program.

  • PDF

Parameter Recovery for LIDAR Data Calibration Using Natural Surfaces

  • Lee Impyeong;Moon Jiyoung;Kim Kyoung-ok
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
    • /
    • pp.642-645
    • /
    • 2004
  • This paper focuses on recovering systematic biases during LIDAR calibration, particularly using natural surfaces as control features. Many previous approaches have utilized all the points overlapping with the control features and often experienced with an inaccurate value converged with a poor rate due to wrong correspondence in pairing a point and the corresponding control features. To overcome these shortcomings, we establish a preventive scheme to select the pairs of high confidence, where the confidence value is based on the error budget associated with the point measurement and the linearity and roughness of the control feature. This approach was then applied to calibraring the LIDAR data simulated with the given systematic biases. The parameters were successfully recovered using the proposed approach with the accuracy and convergence rate superior to those using the previous approaches.

  • PDF

An Intelligent Visual Servoing Method using Vanishing Point Features

  • Lee, Joon-Soo;Suh, Il-Hong
    • Journal of Electrical Engineering and information Science
    • /
    • 제2권6호
    • /
    • pp.177-182
    • /
    • 1997
  • A visual servoing method is proposed for a robot with a camera in hand. Specifically, vanishing point features are suggested by employing a viewing model of perspective projection to calculate the relative rolling, pitching and yawing angles between the object and the camera. To compensate dynamic characteristics of the robot, desired feature trajectories for the learning of visually guided line-of-sight robot motion are obtained by measuring features by the camera in hand not in the entire workspace, but on a single linear path along which the robot moves under the control of a commercially provided function of linear motion. And then, control actions of the camera are approximately found by fuzzy-neural networks to follow such desired feature trajectories. To show the validity of proposed algorithm, some experimental results are illustrated, where a four axis SCARA robot with a B/W CCD camera is used.

  • PDF

Registration of Aerial Image with Lines using RANSAC Algorithm

  • Ahn, Y.;Shin, S.;Schenk, T.;Cho, W.
    • 한국측량학회지
    • /
    • 제25권6_1호
    • /
    • pp.529-536
    • /
    • 2007
  • Registration between image and object space is a fundamental step in photogrammetry and computer vision. Along with rapid development of sensors - multi/hyper spectral sensor, laser scanning sensor, radar sensor etc., the needs for registration between different sensors are ever increasing. There are two important considerations on different sensor registration. They are sensor invariant feature extraction and correspondence between them. Since point to point correspondence does not exist in image and laser scanning data, it is necessary to have higher entities for extraction and correspondence. This leads to modify first, existing mathematical and geometrical model which was suitable for point measurement to line measurements, second, matching scheme. In this research, linear feature is selected for sensor invariant features and matching entity. Linear features are incorporated into mathematical equation in the form of extended collinearity equation for registration problem known as photo resection which calculates exterior orientation parameters. The other emphasis is on the scheme of finding matched entities in the aide of RANSAC (RANdom SAmple Consensus) in the absence of correspondences. To relieve computational load which is a common problem in sampling theorem, deterministic sampling technique and selecting 4 line features from 4 sectors are applied.

Development of Evaluation Perspective and Criteria for the DataON Platform

  • Kim, Suntae
    • Journal of Information Science Theory and Practice
    • /
    • 제8권2호
    • /
    • pp.68-78
    • /
    • 2020
  • This study is a preliminary study to develop an evaluation framework necessary for evaluating the DataON platform. The first objective is to examine expert perceptions of the level of DataON platform construction. The second objective is to evaluate the importance, stability, and usability of DataON platform features over OpenAIRE features. The third objective is to derive weights from the evaluation perspective for future DataON platform evaluation. The fourth objective is to examine the preferences of experts in each evaluation perspective and to derive unbiased evaluation criteria. This study used a survey method for potential stakeholders of the DataON platform. The survey included 12 professionals with at least 10 years of experience in the field. The 57 overall functions and services were measured at 3.1 out of 5 for importance. Stability was -0.07 point and usability was measured as -0.05 point. The 42 features and services scored 3.04 points in importance. Stability was -0.58 points and usability was -0.51 points. In particular, the stability and usability scores of the 42 functions and services provided as of 2018 were higher than the total functions were, which is attributed to the stable and user-friendly improvement after development. In terms of the weight of the evaluation point, the collection quality has the highest weight of 27%. Interface usability is then weighted 22%. Subsequently, service quality is weighted 19%, and finally system performance efficiency and user feedback solicitation are equally weighted 16%.

GENERATION OF DEM FROM CONTOURS FOR THE ORTHORECTIFICATION OF HIGH-RESOLUTION STELLITE IMAGES

  • Choi, Joon-Soo;Cha, Young-Min;Heo, Jae-Wee;Ryu, Young-Soo;Kim, Choen;Oh, Seung-Jun
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2008년도 International Symposium on Remote Sensing
    • /
    • pp.7-10
    • /
    • 2008
  • We present a technique for constructing a digital elevation model (DEM) from contours. The elevation of each ground point in DEM is computed by interpolating the heights of the two adjacent contours of the point. The technique decomposes each sub-domain between adjacent contours into a set of sub-regions. The decomposition is accomplished by constructing a medial axis of the sub-domain. Each sub-region in the decomposition is classified into a variety of terrain features like hillsides, valleys, ridges, etc. The elevations of points are interpolated with different methods according to terrain features they belong to. For a given point in hillside, an approximate gradient line passing through the point is determined and the elevation of the point is interpolated from the known elevations of the two adjacent contours along the approximate gradient line. The univariate monotone rational Hermite spline is used for the interpolation. The DEM constructed by the technique is to be used to orthorectify the high-resolution KOMPSAT3 imagery.

  • PDF

Classification of the Types of Defects in Steam Generator Tubes using the Quasi-Newton Method

  • Lee, Joon-Pyo;Jo, Nam-H.;Roh, Young-Su
    • Journal of Electrical Engineering and Technology
    • /
    • 제5권4호
    • /
    • pp.666-671
    • /
    • 2010
  • Multi-layer perceptron neural networks have been constructed to classify four types of defects in steam generator tubes. Three features are extracted from the signals of the eddy current testing method. These include maximum impedance, phase angle at the point of maximum impedance, and an angle between the point of maximum impedance and the point of half the maximum impedance. Two hundred sets of these features are used for training and assessing the networks. Two approaches are involved to train the networks and to classify the defect type. One is the conjugate gradient method and the other is the Broydon-Fletcher-Goldfarb-Shanno method which is recognized as the most popular algorithm of quasi-Newton methods. It is found from the computation results that the training time of the Broydon-Fletcher-Goldfarb-Shanno method is much faster than that of the conjugate gradient method in most cases. On the other hand, no significant difference of the classification performance between the two methods is observed.

Distinct Point Detection : Forstner Interest Operator

  • Cho, Woo-Sug
    • 한국측량학회지
    • /
    • 제13권2호
    • /
    • pp.299-307
    • /
    • 1995
  • 본 논문은 수치영상으로부터 Digital Photogrammetry와 Computer Vision 분야에서 위치결정 및 3차원 정보의 자동추출을 위한 기본단계인 Distinct Point 추출기법중 F rsner interest operate에 관한 연구이다. Gradien에 기초한 Forstner interest operator는 Orientation-invariant의 특징을 가지고 있으며 소정의 Subpixel정확도를 얻을 수 있다. 본 연구에서는 Fostner interest operator에서 얻어진 Comer Points와 Circular Features를 구분하기 위한 방법으로 F-test를 적용하였으며 Nosie가 Forstner interest operator에 미치는 영향을 고찰하였고 실제 사진영상에 Forstner interest operator를 도입하여 실효성에 바탕을 둔 적용 여부를 검증하였다.

  • PDF

Camera Motion Parameter Estimation Technique using 2D Homography and LM Method based on Invariant Features

  • Cha, Jeong-Hee
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제5권4호
    • /
    • pp.297-301
    • /
    • 2005
  • In this paper, we propose a method to estimate camera motion parameter based on invariant point features. Typically, feature information of image has drawbacks, it is variable to camera viewpoint, and therefore information quantity increases after time. The LM(Levenberg-Marquardt) method using nonlinear minimum square evaluation for camera extrinsic parameter estimation also has a weak point, which has different iteration number for approaching the minimal point according to the initial values and convergence time increases if the process run into a local minimum. In order to complement these shortfalls, we, first propose constructing feature models using invariant vector of geometry. Secondly, we propose a two-stage calculation method to improve accuracy and convergence by using homography and LM method. In the experiment, we compare and analyze the proposed method with existing method to demonstrate the superiority of the proposed algorithms.