• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.05a
• /
• pp.322-326
• /
• 2006

본 논문에서는 내시경 영상에 대해 위암 영역을 자동으로 추출하는 방법을 제안한다. 본 논문에서는 내시경 영상을 획득하는 과정에서 발생하는 조명에 의한 잡음과 굴곡에 의해 발생하는 그림자에 의한 잡음 부분을 해결하기 위해서 HSI의 채도와 밝기 값을 이용하여 잡음 영역을 제거한다. 그리고 헤모글로빈 색소 정보를 나타내는 IHb값을 이용하여 전자 내시경 영상에서 유사한 헤모글로빈 색소 정보를 가지는 영역으로 분할한다. 분할된 영역들 중에서 RGB의 각 채널과 헤모글로빈 색소가 높게 나타나면 후보 영역으로 설정한다. 설정된 후보 영역 중에서 위암 영역의 형태학적인 특징 정보를 이용하여 위암 영역을 추출한다. 실제 전문의가 제공한 20개의 내시경 영상을 대상으로 실험한 결과, 제안된 위암 추출 방법으로 17개가 정확히 추출되었고 3개의 내시경 영상에서는 위암 영역이 정확히 추출되지 않았다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.835-838
• /
• 2008

Many researches on hierarchical path search have been studied so far. Even though partitioning regions is essential part, the researches are not enough. This paper proposes two efficient methods to partition regions: 1)a method based on voronoi algorithm in which a major node is central point of a region, 2) a method based on fired grid that partitions regions into major and minor. The performances of the proposed methods are compared with the conventional hierarchical path search method in which a region is formed by the boundary line of nearest 4 points of a major node in terms of the path search time and the accuracy. The results obtained from the experiments show that the method based on voronoi achieves short execution time and the method based grid achieves high accuracy.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2006.10a
• /
• pp.409-410
• /
• 2006

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.877-881
• /
• 1996

승용차나 소형승합차에는 현가장치의 스프링으로 코일스프링을 많이 사용하고 있으며 최근 들어 승차감의 상을 위해 변위의 증가와 함께 스프링 정수가 증가하는 경화 특성 스프링(hardening type spring)을 많이 채택하고 있는데, 이 특성을 나타낼 수 있는 방법 중 하나가 등반경-테이퍼 소재의 코일스프링이다. 이 논문에서는 주어진 차량조건으로부터 이상적인 스프링 특성곡선을 계산하고 이 곡선을 분할하여 직선의 연결로 근사시켜 분할한 수만큼의 직선적 특성의 스프링으로 직렬 연결되어 있다고 가정하여 이 곡선에 근접된 특성을 가지는 등반경-테이퍼 소재 코일 스프링의 설계방법을 제시하고자 한다.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.641-646
• /
• 2003

Packet processing speed of routers as well as transmission speed of physical links gives a great effect on IP packet transfer rate in Internet. The router forwards a packet after determining the next hop to the packet's destination. IP address lookup is a main design issue for high performance routers. In this paper, we propose a partitioned compressed-trie for speeding-up IP address lookup algorithms based on tie data structure by exploiting path compression. In the ,proposed scheme, IP prefixes are divided into several compressed-tries and lookup is performed on only one partitioned compressed-trie. Memory access time for IP address lookup is lessen due to compression technique and memory required for maintaining partition does not increased.

• Korean Journal of Food Science and Technology
• /
• v.52 no.3
• /
• pp.310-315
• /
• 2020

The aim of this study was to investigate the texture change of cooked rice within a short time after cooking. Using four instant rice brands, the texture change within 30 min after cooking was measured by the texture profile analysis (TPA) method for hardness, adhesiveness, cohesiveness, chewiness, and springiness with different compression ratios (30, 70%) and cross-head speeds (0.5, 1.0 mm/s). In the case of cohesiveness, adhesiveness, and chewiness, there were significant differences in the rice textures at 20 to 30 min after cooking compared to that in the sample immediately after cooking. In particular, adhesiveness showed significant differences at 10 min after cooking. However, there were little significant differences within 30 min for springiness. In conclusion, when measuring cooked rice texture, it is desirable to measure it, if possible, within 10 to 20 min after cooking.

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

TSP(Traveling Salesman Problem)는 주어진 N개의 City들을 단 한번씩만 거쳐 출발지로 되돌아오는 경로들 중 가장 작은 비용이 소요되는 경로를 찾는 문제이며, 고전적인 최적화 문제로 널리 알려져 있다. City의 수가 증가하면 최적 Tour를 찾기 위한 연산 시간이 길어지는 단점이 있다. 본 논문에서는 대규모 TSP의 효율적 해결을 위해 새로운 알고리즘을 제안한다. 본 논문에서는 대규모의 City들의 집합을 두개의 소집합으로 분할하고, 병합을 위해 하나의 Junction City를 지정한다. 분할된 두개의 소집합 각각의 최적 Tour를 구한 후 분할된 두 최적 Tour를 병합하여 하나의 근사 Tour를 구한다. 지정된 Junction City는 병합 시 최적 병합조건을 구하는 연산의 간편화를 기대할 수 있다.

• The Korean Journal of Ecology
• /
• v.27 no.2
• /
• pp.93-98
• /
• 2004

Decay rate and nutrient dynamics during decomposition of oak (Quercus acutissima) branches were investigated for 33-months in Kongju, Korea. After 33-months, remaining weight of B₁, B₂ and B₃ was 44.5%, 58.5% and 55.37%, respectively. Decomposition constant (k) for B₁, B₂ and B₃ was 0.294/yr, 0.195/yr, 0.215/yr, respectively. N concentration in decomposing oak branches increased in all diameter classes. After 33-months, remaining N in B₁, B₂ and B₃ was 101.2%, 91.9%, 104.4%, respectively. P concentration in decomposing oak branches increased in B₁ and B₂, and there was no immobilization period. After 33-months, remaining P in B₁, B₂ and B₃ was 57.2%, 74.4%, 53.9%, respectively. K concentration in decomposing oak branches decreased significantly. Remaining K in B₁, B₂ and B₃ was 7.7%, 17.1% and 17.2%, respectively, which was significantly lower than other nutrients. Ca concentration in decomposing oak branches increased in B₂ and B₃. After 33-months, remaining Ca in B₁, B₂ and B₃ was 58.5%, 47.8% and 75.2%, respectively. Initial concentration of Mg in oak branch was higher in smaller diameter class. After 33-months, remaining Mg in B₁, B₂ and B₃ was 44.3%, 57.9% and 47.7%, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.7B
• /
• pp.417-426
• /
• 2005

Routing and wavelength assignment problem is one of the most important issues in optical transport networks based on wavelength division multiplexing(WDM) technique. In this paper, we propose a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths. And then we compare the performance of the proposed algorithm with that of bounded greedy approach for EDP(BGAforEDP). The proposed one outperforms up to about 20$\%$ in the fixed traditional topology(NSFNET) and about 32$\%$ in random topologies over the BGA for EDP algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.565-569
• /
• 2007

To find optimal path is killer application in the telematics system. The shortest path of conventional system, however, isn't always optimal path. That is, the path with minimum travelling time could be defined as optimal path in the road networks. There are techniques and algorithms for finding optimal path. Hierarchical path algorithm categorizes road networks into major layer and minor layer so that the performance of operational time increases. The path searched is accurate as much as optimal path. At above 2 system, a method to allocate minor roads to major road region influences the performance extremely. This paper proposes methods to determine search space for selecting major roads in the hierarchical path algorithm. In addition, methods which apply the proposed methods to hierarchical route algorithm is presented.