• Journal of KIISE:Software and Applications
• /
• v.33 no.1
• /
• pp.95-104
• /
• 2006

The Gradient Vector Flow (GVF) snake or active contour model offers the best performance for image segmentation. However, there are problems in classical snake models such as the limited capture range and the slow progress into concavity. This paper presents a new method for enhancing the performance of the GVF snake model by extending the external force fields from the neighboring fields and using a modified smoothing method to regularize them. The results on a simulated U-shaped image showed that the proposed method has larger capture range and makes it possible for the contour to progress into concavity more quickly compared with the conventional GVF snake model.

• The KIPS Transactions:PartB
• /
• v.17B no.4
• /
• pp.303-308
• /
• 2010

In this paper, we propose a medical image registration technique combining the gradient vector flow and modified conditional entropy. The registration is conducted by the use of a measure based on the entropy of conditional probabilities. To achieve the registration, we first define a modified conditional entropy (MCE) computed from the joint histograms for the area intensities of two given images. In order to combine the spatial information into a traditional registration measure, we use the gradient vector flow field. Then the MCE is computed from the gradient vector flow intensity (GVFI) combining the gradient information and their intensity values of original images. To evaluate the performance of the proposed registration method, we conduct experiments with our method as well as existing method based on the mutual information (MI) criteria. We evaluate the precision of MI- and MCE-based measurements by comparing the registration obtained from MR images and transformed CT images. The experimental results show that the proposed method is faster and more accurate than other optimization methods.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.2
• /
• pp.439-445
• /
• 2007

GVF can solve two difficulties with Snakes that are on setting initial contour and have a hard time processing into boundary concavities. But GVF takes much longer computation time than the existing Snakes because of their edge map and partial derivatives. Therefore this paper analyzed the computation time between GVF and Snakes. As a simulation result, both algorithms took almost similar computation time in simple image. In real images, GVF took about two times computation than Snakes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.478-480
• /
• 2002

영상 분할은 임상에서의 진단과 분석 및 3차원 가시화를 위해 선행되어야 할 필수 과정이다. 의료영상은 영상이 가지는 데이터 자체의 고유한 제약들과 해부학적 변이성 때문에 영상분할에 어려움이 있다. 본 논문에서는 의료영상의 분할을 위해 스네이크의 새로운 외부 힘으로 Gradient Vector Flow(GVF)를 이용한 방법을 제안한다. 제안된 방법은 2차원 의료영상에서 에지 맵(edge map)을 구하고, GVF을 계산하여 스네이크의 경계선과 같이 관심 있는 특징의 에너지 함수가 최소가 되는 GVF 스네이크(snake)를 구한다. 제안된 방법을 초음파영상과 자기공명영상 같은 의료영상의 분할에 적용한 결과 기존의 스네이크와 달리 잡음이나 오목한 부분이 있는 객체들을 성공적으로 분할하였다.

• Journal of Biomedical Engineering Research
• /
• v.23 no.2
• /
• pp.101-107
• /
• 2002

This paper presents a segmentation algorithm to extract endocardial contour and epicardial contour of left ventricle in MR Cardiac images. The algorithm is based on a generalized gradient vector flow(GGVF) snake and a prediction of initial contour(PIC). Especially. the proposed algorithm uses physical characteristics of endocardial and epicardial contours, cross profile correlation matching(CPCM), and a mixed interpolation model. In the experiment, the proposed method is applied to short axis MR cardiac image set, which are obtained by Siemens, Medinus, and GE MRI Systems. The experimental results show that the proposed algorithm can extract acceptable epicardial and endocardial walls. We calculate quantitative parameters from the segmented results, which are displayed graphically. The segmented left vents role is visualized volumetrically by surface rendering. The proposed algorithm is implemented on Windows environment using Visual C ++.

• Journal of the Korean Mathematical Society
• /
• v.55 no.1
• /
• pp.161-174
• /
• 2018

The aim of this article is to study the k-almost Ricci soliton and k-almost gradient Ricci soliton on contact metric manifold. First, we prove that if a compact K-contact metric is a k-almost gradient Ricci soliton, then it is isometric to a unit sphere $S^{2n+1}$. Next, we extend this result on a compact k-almost Ricci soliton when the flow vector field X is contact. Finally, we study some special types of k-almost Ricci solitons where the potential vector field X is point wise collinear with the Reeb vector field ${\xi}$ of the contact metric structure.

• Korean Journal of Mathematics
• /
• v.27 no.3
• /
• pp.691-705
• /
• 2019

In the present paper is to classify Beta-almost (${\beta}$-almost) Ricci solitons and ${\beta}$-almost gradient Ricci solitons on almost $CoK{\ddot{a}}hler$ manifolds with ${\xi}$ belongs to ($k,{\mu}$)-nullity distribution. In this paper, we prove that such manifolds with V is contact vector field and $Q{\phi}={\phi}Q$ is ${\eta}$-Einstein and it is steady when the potential vector field is pointwise collinear to the reeb vectoer field. Moreover, we prove that a ($k,{\mu}$)-almost $CoK{\ddot{a}}hler$ manifolds admitting ${\beta}$-almost gradient Ricci solitons is isometric to a sphere.

• Journal of information and communication convergence engineering
• /
• v.21 no.3
• /
• pp.225-232
• /
• 2023

Owing to advancements in intelligent transportation systems (ITS) and artificial-intelligence technologies, various machine-learning models can be employed to simulate and predict the number of traffic accidents under different weather conditions. Furthermore, we can analyze the relationship between weather and traffic accidents, allowing us to assess whether the current weather conditions are suitable for travel, which can significantly reduce the risk of traffic accidents. In this study, we analyzed 30000 traffic flow data points collected by traffic cameras at nearby intersections in Washington, D.C., USA from October 2012 to May 2017, using Pearson's heat map. We then predicted, analyzed, and compared the performance of the correlation between continuous features by applying several machine-learning algorithms commonly used in ITS, including random forest, decision tree, gradient-boosting regression, and support vector regression. The experimental results indicated that the gradient-boosting regression machine-learning model had the best performance.

• The Korean Journal of Applied Statistics
• /
• v.24 no.2
• /
• pp.335-345
• /
• 2011

In this paper, we propose a new hybrid speed function for image segmentation using level set. A new proposed speed function uses the region and boundary information of image object for the exact result of segmentation. The region information is defined by the probability information of pixel intensity in a ROI(region-of-interest), and the boundary information is defined by the gradient vector flow obtained from the gradient of image. We show the results of experiment for an various artificial image and real medical image to verify the accuracy of segmentation using proposed method.

• The KIPS Transactions:PartB
• /
• v.18B no.3
• /
• pp.131-138
• /
• 2011

In this paper, we compare our proposed method with previous methods for the volumetric image segmentation using level set. In order to obtain an exact segmentation, the region and boundary information of image object are used in our proposed speed function. The boundary information is defined by the gradient vector flow obtained from the gradient images and the region information is defined by Gaussian distribution information of pixel intensity in a region-of-interest for image segmentation. Also the regular term is used to remove the noise around surface. We show various experimental results of real medical volume images to verify the superiority of proposed method.