• Title/Summary/Keyword: match points

Search Result 149, Processing Time 0.026 seconds

Evaluation on Tie Point Extraction Methods of WorldView-2 Stereo Images to Analyze Height Information of Buildings (건물의 높이 정보 분석을 위한 WorldView-2 스테레오 영상의 정합점 추출방법 평가)

  • Yeji, Kim;Yongil, Kim
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.33 no.5
    • /
    • pp.407-414
    • /
    • 2015
  • Interest points are generally located at the pixels where height changes occur. So, interest points can be the significant pixels for DSM generation, and these have the important role to generate accurate and reliable matching results. Manual operation is widely used to extract the interest points and to match stereo satellite images using these for generating height information, but it causes economic and time consuming problems. Thus, a tie point extraction method using Harris-affine technique and SIFT(Scale Invariant Feature Transform) descriptors was suggested to analyze height information of buildings in this study. Interest points on buildings were extracted by Harris-affine technique, and tie points were collected efficiently by SIFT descriptors, which is invariant for scale. Searching window for each interest points was used, and direction of tie points pairs were considered for more efficient tie point extraction method. Tie point pairs estimated by proposed method was used to analyze height information of buildings. The result had RMSE values less than 2m comparing to the height information estimated by manual method.

Optimal synthesis and design of heat transfer enhancement on heat exchanger networks and its application

  • Huang, Zhao-qing
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10a
    • /
    • pp.376-379
    • /
    • 1996
  • Synthesis for qualitative analysis in connection with quantitative analysis from the pinch design method, EVOP and Operations Research is proposed for the optimal synthesis of heat exchanger networks, that is through of the transportation model of the linear programming for synthesizing chemical processing systems, to determine the location of pinch points, the stream matches and the corresponding heat flowrate exchanged at each match. In the second place, according to the optimization, the optimal design of heat transfer enhancement is carried on a fixed optimum heat exchanger network structure, in which this design determines optimal operational parameters and the chosen type of heat exchangers as well. Finally, the method of this paper is applied to the study of the optimal synthetic design of heat exchanger network of constant-decompress distillation plants.

  • PDF

Robust Image Mosaic using Geometrical Feature Model (기하학적 특징 모델을 이용한 강건한 영상 모자이크 기법)

  • 김정훈;김대현;윤용인;최종수
    • Proceedings of the IEEK Conference
    • /
    • 2000.11d
    • /
    • pp.13-16
    • /
    • 2000
  • This paper presents a robust method to combine a collection of images with small fields of view to obtain an image with a large field of view. In the previous works, there are two main areas which one is a cross correlation-based method and the other is a feature-based method. The former is based on motion estimation from video sequences. so there are a problem on rotating a camera about optical axis. In the latter method, it is difficult to match correspondence feature points correctly.'re find correct correspondences, we proposed the geometrical feature model and correspondence filters and the Gaussian distribution weight function to blend the images smoothly. The experiments show that our method is robust and effective.

  • PDF

A Proposal for a Personal Branding Support Service in Social Media Times

  • Kawano, Yoshihiro;Obu, Yuka
    • Journal of Contemporary Eastern Asia
    • /
    • v.12 no.2
    • /
    • pp.49-59
    • /
    • 2013
  • Social media such as Twitter and Facebook have become popular. In the age of social media, many people have become more active online. For example, about half of all global active Internet users are on Facebook (Perry 2012). Personal branding is a very important strategy to build on an individual's strengths, and this kind of branding is expected to contribute to self-actualization. Therefore, the presence of mentors who advise users to discover their own strong points for self-actualization is necessary. In this paper, we propose a personal branding support service, Mentors, which connects mentors and mentees. The core concept is: "Everyone has the face of both a mentor and mentee." The key function is sharing stages of self-analysis in human life design: Determining value, creating a mission, and forming a strategy. From this function, a good match between a mentor and mentee can be found. The program aims to improve human life by understanding the client's strengths and using social media effectively. Future work includes launching Mentors and evaluating its service.

Recognition and positioning of occuluded objects using polygon segments (다각형 세그먼트를 이용한 겹쳐진 물체의 인식 및 위치 추정)

  • 정종면;문영식
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.5
    • /
    • pp.73-82
    • /
    • 1996
  • In this paper, an efficient algorithm for recognizing and positioning occuluded objects in a two-dimensional plane is presented. Model objects and unknown input image are approximated by polygonal boundaries, which are compactly represented by shape functions of the polygons. The input image is partitioned into measningful segments whose end points are at the locations of possible occlusion - i.e. at concave vertices. Each segment is matched against known model objects by calculating a matching measure, which is defined as the minimum euclidean distance between the shape functions. An O(mm(n+m) algorithm for computing the measure is presentd, where n and m are the number of veritces for a model and an unknown object, respectively. Match results from aprtial segments are combined based on mutual compatibility, then are verified using distance transformation and translation vector to produce the final recognition. The proposed algorithm is invariant under translation and rotation of objects, which has been shown by experimental results.

  • PDF

Fingerprint Minutiae Matching Algorithm using Distance Histogram of Neighborhood

  • Sharma, Neeraj;Lee, Joon-Jae
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.12
    • /
    • pp.1577-1584
    • /
    • 2007
  • Fingerprint verification is being adopted widely to provide positive identification with a high degree of confidence in all practical areas. This popular usage requires reliable methods for matching of these patterns. To meet the latest expectations, the paper presents a pair wise distance histogram method for fingerprint matching. Here, we introduced a randomized algorithm which exploits pair wise distances between the pairs of minutiae, as a basic feature for match. The method undergoes two steps for completion i.e. first it performs the matching locally then global matching parameters are calculated in second step. The proposed method is robust to common problems that fingerprint matching faces, such as scaling, rotation, translational changes and missing points etc. The paper includes the test of algorithm on various randomly generated minutiae and real fingerprints as well. The results of the tests resemble qualities and utility of method in related field.

  • PDF

A Variable Window Method for Three-Dimensional Structure Reconstruction in Stereo Vision (삼차원 구조 복원을 위한 스테레오 비전의 가변윈도우법)

  • 김경범
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.7
    • /
    • pp.138-146
    • /
    • 2003
  • A critical issue in area-based stereo matching lies in selecting a fixed rectangular window size. Previous stereo methods doesn't deal effectively with occluding boundary due to inevitable window-based problems, and so give inaccurate and noisy matching results in areas with steep disparity variations. In this paper, a variable window approach is presented to estimate accurate, detailed and smooth disparities for three-dimensional structure reconstruction. It makes the smoothing of depth discontinuity reduced by evaluating corresponding correlation values and intensity gradient-based similarity in the three-dimensional disparity space. In addition, it investigates maximum connected match candidate points and then devise the novel arbitrarily shaped variable window representative of a same disparity to treat with disparity variations of various structure shapes. We demonstrate the performance of the proposed variable window method with synthetic images, and show how our results improve on those of closely related techniques for accuracy, robustness, matching density and computing speed.

A P-wave Detection Algorithm by Template Matching Method (템플레이트 매칭에 의한 심전도 신호의 P파 검출 알고리즘에 관한 연구)

  • Hong, Jae-Woo;Jeong, Hee-Kyo;Shin, Kun-Soo;Lee, Myoung-Ho
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1990 no.05
    • /
    • pp.21-24
    • /
    • 1990
  • This paper presents a new algorithm for P-wave detection in the ECG signal, we get the peak, onset and offset point by using significant point extraction algorithm with 5-point derivative. To these set of extracted significant points, we apply amplitude and duration threshold criterion. we define the set of significant point meeting the criterion as P-wave candidate. Then P-wave candidate is classified through match-process with template. The template with maximum number or P-wave candidate is selected to be the P-wave.

  • PDF

A Study on 2-D Objects Recognition Using Polygonal Approximation and Coordinates Transition (다각근사화와 좌표이동을 이용한 겹친 2차원 물체인식)

  • 박원진;김보현;이대영
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1986.10a
    • /
    • pp.45-52
    • /
    • 1986
  • This paper presents an experimental model-based vision system which can identify and locate object in scenes containing multiple occluded parts. The objent are assumed to be regid, planar parta. In any recognition system the type of object that might appear in the image dictates the type of knowledge that is needed to recognize the object. The data is reduced to a seguential list of points or pixel that appear on the boundary of the objects. Next the boundary of the object is smoothed using a polygonal approximation algorithm. Recognition consists in finding the prototype that matches model to image. The best match is obtained by optimising some similarity measure.

  • PDF

A Study on the Development of GEOCON for the Geometry Control of Precast Segmental Bridges(I) (프리캐스트 세그멘탈 교량의 선형관리를 위한 GEOCON의 개발에 관한 연구(1))

  • 이환우;곽효경
    • Magazine of the Korea Concrete Institute
    • /
    • v.10 no.1
    • /
    • pp.161-169
    • /
    • 1998
  • 프리스트레스트 콘크리트 교량의 건설공법인 프리캐스트 세그멘탈 공법에서선형관리 기술은 핵심기술 중 하나이다. 그럼에도 불구하고 , 우리나라에서는 몇몇 교량기술자들에게 경험적으로 이해되고 있는 수준을 넘지 못하고 있다. 특히, 세그멘트의 제작에서부터 반드시 필요한 선형관리용 S/W 및 그 운용기술은 아직까지도 선진기술에 의존하고 있는 실정이다. 본 연구에서는 프리캐스트 세그멘탈 공법의 선형관리 기술에 대한 연구를 통하여 3차원적인 세그멘트 제작관리와 가설시 선형관리를 위한 제작선형을 자동적으로 계산할 수 있는 GEOCON을 개발하였다. 본 논문에서는 GEOCON의 알고리즘에 대하여 논하였으며, 특히 수치예제로서 제작오차의 발생위치에 따라 교량선형에 미치는 영향을 분석하였다.