• Title/Summary/Keyword: 라플라시안

Search Result 99, Processing Time 0.045 seconds

Evaluation of Multi-resolution Extraction Filter for Pulmonary Nodules in Chest X-ray Image (흉부 X선 영상내 다중해상도 폐 종류 검출필터의 평가)

  • Kim, Eung-Kyeu
    • Proceedings of the KIEE Conference
    • /
    • 2011.07a
    • /
    • pp.1983-1984
    • /
    • 2011
  • 본 논문에서는 흉부 X선 영상으로부터 폐 종류 음영을 검출하기 위한 필터를 예측해서 바람직하게 평가하기 위한 방법을 제안한다. 더욱이 그 평가방법을 이용해서 이전부터 제안한 다중해상도 라플라시안-가우시안 필터의 평가를 행한다. 전문의의 진단보조 혹은 종합자동진단시스템의 구성요소로서 필터가 행하는 역할을 고려한 후에 필터가 만족해야할 조건 및 그 조건을 만족한 경우에 있어서 몇가지 성능평가 척도를 명확히 한다. 제안한 평가방법을 통해서 다중해상도 필터가 단일해상도 필터에 비해 높은 성능을 갖게됨을 명확히 한다.

  • PDF

Computer Analysis of Interstital Lung Diseases in Chest Radiographs (흉부 X선 사진내의 간질성 폐질환의 컴퓨터 해석)

  • Kim, Eung-Kyeu
    • Proceedings of the KIEE Conference
    • /
    • 1999.11c
    • /
    • pp.775-777
    • /
    • 1999
  • 흉부 단순 X선 사진에 있어서 폐의 간질성 음영의 특징을 컴퓨터를 이용하여 해석하는 시스템을 구축하여 그 정확도를 검토하였다. 이 시스템에서는 X선 사진을 디지털화 해서 관심영역을 설정하여 4방향 라플라시안-가우시안 형상필터를 행하여 2치화 한후, 계속해서 선상음영 판정처리 및 선상음영 차분처리를 행해 간질성 음영의 특징을 나타내는 몇가지 물리적인 지표를 계산 하였다. 82명의 정상예와 이상예에 대하여 이들 물리적 지표의 ROC 해석을 행하여 간질성 폐질환 변화의 양호한 검출결과를 얻었다.

  • PDF

Computer analysis of pulmonary interstital patterns in chest radiographs (흉부 단순 x선 사진에 있어서 폐의 간질성 음영의 컴퓨터 해석)

  • 김응규;권영도;이주신
    • Proceedings of the IEEK Conference
    • /
    • 1998.06a
    • /
    • pp.725-728
    • /
    • 1998
  • 흉부 단순 X선 사진에 있어서 폐의 간질성 음영의 특징을 컴퓨터를 이용하여 해석하는 시스템을 구축하여 그 정확도를 검토하였다. 이 시스템에서는 X선 사진을 디지털화 해서 관심영역을 설정하여, 4방향 라플라시안 -가우시안 형상필터를 행하여 2치화 한후, 계속해서 선상음영 판정처리 및 선상음영 차분처리를 햐해 간질성 음영의 특징을 나타내는 몇가지 물리적인 지표를 계산하였다. 82명의 정상예와 이상예에 대하여 이들 물리적 지표의 ROC 해석을 행하여 간질성 폐질환 변화의 양호한 검출결과를 얻었다.

  • PDF

On the pdf estimation of the intraframe DPCM prediction error and its application for the images (영상신호에 대한 DPCM예측오차신호의 확률분포추정과 그 응용에 관한 연구)

  • 안재형
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.13 no.1
    • /
    • pp.12-18
    • /
    • 1988
  • It is found that the estimation pdf of the real intraframe DPCM prediction error by $x^3$ goodness-of-fit test for the images is nearer gamma distribution that laplacian. Also the new pdf estimation method by NMAE is proposed and applied to the pdf adaptive DPCM system.

  • PDF

Analysis I of Operator Adaptive Characteristic in the Noisy-Blurred Images: Gaussian blurred and additive 20dB noise (훼손된 영상에서의 연산자 적응 특성 분석 I : 가우시안으로 흐려지고 20dB 잡음이 추가된 훼손된 영상)

  • Jeon, Woo-Sang;Han, Kun-Hee
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.5
    • /
    • pp.1685-1692
    • /
    • 2010
  • The Laplacian operator is usually used as a regularization operator which may be used as any differential operator in the regularization iterative processing. In this paper, several kinds of differential operator and proposed operator as a regularization operator were compared with each other performance. For noisy gaussian-blurred images, proposed operator worked better in the edge, while in flat region the conventional operator resulted better. In regularization, smoothing the noise and restoring the edges should be considered at the same time, so the regions divided into the flat, the middle, and the detailed, which were processed in separate and compared.

A New Mapping Algorithm for Depth Perception in 3D Screen and Its Implementation (3차원 영상의 깊이 인식에 대한 매핑 알고리즘 구현)

  • Ham, Woon-Chul;Kim, Seung-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.45 no.6
    • /
    • pp.95-101
    • /
    • 2008
  • In this paper, we present a new smoothing algorithm for variable depth mapping for real time stereoscopic image for 3D display. Proposed algorithm is based on the physical concept, called Laplacian equation and we also discuss the mapping of the depth from scene to displayed image. The approach to solve the problem in stereoscopic image which we adopt in this paper is similar to multi-region algorithm which was proposed by N.Holliman. The main difference thing in our algorithm compared with the N.Holliman's multi-region algorithm is that we use the Laplacian equation by considering the distance between viewer and object. We implement the real time stereoscopic image generation method for OpenGL on the circular polarized LCD screen to demonstrate its real functioning in the visual sensory system in human brain. Even though we make and use artificial objects by using OpenGL to simulate the proposed algorithm we assure that this technology may be applied to stereoscopic camera system not only for personal computer system but also for public broad cast system.

An Image Denoising Algorithm for the Mobile Phone Cameras (스마트폰 카메라를 위한 영상 잡음 제거 알고리즘)

  • Kim, Sung-Un
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.5
    • /
    • pp.601-608
    • /
    • 2014
  • In this study we propose an image denoising algorithm appropriate for mobile smart phone equipped with limited computing ability, which has better performance and at the same time comparable quality comparing with previous studies. The proposed image denoising algorithm for mobile smart phone cameras in low level light environment reduces computational complexity and also prevents edge smoothing by extracting just Gaussian noises from the noisy input image. According to the experiment result, we verified that our algorithm has much better PSNR value than methods applying mean filter or median filter. Also the result image from our algorithm has better clear quality since it preserves edges while smoothing input image. Moreover, the suggested algorithm reduces computational complexity about 52% compared to the method applying original Laplacian mask computation, and we verified that our algorithm has good denoising quality by implementing the algorithm in Android smart phone.

Denoising the Gaussian Noise by the Bayes Techique (Bayes 기법에 의한 가우시안 잡음제거)

  • Woo, Chang-Yong;Park, Nam-Chun;Kim, Jae-Hwan;Joo, Chang-Bok;Shin, Wee-Jae;Lee, Sang-Hoon;Kim, Sung-Il
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2005.11a
    • /
    • pp.217-220
    • /
    • 2005
  • 베이시안 기법의 잡음제거는 사진정보를 모형화하여 베이스 정리에 의해 사후정보를 계산하는 방법이다. 웨이블릿 변환 영역에서 각 대역의 원 신호 히스토그램을 일반화된 라플라시안 분포로 모형화하여 사전정보로 사용가능하다. 잡음 신호의 히스토그램에서 모형을 추정하기 위해서는 잡음편차가 필요하다. 이 논문에서는 단조변환을 이용하여 웨이블릿 변환된 잡음신호 각 대역의 편차를 추정한 후 이 편차에 가중치를 적용하여 모수를 추정한 후 베이스 기법으로 잡음을 제거하였다. 그리고 그 결과를 위너필터에 의해 잡음제거 된 결과와 PSNR로 비교하였다.

  • PDF

Study of High Speed Image Registration using BLOG (BLOG를 이용한 고속 이미지 정합에 관한 연구)

  • Kim, Jong-Min;Kang, Myung-A
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.11
    • /
    • pp.2478-2484
    • /
    • 2010
  • In this paper, real-time detection methods for Panorama system Key-Points offers. A recent study in PANORAMA system real-time area navigation or DVR to apply such research has recently been actively. The detection of the Key-Point is the most important elements that make up a Panorama system. Not affected by contrast, scale, Orientation must be detected Key-Point. Existing research methods are difficult to use in real-time Because it takes a lot of computation time. Therefore, this paper propose BLOG(BitRate Laplacian Of Gaussian)method for faster time Key-Point Detecting and Through various experiments to detect the Speed, Computation, detection performance is compared against.

Modified Speeded Up Robust Features(SURF) for Performance Enhancement of Mobile Visual Search System (모바일 시각 검색 시스템의 성능 향상을 위하여 개선된 Speeded Up Robust Features(SURF) 알고리듬)

  • Seo, Jung-Jin;Yoona, Kyoung-Ro
    • Journal of Broadcast Engineering
    • /
    • v.17 no.2
    • /
    • pp.388-399
    • /
    • 2012
  • In the paper, we propose enhanced feature extraction and matching methods for a mobile environment based on modified SURF. We propose three methods to reduce the computational complexity in a mobile environment. The first is to reduce the dimensions of the SURF descriptor. We compare the performance of existing 64-dimensional SURF with several other dimensional SURFs. The second is to improve the performance using the sign of the trace of the Hessian matrix. In other words, feature points are considered as matched if they have the same sign for the trace of the Hessian matrix, otherwise considered not matched. The last one is to find the best distance-ratio which is used to determine the matching points. We find the best distance-ratio through experiments, and it gives the relatively high accuracy. Finally, existing system which is based on normal SURF method is compared with our proposed system which is based on these three proposed methods. We present that our proposed system shows reduced response time while preserving reasonably good matching accuracy.