• Title/Summary/Keyword: Matching Cost

Search Result 391, Processing Time 0.027 seconds

Improve Stereo Matching by considering the Characteristic Points of the Image and the Cost Function (영상의 특징점과 비용함수를 고려한 스테레오 정합개선)

  • Paik, Yaeung-Min;Choi, Hyun-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.7
    • /
    • pp.1667-1679
    • /
    • 2010
  • This thesis proposes an adaptive variable-sized matching window method using the characteristic points of the image and a method to increase the reliability of the cross-consistency check to raise the correctness of the final disparity image. The proposed adaptive variable-sized window method segments the image with the color information, finds the characteristic points in each segmented image, and varies the size of the matching window according to the existence of the characteristic points inside the window. Also the proposed cross-consistency check method processes the two cases with the cost values corresponding to the best disparity and the second-best disparity: when the cost values themselves are too large and when the difference between the two cost values are too small. The two proposed methods were experimented with the four test images provided by the Middleburry site. As the results from the experiments, the proposed adaptive variable-sized matching window method decreased up to 18.2% of error ratio and the proposed cross-consistency check method increased up to 7.4% of reliability.

High-Performance VLSI Architecture for Stereo Vision (스테레오 비전을 위한 고성능 VLSI 구조)

  • Seo, Youngho;Kim, Dong-Wook
    • Journal of Broadcast Engineering
    • /
    • v.18 no.5
    • /
    • pp.669-679
    • /
    • 2013
  • This paper proposed a new VLSI (Very Large Scale Integrated Circuit) architecture for stereo matching in real time. We minimized the amount of calculation and the number of memory accesses through analyzing calculation of stereo matching. From this, we proposed a new stereo matching calculating cell and a new hardware architecture by expanding it in parallel, which concurrently calculates cost function for all pixels in a search range. After expanding it, we proposed a new hardware architecture to calculate cost function for 2-dimensional region. The implemented hardware can be operated with minimum 250Mhz clock frequence in FPGA (Field Programmable Gate Array) environment, and has the performance of 805fps in case of the search range of 64 pixels and the image size of $640{\times}480$.

Statistical micro matching using a multinomial logistic regression model for categorical data

  • Kim, Kangmin;Park, Mingue
    • Communications for Statistical Applications and Methods
    • /
    • v.26 no.5
    • /
    • pp.507-517
    • /
    • 2019
  • Statistical matching is a method of combining multiple sources of data that are extracted or surveyed from the same population. It can be used in situation when variables of interest are not jointly observed. It is a low-cost way to expect high-effects in terms of being able to create synthetic data using existing sources. In this paper, we propose the several statistical micro matching methods using a multinomial logistic regression model when all variables of interest are categorical or categorized ones, which is common in sample survey. Under conditional independence assumption (CIA), a mixed statistical matching method, which is useful when auxiliary information is not available, is proposed. We also propose a statistical matching method with auxiliary information that reduces the bias of the conventional matching methods suggested under CIA. Through a simulation study, proposed micro matching methods and conventional ones are compared. Simulation study shows that suggested matching methods outperform the existing ones especially when CIA does not hold.

Neural network with occlusion-resistant and reduced parameters in stereo images (스테레오 영상에서 폐색에 강인하고 축소된 파라미터를 갖는 신경망)

  • Kwang-Yeob Lee;Young-Min Jeon;Jun-Mo Jeong
    • Journal of IKEEE
    • /
    • v.28 no.1
    • /
    • pp.65-71
    • /
    • 2024
  • This paper proposes a neural network that can reduce the number of parameters while reducing matching errors in occluded regions to increase the accuracy of depth maps in stereo matching. Stereo matching-based object recognition is utilized in many fields to more accurately recognize situations using images. When there are many objects in a complex image, an occluded area is generated due to overlap between objects and occlusion by background, thereby lowering the accuracy of the depth map. To solve this problem, existing research methods that create context information and combine it with the cost volume or RoIselect in the occluded area increase the complexity of neural networks, making it difficult to learn and expensive to implement. In this paper, we create a depthwise seperable neural network that enhances regional feature extraction before cost volume generation, reducing the number of parameters and proposing a neural network that is robust to occlusion errors. Compared to PSMNet, the proposed neural network reduced the number of parameters by 30%, improving 5.3% in color error and 3.6% in test loss.

Stero matching using dynamic programming with region partition (영역 분할에 의한 동적 계획법을 이용한 스테레오 정합)

  • 강창순;김종득;이상욱;남기곤
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.6
    • /
    • pp.11-20
    • /
    • 1997
  • This paper proposes a modified dynamic programming for finding the correspondence between right and left images. A dynamic programming is based on the intensity of images for stereo matching. But htis method is intended to mismatch at uniformed intensity region. To reduce thd mismatching, the stereo images are segmented to various regions with respective uniform intensity, and the different cost function has applied to the segmented region during the dynamci programming. Cost function costains jump cost. And jump cost included two parameter .alpha. and .beta. which have influence on minimum cost path. Experimental results show that the 3D shape of some stereo pairs cna be finely obtained by this proposed algorithm.

  • PDF

Multirate Sampled-Data Control System: Optimal Digital Redesign Approach (멀티레이트 샘플치 시스템: 최적 디지털 재설계 기법)

  • Kim, Do-Wan;Park, Jin-Bae;Jang, Kwon-Kyu;Joo, Young-Hoon
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.708-710
    • /
    • 2004
  • This paper studies a multirate sampled-data control for LTI systems by using the digital redesign (DR) method. In this note, to well tackle the problem associated with both the state matching and the stabilization, our nobel strategy is to minimize the linear quadratic cost function. The main features of the proposed method are that i) the delta-operator-based descretization method is applied to improve the state-matching performance in the fast sampling limit and/or the large input multiplicity; ii) the proposed multirate control scheme can improve the state-matching performance in the long sampling limit; iii) some sufficient conditions that guarantee the stability of the closed-loop discrete-time system and provide a guarantee cost for the cost function can be formulated in the LMIs format; and iv) an optimal sampled-data controller in the sense of minimizing the upper bound of the cost function is also given by means of an LMI optimization procedure.

  • PDF

An Efficient Approximation method of Adaptive Support-Weight Matching in Stereo Images (스테레오 영상에서의 적응적 영역 가중치 매칭의 효율적 근사화 방법)

  • Kim, Ho-Young;Lee, Seong-Won
    • Journal of Broadcast Engineering
    • /
    • v.16 no.6
    • /
    • pp.902-915
    • /
    • 2011
  • Recently in the area-based stereo matching field, Adaptive Support-Weight (ASW) method that weights matching cost adaptively according to the luminance intensity and the geometric difference shows promising matching performance. However, ASW requires more computational cost than other matching algorithms do and its real-time implementation becomes impractical. By applying Integral Histogram technique after approximating to the Bilateral filter equation, the computational time of ASW can be restricted in constant time regardless of the support window size. However, Integral Histogram technique causes loss of the matching accuracy during approximation process of the original ASW equation. In this paper, we propose a novel algorithm that maintains the ASW algorithm's matching accuracy while reducing the computational costs. In the proposed algorithm, we propose Sub-Block method that groups the pixels within the support area. We also propose the method adjusting the disparity search range depending on edge information. The proposed technique reduces the calculation time efficiently while improving the matching accuracy.

Block Matching Algorithm Using Pixels Selected by Image Complexity (영상 복잡도에 따라 선택된 화소들을 이용한 블록 정합 알고리즘)

  • Kim Seong-hee;Oh Jeong-su
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.8
    • /
    • pp.1703-1708
    • /
    • 2005
  • This paper proposes a modified block matching algorithm which reduces an amount of matching computation by using only pixels contributing greatly to block matching. In consideration of algorithm implementation and additional informatirm, the proposed algorithm divides a matching block into sub-blocks, selects some sub-blocks using their complexities, and execute the block mating with them. Simulation results show that the proposed algorithm performs a valid block matching, diminishing computation cost.

The Matching Principle, Discretionary Accrual and Cost of Capital (수익비용대응, 재량적 발생액 및 자기자본비용)

  • Lee, Kyu-Jin
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.6
    • /
    • pp.483-488
    • /
    • 2019
  • This study first examines whether the high matching principle reduces the cost of equity, and then examines the effect on discretionary accruals and capital cost. According to previous studies, the higher the response to revenue cost, the higher the earnings quality. The higher the quality of earnings, the lower the information risk, and the lower the information risk, the lower the capital cost of enterprise. Discretionary accruals can play two roles in opposing each other. One is that managers use the discretionary accruals to provide private information about the future of the corporation to the market, thus enhancing the usefulness of the earnings. The other is that managers can use the discretionary accruals opportunistically to distort earnings and provide misinformed information to investors, thus reducing the usefulness of earnings. The results of this study represents that the higher the responding to the revenue cost, the less the cost of equity. In the case of firms with high revenue response, we examine whether discretionary accruals reduce the cost of equity capital. As a result of the study, the higher the responding to the revenue cost, the lower the cost of equity capital. Companies with higher matching principle have been shown to reduce their capital costs by using discretionary accruals.

High-Quality Stereo Depth Map Generation Using Infrared Pattern Projection

  • Jeong, Jae-Chan;Shin, Hochul;Chang, Jiho;Lim, Eul-Gyun;Choi, Seung Min;Yoon, Kuk-Jin;Cho, Jae-Il
    • ETRI Journal
    • /
    • v.35 no.6
    • /
    • pp.1011-1020
    • /
    • 2013
  • In this paper, we present a method for obtaining a high-quality 3D depth. The advantages of active pattern projection and passive stereo matching are combined and a system is established. A diffractive optical element (DOE) is developed to project the active pattern. Cross guidance (CG) and auto guidance (AG) are proposed to perform the passive stereo matching in a stereo image in which a DOE pattern is projected. When obtaining the image, the CG emits a DOE pattern periodically and consecutively receives the original and pattern images. In addition, stereo matching is performed using these images. The AG projects the DOE pattern continuously. It conducts cost aggregation, and the image is restored through the process of removing the pattern from the pattern image. The ground truth is generated to estimate the optimal parameter among various stereo matching algorithms. Using the ground truth, the optimal parameter is estimated and the cost computation and aggregation algorithm are selected. The depth is calculated and bad-pixel errors make up 4.45% of the non-occlusion area.