• Journal of Korea Multimedia Society
• /
• v.8 no.4
• /
• pp.473-481
• /
• 2005

In this paper, we propose an image segmentation method preserving object's boundaries by using the number of quantized colors and merging regions using adaptive threshold values. First of all, the proposed method quantizes an original image by a vector quantization and the number of quantized colors is determined differently using PSNR each image. We obtain initial regions from the quantized image, merge initial regions in CIE Lab color space and RGB color space step by step and segment the image into semantic regions. In each merging step, we use color distance between adjacent regions as similarity-measure. Threshold values for region-merging are determined adaptively according to the global mean of the color difference between the original image and its split-regions and the mean of those variations. Also, if the segmented image of RGB color space doesn't split into semantic objects, we merge the image again in the CIE Lab color space as post-processing. Whether the post-processing is done is determined by using the color distance between initial regions of the image and the segmented image of RGB color space. Experiment results show that the proposed method splits an original image into main objects and boundaries of the segmented image are preserved. Also, the proposed method provides better results for objective measure than the conventional method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.151-153
• /
• 2004

점진적 검사점은 페이지 쓰기 보호를 사용하여 검사점에서 변경된 페이지만을 저장한다. 점진적 검사점을 사용하면 검사점 오버헤드가 줄어드는 반면에 프로세스의 메모리 페이지들이 여러 검사점에 걸쳐있기 때문에 오래된 검사점들을 병합하거나 지울 수 없다. 본 논문에서는 점진적 검사점에서 복구와 쓰레기 수집을 위한 효율적인 병합 알고리즘을 제안한다. 제안한 알고리즘으로 점진적 검사점들을 병합하여 복구를 위한 완전 검사점을 만들고 불필요한 검사점들을 지울 수 있다.

• Journal of Broadcast Engineering
• /
• v.18 no.5
• /
• pp.691-701
• /
• 2013

In this paper, an early termination algorithm for merge process is proposed to reduce the computational complexity in High Efficiency Video Coding (HEVC) encoder. In the HEVC, the same candidate modes from merge candidate list (MCL) are shared to predict a merge or merge SKIP mode. This search process is performed by the number of the obtained candidates for the both of the merge and SKIP modes. This may cause some redundant search operations. To reduce this redundant search operation, we employ the neighboring blocks which have been encoded in prior, to check on the contextual information. In this study, the spatial, temporal and depth neighboring blocks have been considered to compute a correlation information. With this correlation information, an early termination algorithm for merge process is suggested. When all modes of neighboring blocks are SKIP modes, then the merge process performs only SKIP mode. Otherwise, usual merge process of HEVC is performed Through experimental results, the proposed method achieves a time-saving factor of about 21.25% on average with small loss of BD-rate, when comparing to the original HM 10.0 encoder.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.401-404
• /
• 2006

Mean shift procedure is applied for the data points in the joint spatial-range domain and achieves a high quality. However, a color image is segmented differently according to the inputted spatial parameter or range parameter and the demerit is that the image is broken into many small regions in case of the small parameter. In this paper, to improve this demerit, we propose the method that groups similar regions using region merging method for over-segmented images. The proposed method converts a over-segmented image in RGB color space into in HSI color space and merges similar regions by hue information. Here, to preserve edge information, the proposed method use by merging constraints to decide whether regions is merged or not. After then, we merge the regions in RGB color space for non-processed regions in HSI color space. Experimental results show the superiority in region's segmentation results.

• Korean Journal of Clinical Pharmacy
• /
• v.19 no.2
• /
• pp.96-104
• /
• 2009

배경: 당뇨병 환자에게 관상동맥심질환은 생존률, 건강 상태 유지 및 삶의 질에 주요한 영향을 미치는 합병증이며 적극적인 당뇨병 치료는 이러한 심혈관 합병증을 예방할 수 있으나 당뇨병의 적극적 치료와 관리에는 많은 비용이 소요된다. 목적: 제2형 당뇨병 환자를 대상으로 메트포르민과 글리메피리드 병합요법과 메트포르민과 피오글리타존 병합요법의 비용-효과성을 비교하고자 하였다. 연구방법: 마르코프 코호트 프로세스(Markov Cohort Process Model) 모형을 이용하여 비용-효과분석을 실시하였다. 연장된 수명 (life years gained, LYG)과 삶의 질(quality)을 보정하여 증가된 QALYs를 주요 효과 지표로 측정하였고, 총비용으로는 직접의료비용과, 환자와 가족의 교통비를 직접비의료비용으로 고려하였고 환자와 가족의 시간비용을 간접비용으로 포함하였다. 연구결과: 비용-효과분석 결과, 메트포르민과 글리메피리드 병합요법의 경우 총 비용은 5,962,288원, 효과는 7.94LYG, 6.43QALY이었다. 반면 메트포르민과 피오글리타존 병합요법은 총 비용 10,982,243원, 효과 8.62LYG, 6.99QALY으로, 점증적 비용-효과비(ICER)는 7,402,663원/LYG과 8,934,546원/QALY 이었다. 결론: 우리 사회의 연장된 수명(LYG)에 따른 지불의사가 700만원 이하인 경우는 메트포르민과 글리메피리드 병합요법이 비용-효과적인 대안이며 700만원 이상인 경우에는 메트포르민과 피오글리타존 병합요법이 비용-효과적인 대안이 될 수 있다.

• Journal of the Korean Wood Science and Technology
• /
• v.38 no.6
• /
• pp.498-506
• /
• 2010

To use domestic softwood for structural lumber, appropriate grading system for quality, production and distribution condition of domestic lumber should be prepared. Kim et al. developed an automatic image processing system for grading domestic structural lumber (2009a and b). This study was carried out to investigate optimal image merging conditions for improving performance of image input system which is the key technique of image processing system, developed in the previous paper. To merge digital images of Korean larch lumber, choosing the green channel information of obtained image data showed the most accurate merging performance. As a pre-treatment process, applying Y-derivative Sharr's kernel filter could improve the image merging accuracy, but the effect of camera calibration was imperceptible. The optimal size of template image was verified as 30 pixel widths and 150 pixel heights. When applying the above mentioned conditions, the error length of images was 3.1 mm and the processing time was 9.7 seconds in average.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1295-1304
• /
• 2010

This paper proposes a fault-tolerant data aggregation which provides energy efficient and reliable data collection in wireless sensor networks. The traditional aggregation scheme does not provide the countermeasure to packet loss or the countermeasure scheme requires a large amount of energy. The proposed scheme applies caching and re-transmission based on the track topology to the adaptive timeout scheduling. The proposed scheme uses a single-path routing based on the traditional tree topology at normal, which reduces the dissipated energy in sensor nodes without any countermeasure against packet loss. The proposed scheme, however, retransmits the lost packet using track topology under event occurrences in order to fulfill more accurate data aggregation. Extensive simulation work under various workloads has revealed that the proposed scheme decrease by 8% in terms of the dissipated energy and enhances data accuracy 41% when the potential of event occurrence exists as compared with TAG data aggregation. And the proposed scheme decrease by 53% in terms of the dissipated energy and shows a similar performance in data accuracy when the potential of event occurrence exists as compared with PERLA data aggregation.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.119-126
• /
• 2012

Local monitoring is an effective technique in securing data of wireless sensor networks. Existing solutions require high communication cost for detecting false data and this results in a network lifetime being shortened. This paper proposes novel techniques of monitoring based secure data aggregation and filtering false data in wireless sensor networks. The aim is to reduce energy consumption in securing data aggregation. An aggregator and its monitoring node perform data aggregation in a 60o sextant cluster. By checking Message Authentication Codes (MAC), aggregation data will be dropped by a forward aggregator if data aggregated by the aggregator and data monitored by the monitoring node are inconsistent. The simulation shows that the proposed protocol can reduce the amount of average energy consumption about 64% when comparing with the Data Aggregation and Authentication protocol (DAA)[1]. Additionally, the network lifetime of the proposed protocol is 283% longer than that of DAA without any decline in data integrity.

• Journal of Broadcast Engineering
• /
• v.24 no.1
• /
• pp.41-47
• /
• 2019

Recently, enhanced methods on the inter merging have been being investigated in Versatile Video Coding (VVC) standardization which will be a next generation video coding standard with capability beyond the High Efficiency Video Coding (HEVC). If there is not enough motion information available in the neighboring blocks in the merge mode, zero motion candidate is inserted into the merge candidate list, which could make the coding efficiency decreased. In this paper, we propose an efficient method of constructing the merge mode candidate list to reduce the case that the zero motion is used as a candidate by generating an alternative merge candidate. Experimental results show that the proposed method gives the average BD-rate gain of 0.2% with the decoding time increase of 3% in the comparison with VTM 1.0.

• The KIPS Transactions:PartB
• /
• v.9B no.1
• /
• pp.17-22
• /
• 2002

A major impediment in using the Dempster-chafer evidence combination scheme is its computational complexity, which in general is exponential since DS scheme allows any subsets over the frame of discernment as focal elements. To avoid this problem, we propose a method called approximate evidence combination scheme. This scheme is applied to a few sample applications and the experiment results are compared with those of VBS. The results show that the approximation scheme achieves a great amount of computational speedup and produces belief values within the range of deviation that the expert allows.