• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.729-734
• /
• 2000

전통적인 기존의 슬라이싱 기법들은 종속 그래프를 통해 슬라이스를 산출하였고, 슬라이스의 정확성을 입증하였다. 그러나, 기존의 종속 그래프 기법은 정적 슬라이싱 기법을 바탕으로 하기 때문에 프로시져 간의 매개변수별 자료 전달 링크를 나타내기 위하여 많은 정점들과 간선들이 필요하다. 그래서 그래프가 매우 복잡하다. 본 논문에서는 어떤 작업을 처리하기 위해 관련된 여러 개의 프로그램으로 구성된 소프트웨어 시스템의 슬라이싱을 수행하기 위한 동적 시스템 종속 그래프의 표현법에 대해 제안하였다. 그리고, 본 논문에서 제안한 동적 시스템 종속 그래프 기법과 기존의 프로그램 종속 그래프 기법에 대한 복잡도 측정 공식을 제안하였으며, 동적 시스템 종속 그래프 기법이 기존의 기법에 비해 그래프의 복잡도가 작아 효율적임을 보였다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.163-174
• /
• 2004

The 3D tooth model in which each tooth can be manipulated individualy is essential component for the orthodontic simulation and implant simulation in dental field. For the reconstruction of such a tooth model, we need an image segmentation algorithm capable of separating individual tooth from neighboring teeth and alveolar bone. In this paper we propose a CT image normalization method and adaptive optimal thresholding algorithm for the segmenation of tooth region in CT image slices. The proposed segmentation algorithm is based on the fact that the shape and intensity of tooth change gradually among CT image slices. It generates temporary boundary of a tooth by using the threshold value estimated in the previous imge slice, and compute histograms for the inner region and the outer region seperated by the temporary boundary. The optimal threshold value generating the finnal tooth region is computed based on these two histogram.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2556-2566
• /
• 1998

Program slicing is a technique to extract the statements which influence the value of a variable at a particular point of the program. It has been proposed that this technique is useful in debugging, iptimization, program maintenance, testing, extraction reusable components and other applications including the understanding of the program behavior. This paper aims to address the problem of slicing programs with Jump goto, break, continue in C statements, It was found that previous slicing algorithms do not always generate semantically correct slices when applied to such programs. We, therefore, point out why the previous methods do not work in this more general setting, and describe our eficient solutions that compate more correctly executable slices for such programs.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.8
• /
• pp.42-50
• /
• 2011

Recently, research activities on the future internet are being actively performed in foreign and domestic. In domestic, ETRI and 4 universities are focused on implementation of a testbed for research on the future internet named as 'FiRST(Future Internet Research for Sustainable Testbed)'. In the 'FiRST' project, 4 universities are performing a project in collaboration named as 'FiRST@PC' project that is for an implementation of the testbed using the programmable platform-based openflow switches. Currently, the research on the virtualization of the testbed is being performed that has a purpose for supporting an isolated network to individual researcher. In this paper, we implemented a traffic scheduler for providing QoS by using the programmable platform that performs a hardware-based packet processing and we are implemented a testbed using that traffic scheduler. We perform a performance evaluation of the traffic scheduler on the testbed. As a result, we show that the hardware-based NetFPGA scheduler can provide reliable and stable QoS to virtualized networks of the Future Internet Testbed.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.267-273
• /
• 2011

In this paper, we proposed the method to detect brain tumor region in MR images. Our method is composed of 3 parts, detection of tumor slice, detection of tumor region and tumor boundary detection. In the tumor slice detection step, a slice which contains tumor regions is distinguished using symmetric analysis in 3D brain volume. The tumor region detection step is the process to segment the tumor region in the slice distinguished as a tumor slice. And tumor region is finally detected, using spatial feature and symmetric analysis based on the cluster information. The process for detecting tumor slice and tumor region have advantages which are robust for noise and requires less computational time, using the knowledge of the brain tumor and cluster-based on symmetric analysis. And we use the level set method with fast marching algorithm to detect the tumor boundary. It is performed to find the tumor boundary for all other slices using the initial seeds derived from the previous or later slice until the tumor region is vanished. It requires less computational time because every procedure is not performed for all slices.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.275-278
• /
• 2001

영상 분할은 임상에서의 진단과 분석 및 3차원 가시화하는데 있어 선행되어야 할 필수적인 과정이다. 본 논문에서는 심혈관계 영상의 분할을 위한 Wave-front SRG방법을 제안한다. 제안된 방법은 2차원 슬라이스 영상에서 사용자에 의한 씨앗점(seed front)을 입력으로 받아 그 이웃한 슬라이스들에 wave-front를 만들어 영역 성장법에 의해 3차원 volume을 확장시킨다. 이때 다음으로 성장할 wave-front voxel의 mean gradient 값을 사용하여 밝기값의 변화가 심한 심혈관계 영상을 분할하였으며, Wave-front voxel의 size를 계산하여 혈관분할 시 발생할 수 있는 작은 채널에서의 새나감을 방지하였다. 제안된 방법을 컴퓨터 단층촬영으로 얻은 심혈 관계 영상의 분할에 적용한 결과, 밝기값의 변화가 심한 심혈관계 영상을 성공적으로 분할했으며, 작의 채널의 새나감이 없이 분할을 수행하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.634-637
• /
• 2002

오늘날 CT나 MR등을 통한 의학 영상 기술과 컴퓨터 성능의 향상으로 인체 내부 장기의 영상을 비교적 용이하게 얻을 수 있으며 얻어진 영상 정보는 컴퓨터로 수치와 되므로 데이터의 조작 및 가공이 용이하다. 그러나, 이 데이터는 2D 슬라이스들의 연속으로 표현되므로 이것을 보다 편리하게 가시화. 조작, 분석이 용이한 상태로 바꾸기 위해서는 3차원 구조로의 재구성이 필요하게 된다. 이것을 위하여 무엇보다도 먼저 CT나 MR을 통하여 얻어진 영상을 분석하여 특정 장기의 영상 부분를 다른 조직의 영상부분으로부터 분리(segmentation)할 필요가 있다. 이러한 Segmentation방법에는 여러가지가 있는데, 수작업의 결합 등으로 인해서 비효율적인 문제점을 가지고 있다. 이에 본 논문은 보다 효율적인 segmentation의 처리를 위하여 region-based 기법을 응용하여 새로운 segmentation 방법을 개발하였다. 그리하여, 본 논문이 제안한 알고리즘을 슬라이스 간격이 큰 2차원 복부 CT 영상에 적용시켜 간(liver)의 추출을 시도하였고 향상된 성능을 확인할 수 있었다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.2
• /
• pp.171-179
• /
• 2011

Feistel and SPN are the two main structures in a block cipher. Feistel is a symmetric structure which has the same structure in encryption and decryption, but SPN is not a symmetric structure. Encrypt round function and decrypt round function in SPN structure have three parts, round key addition and substitution layer with S-box for confusion and permutation layer for defusion. Most SPN structure for example ARIA and AES uses 8 bit S-Box at substitution layer, which is vulnerable to Square attack, Boomerang attack, Impossible differentials cryptanalysis etc. In this paper, we propose a SPN which has a symmetric structure in encryption and decryption. The whole operations of proposed algorithm are composed of the even numbers of N rounds where the first half of them, 1 to N/2 round, applies a right function and the last half of them, (N+1)/2 to N round, employs an inverse function. And a symmetry layer is located in between the right function layer and the inverse function layer. The symmetric layer is composed with a multiple simple bit slice involution S-Boxes. The bit slice involution S-Box symmetric layer increases difficult to attack cipher by Square attack, Boomerang attack, Impossible differentials cryptanalysis etc. The proposed symmetric SPN block cipher with bit slice involution S-Box is believed to construct a safe and efficient cipher in Smart Card and RFID environments where electronic chips are built in.

• Food Science of Animal Resources
• /
• v.27 no.1
• /
• pp.42-46
• /
• 2007

We evaluated the microbial safety and quality characteristics of Korean slice beef jerky, and investigated these properties over 28-day and 90-day storage periods at room temperature ($25^{\circ}C$) and elevated temperature ($35^{\circ}C$). After microbial counts of all samples, mesophilic bacteria were detected at 1.23 Log CFU/g at day 0. Counts of mesophilic bacteria did not change significantly in all samples, and coliforms and Bacillus cereus were not detected in all samples during storage at either $25^{\circ}C$ or $35^{\circ}C$. TBA values, Aw, and pH were investigated. The Aw of korean slice beef jerky stored at room temperature was 0.71 at day 0, and was reduced to 0.61 after 90 days. The TBA value increased as storage time increased, and its TBA value was 0.48 after 90 days of storage. The pH of all samples did not change significantly. At $35^{\circ}C$ storage, TBA values, Aw, pH were not significantly different than those stored at $25^{\circ}C$. Also, the sensory properties of all samples were not significantly different between two storage temperatures. In conclusion, these results suggest Koran slice beef jerky ould be used as basic study for development of the commercial beef jerky.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.141-148
• /
• 2011

Most of the previous works on scene change detection algorithm focus on the detection of abrupt rather than gradual changes. In general, gradual scene change detection algorithms require heavy computation. Some of those approaches don't consider the error factors such as flashlights, camera or object movements, and special effects. Many scenes change detection algorithms based on the histogram show better performances than other approaches, but they have computation load problem. In this paper, we proposed a scene change detection algorithm with fast and accurate performance using the vertical and horizontal blocked slice images and their macro block informations. We apply graph cut partitioning algorithm for clustering and partitioning of video sequence using generated spatio-temporal histogram. When making spatio-temporal histogram, we only use the central block on vertical and horizontal direction for performance improvement. To detect camera and object movement as well as various special effects accurately, we utilize the motion vector and type information of the macro block.