• The KIPS Transactions:PartB
• /
• v.18B no.4
• /
• pp.213-220
• /
• 2011

This paper proposes an effective, four-stage smoke detection method based on video that provides emergency response in the event of unexpected hazards in early fire-alarming systems. In the first phase, an approximate median method is used to segment moving regions in the present frame of video. In the second phase, a color segmentation of smoke is performed to select candidate smoke regions from these moving regions. In the third phase, a feature extraction algorithm is used to extract five feature parameters of smoke by analyzing characteristics of the candidate smoke regions such as area randomness and motion of smoke. In the fourth phase, extracted five parameters of smoke are used as an input for a K-nearest neighbor (KNN) algorithm to identify whether the candidate smoke regions are smoke or non-smoke. Experimental results indicate that the proposed four-stage smoke detection method outperforms other algorithms in terms of smoke detection, providing a low false alarm rate and high reliability in open and large spaces.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3B
• /
• pp.91-99
• /
• 2008

In this paper, we design the function of ULSLE(Upper Layer Shared LAN Emulation) to provide both the efficient LAN service and compatibility with 802.1D bridge in Hybrid two-stage AWG based WDM-PON. The ULSLE layer lies above MAC control layer in order to provide a mean to interface WDM-PON and 802.1D bridge. It also performs LAN emulation based on PON-Tag which is only used to decide both the transmission mode and the destination of frames transmitted from ONUs. That is, the PON-Tag is not used for downstream frames but destination address field in original frame instead. This decreases the processing overhead and complexity caused by PON-Tag at OLT and ONU. The verification of designed ULSLE is performed according to the specific scenarios based on transmission mode and destination using OPNET.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.1
• /
• pp.38-46
• /
• 2004

Image segmentation is the task which partitions the image into meaningful regions and considered to be one of the most important steps in computer vision and image processing. Image segmentation is also widely used in object-based video compression such as MPEG-4 to extract out the object regions from the given frame. Watershed algorithm is frequently used to obtain the more accurate region boundaries. But, it is well known that the watershed algorithm is extremely sensitive to gradient noise and usually results in oversegmentation. To solve such a problem, we propose an image segmentation method which is robust to noise by using stabilized inverse diffusion equation (SIDE) and is more efficient in segmentation by employing multiresolution approach. In this paper, we apply both the region projection method using labels of adjacent regions and the region merging method based on region adjacency graph (RAG). Experimental results on noisy image show that the oversegmenation is reduced and segmentation efficiency is increased.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.5
• /
• pp.44-56
• /
• 2009

Multimedia streaming service is susceptible to loss and delay of data as it requires high bandwidth and real time processing. Therefore QoS cannot be guaranteed due to data loss caused by heavy network traffic and error of wireless channel. To solve these problems, studies about algorithms which improve the quality of multimedia by serving differently according to the priority of packets in multimedia stream. Two algorithms are proposed in this paper. The first algorithm proposed is WMS-1(Wireless Multimedia Scheduling-1) algorithm which acts like IWFQ when any wireless loss is occurred but assigns channels first in case of urgent situation like when the running time of multimedia runs out. The second algorithm proposed is WMS-2(Wireless Multimedia Scheduling-2) algerithm that assigns priority to multimedia flow and schedules flow that has higher priority according to type of frame first. The comparison with other existing scheduling algorithms shows that multimedia service quality of the proposed algorithm is improved and the larger the queue size of base station is, the better total quality of service and fairness were gained.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.6
• /
• pp.39-47
• /
• 2009

This paper presents implementation of two types of the 802.11 MAC engine for the next generation WLAN, 802.11n. The first version of MAC engine consists of hardwired logic and embedded firmware. Hardwired logic includes Tx block, Rx block, Backoff block, and ChannelManage block. Embedded firmware contains Protocol Control block, MLME block, and MSDU processing block. The first version has a time-critical fault during the atomic transmission caused by software overhead, so it can not be applied to 802.11n MAC. For that reason, the second version has additional blocks with hardwired logic modules to reduce software overhead of the first version. This enhanced version has 73Mbps throughput and it is expected to be further improved up to 129 Mbps with frame aggregation which is one of the key additional features of 802.11n. As a result, the second version of MAC engine can be applied to 802.11n MAC.

• Annual Conference on Human and Language Technology
• /
• 2006.10e
• /
• pp.189-196
• /
• 2006

본 논문은 시맨틱 웹 응용 서비스를 구현함에 있어 필수적으로 요구되는 온톨로지 인스턴스 구축을 효율적으로 처리하는 데 있어 텍스트 처리 기술이 어떤 역할을 수행할 수 있는 가를 $OntoFrame-K^{(R)}$라는 시맨틱 웹 기반 정보 유통 체계에의 적용 사례를 통해 살펴본다. 본 논문에서 소개하는 텍스트 처리 기술은 개체 확인물 통한 개념 사례화, 주제 분야 할당을 통한 메타데이터 확장에, 그리고 인용 정보 추출 및 인용 관계 구축을 통한 객체 관계속성 구축에 적용된다. 개체 확인에서는 메타데이터 비교 잊 병합을 사용하였으며 이를 기반으로 한 수작업 구축을 통해 8,543명의 인력 URI를 확보하였다. 주제 및 분야 할당에서는 색인어와 분야분류명이 매핑된 시소러스 개념어의 매칭을 통해 색인어 별 TF (Term Frequency), 색인어와 매칭된 개념어 별 TF, 색인어와 매칭된 개념어 별 시소러스에서의 깊이, 색인어와 매칭된 개념어 별 개념 패싯, 색인어와 매칭된 각 개념어에 부착된 분야분류명 목록 등 할당을 위한 다양한 자질을 확보 적용하였다. 인용 정보 추출과 인용 관계 구축에서는 객체 URI와 인력 URI를 기반으로 하여 자동 추출된 인용 정보를 반영하는 방식으로 7,237개 문헌으로부터 총 135개의 인용 네트워크 그룹을 자동으로 확보하였다. 본 연구를 통해 제시된 텍스트 처리 기술의 활용 방안이 향후 시맨틱 웹 응용 서비스 및 인프라 구현에서 다각적으로 활용될 수 있기를 기대한다.

• Korean Journal of Plant Resources
• /
• v.16 no.3
• /
• pp.238-244
• /
• 2003

During the life cycle, plants have to suffer from various environmental stresses. A common element in response to many environmental stresses is cellular dehydration. Dehydrins are a family of proteins commonly induced by environmental stresses associated with low temperature or dehydration and during seed maturation drying. For the study in the defense mechanism against various stresses, a cDNA clone encoding a dehydrin gene was isolated from a cDNA library prepared from tab root mRNAs of Codonopsis lanceolata. The cDNA, designated ClDhn1, is 893 nucleotides long and has an open reading frame of 480 bp with a deduced amino acid sequence of 159 residues. The ClDhn1 amino acid sequence is highly hydrophilic and possesses two conserved repeats of characterized lysine­rich K­segment (KIKEKLPG), and a 7­serine residue stretch prior to the first lysine­rich repeat that is common to many dehydrins. The DEYGNP conserved motif is, however, modified in the sequence of ClDhn1 gene. The deduced amino acid sequence of ClDhn1 was compared with other plant dehydrinls and showed high homology with Solanum commersonii

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3C
• /
• pp.278-286
• /
• 2010

Motion Compensated Frame Interpolation(MCFI) has been used to reduce motion jerkiness for dynamic scenes and motion blurriness for LCD-panel display as post processing for large screen and full HD(high definition) display. Conventionally, block matching algorithms (BMA) are widely used to do motion estimation for simplicity of implementation. However, there are still several drawbacks. So in this paper, we propose a novel shape-based ME algorithm to increase accuracy and reduce ME computational cost. To increase ME accuracy, we do motion estimation based on shape of moving objects. And only moving areas are included for motion estimation to reduce computational cost. The results show that the computational cost is 25 % lower than full search BMA, while the performance is similar or is better, especially in the fast moving region.

• Journal of Biosystems Engineering
• /
• v.27 no.2
• /
• pp.151-160
• /
• 2002

Cow image processing technique would be useful not only for recognizing an individual but also for establishing the image database and analyzing the shape of cows. A cow (Holstein) has usually the unique speckle pattern. In this study, the individual recognition of cow was carried out using the speckle pattern and the content-based image retrieval technique. Sixty cow images of 16 heads were captured under outdoor illumination, which were complicated images due to shadow, obstacles and walking posture of cow. Sixteen images were selected as the reference image for each cow and 44 query images were used for evaluating the efficiency of individual recognition by matching to each reference image. Run-lengths and positions of runs across speckle area were calculated from 40 horizontal line profiles for ROI (region of interest) in a cow body image after 3 passes of 5$\times$5 median filtering. A similarity measure for recognizing cow individuals was calculated using Euclidean distance of normalized G-frame histogram (GH). normalized speckle run-length (BRL), normalized x and y positions (BRX, BRY) of speckle runs. This study evaluated the efficiency of individual recognition of cow using Recall(Success rate) and AVRR(Average rank of relevant images). Success rate of individual recognition was 100% when GH, BRL, BRX and BRY were used as image query indices. It was concluded that the histogram as global property and the information of speckle runs as local properties were good image features for individual recognition and the developed system of individual recognition was reliable.

• Journal of Satellite, Information and Communications
• /
• v.9 no.4
• /
• pp.77-81
• /
• 2014

This paper propose a method to detect moving object and locating in real time from video sequence. first the proposed method extract moving object by differencing two consecutive frames from the video sequence. If the interval between captured two frames is long, it cause to generate fake moving object as tail of the real moving object. secondly this paper proposed method to overcome this problem by using doppler effects and HSV color model. finally the object segmentation and locating is done by combining the result that obtained from steps above. The proposed method has 99.2% of detection rate in practical and also this method is comparatively speed than other similar methods those proposed in past. Since the complexity of the algorithm is directly affects to the speed of the system, the proposed method can be used as low complexity algorithm for real time moving object detection.