• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.19-30
• /
• 2009

The service that has recently come into the spotlight utilizes the map to first approach the map and then provide various mash-up formed results through the interface. This service can provide precise information to the users but the map is barely reusable. The sketch-map system of this paper, unlike the existing large map system, uses the method of presenting the specific spot and route in XML document and then clustering among sketch-maps. The map service system is designed to show the optimum route to the destination in a simple outline map. It is done by renovating the spot presented by the map into optimum contents. This service system, through the process of analyzing, splitting and clustering of the sketch-map's XML document input, creates a valid form of a sketch-map. It uses the LCS(Longest Common Subsequence) algorithm for splitting and merging sketch-map in the process of query. In addition, the simulation of this system's expected effects is provided. It shows how the maps that share information and knowledge assemble to form a large map and thus presents the system's ability and role as a new research portal.

• 한국전산유체공학회:학술대회논문집
• /
• 2009.11a
• /
• pp.1-1
• /
• 2009

In this presentation, I talk about various fluid simulation methods that have been developed for computer graphics special effects since 1996. They are all based on CFD but sacrifice physical reality for visual plausability and time. But as the speed of computer increases rapidly and the capability of GPU (graphics processing unit) improves, methods for more physical realism have been tried. In this talk, I will focus on four aspects of fluid simulation methods for computer graphics: (1) particle level-set methods, (2) particle-based simulation, (3) methods for exact satisfaction of incompressibility constraint, and (4) GPU-based simulation. (1) Particle level-set methods evolve the surface of fluid by means of the zero-level set and a band of massless marker particles on both sides of it. The evolution of the zero-level set captures the surface in an approximate manner and the evolution of marker particles captures the fine details of the surface, and the zero-level set is modified based on the particle positions in each step of evolution. (2) Recently the particle-based Lagrangian approach to fluid simulation gains some popularity, because it automatically respects mass conservation and the difficulty of tracking the surface geometry has been somewhat addressed. (3) Until recently fluid simulation algorithm was dominated by approximate fractional step methods. They split the Navier-Stoke equation into two, so that the first one solves the equation without considering the incompressibility constraint and the second finds the pressure which satisfies the constraint. In this approach, the first step introduces error inevitably, producing numerical diffusion in solution. But recently exact fractional step methods without error have been developed by fluid mechanics scholars), and another method was introduced which satisfies the incompressibility constraint by formulating fluid in terms of vorticity field rather than velocity field (by computer graphics scholars). (4) Finally, I want to mention GPU implementation of fluid simulation, which takes advantage of the fact that discrete fluid equations can be solved in parallel.

• Journal of Broadcast Engineering
• /
• v.9 no.3
• /
• pp.257-273
• /
• 2004

In stereoscopic or multi-view three dimensional display systems, the synthesis of intermediate sequences is inevitably needed to assure look-around capability and continuous motion parallax so that it could enhance comfortable 3D perception. The quadtree-based disparity estimation is one of the most remarkable methods for synthesis of Intermediate sequences due to the simplicity of its algorithm and hardware implementation. In this paper, we propose two ideas in order to reduce the annoying flicker at the object boundaries of synthesized intermediate sequences by quadtree-based disparity estimation. First, new split-scheme provides more consistent auadtree-splitting during the disparity estimation. Secondly, adaptive temporal smoothing using correlation between present frame and previous one relieves error of disparity estimation. Two proposed Ideas are tested by using several stereoscopic sequences, and the annoying flickering is remarkably reduced by them.

• The Korean Journal of Applied Statistics
• /
• v.14 no.1
• /
• pp.91-101
• /
• 2001

It has been shown that the multiple trees predictors are more accurate in reducing test set error than a single tree predictor. There are two ways of generating multiple trees. One is to generate modified training sets by resampling the original training set, and then construct trees. It is known that arcing algorithm is efficient. The other is to perturb randomly the working split at each node from a list of best splits, which is expected to generate reasonably good trees for the original training set. We propose a new combined multiple regression trees predictor which uses the latter multiple regression tree predictor as a predictor based on a modified training set at each stage of arcing. The efficiency of those prediction methods are compared by applying to high throughput screening of chemical compounds for biological effects.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.5
• /
• pp.417-423
• /
• 2017

This paper intend to implement monitoring systems for individual customized diagnostics to maintain ongoing disease management to promote human health. Analyze the threshold of a measured biological signal using a number of measuring sensors. Performance assessment revealed that the SVM algorithm for bio-signal analysis showed an average error rate of 2 %. The accuracy of the classification is 97.2%, and reduced the maximum of 19.2% of the storage space when you split the window into 5,000 pieces. Out of the total 5,000 bio-signals, 84 results showed that results from the system were differently the results of the expert's diagnosis and showed about 98 % accuracy. However, the results of the monitoring system did not occur when the results of the monitoring system were lower than that of experts. And About 98% accuracy was shown.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.369-380
• /
• 1996

Inductive Loop Detector(ILD) has been commonly used in collecting traffic data such as occupancy time and non-occupancy time. From the data, the traffic volume and type of passing vehicle is calculated. To provide reliable data for traffic control and plan, accuracy is required in type recognition which can be utilized to determine split of traffic signal and to provide forecasting data of queue-length for over-saturation control. In this research, a new recognition model issuggested for recognizing typeof vehicle from thecollected data obtained through ILD systems. Two clustering methods, based on statistical algorithms, and one neural network clustering method were employed to test the reliability and occuracy for the methods. In a series of experiments, it was found that the new model can greatly enhance the reliability and accuracy of type recongition rate, much higher than conventional approa-ches. The model modifies the neural network clustering method and enhances the recongition accuracy by iteratively applying the algorithm until no more unclustered data remains.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.5 no.2
• /
• pp.54-68
• /
• 2002

In this paper, We propose a multi-dimensional index structure, called a VA (vector approximate) -tree that constructs a tree with vector approximates of multi-dimensional feature vectors. To save storage space for index structures, the VA-tree employs vector approximation concepts of VA-file that presents feature vectors with much smaller number of bits than original value. Since the VA-tree is a tree structure, it does not suffer from performance degradation owing to the increase of data. Also, even though the VA-tree is MBR Minimum Bounding Region) based tree structure like a R-tree, its split algorithm never allows overlap between MBRs. We show through various experiments that our proposed VA-tree is the efficient index structure for large amount of multi-dimensional data.

• Journal of Korea Multimedia Society
• /
• v.5 no.2
• /
• pp.167-175
• /
• 2002

Image Mosaicing creates a new image by composing video frames or still images that are related, and performed by arrangement, composition and redundancy analysis of images. This paper proposes a hierarchical image mosaicing system using camera and object parameters far efficient video database construction. A tree-based image mosiacing has implemented for high-speed computation time and for construction of static and dynamic image mosaic. Camera parameters are measured by using least sum of squared difference and affine model. Dynamic object detection algorithm has proposed for extracting dynamic objects. For object extraction, difference image, macro block, region splitting and 4-split detection methods are proposed and used. Also, a dynamic positioning method is used for presenting dynamic objects and a blurring method is used for creating flexible mosaic image.

• Journal of Broadcast Engineering
• /
• v.4 no.2
• /
• pp.144-154
• /
• 1999

The binomial sequences are family of orthogonal sequences that can be generated with remarkable simplicity-no multiplications are necessary. This paper introduces a class of non-recursive multidimensional filters for frequency-selective image processing without multiplication operations. The magnitude responses are narrow-band. approximately gaussian-shaped with center frequencies which can be positioned to yield low-pass. band-pass. or high-pass filtering. Algorithms for the efficient implementation of these filters in software or in hardware are described. Also. we show that the binomial QMFs are the maximally flat magnitude square Perfect Reconstruction paraunitary filters with good compression capability and these are shown to be wavelet filters as well. In wavelet transform the original image is decomposed at different scales using a pyramidal algorithm architecture. The decomposition is along the vertical and horizontal direction and maintains constant the number of pixels required to describe the images. An efficient perfect reconstruction binomial QMF-Wavelet signal decomposition structure is proposed. The technique provides a set of filter solutions with very good amplitude responses and band split. The proposed binomial QMF-filter structure is efficient, simple to implement on VLSl. and suitable for multi-resolution signal decomposition and coding applications.

• Journal of Korean Society of Transportation
• /
• v.24 no.4 s.90
• /
• pp.81-91
• /
• 2006

As public transportation is significant mode to make sustainable urban transportation system, the importance of Public transportation has grown gradually. Nowadays the central and local government make various policies which help to raise modal sp)it of public transportation. To understand previous public transportation Policies and make more efficient policies, it is important to know the current level of public transportation exactly. The main aim of this study is assess the competitiveness of public transportation in world major cities We select assessment indexes and have grouping use factor analysis. Then we have 8 clusters of cities by cluster analysis, Also, we analyze the relationship between public transportation characteristics and modal split.