• Title/Summary/Keyword: matching points

Search Result 705, Processing Time 0.033 seconds

A Flexible Feature Matching for Automatic face and Facial feature Points Detection (얼굴과 얼굴 특징점 자동 검출을 위한 탄력적 특징 정합)

  • 박호식;손형경;정연길;배철수
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.05a
    • /
    • pp.608-612
    • /
    • 2002
  • An automatic face and facial feature points(FFPs) detection system is proposed. A face is represented as a graph where the nodes are placed at facial feature points(FFPs) labeled by their Gabor features md the edges are describes their spatial relations. An innovative flexible feature matching is proposed to perform features correspondence between models and the input image. This matching model works likes random diffusion process in the image spare by employing the locally competitive and globally corporative mechanism. The system works nicely on the face images under complicated background, pose variations and distorted by facial accessories. We demonstrate the benefits of our approach by its implementation on the fare identification system.

  • PDF

Automatic Registration of High Resolution Satellite Images using Local Properties of Tie Points (지역적 매칭쌍 특성에 기반한 고해상도영상의 자동기하보정)

  • Han, You-Kyung;Byun, Young-Gi;Choi, Jae-Wan;Han, Dong-Yeob;Kim, -Yong-Il
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.28 no.3
    • /
    • pp.353-359
    • /
    • 2010
  • In this paper, we propose the automatic image-to-image registration of high resolution satellite images using local properties of tie points to improve the registration accuracy. A spatial distance between interest points of reference and sensed images extracted by Scale Invariant Feature Transform(SIFT) is additionally used to extract tie points. Coefficients of affine transform between images are extracted by invariant descriptor based matching, and interest points of sensed image are transformed to the reference coordinate system using these coefficients. The spatial distance between interest points of sensed image which have been transformed to the reference coordinates and interest points of reference image is calculated for secondary matching. The piecewise linear function is applied to the matched tie points for automatic registration of high resolution images. The proposed method can extract spatially well-distributed tie points compared with SIFT based method.

Video Sequences Registration by using Interested Points Extraction (특징점 추출에 의한 비디오 영상등록)

  • Kim, Seong-Sam;Lee, Hye-Suk;Kim, Eui-Myoung;Yoo, Hwan-Hee
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2007.04a
    • /
    • pp.127-130
    • /
    • 2007
  • The increased availability of portable, low-cost, high resolution video devices has resulted in a rapid growth of the applications for video sequences. These video devices can be mounted in handhold unit, mobile unit and airborne platforms like maned or unmaned helicopter, plane, airship, etc. A core technique in use of video sequences is to align neighborhood video frames to each other or to reference images. For video sequences registration, we extracted interested points from aerial video sequences using Harris, $F{\square}rstner$, and KLT operators and implemented image matching using these points. As the result, we analysed image matching results for each operators and evaluated accuracy of aerial video registration.

  • PDF

Optimal 3D Grasp Planning for unknown objects (임의 물체에 대한 최적 3차원 Grasp Planning)

  • 이현기;최상균;이상릉
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2002.05a
    • /
    • pp.462-465
    • /
    • 2002
  • This paper deals with the problem of synthesis of stable and optimal grasps with unknown objects by 3-finger hand. Previous robot grasp research has analyzed mainly with either unknown objects 2D by vision sensor or unknown objects, cylindrical or hexahedral objects, 3D. Extending the previous work, in this paper we propose an algorithm to analyze grasp of unknown objects 3D by vision sensor. This is archived by two steps. The first step is to make a 3D geometrical model of unknown objects by stereo matching which is a kind of 3D computer vision technique. The second step is to find the optimal grasping points. In this step, we choose the 3-finger hand because it has the characteristic of multi-finger hand and is easy to modeling. To find the optimal grasping points, genetic algorithm is used and objective function minimizing admissible farce of finger tip applied to the object is formulated. The algorithm is verified by computer simulation by which an optimal grasping points of known objects with different angles are checked.

  • PDF

The Optimal Grasp Planning by Using a 3-D Computer Vision Technique (3차원 영상처리 기술을 이용한 Grasp planning의 최적화)

  • 이현기;김성환;최상균;이상룡
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.19 no.11
    • /
    • pp.54-64
    • /
    • 2002
  • This paper deals with the problem of synthesis of stable and optimal grasps with unknown objects by 3-finger hand. Previous robot grasp research has mainly analyzed with either unknown objects 2-dimensionally by vision sensor or known objects, such as cylindrical objects, 3-dimensionally. As extending the previous work, in this study we propose an algorithm to analyze grasp of unknown objects 3-dimensionally by using vision sensor. This is archived by two steps. The first step is to make a 3-dimensional geometrical model for unknown objects by using stereo matching. The second step is to find the optimal grasping points. In this step, we choose the 3-finger hand which has the characteristic of multi-finger hand and is easy to model. To find the optimal grasping points, genetic algorithm is employed and objective function minimizes the admissible force of finger tip applied to the objects. The algorithm is verified by computer simulation by which optimal grasping points of known objects with different angle are checked.

An Advanced Successive Elimination Algorithm Using Mean Absolute Difference of Neighboring Search Points (경계점의 절대 오차 평균을 이용한 개선된 연속 제거 알고리즘)

  • Jung, Soo-Mok
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.5
    • /
    • pp.755-760
    • /
    • 2004
  • In this paper, an advanced successive elimination algorithm was proposed using mean absolute difference of neighboring search points. By using mean absolute difference of neighboring search points, the search point in motion estimation can be eliminated effeciently without matching evaluation that requires very intensive computations. By using adaptive MAD calculation algorithm, the candidate matching block can be eliminated early. So, the number of the proposed algrorithm was verified by experimental results.

  • PDF

A Study on CRM(Center of Rotation Method) based on MST(Minimum Spanning Tree) Matching Algorithm for Fingerprint Recognition

  • Kwon, Hyoung-Ki;Lee, Jun-Ho;Ryu, Young-Kee
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.55.5-55
    • /
    • 2001
  • The MST (Minimum Spanning Tree) matching algorithm had been used for searching the part accord points extracted from the gray level fingerprint image. The method, however, had some limitations. To obtain the relationship between enrolled and inputted fingerprint, the MST was used to generate the tree graph that represent the unique graph for given fingerprint data. From the graph, the accord points are estimated. However, the shape of the graph highly depends on the positions of the minutiae. If there are some pseudo minutiae caused by noise, the shape of the graph will be different In this paper, to overcome the limitations of the MST, we proposed CRM (Center of Rotation Method) algorithm that found the true part accord points. The proposed method is based on the assumption ...

  • PDF

Octree model based fast three-dimensional object recognition (Octree 모델에 근거한 고속 3차원 물체 인식)

  • 이영재;박영태
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.9
    • /
    • pp.84-101
    • /
    • 1997
  • Inferring and recognizing 3D objects form a 2D occuluded image has been an important research area of computer vision. The octree model, a hierarchical volume description of 3D objects, may be utilized to generate projected images from arbitrary viewing directions, thereby providing an efficient means of the data base for 3D object recognition. We present a fast algorithm of finding the 4 pairs of feature points to estimate the viewing direction. The method is based on matching the object contour to the reference occuluded shapes of 49 viewing directions. The initially best matched viewing direction is calibrated by searching for the 4 pairs of feature points between the input image and the image projected along the estimated viewing direction. Then the input shape is recognized by matching to the projectd shape. The computational complexity of the proposed method is shown to be O(n$^{2}$) in the worst case, and that of the simple combinatorial method is O(m$^{4}$.n$^{4}$) where m and n denote the number of feature points of the 3D model object and the 2D object respectively.

  • PDF

Correction of Ocular Fundus Fluorescein Angiogram in Nonlinear Distortion (비선형왜곡된 형광안저화상의 보정)

  • 고창림
    • Journal of Biomedical Engineering Research
    • /
    • v.11 no.1
    • /
    • pp.31-38
    • /
    • 1990
  • Image correction of the fluorescein angiogram with the low contrast and geometrically distorted is studied. The procedure is divided into two steps : A template matching step and a geometrical transformation step. Based on the sequential similiarity detection algorithm, more Improved matching results are obtained with edge enhanced image. For the reference points and the corresponding matchimg points, the geometrical transformationss by the use of the average value of the X, Y translational shifts and a pair of these points, respectively are described. Then the corrected images are obtained using bilinear interpolation. It is proven that the usefullness of this study for the image correction of the ocular fundus fluoresceln angiogram with low contrast and geometrically distorted mainly due to the eye movements.

  • PDF

RPC Correction of KOMPSAT-3A Satellite Image through Automatic Matching Point Extraction Using Unmanned AerialVehicle Imagery (무인항공기 영상 활용 자동 정합점 추출을 통한 KOMPSAT-3A 위성영상의 RPC 보정)

  • Park, Jueon;Kim, Taeheon;Lee, Changhui;Han, Youkyung
    • Korean Journal of Remote Sensing
    • /
    • v.37 no.5_1
    • /
    • pp.1135-1147
    • /
    • 2021
  • In order to geometrically correct high-resolution satellite imagery, the sensor modeling process that restores the geometric relationship between the satellite sensor and the ground surface at the image acquisition time is required. In general, high-resolution satellites provide RPC (Rational Polynomial Coefficient) information, but the vendor-provided RPC includes geometric distortion caused by the position and orientation of the satellite sensor. GCP (Ground Control Point) is generally used to correct the RPC errors. The representative method of acquiring GCP is field survey to obtain accurate ground coordinates. However, it is difficult to find the GCP in the satellite image due to the quality of the image, land cover change, relief displacement, etc. By using image maps acquired from various sensors as reference data, it is possible to automate the collection of GCP through the image matching algorithm. In this study, the RPC of KOMPSAT-3A satellite image was corrected through the extracted matching point using the UAV (Unmanned Aerial Vehichle) imagery. We propose a pre-porocessing method for the extraction of matching points between the UAV imagery and KOMPSAT-3A satellite image. To this end, the characteristics of matching points extracted by independently applying the SURF (Speeded-Up Robust Features) and the phase correlation, which are representative feature-based matching method and area-based matching method, respectively, were compared. The RPC adjustment parameters were calculated using the matching points extracted through each algorithm. In order to verify the performance and usability of the proposed method, it was compared with the GCP-based RPC correction result. The GCP-based method showed an improvement of correction accuracy by 2.14 pixels for the sample and 5.43 pixelsfor the line compared to the vendor-provided RPC. In the proposed method using SURF and phase correlation methods, the accuracy of sample was improved by 0.83 pixels and 1.49 pixels, and that of line wasimproved by 4.81 pixels and 5.19 pixels, respectively, compared to the vendor-provided RPC. Through the experimental results, the proposed method using the UAV imagery presented the possibility as an alternative to the GCP-based method for the RPC correction.