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

• Proceedings of the Korea Information Processing Society Conference
• /
• 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)을 가짐을 보여준다.

• Journal of Digital Convergence
• /
• v.14 no.10
• /
• pp.271-276
• /
• 2016

In this paper, we propose robust face and eye detection algorithm under changing environmental condition such as lighting and pose variations. Generally, the eye detection process is performed followed by face detection and variations in pose and lighting affects the detection performance. Therefore, we have explored face detection based on Modified Census Transform algorithm. The eye has dominant features in face area and is sensitive to lighting condition and eye glasses, etc. To address these issues, we propose a robust eye detection method based on Gabor transformation and Features from Accelerated Segment Test algorithms. Proposed algorithm presents 27.4ms in detection speed with 98.4% correct detection rate, and 36.3ms face detection speed with 96.4% correct detection rate for eye detection performance.

• Journal of Digital Convergence
• /
• v.13 no.6
• /
• pp.151-156
• /
• 2015

In this paper, we have proposed personal multimodal biometric authentication system based on face detection, recognition and speaker verification for smart-phone environment. Proposed system detect the face with Modified Census Transform algorithm then find the eye position in the face by using gabor filter and k-means algorithm. Perform preprocessing on the detected face and eye position, then we recognize with Linear Discriminant Analysis algorithm. Afterward in speaker verification process, we extract the feature from the end point of the speech data and Mel Frequency Cepstral Coefficient. We verified the speaker through Dynamic Time Warping algorithm because the speech feature changes in real-time. The proposed multimodal biometric system is to fuse the face and speech feature (to optimize the internal operation by integer representation) for smart-phone based real-time face detection, recognition and speaker verification. As mentioned the multimodal biometric system could form the reliable system by estimating the reasonable performance.

• Convergence Security Journal
• /
• v.13 no.3
• /
• pp.9-15
• /
• 2013

Calculating of matching cost is an important for efficient stereo matching. To investigate the performance of matching process, the concepts of the existing methods are introduced. Also we analyze the performance and merits of them. The simplest matching costs assume constant intensities at matching image locations. We consider matching cost functions which can be distinguished between pixel-based and window-based approaches. The Pixel-based approach includes absolute differences (AD) and sampling-intensitive absolute differences (BT). The window-based approach includes the sum of the absolute differences, the sum of squared differences, the normalized cross-correlation, zero-mean normalized cross-correlation, census transform, and the absolute differences census transform (AD-Census). We evaluate matching cost functions in terms of accuracy and time complexity. In terms of the accuracy, AD-Census method shows the lowest matching error ratio (the best solution). The ZNCC method shows the lowest matching error ratio in non-occlusion and all evaluation part. But it performs high matching error ratio at the discontinuities evaluation part due to blurring effect in the boundary. The pixel-based AD method shows a low complexity in terms of time complexity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.2
• /
• pp.33-44
• /
• 2010

This paper propose the structure of real-time face detection hardware architecture for robot vision processing applications. The proposed architecture is robust against illumination changes and operates at no less than 60 frames per second. It uses Modified Census Transform to obtain face characteristics robust against illumination changes. And the AdaBoost algorithm is adopted to learn and generate the characteristics of the face data, and finally detected the face using this data. This paper describes the face detection hardware structure composed of Memory Interface, Image Scaler, MCT Generator, Candidate Detector, Confidence Comparator, Position Resizer, Data Grouper, and Detected Result Display, and verification Result of Hardware Implementation with using Virtex5 LX330 FPGA of Xilinx. Verification result with using the images from a camera showed that maximum 32 faces per one frame can be detected at the speed of maximum 149 frame per second.

• Journal of IKEEE
• /
• v.26 no.4
• /
• pp.686-692
• /
• 2022

In this paper, the matching error rates of modified area-based, energy-based algorithms, and learning-based structures were compared for stereo image matching. Census transform (CT) based on region and life propagation (BP) algorithm based on energy were selected, respectively.Existing algorithms have been improved and implemented in an embedded processor environment so that they can be used for stereo image matching in mobile systems. Even in the case of the learning base to be compared, a neural network structure that utilizes small-scale parameters was adopted. To compare the error rates of the three matching methods, Middlebury's Tsukuba was selected as a test image and subdivided into non-occlusion, discontinuous, and disparity error rates for accurate comparison. As a result of the experiment, the error rate of modified CT matching improved by about 11% when compared with the existing algorithm. BP matching was about 87% better than conventional CT in the error rate. Compared to the learning base using neural networks, BP matching was about 31% superior.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.1
• /
• pp.91-96
• /
• 2015

In this study, we introduce robust face recognition system with illumination variation realized with the aid of CT preprocessing method. As preprocessing algorithm, Census Transform(CT) algorithm is used to extract locally facial features under unilluminated condition. The dimension reduction of the preprocessed data is carried out by using $(2D)^2$PCA which is the extended type of PCA. Feature data extracted through dimension algorithm is used as the inputs of proposed radial basis function neural networks. The hidden layer of the radial basis function neural networks(RBFNN) is built up by fuzzy c-means(FCM) clustering algorithm and the connection weights of the networks are described as the coefficients of linear polynomial function. The essential design parameters (including the number of inputs and fuzzification coefficient) of the proposed networks are optimized by means of artificial bee colony(ABC) algorithm. This study is experimented with both Yale Face database B and CMU PIE database to evaluate the performance of the proposed system.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.6
• /
• pp.473-479
• /
• 2019

This study applied SGM (Semi Global Matching) to generate DSM (Digital Surface Model) using WorldView-1 high-resolution satellite stereo pair in Terrassa, Spain provided by ISPRS (International Society for Photogrammetry and Remote Sensing). The SGM is an image matching algorithm that performs the computation of the matching cost for the stereo pair in multi-paths and aggregates the computed costs sequentially. This method finally calculates the disparity corresponding to the minimum (or maximum) value of the aggregation cost. The cost was applied to MI (Mutual Information), NCC (Normalized Cross-Correlation), and CT (Census Transform) in order to the SGM. The accuracy and performance of the outline representation result in DSM by each cost are presented. Based on the images used and the subject area, the accuracy of the CT cost results was the highest, and the outline representation was also most clearly depicted. In addition, while the SGM method represented more detailed outlines than the existing software, many errors occurred in the water area.

• Journal of Korea Multimedia Society
• /
• v.16 no.3
• /
• pp.302-308
• /
• 2013

In this research, we have explored personal authentication system through multimodal biometrics for mobile computing environment. We have selected face and speaker recognition for the implementation of multimodal biometrics system. For face recognition part, we detect the face with Modified Census Transform (MCT). Detected face is pre-processed through eye detection module based on k-means algorithm. Then we recognize the face with Principal Component Analysis (PCA) algorithm. For speaker recognition part, we extract features using the end-point of voice and the Mel Frequency Cepstral Coefficient (MFCC). Then we verify the speaker through Dynamic Time Warping (DTW) algorithm. Our proposed multimodal biometrics system shows improved verification rate through combining two different biometrics described above. We implement our proposed system based on Android environment using Galaxy S hoppin. Proposed system presents reduced false acceptance ratio (FAR) of 1.8% which shows improvement from single biometrics system using the face and the voice (presents 4.6% and 6.7% respectively).