• 한국멀티미디어학회논문지
• /
• 제25권5호
• /
• pp.670-675
• /
• 2022

This study proposes an improved binarization method to improve image recognition rate. The research goal is to minimize the information loss that occurs during the binarization process, and to transform the object of the original image that cannot be determined through the transformation process into an image that can be judged. The proposed method uses a stepwise segmentation method of an image and divides blocks using prime numbers. Also, within one block, a trapezoidal type of fuzzy is applied. The fuzzy trapezoid is binarized by dividing the brightness histogram area into three parts according to the degree of membership. As a result of the experiment, information loss was minimized in general images. In addition, it was found that the converted binarized image expressed the object better than the original image in the special image in which the brightness region was tilted to one side.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.438-441
• /
• 2004

Image binarization using a global threshold value [3] performs at high speed, but usually results in undesired binary images when the source images are of poor quality. In such cases, adaptive local thresholding algorithms [1][2][3] are used to obtain better results, and the algorithm proposed by A.E.Savekis which chooses local threshold using fore­ground and background clustering [1] is one of the best thresholding algorithms. However, this algorithm runs slowly due to its re-computing threshold value of each central pixel in a local window MxM. In this paper, we present a dynamic programming approach for the step of calculating local threshold value that reduces many redundant computations and improves the execution speed significantly. Experiments show that our proposal improvement runs more ten times faster than the original algorithm.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 학술대회지
• /
• pp.814-818
• /
• 2004

Off-line handwritten character recognition is in difficulty of incomplete preprocessing because it has not dynamic and timing information besides has various handwriting, extreme overlap of the consonant and vowel and many error image of stroke. Consequently off-line handwritten character recognition needs to study about preprocessing of various methods such as binarization and thinning. This paper considers running time of watershed algorithm and the quality of resulting image as preprocessing For off-line handwritten Korean character recognition. So it proposes application of effective watershed algorithm for segmentation of character region and background region in gray level character image and segmentation function for binarization image and segmentation function for binarization by extracted watershed image. Besides it proposes thinning methods which effectively extracts skeleton through conditional test mask considering running time and quality. of skeleton, estimates efficiency of existing methods and this paper's methods as running time and quality. Watershed image conversion uses prewitt operator for gradient image conversion, extracts local minima considering 8-neighborhood pixel. And methods by using difference of mean value is used in region merging step, Converted watershed image by means of this methods separates effectively character region and background region applying to segmentation function. Average execution time on the previous method was 2.16 second and on this paper method was 1.72 second. We prove that this paper's method removed noise effectively with overlap stroke as compared with the previous method.

• 한국정보과학회논문지:시스템및이론
• /
• 제35권12호
• /
• pp.560-567
• /
• 2008

본 논문에서는 비디오 영상에서 추출한 이미지를 이용하여, 흑백 만화로 변환하기 위한 알고리즘에 대해 논의한다. 대부분의 흑백 만화는 사람의 얼굴이나 손과 같은 살색 계통은 흰색 내지 엷은 색상으로 표현되며, 이미지의 어두운 영역은 해칭과 같이 규칙적이면서도 불규칙한 형태로 묘사한다. 그러므로 단순한 임계값을 이용한 이진화 알고리즘으로 흑백 만화를 렌더링 할 경우, 원본 색상 영상의 다양한 색상과 흑백 만화에서 사용되는 다양한 패턴을 렌더링 할 수 없다. 이러한 흑백 만화의 특징을 반영한 카투닝을 수행하기 위해서, 본 논문에서는 다음과 같은 작업을 수행한다. 먼저, 원본 이미지 영상의 미세한 색상변화를 제거하기 위해서, 1) Bilateral 필터를 적용한다. 그 후, 영상의 각 영역을 유사한 색상 정보로 클러스터링 하기 위해서, 2) Mean shift 세그멘테이션을 적용하였으며, 각 영역별 확장 작업을 수행하였다. 이때 각 영역의 색상이 유사한 정도를 계산하기 위해서, 사람의 색상인지 능력과 유사한 특성을 가진 HSV 색상 모델을 사용하여, 각 영역의 색상 유사정도를 계산하였다. 최종적으로 세그멘테이션된 색상정보를 바탕으로 흑백만화에서 일반적으로 활용되는 색상과 프레임 이미지의 픽셀값을 고려한 3) 이진화를 수행하고, 4) 스트록을 추가해 흑백 만화의 컷 이미지를 완성한다.

• IEIE Transactions on Smart Processing and Computing
• /
• 제4권2호
• /
• pp.126-131
• /
• 2015

When a battery is discharging, the battery's current and terminal voltage must both be measured to estimate its state of charge (SOC). If the SOC can be estimated by using only the current or voltage, hardware costs will decrease. This paper proposes an SOC estimation algorithm that needs to measure only the terminal voltage while a battery is discharging. The battery's SOC can be deduced from its open circuit voltage (OCV) through the relationship between SOC and OCV. But when the battery is discharging, it is not possible to measure the OCV due to the voltage drop in the battery's internal resistance (IRdrop). The proposed algorithm calculates OCV by estimating IRdrop using a dynamic terminal voltage measurement. This paper confirms the results of applying the algorithm in a hardware environment via algorithm binarization. To evaluate the algorithm, a Simulink battery model based on actual values was used.

• Journal of Information Processing Systems
• /
• 제14권4호
• /
• pp.892-903
• /
• 2018

The paper proposes a novel gait recognition algorithm based on feature fusion of gait energy image (GEI) dynamic region and Gabor, which consists of four steps. First, the gait contour images are extracted through the object detection, binarization and morphological process. Secondly, features of GEI at different angles and Gabor features with multiple orientations are extracted from the dynamic part of GEI, respectively. Then averaging method is adopted to fuse features of GEI dynamic region with features of Gabor wavelets on feature layer and the feature space dimension is reduced by an improved Kernel Principal Component Analysis (KPCA). Finally, the vectors of feature fusion are input into the support vector machine (SVM) based on multi classification to realize the classification and recognition of gait. The primary contributions of the paper are: a novel gait recognition algorithm based on based on feature fusion of GEI and Gabor is proposed; an improved KPCA method is used to reduce the feature matrix dimension; a SVM is employed to identify the gait sequences. The experimental results suggest that the proposed algorithm yields over 90% of correct classification rate, which testify that the method can identify better different human gait and get better recognized effect than other existing algorithms.

• 정보처리학회논문지B
• /
• 제9B권4호
• /
• pp.481-490
• /
• 2002

오프라인 필기체 문자 인식은 동적인 정보를 가지고 있지 않고, 다양한 필기와 자음과 모음의 겹침이 심하며, 획 사이의 잡영을 많이 가지고 있어 불완전한 전처리를 수행하여야 하는 어려움이 있다. 따라서 오프라인 필기체 문자 인식은 다양한 방법의 전처리 즉 이진화 및 세선화에 대한 연구가 필요하다. 본 논문에서는 오프라인 필기체 한글 문자 인식의 전처리로서 워터쉐드 알고리즘의 수행 시간과 결과 영상의 품질을 고려해 그레이 레벨 문자 영상에서의 문자 영역과 배경 영역의 분할을 위한 효과적인 워터쉐드 알고리즘의 적용 방법과 추출된 워터쉐드 영상을 이진화하는 분할 함수를 제안한다. 또한 수행 시간과 골격선의 품질을 고려한 조건 검사 마스크를 통해서 효과적으로 골격선을 추출하는 세선화 방법을 제안하고 기존의 방법과 본 논문 방법을 수행 시간과 품질로써 성능을 평가한다. 실험 결과 기존의 방법은 평균 2.16초, 본 논문 방법은 평균 1.72초의 수행 시간이 걸렸다. 또한 결과 영상의 품질은 본 논문 방법이 문자 획 사이의 잡영을 효과적으로 처리함을 알 수 있었다.

• 제어로봇시스템학회논문지
• /
• 제22권9호
• /
• pp.738-744
• /
• 2016

In this paper, a robust visual odometry system has been proposed and implemented in an environment with dynamic illumination. Visual odometry is based on stereo images to estimate the distance to an object. It is very difficult to realize a highly accurate and stable estimation because image quality is highly dependent on the illumination, which is a major disadvantage of visual odometry. Therefore, in order to solve the problem of low performance during the feature detection phase that is caused by illumination variations, it is suggested to determine an optimal threshold value in the image binarization and to use an adaptive threshold value for feature detection. A feature point direction and a magnitude of the motion vector that is not uniform are utilized as the features. The performance of feature detection has been improved by the RANSAC algorithm. As a result, the position of a mobile robot has been estimated using the feature points. The experimental results demonstrated that the proposed approach has superior performance against illumination variations.

• 한국지능시스템학회논문지
• /
• 제13권1호
• /
• pp.57-62
• /
• 2003

자동화 지문인식을 위한 과정에서 지문영상의 정보를 보존하면서 최적의 세선화와 특이점추출을 위한 중요한 부분은 이진화 과정이다. 이진화 과정은 그레이-스케일 레벨의 영상을 0과 255값으로 바꾸는 과정이다. 이 과정에서 적절한 기준레벨값(Threshold Value)을 설정해 주지 않으면 지문영상의 정보가 손실된다. 본 논문에서는 이진화 과정 부분에 인공지능 기법을 적용하여 입력되는 지문영상에서 실시간으로 기준레벨(Threshold)을 추출하는 방법을 제안한다. 실험결과 기존의 방법과 비교하여 좋은 성능을 보여주고 있음을 나타낸다

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5624-5638
• /
• 2016

A novel method based on Surf points is proposed to detect and lock-track single ground target in aerial videos. Videos captured by moving cameras contain complex motions, which bring difficulty in moving object detection. Our approach contains three parts: moving target template detection, search area estimation and target tracking. Global motion estimation and compensation are first made by grids-sampling Surf points selecting and matching. And then, the single ground target is detected by joint spatial-temporal information processing. The temporal process is made by calculating difference between compensated reference and current image and the spatial process is implementing morphological operations and adaptive binarization. The second part improves KALMAN filter with surf points scale information to predict target position and search area adaptively. Lastly, the local Surf points of target template are matched in this search region to realize target tracking. The long-term tracking is updated following target scaling, occlusion and large deformation. Experimental results show that the algorithm can correctly detect small moving target in dynamic scenes with complex motions. It is robust to vehicle dithering and target scale changing, rotation, especially partial occlusion or temporal complete occlusion. Comparing with traditional algorithms, our method enables real time operation, processing $520{\times}390$ frames at around 15fps.