• Title/Summary/Keyword: 2진 영상

Search Result 631, Processing Time 0.037 seconds

Skew Correction of Document Images using Edge (에지를 이용한 문서영상의 기울기 보정)

  • Ju, Jae-Hyon;Oh, Jeong-Su
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.7
    • /
    • pp.1487-1494
    • /
    • 2012
  • This paper proposes an algorithm detecting the skew of the degraded as well as the clear document images using edge and correcting it. The proposed algorithm detects edges in a character region selected by image complexity and generates projection histograms by projecting them to various directions. And then it detects the document skew by estimating the edge concentrations in the histograms and corrects the skewed document image. For the fast skew detection, the proposed algorithm uses downsampling and 3 step coarse-to-fine searching. In the skew detection of the clear and the degraded images, the maximum and the average detection errors in the proposed algorithm are about 50% of one in a conventional similar algorithm and the processing time is reduced to about 25%. In the non-uniform luminance images acquired by a mobile device, the conventional algorithm can't detect skews since it can't get valid binary images, while the proposed algorithm detect them with the average detection error of 0.1o or under.

Diffusion-weighted MR imaging findings of intracerebral hematoma (뇌실질내의 확산강조영상 소견)

  • 박창숙;최순섭;오종영;박병호;김기욱;남경진;이영일
    • Investigative Magnetic Resonance Imaging
    • /
    • v.6 no.1
    • /
    • pp.21-27
    • /
    • 2002
  • Purpose : To evaluate diffusion-weighted imaging findings of intracerebral hematoma according to the time sequence. Materials and methods : Seventeen patients with intracerebral hematoma were studied. Diffusion weighted images using 1.5 tesla MRI machine were obtained with b-value of $1000{\;}sec/\textrm{mm}^2$. The patients were grouped as hyperacute stage(within 12 hours, 5 patients), acute stage(within 3 days, 4 patients), subacute stage(within 3 weeks, 4 patients), and chronic stage(after 3 weeks,4 patients). The signal intensities were analysed as bright, high, iso, low and dark at the central and peripheral portions of the hematoma in each stage, and compared with those of T2 and T1 weighted images. Results : The signal intensities of the central and peripheral portion of the intracerebral hematoma on diffusion-weighted images were high and dark in hyperacute stage, dark and high-bright in acute stage, and high-bright and dark in subacute and chronic stages. The patterns of signal change of hematoma on diffusion-weighted image according to the time sequence were similar to those on T2-weighted image, but changed early and prominently. Conclusion : The intracerebral hematoma on diffusion-weighted image showed unique central and peripheral signal intensity according to the time sequence. Central portions show high to bright signals in hyperacute, subacute and chronic stage, and dark signal in acute stage, and peripheral portions show dark signals in hyperacute, subacute and chronic stage, and high to bright signal in acute stage.

  • PDF

Study on evaluating the significance of 3D nuclear texture features for diagnosis of cervical cancer (자궁경부암 진단을 위한 3차원 세포핵 질감 특성값 유의성 평가에 관한 연구)

  • Choi, Hyun-Ju;Kim, Tae-Yun;Malm, Patrik;Bengtsson, Ewert;Choi, Heung-Kook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.10
    • /
    • pp.83-92
    • /
    • 2011
  • The aim of this study is to evaluate whether 3D nuclear chromatin texture features are significant in recognizing the progression of cervical cancer. In particular, we assessed that our method could detect subtle differences in the chromatin pattern of seemingly normal cells on specimens with malignancy. We extracted nuclear texture features based on 3D GLCM(Gray Level Co occurrence Matrix) and 3D Wavelet transform from 100 cell volume data for each group (Normal, LSIL and HSIL). To evaluate the feasibility of 3D chromatin texture analysis, we compared the correct classification rate for each of the classifiers using them. In addition to this, we compared the correct classification rates for the classifiers using the proposed 3D nuclear texture features and the 2D nuclear texture features which were extracted in the same way. The results showed that the classifier using the 3D nuclear texture features provided better results. This means our method could improve the accuracy and reproducibility of quantification of cervical cell.

Complemented Maximum-Length Cellular Automata Applied on Video Encryption (비디오 암호화를 위한 여원 최대길이 셀룰라 오토마타)

  • Li, Gao-Yong;Cho, Sung-Jin;Kim, Seok-Tae
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.1
    • /
    • pp.13-18
    • /
    • 2017
  • With the advancement of internet technology, the importance of data protection is gaining more attention. As a possible data protection solution, we propose a novel video encryption method using complemented maximum-length cellular automata (C-MLCA). The first step for encryption is to use 90/150 CA rule to generate a transition matrix T of a C-MLCA state followed by a 2D C-MLCA basis image. Then, we divide the video into multiple frames. Once, we perform exclusive-OR operation with the split frames and the 2D basis image, the final encrypted video can be obtained. By altering values of pixel, the fundamental information in visualizing image data, the proposed method provides improved security. Moreover, we carry out some computational experiments to further evaluate our method where the results confirm its feasibility.

Compression of BTC Image Utilizing Data Hiding Technique (데이터 은닉 기법을 이용한 BTC(Block Truncation Coding) 영상의 압축)

  • Choi, Yong-Soo;Kim, Hyoung-Joong;Park, Chun-Myung;Choi, Hui-Jin
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.1
    • /
    • pp.51-57
    • /
    • 2010
  • In this paper, It propose methods compressing BTC image utilizing data hiding technique. BTC is used to compress general digital image into binary image and applied into application such as printer. Additional information, transferred with binary image, is as big as the size of binary image. Therefore, we wish to reduce the total transmission bandwidth by decreasing the additional information with sustaining the small image degradation. Because typical BTC image doesn't have enough space for data hiding, we adopt Adaptive AMBTC (Absolute Moment BTC) algorithm to produce the binary image, and calculate virtual histogram from created binary image and modify this histogram for reducing the additional information. The proposed algorithm can reduce about 6-11 % of the image file size, compared with the existing BTC algorithm, without making perceptible image degradation.

Automatic prostate segmentation method on dynamic MR images using non-rigid registration and subtraction method (동작 MR 영상에서 비강체 정합과 감산 기법을 이용한 자동 전립선 분할 기법)

  • Lee, Jeong-Jin;Lee, Ho;Kim, Jeong-Kon;Lee, Chang-Kyung;Shin, Yeong-Gil;Lee, Yoon-Chul;Lee, Min-Sun
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.3
    • /
    • pp.348-355
    • /
    • 2011
  • In this paper, we propose an automatic prostate segmentation method from dynamic magnetic resonance (MR) images. Our method detects contrast-enhanced images among the dynamic MR images using an average intensity analysis. Then, the candidate regions of prostate are detected by the B-spline non-rigid registration and subtraction between the pre-contrast and contrast-enhanced MR images. Finally, the prostate is segmented by performing a dilation operation outward, and sequential shape propagation inward. Our method was validated by ten data sets and the results were compared with the manually segmented results. The average volumetric overlap error was 6.8%, and average absolute volumetric measurement error was 2.5%. Our method could be used for the computer-aided prostate diagnosis, which requires an accurate prostate segmentation.

A Study on High Speed Image Rotation Algorithm using CUDA (CUDA를 이용한 고속 영상 회전 알고리즘에 관한 연구)

  • Kwon, Hee-Choul;Cho, Hyung-Jin;Kwon, Hee-Yong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.5
    • /
    • pp.1-6
    • /
    • 2016
  • Image rotation is one of main pre-processing step in image processing or image pattern recognition. It is implemented with rotation matrix multiplication. However it requires lots of floating point arithmetic operations and trigonometric function calculations, so it takes long execution time. We propose a new high speed image rotation algorithm without two major time-consuming operations. It use just 2 shear translation operations, so it is very fast. In addition, we apply a parallel computing technique with CUDA. CUDA is a massively parallel computing architecture using prevailed GPU recently. As GPU is a dedicated graphic processor, it is exellent for parallel processing of pixels. We compare the proposed algorithm with the conventional rotation one with various size images. Experimental results show that the proposed algorithm is superior to the conventional rotation ones.

Evaluation of Magnetic Resonance Imaging using Image Co-registration in Stereotactic Radiosurgery (정위방사선수술시 영상공동등록을 이용한 자기공명영상 유용성 평가)

  • Jin, Seongjin;Cho, Jihwan;Park, Cheolwoo
    • Journal of the Korean Society of Radiology
    • /
    • v.11 no.4
    • /
    • pp.235-240
    • /
    • 2017
  • The purpose of this study is to confirm the safety of the clinical application of image co - registration in steteotactic radiosurgery by evaluating the 3D positioning of magnetic resonance imaging using image co-registration. We performed a retrospective study using three-dimensional coordinate measurement of 32 patients who underwent stereotactic radiosurgery and performed magnetic resonance imaging follow-up using image co-registration. The 3 dimensional coordinate errors were $1.0443{\pm}0.5724mm$ (0.10 ~ 1.89) in anterior commissure and $1.0348{\pm}0.5473mm$ (0.36 ~ 2.24) in posterior commissure. The mean error of MR1 (3.0 T) was lower than that of MR2 (1.5 T). It is necessary to minimize the error of magnetic resonance imaging in the treatment planning using the image co - registration technique and to confirm it.