• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.12-18
• /
• 2007

The three dimensional interpolation is widely used for many kinds of color signal transformation such as real-time color gamut mapping. Given input color signal, the output color signal is approximately calculated by the interpolation with the input point and extracted values from a lookup table which is constructed by storing the values of transformation at regularly packed sample points. Apparently, errors of the interpolated approximation heavily depend on the selection of the lookup table. In this paper, a least square method is applied to assigning values of the lookup table with fixed size in order to minimize error of three-dimensional interpolation. The experimental result shows that the proposed method has better interpolation performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.2
• /
• pp.438-446
• /
• 2013

Generally, a camera isn't located at the center of display in a tele-presence system and it causes an incorrect eye contact between speakers which reduce the realistic feeling during the conversation. To solve this incorrect eye contact problem, we newly propose an intermediate view reconstruction algorithm using both a color camera and a depth camera and applying for the depth image based rendering (DIBR) algorithm. In the proposed algorithm, an efficient hole filling method using the arithmetic mean value of neighbor pixels and an efficient boundary noise removal method by expanding the edge region of depth image are included. We show that the generated eye-contacted image has good quality through experiments.

• The KIPS Transactions:PartA
• /
• v.18A no.6
• /
• pp.265-270
• /
• 2011

Even though 32-bit ISA based microprocessors are widely used more and more, 16-bit ISA based processors are still being frequently employed for embedded systems. Intel 8086, 80286, Motorola 68000, and ADChips AE32000 are the representatives of the 16-bit ISA based processors. However, due to less expressiveness of the 16-bit ISA from its narrow bit width, we need to execute more 16-bit instructions for the same implementation compared to 32-bit instructions. Because the number of executed instructions is a very important factor in performance, we have to resolve the problem by improving the expressiveness of the 16-bit ISA. In this paper, we propose a new pair register allocation algorithm to enhance an original graph-coloring based register allocation algorithm. Also, we explain about both the performance result and further research directions.

• The KIPS Transactions:PartC
• /
• v.11C no.5
• /
• pp.677-682
• /
• 2004

In the present paper routing and wavelength assignment (RWA) in optical WDM networks is considered. Previous techniques based on the combination of integer linear programming and graph coloring are complex and require extensive use of heuristics. Such methods are mostly slow and sometimes impossible to get results due to infeasibility. An alternative approach applied to RWA employs on the greedy algorithm for obtaining the maximum edge disjoint paths. Even though this approach is fast, it produces a solution for any connection request, which is very far from the optimal utilization of wavelengths. We propose a novel algorithm, which is based on the maximum flow technique to obtain the maximum quantity of edge, disjoint paths. Here we compare the offered method with previous maximum edge disjoint paths algorithms ap plied to the RWA.

• Journal of Advanced Navigation Technology
• /
• v.14 no.2
• /
• pp.191-197
• /
• 2010

Many does an application and application but the image analysis of face detection considerably is difficult. In order for with effect of the illumination which is irregular in the present paper America the illumination to range evenly in the face which is detected, detects a face territory, Complemented the result which detects only the front face of existing. With LAB color illumination revisions compared in Adaboost face detection of existing and 32% was visible the face detection result which improves. Bought two images which are input and executed Glassfire label rings. Compared Area critical price and became the area of above critical value and revised from RGB smooth anger and LAB images with LCFD system algorithm. The operational conversion image which is extracted like this executed a face territory detection in the object. In order to extract the feature which is necessary to a face detection used AdaBoost algorithms. The face territory remote login with the face territory which tilts in the present paper, until Multi-view face territory detections was possible. Also relationship without high detection rate seems in direction of illumination, With only the public PC application is possible was given proof user authentication field etc.

• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.123-130
• /
• 2004

Routing and wavelength assignment(RWA) problem is an important issue in optical transport networks based on wavelength division multiplexing(WDM) technique. It is typically solved using a combination of linear programming and graph coloring, or path selection based graph algorithms. Such methods are either complex or make extensive use of heuristics. In this paper we propose a novel and efficient approach which basically obtains the maximum edge disjoint paths (EDPs) for each source-destination demand pair. And those EDPs obtained are stored in Lookup Table and used for the update of weight matrix. Routes are determined in order by the weight matrix for the demand set. The comprehensive computer simulation shows that the Proposed algorithm uses similar or fewer wavelengths with significantly less execution time than bounded greedy approach (BGA) for EDP which is currently known to be effective in practice.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.40-43
• /
• 2012

3차원 영상 기술은 방송, 영화, 게임, 의료, 국방 등 다양한 기존 산업들과 융합하며 새로운 패러다임을 형성하고 있으며, 고품질 및 고해상도의 3차원 영상 획득에 대한 필요성이 강조되고 있다. 이에 따라, 최근에는 3차원 입체 영상을 제작 하는 방법 중 하나인 2D-plus-Depth 구조에 대한 연구가 활발히 진행되고 있다. 2D-plus-Depth 구조는 Charge-Coupled Device(CCD) 센서 등을 이용한 일반 카메라와 깊이 카메라를 결합한 형태로써 이 구조로부터 얻은 깊이 영상의 해상도를 상향 변환하기 위해서 Joint Bilateral Upsampling(JBU)[1], 컬러 영상의 정보를 활용한 보간법[2] 등의 방법들이 사용된다. 하지만 이 방법들은 깊이 영상을 높은 배율로 상향 변환할 경우 텍스처가 복사되거나 흐림 및 블록화 현상이 발생하는 문제점이 있다. 본 논문에서는 2D-plus-Depth 구조에서 얻은 고해상도 컬러 영상에서 보간 정보를 구하고 이 정보를 저해상도의 깊이 영상에 적용하여 상향 변환된 가이드 깊이 영상을 제작한다. 이 가이드 깊이 영상을 Bilateral Filtering[8]을 이용함으로써 고품질의 고해상도 깊이 영상을 획득한다. 실험 결과 제안하는 방법으로 해상도를 상향 변환을 할 경우에 기존의 보간법들에 비해 깊이 영상의 특성을 잘 보존함을 확인할 수 있고, 가이드 깊이 영상에 필터링을 처리한 결과가 JBU의 결과보다 향상됨을 확인할 수 있다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.11
• /
• pp.830-835
• /
• 2006

Because of its exponential growth of data and voice transmissions through wireless communications, efficient resource management became more important factor when we design wireless networks. One of those limited resources in the wireless communications is frequency bandwidth. As a solution of increasing reusability of resources, the efficient frequency assignment problems on wireless networks have been widely studied. One suitable approach to solve these frequency assignment problems is transforming the problem into traditional graph coloring problems in graph theory. However, most of frequency assignments on arbitrary network topology are NP-Complete problems. In this paper, we consider the Chromatic Bandwidth Problem on the cellular topology wireless networks. It is known that the lower bound of the necessary number of frequencies for this problem is $O(k^2)$. We prove that the lower bound of the necessary number of frequencies for the Chromatic Bandwidth Problem is $O(k^3)$ which is tighter lower bound than the previous known result.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.979-986
• /
• 2005

In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A RWA problem for scheduled lightpath demands (SLDs) has been solved by combinatorial optimal solution (COS) and graph coloring, or heuristic sequential RWA (sRWA). Such methods are very complex and incurs large computational overhead. In this paper, we propose an efficient RWA algorithm to utilize the time disjoint property as well as space disjoint property through fast grouping of SLDs. The computer simulation shows that our proposed algorithm indeed achieves up to $54\%$ faster computation with similar number of wavelengths than the existing heuristic sRWA algorithm.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.41 no.2
• /
• pp.117-124
• /
• 2017

The performance of the colored Gauss-Seidel solver on CPU and GPU was investigated for the two- and three-dimensional heat conduction problems by using different mesh sizes. The heat conduction equation was discretized by the finite difference method and finite element method. The CPU yielded good performance for small problems but deteriorated when the total memory required for computing was larger than the cache memory for large problems. In contrast, the GPU performed better as the mesh size increased because of the latency hiding technique. Further, GPU computation by the colored Gauss-Siedel solver was approximately 7 times that by the single CPU. Furthermore, the colored Gauss-Seidel solver was found to be approximately twice that of the Jacobi solver when parallel computing was conducted on the GPU.