• Investigative Magnetic Resonance Imaging
• /
• v.2 no.1
• /
• pp.58-66
• /
• 1998

Purpose : This paper introduces a new three dimensional magnetic Resonance Image classification which is based on Mar kov Random Field-Gibbs Random Field with a line model. Material and Methods : The performance of the Gibbs Classifier over a statistically heterogeneous image can be improved if the local stationary regions in the image are disassociated from each other through the mechanism of the interaction parameters defined at the local neighborhood level. This usually involves the construction of a line model for the image. In this paper we construct a line model for multisignature images based on the differential of the image which can provide an a priori estimate of the unobservable line field, which may lie in regions with significantly different statistics. the line model estimated from the original image data can in turn be used to alter the values of the interaction parameters of the Gibbs Classifier. Results : MRF-Gibbs classifier for volumetric MR images is developed under the condition that the domain of the image classification is $E^{3}$ space rather thatn the conventional $E^{2}$ space. Compared to context free classification, MRF-Gibbs classifier performed better in homogeneous and along boundaries since contextual information is used during the classification. Conclusion : We construct a line model for multisignature, multidimensional image and derive the interaction parameter for determining the energy function of MRF-Gibbs classifier.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.25 no.2
• /
• pp.178-188
• /
• 2019

When using a distributed system, it is very important to know the intention of a target ship in order to prevent collisions. The action taken by a certain ship for collision avoidance and the action of the target ship it intends to avoid influence each other. However, it is difficult to establish a collision avoidance plan in consideration of multiple-ship situations for this reason. To solve this problem, a Distributed Stochastic Search Algorithm (DSSA) has been proposed. A DSSA searches for a course that can most reduce cost through repeated information exchange with target ships, and then indicates whether the current course should be maintained or a new course should be chosen according to probability and constraints. However, it has not been proven how the parameters used in DSSA affect collision avoidance actions. Therefore, in this paper, I have investigated the effect of the parameters and weight factors of DSSA. Experiments were conducted by combining parameters (time window, safe domain, detection range) and weight factors for encounters of two ships in head-on, crossing, and overtaking situations. A total of 24,000 experiments were conducted: 8,000 iterations for each situation. As a result, no collision occurred in any experiment conducted using DSSA. Costs have been shown to increase if a ship gives a large weight to its destination, i.e., takes selfish behavior. The more lasting the expected position of the target ship, the smaller the sailing distance and the number of message exchanges. The larger the detection range, the safer the interaction.

• Journal of KIISE:Software and Applications
• /
• v.36 no.11
• /
• pp.936-946
• /
• 2009

A graph cuts method has recently attracted a lot of attentions for image segmentation, as it can globally minimize energy functions composed of data term that reflects how each pixel fits into prior information for each class and smoothness term that penalizes discontinuities between neighboring pixels. In previous approaches to graph cuts-based automatic image segmentation, GMM(Gaussian mixture models) is generally used, and means and covariance matrixes calculated by EM algorithm were used as prior information for each cluster. However, it is practicable only for clusters with a hyper-spherical or hyper-ellipsoidal shape, as the cluster was represented based on the covariance matrix centered on the mean. For arbitrary-shaped clusters, this paper proposes graph cuts-based image segmentation using mean shift analysis. As a prior information to estimate the data term, we use the set of mean trajectories toward each mode from initial means randomly selected in $L^*u^*{\upsilon}^*$ color space. Since the mean shift procedure requires many computational times, we transform features in continuous feature space into 3D discrete grid, and use 3D kernel based on the first moment in the grid, which are needed to move the means to modes. In the experiments, we investigate the problems of mean shift-based and normalized cuts-based image segmentation methods that are recently popular methods, and the proposed method showed better performance than previous two methods and graph cuts-based automatic image segmentation using GMM on Berkeley segmentation dataset.

• Korean Journal of Soil Science and Fertilizer
• /
• v.16 no.4
• /
• pp.305-310
• /
• 1983

Spatial variability of infiltration rates of 96 samples from Hwadong SiCL was studied by using geostatistical concepts. The measurement was made at the nodes of the regular grid consisting of 12 rows and 8 columns. Sample spacing within rows and columns was 3 and 2 meters, respectively. This study illustrated the use of variogram as a tool to identify the degree of dependency of the infiltration rate on the distance between pairs of measurements and how to take advantage of this dependency. Fractile diagram showed that the distribution of observation was approximately normal. The range of the variogram was about 7.4 meters. The minimum number of samples necessary to reproduce the results similar to the 96 measured values was 8 to 10. Coefficients of theoretical variogram function for computing kriged values and kriged varionces of nuogget effect, slope, and range were 0.444 cm/day, 0.003 cm/day, and 7.4 m, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3B
• /
• pp.421-430
• /
• 2010

Now a days, as a communications network is being broadband, IPTV(Internet Protocol Television) service which provides various two-way TV service is increasing. But as the data which is transmitted between IPTV set-top box and smart card is almost transmitted to set-top box, the illegal user who gets legal authority by approaching to the context of contents illegally using McComac Hack Attack is not prevented perfectly. In this paper, set-top box access security model is proposed which is for the protection from McComac Hack Attack that tries to get permission for access of IPTV service illegally making data line which is connected from smart card to set-top box by using same kind of other set-top box which illegal user uses. The proposed model reports the result of test which tests the user who wants to get permission illegally by registration the information of a condition of smart card which is usable in set-top box in certification server so that it prevents illegal user. Specially, the proposed model strengthen the security about set-top box by adapting public key which is used for establishing neighbor link and inter-certification process though secret value and random number which is created by Pseudo random function.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.2
• /
• pp.92-98
• /
• 2017

Generally, image contains geometrical and radiometric errors. Census transform can solve the stereo mismatching problem caused by the radiometric distortion. Since the general census transform compares center of window pixel value with neighbor pixel value, it is hard to obtain an accurate matching result when the difference of pixel value is not large. To solve that problem, we propose a census transform method that applies different 4-step weight for each pixel value difference by applying an assistance window inside the window kernel. If the current pixel value is larger than the average of assistance window pixel value, a high weight value is given. Otherwise, a low weight value is assigned to perform a differential census transform. After generating an initial disparity map using a weighted census transform and input images, the gradient information is additionally used to model a cost function for generating a final disparity map. In order to find an optimal cost value, we use guided filtering. Since the filtering is performed using the input image and the disparity image, the object boundary region can be preserved. From the experimental results, we confirm that the performance of the proposed stereo matching method is improved compare to the conventional method.

• Journal of Intelligence and Information Systems
• /
• v.14 no.1
• /
• pp.117-129
• /
• 2008

The cost-based scheduling work has been done in both the Operations Research (OR) and Artificial Intelligence (AI) literature. To deal with more realistic problems, AI-based heuristic scheduling approach with non-regular performance measures has been studied. However, there has been little research effort to develop a full inter-job cost propagation algorithm (CPA) for different jobs having multiple downstream and upstream activities. Without such a CPA, decision-making in scheduling heuristics relies upon local, incomplete cost information, resulting in poor schedule performance from the overall cost minimizing objective. For such a purpose, we need two types of CPAs : intra-job CPA and inter-job CPA. Whenever there is a change in cost information of an activity in a job in the process of scheduling, the intra-job CPA updates cost curves of other activities connected through temporal constraints within the same job. The inter-job CPA extends cost propagation into other jobs connected through precedence relationships. By utilizing the cost information provided by CPAs, we propose cost-based scheduling heuristics that attempt to minimize the total schedule cost. This paper develops inter-job CPAs that create and update cost curves of each activity in each search state, and propagate cost information throughout a whole network of temporal constraints. Also we propose various cost-based scheduling heuristics that attempt to minimize the total schedule cost by utilizing the cost propagation algorithm.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.10
• /
• pp.357-364
• /
• 2014

The first mission for the IoT based hyper-connectivity communication is developing a device-to-device communication technique in infra-less low-power and lossy networks. In a low-power and lossy wireless network, IoT devices and routers cannot keep the original path toward the destination since they have the limited memory. Different from the previous light-weight routing protocols focusing on the reduction of the control messages, the proposed scheme provides the light-weight IPv6 address auto-configuration, IPv6 neighbor discovery and routing protocol in a IoT capable infra-less wireless networks with the bloom filer and enhanced rank concepts. And for the first time we evaluate our proposed scheme based on the modeling of various probability distributions in the IoT environments with the lossy wireless link. Specifically, the proposed enhanced RPL based light-weight routing protocol improves the robustness with the multi-paths locally established based on the enhanced rank concepts even though lossy wireless links are existed. We showed the improvements of the proposed scheme up to 40% than the RPL based protocol.

• The Korean Journal of Nuclear Medicine
• /
• v.39 no.6
• /
• pp.464-472
• /
• 2005

Purpose: SPECT using a fan-beam collimator improves spatial resolution and sensitivity. For the reconstruction from fan-beam projections, it is necessary to implement direct fan-beam reconstruction methods without transforming the data into the parallel geometry. In this study, various fan-beam reconstruction algorithms were implemented and their performances were compared. Materials and Methods: The projector for fan-beam SPECT was implemented using a ray-tracing method. The direct reconstruction algorithms implemented for fan-beam projection data were FBP (filtered backprojection), EM (expectation maximization), OS-EM (ordered subsets EM) and MAP-EM OSL (maximum a posteriori EM using the one-step late method) with membrane and thin-plate models as priors. For comparison, the fan-beam protection data were also rebinned into the parallel data using various interpolation methods, such as the nearest neighbor, bilinear and bicubic interpolations, and reconstructed using the conventional EM algorithm for parallel data. Noiseless and noisy projection data from the digital Hoffman brain and Shepp/Logan phantoms were reconstructed using the above algorithms. The reconstructed images were compared in terms of a percent error metric. Results: for the fan-beam data with Poisson noise, the MAP-EM OSL algorithm with the thin-plate prior showed the best result in both percent error and stability. Bilinear interpolation was the most effective method for rebinning from the fan-beam to parallel geometry when the accuracy and computation load were considered. Direct fan-beam EM reconstructions were more accurate than the standard EM reconstructions obtained from rebinned parallel data. Conclusion: Direct fan-beam reconstruction algorithms were implemented, which provided significantly improved reconstructions.

• Korean Journal of Remote Sensing
• /
• v.34 no.2_1
• /
• pp.267-282
• /
• 2018

Despite the continuous development of phenology detection studies using satellite imagery, verification through comparison with the field observed data is insufficient. Especially, in the case of Korean forests patching in various forms, it is difficult to estimate the start of season (SOS) by using only satellite images due to resolution difference. To improve the accuracy of vegetation phenology estimation, this study reconstructed the large scaled forest type map (1:5,000) with MODIS pixel resolution and produced time series vegetation phenology curves from Normalized Difference Vegetation Index (NDVI) and Enhanced Vegetation Index (EVI) derived from MODIS images. Based on the field observed data, extraction methods for the vegetation indices and SOS for Korean forests were compared and evaluated. We also analyzed the correlation between the composition ratio of forest types in each pixel and phenology extraction from the vegetation indices. When we compared NDVI and EVI with the field observed SOS data from the Korea National Arboretum, EVI was more accurate for Korean forests, and the first derivative was most suitable for extracting SOS in the phenology curve from the vegetation index. When the eight pixels neighboring the pixels of 7 broadleaved trees with field SOS data (center pixel) were compared to field SOS, the forest types of the best pixels with the highest correlation with the field data were deciduous forest by 67.9%, coniferous forest by 14.3%, and mixed forest by 7.7%, and the mean coefficient of determination ($R^2$) was 0.64. The average national SOS extracted from MODIS EVI were DOY 112.9 in 2014 at the earliest and DOY 129.1 in 2010 at the latest, which is about 0.16 days faster since 2003. In future research, it is necessary to expand the analysis of deciduous and mixed forests' SOS into the extraction of coniferous forest's SOS in order to understand the various climate and geomorphic factors. As such, comprehensive study should be carried out considering the diversity of forest ecosystems in Korea.