• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.11
• /
• pp.102-113
• /
• 1997

In this paepr, a new image segmentation method reducing efficiently contour information causing bottleneck problem at segmentatio-based very low bit rate codingis proposed, while preserving objective and subjective quality. It consists of 4-level hierarchical image segmentation based on mathematical morphology and 1-leve region merging structure using contast of two adjacent regions. For two adjacent region pairs at the fourth level included in each region of the thid level, contrast is calculated. Among the pairs of two adjacent regions with less value than threshold, two adjacent regions having the minimum contrast are merged first. After region merging, texture of the merged region is updated. The procedure is performed recursively for all the adjacent region pairs at the fourth level included in each region of the third level. Compared with the previous method, the objective and subjective image qualities are similar. But it reduces 46.65% texture information on the average by decreasing total region number to be tansmitted. Specially, it shows reduction of the 23.95% contour information of the average. Thus, it can improve efficiently the bottleneck problem at segementation-based very low bit rate coding.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.13 no.4
• /
• pp.71-79
• /
• 2017

Recently, Fire watching and dangerous substances monitoring system has been being developed to enhance various fire related security. It is generally assumed that fire flame extraction plays a very important role on this monitoring system. In this study, we propose the fire flame extraction method of Non-Residential Facilities based on core object extraction in image. A core object is defined as a comparatively large object at center of the image. First of all, an input image and its decreased resolution image are segmented. Segmented regions are classified as the outer or the inner region. The outer region is adjacent to boundaries of the image and the rest is not. Then core object regions and core background regions are selected from the inner region and the outer region, respectively. Core object regions are the representative regions for the object and are selected by using the information about the region size and location. Each inner region is classified into foreground or background region by comparing its values of a color histogram intersection of the inner region against the core object region and the core background region. Finally, the extracted core object region is determined as fire flame object in the image. Through experiments, we find that to provide a basic measures can respond effectively and quickly to fire in non-residential facilities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1691-1697
• /
• 1997

This paper presents a new motion compensated error coding method suitable for region based image coding system. Compared with block based conding, the region based coding improves subjective quality as it estimates and compensates 2D (or 3D) translantional, rotational, and scaling motion for each regions. although the region based coding has this advantage, its merit is reduced as bock-DCT (2D-DCT) is used to encode motion-compensated error. To overcome this problem, a new region adaptive motion compensated error coding technique which improver subjective and objective quality in the region boundary is proposed in this paper. In the proposed method, regions with large error are estimated using contour of the regions and contrast between the regions. The regions estiated as those with large error are coded by arbitrarily shaped image segment coding method. The mask information of the coded regions is not transmitted because it is estimated as the same algorithm in the encoder and the decoder. The proposed region adaptive motion conpensated error coding method improves about 0.5dB when it is compared with conventional block based method.

• Journal of the Korean Geographical Society
• /
• v.37 no.1
• /
• pp.41-60
• /
• 2002

It has been ten years since Daily Living Information Newspapers are first circulated as an useful local information source for everyday life in Korea. The circulation region is formed by the population size according to each type and sometimes, everyday life space across the boundaries of metropolitan area or province. The Daily Living Information Newspapers published in the area where corporations are located are distinguished from the others by region-attached advertisements. And their circulation regions of them are more detailed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.447-451
• /
• 2010

In this paper, we propose a simple but effective algorithm to increase the speed of Emphysema region classification. Emphysema region classification method based on CT image consumes a lot of time because of the large number of subregions due to the large size of CT image. Some of the sub-regions contain no Emphysema and the classification of these regions is worthless. To speed up the classification process, we create an algorithm to select Emphysema region candidates and only use these candidates in the Emphysema region classification instead of all of the sub-regions. First, the lung region is detected. Then we threshold the lung region and only select the dark pixels because Emphysema only appeared in the dark area of the CT image. Then the thresholded pixels are clustered into a region that called the Emphysema pre-detected region or Emphysema region candidate. This region is then divided into sub-region for the Emphysema region classification. The experimental result shows that Emphysema region classification using predetected Emphysema region decreases the size of lung region which will result in about 84.51% of time reduction in Emphysema region classification.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.299-300
• /
• 2006

In this paper, we propose a segmentation algorithm which combines the ideas from local watershed transforms and the region merging algorithm based hierarchical queue. Only the process of watershed and region merging algorithm can be restricted area. A fast region merging approach is proposed to extract the video object from the regions of watershed segmentation. Results show the effectiveness and convenience of the approach.

• International Journal of Contents
• /
• v.1 no.1
• /
• pp.40-44
• /
• 2005

This paper introduces region partitioning method of non-perfect nested loops with non-uniform dependences. This kind of loop normally can't be parallelized by existing parallelizing compilers and transformations. Even when parallelized in rare instances, the performance is very poor. Based on the Convex Hull theory which has adequate information to handle non-uniform dependences, this paper proposes an enhanced region partitioning method which divides the iteration space into minimum parallel regions where all the iterations inside each parallel region can be executed in parallel by using variable renaming after copying.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.59-66
• /
• 2004

Symmetry region searching can extract face region without a prior information in an image by using symmetric. However, this method requires a plenty of the computation time because the mask size to process symmetry region searching must be larger than the size of object such as eye, nose and mouth in face. in this paper, it proposed symmetric by using symmetry region searching and Wavelet Transform to reduce computation time of symmetry region searching, and It was applied to this method in an original image. To extract exact face region, we also experimented face region searching by using domain division in extraction region.

• The KIPS Transactions:PartC
• /
• v.14C no.4
• /
• pp.359-364
• /
• 2007

Current researches on the overlay multicast mechanism in the mobile ad hoc network (MANET) maintain the network topology information of the dynamically changing MANET, which may cause severe overhead. In this paper, we propose a new overlay multicast mechanism, the region-based overlay multicast in MANET(ROME), using the geometric locations of group members. In ROME, the physical topology is divided into small regions and the scope of location updates of group members is limited to a single region. ROME provides scalability by using the coordinate of the center point of a destination region as the destination of a data packet instead of the list of member addresses of that region. Our simulation results show that ROME gives better performance in terms of the packet overhead than other schemes.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.7
• /
• pp.78-88
• /
• 1997

A three dimensional-two spatical dimensions plus time-image segmentation is widely used in a very low bit rate image sequence coding because it can solve the region correspondence problem. Mathematical morphology is a very efficient tool for the segmentation because it deals well with geometric features such as size, shape, contrast and connectivity. But if the motion in the image sequence is large in time axis, the conventional 3D morphological segmentation algorithm have difficulty in solving region correspondence problem. To alleviate this problem, we propose the hierarchical image sequence segmentation algorithm that uses the region motion information. Since the motion of a region in previous level affects that in current level uses the previous motion information to increase region correspondence. Simulation result shows improved performance for sequence frames with large motion.