• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.1312-1314
• /
• 2013

본 연구에서는 조영증강 의료 초음파 영상에서 효과적인 병변 탐색을 위한 방법론을 고찰한다. 병변 영상을 포함하는 ROI 추출을 위하여 조영효과의 전이 형태에 대한 단계 분할 기법과 동적 프로젝션 데이터의 분석 기법을 제안한다. 프레임간 유사도 척도의 분석을 통하여 비정상 프레임을 제거한 후 조영제의 도달시간(AT: Arrival Time)과 확산구간을 추출하여 탐색 대상 데이터의 양을 감소시킨다. 대상구간에서 초음파 영상의 수평방향 및 수직방향 프로젝션 데이터에 대한 동적 특성을 분석함으로써 후보영역을 추출하며 마이크로 버블의 추출, 조영효과의 증가속도 및 비율 등의 요소를 고려하여 ROI 를 선별하고 그 형태를 재조정한다. 부수적으로, 대상영역에서의 각 픽셀정보에 대하여 명도변화곡선(TIC) 특성분석을 통하여 영상을 재구성하고 병변영상의 형태와 윤곽선을 추출하게 된다.

• Journal of Broadcast Engineering
• /
• v.23 no.4
• /
• pp.474-483
• /
• 2018

In this paper, we propose a multi-scale high dynamic range (HDR) tone mapping algorithm using guided image filter (GIF). The GIF is used to divide an image into a base layer and a detail layer, then the range of the detail layer is reduced with a compression function to enhance the detail information of the image. However, in most cases, an image includes the detail and edge information in different scales. That is to say, it is difficult to represent all detail features under a certain scale, and a single-scale image decomposition method is not free from artifacts around edges. To solve the problems, the multi-scale image decomposition method is proposed. It utilizes the detail layers of several scale to determine how much edge is preserved. Experiment results show that the proposed algorithm has better image performance in preserving edge compared to conventional algorithm.

• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.52-58
• /
• 2007

In this paper we propose a new robust method to extract accurate human silhouettes indoors with active stereo camera. A prime application is for gesture recognition of mobile robots. The segmentation of distant moving objects includes many problems such as low resolution, shadows, poor stereo matching information and instabilities of the object and background color distributions. There are many object segmentation methods based on color or stereo information but they alone are prone to failure. Here efficient color, stereo and image segmentation methods are fused to infer object and background areas of high confidence. Then the inferred areas are incorporated in graph cut to make human silhouette extraction robust and accurate. Some experimental results are presented with image sequences taken using pan-tilt stereo camera. Our proposed algorithms are evaluated with respect to ground truth data and proved to outperform some methods based on either color/stereo or color/contrast alone.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.223-230
• /
• 2006

A MMORPG(Massively Multiplayer Online Role-Playing Game) is an online role-playing game in which a large number of players can interact with each other in the same world at the same time. Most of them require significant hardware requirements(e.g., servers and bandwidth), and dedicated support staff. Despite the efforts of developers, users often cite overpopulation, lag, and poor support as problems of games. In this paper, a dynamic load balancing method for MMORPGS is proposed. It tries to adapt to dynamic change of population by using dynamic map-partition method with VML(Virtual Map Layer) which consists of fields, sector groups, sectors, and cells. From the experimental results, our approach achieves about $23^{\sim}67%$ lower loads for each field server. By the modification to Virtual Area Layer, we can easily manage problems that come from changes of map data, resources' status, and users' behavior pattern.

• KIPS Transactions on Software and Data Engineering
• /
• v.8 no.4
• /
• pp.171-178
• /
• 2019

The use of anti-scatter grids in radiographic imaging has the advantage of preventing the image distortion caused by scattered radiation. However, it carries the side effect of leaving artifacts in the X-ray image. In this paper, we propose a grid line suppression technique using discrete cosine transform(DCT). In X-ray images, the grid lines have different characteristics depending on the shape of the object and the area of the image. To solve this problem, we adopt the DCT transform based on a dynamic segmentation, and propose a filter transfer function for each individual segment. An algorithm for detecting the band of grid lines in frequency domain and a band stop filter(BSF) with a filter transfer function of a combination of Kaiser window and Butterworth filter have been proposed. To solve the blocking effects, we present a method to determine the pixel values using multiple structured images. The validity of the proposed theory has been evaluated from the experimental results using 140 X-ray images.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.81-90
• /
• 2004

Recently, It has been increased to use a multi-dimensional data in various applications with a rapid growth of the computing environment. In this paper, we propose the vector approximate tree for content-based retrieval of multi-dimensional data. The proposed index structure reduces the depth of tree by storing the many region information in a node because of representing region information using space partition based method and vector approximation method. Also it efficiently handles 'dimensionality curse' that causes a problem of multi-dimensional index structure by assigning the multi-dimensional data space to dynamic bit. And it provides the more correct regions by representing the child region information as the parent region information relatively. We show that our index structure outperforms the existing index structure by various experimental evaluations.

• The Journal of the Korea Contents Association
• /
• v.13 no.12
• /
• pp.9-18
• /
• 2013

In recent years, the demands of multimedia data in wireless sensor networks have been significantly increased for the high-quality environment monitoring applications that utilize sensor nodes to collect multimedia data. However, since the amount of multimedia data is very large, the network lifetime and network performance are significantly reduced due to excessive energy consumption on particular nodes. In this paper, we propose an energy-efficient dynamic area compression scheme in wireless multimedia sensor networks. The proposed scheme minimizes the energy consumption in the huge multimedia data transmission process by compression using the Chinese Remainder Theorem(CRT) and dynamic area detection and division algorithm. Our experimental results show that our proposed scheme improves the data compression ratio by about 37% and reduces the amount of transmitted data by about 56% over the existing scheme on average. In addition, the proposed scheme increases network lifetime by about 14% over the existing scheme on average.

• The KIPS Transactions:PartB
• /
• v.16B no.4
• /
• pp.263-270
• /
• 2009

Histogram Equalization (HE) is a very popular technique for enhancing the contrast of an image. HE stretches the dynamic range of an image using the cumulative distribution function of a given input image, therefore improving its contrast. However, HE has a well-known problem : when HE is applied for the contrast enhancement, there is a significant change in brightness. To resolve this problem, we propose An Adaptive Contrast Enhancement Algorithm using Subhistogram Area-Ratioed Histogram Redistribution, a new method that helps reduce excessive contrast enhancement. This proposed algorithm redistributes the dynamic range of an input image using its mean luminance value and the ratio of sub-histogram area. Experimental results show that by this redistribution, the significant change in brightness is reduced effectively and the output image is able to preserve the naturalness of an original image even if it has a poor histogram distribution.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.23-37
• /
• 2004

Location Based Services(LBSs) in mobile environments become very popular recently. For efficient LBSs, spatial database management systems must need a spatial indexing scheme such as R-trees in order to manage the huge spatial database. However, it may need unnecessary disk accesses since it needs to access objects which are not actually concerned to user's location-based queries. In this paper, to support the location-based queries efficiently, we propose a CLR-tree(Cell Leveling R-tree) in which a dynamic cell is built up within the minimum bounding rectangle of R-trees' node. The cell level of nodes is compared with the query's cell level in location-based query processing and determines the minimum search space. Also, we propose the insertion, split, deletion, and search algorithms for CRL-trees. From the experimental results, we see that a CLR-tree is able to decrease $5{\sim}20%$ of disk accesses from those of R-trees. So, a CLR-tree can be used for fast accessing spatial objects to user's location-based queries in LBSs.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.6
• /
• pp.599-607
• /
• 2001

In Conventional BMA, the motion vector can describe only translational movement and blocking noise is generated. To overcome this defect, motion estimation using triangular mesh has been proposed. The regular mesh is the method of dividing the image area into equal size triangle and haying the same node connection. It has no additional information about mesh structure, but do not reflect the real motion because it represents the regions by equal mesh structure regardless of the amount of motion. In this paper, motion estimation using dynamic regular mesh is proposed, In this method, the mesh structure is varied from the amount of motion and maintain the form of regular mesh. By the simulation, proposed method have better performance in PSNR and is superior to the other method in convergence rate.