• Title/Summary/Keyword: Matching cost

Search Result 391, Processing Time 0.027 seconds

A Study on Genetic Algorithm and Stereo Matching for Object Depth Recognition (물체의 위치 인식을 위한 유전 알고리즘과 스테레오 정합에 관한 연구)

  • Hong, Seok-Keun;Cho, Seok-Je
    • Journal of Navigation and Port Research
    • /
    • v.32 no.5
    • /
    • pp.355-361
    • /
    • 2008
  • Stereo matching is one of the most active research areas in computer vision. In this paper, we propose a stereo matching scheme using genetic algorithm for object depth recognition. The proposed approach considers the matching environment as an optimization problem and finds the optimal solution by using an evolutionary strategy. Accordingly, genetic operators are adapted for the circumstances of stereo matching. An individual is a disparity set. Horizontal pixel line of image is considered as a chromosome. A cost function is composed of certain constraints which are commonly used in stereo matching. Since the cost function consists of intensity, similarity and disparity smoothness, the matching process is considered at the same time in each generation. The LoG(Laplacian of Gaussian) edge is extracted and used in the determination of the chromosome. We validate our approach with experimental results on stereo images.

Stereo Matching by Dynamic Programming with Edges Emphasized (에지 정보를 강조한 동적계획법에 의한 스테레오 정합)

  • Joo, Jae-Heum;Oh, Jong-kyu;Seol, Sung-Wook;Lee, Chul-Hun;Nam, Ki-Gon
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.10
    • /
    • pp.123-131
    • /
    • 1999
  • In this paper, we proposed stereo matching algorithm by dynamic programming with edges emphasized. Existing algorithms show blur generally at depth discontinuities owing to smoothness constraint and non-existence of matching pixel in occlusion regions. Also it accompanies matching error by lackness of matching information in the untextured regions. This paper defines new cost function to make up for the problems occurred to existing algorithms. It is possible through deriving matching of edges in left and right images to be carried out between edge regions anf deriving that in the other regions to be peformed between the other regions. In case of the possibility that edges can be Produced in a large amount, matching between edge information adds weight to cost function in proportion to Path distance. Proposed algorithm was applied to various images obtained by convergent camera model as well as parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion regions compared to existing algorithms. Also it could improve blur especially in discontinuity regions.

  • PDF

Bottom-Up Segmentation Based Robust Shape Matching in the Presence of Clutter and Occlusion

  • Joo, Han-Byul;Jeong, Ye-Keun;Kweon, In-So
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.307-310
    • /
    • 2009
  • In this paper, we present a robust shape matching approach based on bottom-up segmentation. We show how over-segmentation results can be used to overcome both ambiguity of contour matching and occlusion. To measure the shape difference between a template and the object in the input, we use oriented chamfer matching. However, in contrast to previous work, we eliminate the affection of the background clutters before calculating the shape differences using over-segmentation results. By this method, we can increase the matching cost interval between true matching and false matching, which gives reliable results. Finally, our experiments also demonstrate that our method is robust despite the presence of occlusion.

  • PDF

Reconstruction of Disparity Map for the Polygonal Man-Made Structures (다각형 인공 지물의 시차도 복원)

  • 이대선;엄기문;이쾌희
    • Korean Journal of Remote Sensing
    • /
    • v.11 no.2
    • /
    • pp.43-57
    • /
    • 1995
  • This paper presents reconstruction of disparity in images. To achieve this, the algorithm was made up of two different procedures - one is extraction of boundaries for man-made structures and the other is matching of the structures. In the extraction of boundaries for man-made structures, we assume that man-made structures are composed of lines and the lines make up closed polygon. The convertional algorithms of the edges extraction may not perceive man-made structures and have problems that matching algorithms were too complex. This paper proposed sub-pixel boundaries extraction algorithm that fused split-and-merge and image improvement algorithms to overcome complexity. In matching procedure, feature-based algorithm that minimize the proposed cost function are used and the cost fuction considers movement of mid-points for left and right images to match structures. Because we could not obtain disparity of inner parts for the man-made structures, interpolation method was used. The experiment showed good results.

Feature matching toy Omnidirectional Image based on Singular Value Decomposition

  • Kim, Do-Yoon;Lee, Young-Jin;Myung jin Chung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.98.2-98
    • /
    • 2002
  • $\textbullet$ Omnidirectional feature matching $\textbullet$ SVD-based matching algorithm $\textbullet$ Using SSD instead of the zero-mean correlation $\textbullet$ The similarity with the Gaussian weighted $\textbullet$ Low computational cost $\textbullet$ It describes the similarity of the matched pairs in omnidirectional images.

  • PDF

Improvement of ASIFT for Object Matching Based on Optimized Random Sampling

  • Phan, Dung;Kim, Soo Hyung;Na, In Seop
    • International Journal of Contents
    • /
    • v.9 no.2
    • /
    • pp.1-7
    • /
    • 2013
  • This paper proposes an efficient matching algorithm based on ASIFT (Affine Scale-Invariant Feature Transform) which is fully invariant to affine transformation. In our approach, we proposed a method of reducing similar measure matching cost and the number of outliers. First, we combined the Manhattan and Chessboard metrics replacing the Euclidean metric by a linear combination for measuring the similarity of keypoints. These two metrics are simple but really efficient. Using our method the computation time for matching step was saved and also the number of correct matches was increased. By applying an Optimized Random Sampling Algorithm (ORSA), we can remove most of the outlier matches to make the result meaningful. This method was experimented on various combinations of affine transform. The experimental result shows that our method is superior to SIFT and ASIFT.

Local Stereo Matching Method based on Improved Matching Cost and Disparity Map Adjustment (개선된 정합 비용 및 시차 지도 재생성 기반 지역적 스테레오 정합 기법)

  • Kang, Hyun Ryun;Yun, In Yong;Kim, Joong Kyu
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.5
    • /
    • pp.65-73
    • /
    • 2017
  • In this paper, we propose a stereo matching method to improve the image quality at the hole and the disparity discontinuity regions. The stereo matching method extracts disparity map finding corresponding points between stereo image pair. However conventional stereo matching methods have a problem about the tradeoff between accuracy and precision with respect to the length of the baseline of the stereo image pair. In addition, there are hole and disparity discontinuity regions which are caused by textureless regions and occlusion regions of the stereo image pair. The proposed method extracts initial disparity map improved at disparity discontinuity and miss-matched regions using modified AD-Census-Gradient method and adaptive weighted cost aggregation. And then we conduct the disparity map refinement to improve at miss-matched regions, while also improving the accuracy of the image. Experimental results demonstrate that the proposed method produces high-quality disparity maps by successfully improving miss-matching regions and accuracy while maintaining matching performance compared to existing methods which produce disparity maps with high matching performance. And the matching performance is increased about 3.22(%) compared to latest stereo matching methods in case of test images which have high error ratio.

A Multiresolution Stereo Matching Based on Genetic Algorithm using Edge Information (에지 정보를 이용한 유전 알고리즘 기반의 다해상도 스테레오 정합)

  • Hong, Seok-Keun;Cho, Seok-Je
    • The KIPS Transactions:PartB
    • /
    • v.17B no.1
    • /
    • pp.63-68
    • /
    • 2010
  • In this paper, we propose a multiresolution stereo matching method based on genetic algorithm using edge information. The proposed approach considers the matching environment as an optimization problem and finds the solution by using a genetic algorithm. A cost function composes of certain constraints which are commonly used in stereo matching. We defines the structure of chromosomes using edge pixel information of reference image of stereo pair. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement. We valid our approach not only reduce the search time for correspondence but alse ensure the validity of matching.

THE SPECTRAL SHAPE MATCHING METHOD FOR THE ATMOSPHERIC CORRECTION OF LANDSAT IMAGERY IN SAEMANGEUM COASTAL AREA

  • Min Jee-Eun;Ryu Joo-Hyung;Shanmugam P.;Ahn Yu-Hwan;Lee Kyu-Sung
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.671-674
    • /
    • 2005
  • Atmospheric correction over the ocean part is more important than that over the land because the signal from the ocean is very small about one tenth of that reflected from land. In this study, the Spectral Shape Matching Method (SSMM) developed by Ahn and Shanmugam (2004) is evaluated using Landsat imagery acquired over the highly turbid Saemangeum Coastal Area. The result of SSMM is compared with COST model developed by Chavez (1991 and 1997). In principle, SSMM is simple and easy to implement on any satellite imagery, relying on both field and image properties. To assess the potential use of these methods, several field campaigns were conducted in the Saemangeum coastal area corresponding with Landsat-7 satellite's overpass on 29 May 2005. In-situ data collected from the coastal waters of Saemangeum using optical instruments (ASD field spectroradiometer) consists of ChI, Ap, SS, aooM, F(d). In order to perform SSMM, we use the in-situ water-leaving radiance spectra from clear oceanic waters to estimate the the path radiance from total signal recorded at the top of the atmosphere (TOA), due to the reason that the shape of clear water-leaving radiance spectra is nearly stable than turbid water-leaving radiance spectra. The retrieved water-leaving radiance after subtraction of path signal from TOA signal in this way is compared with that estimated by COST model. The result shows that SSMM enabled retrieval of water-leaving radiance spectra that are consistent with in-situ data obtained from Saemangeum coastal waters. The COST model yielded significantly high errors in these areas.

  • PDF

Outcomes Analysis for Western Medicine and Korean Medicine Using the Propensity Score Matching in Allergic Rhinitis: Data from the Health Insurance Review and Assessment Service (알레르기 비염에서 성향 점수 매칭을 이용한 의과·한의과 간 성과 분석: 건강보험심사평가원 청구 자료 이용)

  • Kang, Chae-Yeong;Kim, Hui-Jun;Kim, Jeong-Hun;Hwang, Jin-Seub;Lee, Dong-Hyo
    • The Journal of Korean Medicine Ophthalmology and Otolaryngology and Dermatology
    • /
    • v.34 no.2
    • /
    • pp.53-69
    • /
    • 2021
  • Objectives : The purpose of this study is to analyze the effects of treatment between Western medicine and Korean medicine on Allergic rhinitis patients using national population-based claim data from the Health Insurance Review and Assessment Service. Methods : The subjects of the study were 30,024 patients in the Korean medicine group and 30,024 in the Western medicine group who were diagnosed with Allergic rhinitis from September 1, 2018 to December 31, 2018. Propensity score analysis was used for matching age, sex, etc. at a ratio of 1:1. Cox regression and subgroup analysis were used to estimate the adjusted hazard ratio of recurrence, Asthma, and Atopic dermatitis in Korean medicine group and Western medicine group. In addition, the total treatment period, total treatment cost, and average cost per day of visit were compared and analyzed. Results : Compared to Korean medicine, Western medicine had a significantly higher risk of recurrence at 1.701 times, Asthma occurrence risk at 1.609 times and Atopic dermatitis occurrence risk at 1.098 times. Compared to Western medicine, the total treatment period of Korean medicine was 14.27 days longer, the total treatment cost was 53,591 won more, and the average cost per day was 7,539 won more. Conclusions : This study is a retrospective cohort study using the propensity score matching in Korea to compare the outcomes of Allergic rhinitis between Western medicine and Korean medicine. Further research is needed by considering patients characteristics, and linking with additional data.