• Journal of Information Processing Systems
• /
• v.13 no.2
• /
• pp.256-267
• /
• 2017

An active research area in computer vision, stereo matching is aimed at obtaining three-dimensional (3D) information from a stereo image pair captured by a stereo camera. To extract accurate 3D information, a number of studies have examined stereo matching algorithms that employ adaptive support weight. Among them, the adaptive census transform (ACT) algorithm has yielded a relatively strong matching capability. The drawbacks of the ACT, however, are that it produces low matching accuracy at the border of an object and is vulnerable to noise. To mitigate these drawbacks, this paper proposes and analyzes the features of an improved stereo matching algorithm that not only enhances matching accuracy but also is also robust to noise. The proposed algorithm, based on the ACT, adopts the truncated absolute difference and the multiple sparse windows method. The experimental results show that compared to the ACT, the proposed algorithm reduces the average error rate of depth maps on Middlebury dataset images by as much as 2% and that is has a strong robustness to noise.

• 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.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.90-98
• /
• 2013

The stereo system based on local matching is very popular due to its algorithmic simplicity, however it is limited to apply to various applications because it shows poor quality with low matching rates. In this paper, we propose and design a realtime stereo system based on an adaptive support-weight and the system shows low error rates and realtime performance. Generally, in the adaptive support-weight algorithm the intermediate computing results can not be reused to reduce the number of computations. In this research we modify the scheduling to reuse the intermediate results for the better performance by processing rows and columns separately. The nonlinear functions such as exponential or arc tangent have been designed with piecewise linear and step functions by empirical simulations and error analysis. The proposed architecture is composed of 9 processing elements for realtime performance. The proposed stereo system has been designed and synthesized using Donbu Hitek 0.18um standard cell library and can run up to 350Mhz operation frequency (33 frames per second) with 424K gates.

• The Korean Journal of Applied Statistics
• /
• v.25 no.5
• /
• pp.829-835
• /
• 2012

When the input features are generated by factors in a classification problem, it is more meaningful to identify important factors, rather than individual features. The $F_{\infty}$-norm support vector machine(SVM) has been developed to perform automatic factor selection in classification. However, the $F_{\infty}$-norm SVM may suffer from estimation inefficiency and model selection inconsistency because it applies the same amount of shrinkage to each factor without assessing its relative importance. To overcome such a limitation, we propose the adaptive $F_{\infty}$-norm ($AF_{\infty}$-norm) SVM, which penalizes the empirical hinge loss by the sum of the adaptively weighted factor-wise $L_{\infty}$-norm penalty. The $AF_{\infty}$-norm SVM computes the weights by the 2-norm SVM estimator and can be formulated as a linear programming(LP) problem which is similar to the one of the $F_{\infty}$-norm SVM. The simulation studies show that the proposed $AF_{\infty}$-norm SVM improves upon the $F_{\infty}$-norm SVM in terms of classification accuracy and factor selection performance.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.9
• /
• pp.45-53
• /
• 2015

Adaptive support-weight based algorithm can produce better disparity map compared to generic area-based algorithms and also can be implemented as a realtime system. In this paper, we propose a realtime system based on geodesic support-weight which performs better segmentation of objects in the window. The data scheduling is analyzed for efficient hardware design and better performance and the parallel architecture for weight update which takes the longest delay is proposed. The exponential function is efficiently designed using a simple step function by careful error analysis. The proposed architecture is designed with verilogHDL and synthesized using Donbu Hitek 0.18um standard cell library. The proposed system shows 2.22% of error rate and can run up to 260Mhz (25fps) operation frequency with 182K gates.

• Annual Conference of KIPS
• /
• 2015.10a
• /
• pp.1559-1562
• /
• 2015

최근 3 차원 깊이 정보를 활용하는 분야가 많아짐에 따라, 정확한 깊이 정보를 추출하기 위한 연구가 계속 진행되고 있다. 특히 ASW(Adaptive Support Weight)는 기존의 영역 기반 알고리즘의 정확도를 향상시키기 위한 방법으로 많이 이용되고 있다. 그 중에서 ACT(Adaptive Census Transform)는 폐백 영역이나 경계 영역에서 정확도가 낮다는 단점이 있었다. 본 논문에서는 정확한 깊이 맵 (depth map)을 추출하기 위해, 기존의 ACT를 개선한 스테레오 정합 알고리즘을 제안한다. 이는 잡음에 강하고 재사용성이 높은 MSW(Multiple Sparse Windows)를 기반으로, TAD(Truncated Absolute Difference)와 ACT 두 개의 정합 알고리즘을 동시에 사용하여 폐색 영역과 울체의 경계 영역에서 정확도가 낮은 기존의 방법을 개선한다. Middlebury에서 제공하는 영상을 사용한 시뮬레이션 결과는 제안한 방법이 기존의 방법보다 평균적으로 약 1.9% 낮은 에러율(error rate)을 가짐을 보여준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4375-4388
• /
• 2018

To solve the problem of transmission errors in stereoscopic images, this paper proposes a novel error concealment (EC) method using superpixel segmentation and adaptive disparity selection (SSADS). Our algorithm consists of two steps. The first step is disparity estimation for each pixel in a reference image. In this step, the numbers of superpixel segmentation labels of stereoscopic images are used as a new constraint for disparity matching to reduce the effect of mismatching. The second step is disparity selection for a lost block. In this step, a strategy based on boundary smoothness is proposed to adaptively select the optimal disparity which is used for error concealment. Experimental results demonstrate that compared with other methods, the proposed method has significant advantages in both objective and subjective quality assessment.

• Journal of Digital Convergence
• /
• v.11 no.10
• /
• pp.123-131
• /
• 2013

This study aims to investigate development directions for smart contents to support enhancing adaptive behavior skills of children with autistic disorder in elementary school. AHP survey of experts including special education teachers and directors in educational institution for disability children was performed to analyze importance weight for smart contents development necessity and effectiveness in adaptive behavior skills. And the smart contents development suitability through pre-discussion for idea generation for various development method and AHP survey with smart application development experts was evaluated. The results show that the effective and suitable adaptive behavior skills for smart contents development were understanding of languaging, time management and keeping, movement skills, wearing clothes, and personal hygiene in order of importance. Based on this study, education authorities should make an effort not to develop fragmentary educational smart contents but to support development of smart contents and service systems with better effectiveness and usability to meet demand for special education teachers and parents considering characteristics of children with autism.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.841-842
• /
• 2008

스테레오 매칭(Stereo Matching) 기법에 대한 전역적인 방법과 지역적인 방법에 대한 연구가 활발하게 진행되고 있다. 최근의 적응적 영역 가중치 방법(Adaptive Support-Weight)은 매우 뛰어난 결과에 비해 많은 계산 시간이 필요하다. 따라서 로봇시스템에서 스테레오 매칭을 이용하기에는 부적합하다. 본 논문에서는 분리 가능한 Bilateral 필터를 이용하여 빠른 스테레오매칭 기법을 제안한다

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.2
• /
• pp.187-196
• /
• 1996

This paper introduces the concept of fixed weights and proposes an algorithm for classification by adding this concept to vector space separation method in LVQ. The proposed algorithm is based on competitive learning. It uses fixed weightsfor generality and fast adaptation efficient radius for new weight creation, and L1 distance for fast calcualtion. It can be applied to many fields requiring adaptive learning with the support of generality, real-tiem processing and sufficient training effect using smaller data set. Recognition rate of over 98% for the train set and 94% for the test set was obtained by applying the suggested algorithm to on-line handwritten recognition.