• ETRI Journal
• /
• 제35권3호
• /
• pp.491-500
• /
• 2013

A connected component analysis from a binary image is a popular character segmentation method but occasionally fails to segment the characters owing to image noise and uneven illumination. A multimethod binarization scheme that incorporates two or more binary images is a novel solution, but selection of binarization methods has never been analyzed before. This paper reveals the best combination of binarization methods and parameters and presents an in-depth analysis of the multimethod binarization scheme for better character segmentation. We carry out an extensive quantitative evaluation, which shows a significant improvement over conventional single-method binarization methods. Experiment results of six binarization methods and their combinations with different test images are presented.

• 한국통신학회논문지
• /
• 제21권11호
• /
• pp.2750-2767
• /
• 1996

In this papr, a new lossless compression method is presented based on the Binary Adaptive Arithmetic Coder(BAAC). A simple unbalanced binary tree is created by recursively dividing the BAAC unit interval into two probability sub-inervals. On the tree the More Probable Predicted Value(MPPV) and Less Probable Predicated Value(LPPV) estimated by local statistics of the image pixels are arranged in decreasing order. The BAAC or Huffman coder is thus applied to the branches of the tree. The proposed method allows the coder be directly applied to the full bit-plane medical image without a decomposition of the full bit-planes into a series of binary bit-planes. The use of the full bit model template improves the compresion ratio. In addition, a fast computation for adjusting the interval is possible since a simple arithmetic operation based on probability interval estimation state machine is used for interval sub-division within the BAAC unit interval.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -2
• /
• pp.1284-1287
• /
• 2002

A fast algorithm for a circular pattern recognition from a binary edge image is proposed in this paper. The implementation of this algorithm onto an FPGA is designed using Verilog-HDL where a target device is Altera EPF10K100ARC240-3. For a 256 ${\times}$ 256-pixe1 binary edge image assuming a real watermelon in a greenhouse, improved circuit performance of the proposed design was confirmed.

• 한국콘텐츠학회논문지
• /
• 제2권4호
• /
• pp.46-50
• /
• 2002

본 논문은 지문 영상의 전처리중 이진화 수행과정에서 지문 영상의 국부적 밝기 차이에 따른 가장 큰 애로점인 임계치(threshold value) 설정을 대상 지문 영역의 밝기 등에 스스로 적응할 수 있도록 Silt Sum 방법을 응용한 적을 이진화를 수행하였다. 기존의 방법과 비교하여 본 연구에서 제시한 개선된 전처리 방법은 보다 높은 인식 정확도를 제공하며, 이에 따라 실험 결과에서 보는 바와 같이 지문 인식을 위한 특징점 추출 알고리즘에 적용될 수 있다.

• 대한전자공학회논문지
• /
• 제27권1호
• /
• pp.105-111
• /
• 1990

In this paper, fast algorithms to generate the codebook of vector quantization in image coding, are proposed. And an efficient algorithm to guess a initial codebook, namely, binary splitting method, is proposed. We generated the initial codebook by binary splitting method and then reduced the searching time using Iterative Optimization algorithm as an alternate to the generalized Lloyd algorithm and several information from binary splitting method. And the searching time and performance can be traded off by varying the searching range. With this proposed algorithm, the computation time can be reduced by a factor of 60 Without any degradation of image quality.

• Journal of Information Processing Systems
• /
• 제13권6호
• /
• pp.1628-1639
• /
• 2017

The combination texture feature extraction approach for texture image retrieval is proposed in this paper. Two kinds of low level texture features were combined in the approach. One of them was extracted from singular value decomposition (SVD) based dual-tree complex wavelet transform (DTCWT) coefficients, and the other one was extracted from multi-scale local binary patterns (LBPs). The fusion features of SVD based multi-directional wavelet features and multi-scale LBP features have short dimensions of feature vector. The comparing experiments are conducted on Brodatz and Vistex datasets. According to the experimental results, the proposed method has a relatively better performance in aspect of retrieval accuracy and time complexity upon the existing methods.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2009년도 추계학술발표대회
• /
• pp.345-346
• /
• 2009

The segmentation of vessel including portal vein, hepatic vein and artery, from Computed Tomography (CT) images plays an important role in the therapeutic strategies for hepatic diseases. Representing segmented vessels in three dimensional spaces is extremely useful for doctors to plan liver surgery. In this paper, proposed method is focused on smoothing technique of segmented 3D liver vessels, which derived from 3D region growing approach. A pixel expand algorithm has been developed first to avoid vessel lose and disconnection cased by the next smoothing technique. And then a binary volume filtering technique has been implemented and applied to make the segmented binary vessel volume qualitatively smoother. This strategy uses an iterative relaxation process to extract isosurfaces from binary volumes while retaining anatomical structure and important features in the volume. Hard and irregular place in volume image has been eliminated as shown in the result part, which also demonstrated that proposed method is a suitable smoothing solution for post processing of fine vessel segmentation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1766-1784
• /
• 2014

Finger vein images contain rich oriented features. Local line binary pattern (LLBP) is a good oriented feature representation method extended from local binary pattern (LBP), but it is limited in that it can only extract horizontal and vertical line patterns, so effective information in an image may not be exploited and fully utilized. In this paper, an orientation-selectable LLBP method, called generalized local line binary pattern (GLLBP), is proposed for finger vein recognition. GLLBP extends LLBP for line pattern extraction into any orientation. To effectually improve the matching accuracy, the soft power metric is employed to calculate the matching score. Furthermore, to fully utilize the oriented features in an image, the matching scores from the line patterns with the best discriminative ability are fused using the Hamacher rule to achieve the final matching score for the last recognition. Experimental results on our database, MMCBNU_6000, show that the proposed method performs much better than state-of-the-art algorithms that use the oriented features and local features, such as LBP, LLBP, Gabor filter, steerable filter and local direction code (LDC).

• 한국산업정보학회논문지
• /
• 제22권4호
• /
• pp.1-9
• /
• 2017

본 논문에서는 위상 천이 디지털 홀로그래피(PSDH; Phase-Shifting Digital Holography) 및 디지털 워터마킹(Digital Watermarking) 기반 디지털 홀로그램의 이중 암호화 기술을 제안한다. 이를 위해 먼저 디지털 워터마크에 사용할 로고 영상을 정하고, 이 영상에 대한 이진 위상 컴퓨터형성 홀로그램(CGH; Computer Generated Hologram)을 반복 알고리즘을 이용하여 설계한다. 그리고 랜덤하게 발생시킨 이진 위상 마스크를 워터마크로 정하고, 설계된 이진 위상 CGH와 XOR 논리연산을 통해 워터마크 정보에 대한 키 영상을 생성한다. 그리고 물체 영상을 위상 변조하여 세기가 일정한 함수로 만든 후, 워터마크인 랜덤하게 발생시킨 이진 위상 마스크를 곱하여 물체파를 생성한다. 이 물체파는 워터마크 정보가 포함된 잡음과 유사한 패턴을 가지는 1차 암호화된 영상이라고 할 수 있다. 이를 2-단계 PSDH기술을 적용하여 기준파와 간섭을 시키면 가시성이 향상된 최종 간섭무늬를 얻는다. 이 간섭패턴이 최종적으로 구하고자 하는 물체 영상의 2차 암호화된 영상이 된다. 암호화된 영상의 복호화는 2-단계 PSDH기술을 통한 암호화된 영상들을 이용하여 적절한 산술연산 처리한 후, 프레즈넬 변환 및 1차 암호화 과정의 역순으로 진행하면 된다. 제안된 방법의 암호화 및 복호화 기술은 컴퓨터 시뮬레이션을 통하여 검증된다.

• 한국전기전자재료학회논문지
• /
• 제14권1호
• /
• pp.26-33
• /
• 2001

The proposed system was composed of pre-processor which was executing binary/high-pass filtering and post-processor which ranged from statistic data to prediction. In post-processor work, step one was filter process of image, step two was image recognition, and step three was destruction degree/time prediction. After these processing, we could predict image of the last destruction timestamp. This research was produced variation value according to growth of tree pattern. This result showed improved correction, when this research was applied image Processing. Pre-processing step of original image had good result binary work after high pas- filter execution. In the case of using partial discharge of the image, our research could predict the last destruction timestamp. By means of experimental data, this prediction system was acquired $\pm$3.2% error range.