• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.4
• /
• pp.430-436
• /
• 2014

Matrix-star and Half-Pancake graphs are modified versions of Star graphs, and has some good characteristics such as node symmetry and fault tolerance. This paper analyzes embedding between Matrix-star and Half-Pancake graphs. As a result, Matrix-star graphs $MS_{2,n}$ can be embedded into Half-Pancake graphs $HP_{2n}$ with dilation 5 and expansion 1. Also, Half Pancake Graphs, $HP_{2n}$ can be embedded into Matrix Star Graphs, $MS_{2,n}$ with the expansion cost, O(n). This result shows that algorithms developed from Star Graphs can be applied at Half Pancake Graphs with additional constant cost because Star Graphs, $S_n$ is a part graph of Matrix Star Graphs, $MS_{2,n}$.

• Proceedings of the KSRS Conference
• /
• 1999.11a
• /
• pp.262-266
• /
• 1999

Several commercial companies that plan to provide improved panchromatic and/or multi-spectral remote sensor data in the near future are suggesting that merge datasets will be of significant value. This study evaluated the utility of one major merging process-process components analysis and its inverse. The 6 bands of 30$\times$30m Landsat TM data and the 10$\times$l0m SPOT panchromatic data were used to create a new 10$\times$10m merged data file. For the image classification, 6 bands that is 1st, 2nd, 3rd, 4th, 5th and 7th band may be used in conjunction with supervised classification algorithms except band 6. One of the 7 bands is Band 6 that records thermal IR energy and is rarely used because of its coarse spatial resolution (120m) except being employed in thermal mapping. Because SPOT panchromatic has high resolution it makes 10$\times$10m SPOT panchromatic data be used to classify for the detailed classification. SPOT as the Landsat has acquired hundreds of thousands of images in digital format that are commercially available and are used by scientists in different fields. After the merged, the classifications used supervised classification and neural network. The method of the supervised classification is what used parallelepiped and/or minimum distance and MLC(Maximum Likelihood Classification) The back-propagation in the multi-layer perception is one of the neural network. The used method in this paper is MLC(Maximum Likelihood Classification) of the supervised classification and the back-propagation of the neural network. Later in this research SPOT systems and images are compared with these classification. A comparative analysis of the classifications from the TM and merged SPOT/TM datasets will be resulted in some conclusions.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.535-538
• /
• 2002

Machine vision algorithms, which are composed of noise elimination algorithm, crack detection and mapping algorithm, and path planning algorithm, are required for sealing crack networks effectively and automation of crack sealing.. Noise elimination algorithm is the first step so that computer take cognizance of cracks effectively. Noises should be removed because common road includes a lot of noises(mark of oil, tire, traffic lane, and sealed crack) that make it difficult the computer to acknowledge cracks accurately. The objective of this paper is to propose noise elimination algorithm, prove the efficiency of the algorithm through coding. The result of the coding is represented in this paper as well.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.2
• /
• pp.1-10
• /
• 2016

The computational cost of clothing simulation and rendering is mainly depends on the type of mesh and its quality. Thus, quadrilateral meshes are generally preferred over triangular meshes for the reasons of accuracy and efficiency. This paper presents a method of quadrangulating sewing pattern based on the recursive geometry decomposition method. Herein, we proposed two simple improvements to the previous algorithms. The first one deals with the recursive geometry decomposition in which the physical domain is decomposed into simple and mappable regions. The second proposed algorithm deals with the vertex validation in which the invalid vertex classification can be validated.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.4
• /
• pp.304-310
• /
• 2017

In this paper, we propose the architecture of an IPM based lane detector for autonomous vehicles to detect and control the driving route along the curved lane. In the IPM image, we divide the area into two fields, Far/Near Field, and the lane candidate region is detected using the Hough transform to perform the matching for the curved lane. In autonomous vehicles, various algorithms must be embedded in the system. To reduce the system resources, we proposed a method to minimize the number of memory accesses to the image and various parameters on the external memory. The proposed circuit has 96% lane recognition rate and occupies 16% LUT, 5.9% FF and 29% BRAM in Xilinx XC7Z020. It processes Full-HD image at a rate of 42 fps at a 100 MHz operating clock.

• Journal of Korea Multimedia Society
• /
• v.2 no.4
• /
• pp.378-389
• /
• 1999

Parallel tasks in distributed real-time systems can be divided into several subtasks and be executed in parallel according to their real-time attributes. But, it is difficult to gain the optimal solution which is to allocate a tasks deadline into the subtasks deadline while minimizing the subtasks deadline miss. Tn this Paper, we propose the algorithm that allocates deadlines into each subtask, according to the attributes of each subtask(i.e. using communication time and execution time to periodic tasks). Also, we suggest a processor mapping algorithm that considers the communication time among the processors and the effective duplication algorithm which is allocated to the identical processor for the purpose of improving the communication time between the subtasks. We can obtain a result that reduces IPC(Inter-Processor Communication) time and uses the idle processor through applying effective real-time attributes to FUTD(Fully connected, Unbounded Task Duplication) algorithms. As a result, we can improve the average processor utilization.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.12
• /
• pp.665-682
• /
• 2007

Line drawing is a widely used style in non-photorealistic rendering because it generates expressive descriptions of object shapes with a set of strokes. Although various techniques for line drawing of 3D objects have been developed, line drawing of 2D images has attracted little attention despite interesting applications, such as image stylization. This paper presents a robust and effective technique for generating line drawings from 2D images. The algorithm consists of three parts; filtering, linking, and stylization. In the filtering process, it constructs a likelihood function that estimates possible positions of lines in an image. In the linking process, line strokes are extracted from the likelihood function using clustering and graph search algorithms. In the stylization process, it generates various kinds of line drawings by applying curve fitting and texture mapping to the extracted line strokes. Experimental results demonstrate that the proposed technique can be applied to the various kinds of line drawings from 2D images with detail control.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.340-343
• /
• 2004

Since the tide embankment construction started in 1991, the coastal environment in and around the Saemangeum area has undergone changes rapidly, there is a need for monitoring the environmental change in this region. Owing to high temporal and spatial heterogeneity of the coastal ecosystem and processes as well as the expense with traditional filed sampling at discrete locations, satellite remote sensing measurements offer a unique perspective on mapping a large region simultaneously because of the synoptic and repeat coverage and that quantitative algorithms used for estimating constituents' concentration in the coastal environments. Thus, the main objectives of the present study are to analyze the retrieved Suspended Sediment (SS) pattern to predict changes after the commencement of the tide embankment construction work in 1991. This is accomplished with a series of the Landsat TM/ETM+ imagery acquired from 1985-2002 (a total of 18 imageries). Instead of a simple empirical algorithm, we implement an analytical SS algorithm, developed by Ahn et al. (2003), which is especially developed for estimating SS concentration (SSC) in Case-2 waters. The results show that there is a significant change in SS pattern, which is mainly influenced by the tide and tidal height after the construction of the embankment work. As the construction progressed, the distribution pattern of SS has greatly changed, and the rate of SS concentration in the gap area of the dyke of post-construction has significantly increased.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.2
• /
• pp.21-28
• /
• 2001

As a result of the recent explosive growth of scientific data, extremely large volume datasets have become increasingly commonplace. While several texture-based volume rendering algorithms have been proposed, most of them focused on volumes smaller than the hardware's available texture memory. This paper presents a new parallel volume rendering scheme for very large static and time-varying data on a multipipe system architecture. Our scheme subdivides large volumes dynamically into smaller bricks, and assigns them adaptively to graphics pipes to minimize the costs of texture swapping. With the new method, Phong shaded images can be easily created by computing the gradients on the fly and using the color matrix feature of OpenGL. We report experimental results on an SGI Onyx2 for the various large datasets.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.3
• /
• pp.115-122
• /
• 2017

As the era of the fourth industrial revolution began, augmented reality showed infinite possibilities throughout society. However, current augmented reality systems such as head-mount display and hand-held display systems suffer from various problems such as weariness and nausea, and thus space-augmented reality, which is a projector-based augmented reality technology, is attracting attention. Spacial augmented reality requires precise tracking of dynamic objects to project virtual images in order to increase realism of augmented reality and induce user 's immersion. The infrared sensor-based precision tracking algorithm developed in this paper demonstrates very robust tracking performance with an average error rate of less than 1.5% and technically opens the way towards advanced augmented reality technologies such as tracking for arbitrary objects, and Socially, by easy-to-use tracking algorithms for non-specialists, it allows designers, students, and children to easily create and enjoy their own augmented reality content.