• Journal of Korea Multimedia Society
• /
• v.12 no.8
• /
• pp.1082-1088
• /
• 2009

Fundus images are highly useful in evaluating patients' retinal conditions in diagnosing eye diseases. In particular, vessel regions are essential in diagnosing diabetes and hypertension. In this paper, we used top-hat filter to compensate for non-uniform background. Image contrast was enhanced by using contrast limited adaptive histogram equalization (CLAHE) method. Hessian matrix was next applied to detect vessel regions. Results indicate that our method is 1.3% more accurate than matched filter method. Our proposed method is expected to contribute to diagnosing eye diseases.

• The KIPS Transactions:PartB
• /
• v.8B no.2
• /
• pp.173-182
• /
• 2001

본 논문에서는 투과형 토머그래피 영상재구성을 위하여 EM 알고리즘을 사용하는 경우에 발생하는 문제점을 해결할 수 있는 방안을 제시한다. 일반적으로 토머그래피 영상재구성과 같은 다-차원의 모수 추정인 경우에서는 그것의 페널티 함수의 헤이지안행렬의 역행렬 차수가 매우 높기 때문에 그것을 직접적으로 계산할 수 없다. 이러한 문제점을 해결하기 위하여 PEMG-1 알고리즘을 제안한다. 이 알고리즘은 페널티 함수를 사용하는 그래디언트 형태의 알고리즘인데 이것은 Lange(1995)과 Green(1990)의 알고리즘에서 지적된 문제점을 동시에 해결할 수 있다.

• Journal of Internet of Things and Convergence
• /
• v.10 no.3
• /
• pp.25-33
• /
• 2024

In tomographic image reconstruction, the focus is on developing CT image reconstruction methods that can maintain high image quality while reducing patient radiation exposure. Typically, statistical image reconstruction methods have the ability to generate high-quality and accurate images while significantly reducing patient radiation exposure. However, in cases like CT image reconstruction, which involve multi-dimensional parameter estimation, the degree of the Hessian matrix of the penalty function is very large, making it impossible to calculate. To solve this problem, the author proposed the PEMG-1 algorithm. However, the PEMG-1 algorithm has issues with the convergence speed, which is typical of statistical image reconstruction methods, and increasing the penalty log-likelihood. In this study, we propose a reconstruction algorithm that ensures fast convergence speed and monotonic increase in likelihood. The basic structure of this algorithm involves sequentially updating groups of pixels instead of updating all parameters simultaneously with each iteration.