• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2004.10a
• /
• pp.75-78
• /
• 2004

A mesh generation algorithm adapted to the mesh density map using the Delaunay mesh generation technique is developed. In the finite element analyses of the forging processes, the numerical error increases as the process goes on because of discrete property of the finite elements or severe distortion of elements. Especially, in the region where stresses and strains are concentrated, the numerical discretization error will be highly increased. However, it is too time consuming to use a uniformly fine mesh in the whole domain to reduce the expected numerical error. Therefore, it is necessary to construct locally refined mesh at the region where the error is concentrated such as at the die corner. In this study, the point insertion algorithm is used and the mesh size is controlled by moving nodes to optimized positions according to a mesh density map constructed with a posteriori error estimation. An optimization technique is adopted to obtain a good position of nodes. And optimized smoothing techniques are also adopted to have smooth distribution of the mesh and improve the mesh element quality.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.3
• /
• pp.417-423
• /
• 2011

Generally, in order to avoid overlap with previous research and to initiate the innovative research, researchers must analyze patent information before research can begin. In this paper, the development of grading criteria using current trends in the wind power generation will be performed by analyzing the following criteria: technology position of major countries, impact factor each countries, patent family size, patent portfolios analysis, patent applied analysis, and analysis of nationality for a patent. This patent information for the wind power generation is expected to be useful in deciding the direction of future research.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.5
• /
• pp.385-391
• /
• 2013

Big Data is data of big size which is not processed, collected, stored, searched, analyzed by the existing database management system. The parallel genetic algorithm using the Hadoop for BigData technology is easily realized by implementing GA(Genetic Algorithm) using MapReduce in the Hadoop Distribution System. The previous study that the genetic algorithm using MapReduce is proposed suitable transforming for the GA by MapReduce. However, they did not show good performance because of frequently occurring data input and output. In this paper, we proposed the MRPGA(MapReduce Parallel Genetic Algorithm) using improvement Map and Reduce process and the parallel processing characteristic of MapReduce. The optimal solution can be found by using the topology, migration of parallel genetic algorithm and local search algorithm. The convergence speed of the proposal method is 1.5 times faster than that of the existing MapReduce SGA, and is the optimal solution can be found quickly by the number of sub-generation iteration. In addition, the MRPGA is able to improve the processing and analysis performance of Big Data technology.

• ETRI Journal
• /
• v.26 no.6
• /
• pp.615-621
• /
• 2004

Next generation mobile communication system, such as IMT-2000, adopts Turbo codes due to their powerful error correction capability. This paper presents a block-wise maximum a posteriori (MAP) Turbo decoding structure with a low memory requirement. During this research, it has been observed that the training size and block size determine the amount of required memory and bit-error rate (BER) performance of the block-wise MAP decoder, and that comparable BER performance can be obtained with much shorter blocks when the training size is sufficient. Based on this observation, a new decoding structure is proposed and presented in this paper. The proposed block-wise decoder employs a decoding scheme for reducing the memory requirement by setting the training size to be N times the block size. The memory requirement for storing the branch and state metrics can be reduced 30% to 45%, and synthesis results show that the overall memory area can be reduced by 5.27% to 7.29%, when compared to previous MAP decoders. The decoder throughput can be maintained in the proposed scheme without degrading the BER performance.

• Journal of Fisheries and Marine Sciences Education
• /
• v.17 no.1
• /
• pp.76-85
• /
• 2005

GIS (Geographic Information Systems) technology is a necessary function to support location based on service by using GPS in the mobile environment. These mobile systems have basic functional limitations such as a low rate of processing, limited memory capacity, and small screen size. Because of these limitations, most of the mobile systems require development of a reduced digital map to overcome problems with large-volume spatial data. In this paper, we suggest using the reduced digital map format in order to use location based on service in a PDA environment. The processing of the proposed data format consists of map generation, redefinition of layers, creating polygons, and format conversion. The proposed data format reduces the data size by about 98% comparing with DXF format based on the digital map of Busan.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.697-698
• /
• 2006

In this paper, we propose a new scheme to generate multi-view images using a depth-image-based rendering (DIBR) technique. In order to improve the quality of multi-view images at newly exposed areas during mesh-based rendering, we preprocess the depth map using a Gaussian smoothing filter. Previous algorithms apply a smoothing filter to the whole depth map even if the depth map is collapsed. After extracting objects from the depth map, we apply the smoothing filter to their boundaries. Finally, we cannot only maintain the depth quality, but also generate high quality multi-view images. Experimental results show that our proposed algorithm outperforms previous works and supports an efficient depth keying technique.

• Korean Journal of Computational Design and Engineering
• /
• v.19 no.1
• /
• pp.61-67
• /
• 2014

This paper proposes a procedure enabling the extraction of view-dependent triangular approximations from a height map. In general, procedures to approximate a height map use tree hierarchies. These methods, however, have a limitation in terms of accuracy, because they depend on tree hierarchy than terrain features. To overcome the difficult, we apply the simplification method for triangular meshes to a height map. The proposed procedure maintains full decimation procedure to support multiresolution. The maintenance of decimation procedure results in creation of the groups (trees), each of which consists of vertices that can be merged into one vertex (root node). As the groups have tolerance which is determined by some tests, they support the generation of view-dependent arbitrary triangular meshes.

• Journal of Korea Game Society
• /
• v.11 no.3
• /
• pp.3-8
• /
• 2011

The learning by computer games, is in the spotlight as an effective education method for the game generation. The educational games need to provide additionally an omniscient view of the learning as an objective viewpoint for storytelling of learning. The omniscient viewpoint needs good readability in real-time, and to provide systematically overall and detailed informations of learning. In this paper, we propose the visual learning map as the omniscient view for storytelling of learning. The proposed learning map is composed of the district map, the topic map, and the progress map for the omniscient view of the learning. The proposed learning map is represented by several visual diagrams for real-time readability. The proposed learning map can apply to all the educational games which provide the game minimaps.

• Journal of Korea Multimedia Society
• /
• v.23 no.2
• /
• pp.127-134
• /
• 2020

In this paper, we propose a map alignment method for maps generated by point-line monocular SLAM. In the proposed method, the information of feature lines as well as feature points extracted from multiple maps are fused into a single map. To this end, the proposed method first searches for similar areas between maps via Bag-of-Words-based image matching. Thereafter, it calculates the similarity transformation between the maps in the corresponding areas to align the maps. Finally, we merge the overlapped information of multiple maps into a single map by removing duplicate information from similar areas. Experimental results show that maps created by different users are combined into a single map, and the accuracy of the fused map is similar with the one generated by a single user. We expect that the proposed method can be utilized for fast imagery map generation.

• Korean Journal of Remote Sensing
• /
• v.34 no.2_2
• /
• pp.407-418
• /
• 2018

The frequency and risk of disasters are increasing due to environmental and social factors. In order to respond effectively to disasters that occur unexpectedly, it is very important to quickly obtain up-to-date information about target area. It is possible to intuitively judge the situation about the area through the image-map generated at high speed, so that it can cope with disaster quickly and effectively. In this study, we propose an image-map generation and visualization system from UAV images for real-time disaster monitoring. The proposed system consists of aerial segment and ground segment. In the aerial segment, the UAV system acquires the sensory data from digital camera and GPS/IMU sensor. Communication module transmits it to the ground server in real time. In the ground segment, the transmitted sensor data are processed to generate image-maps and the image-maps are visualized on the geo-portal. We conducted experiment to check the accuracy of the image-map using the system. Check points were obtained through ground survey in the data acquisition area. When calculating the difference between adjacent image maps, the relative accuracy was 1.58 m. We confirmed the absolute accuracy of the image map for the position measured from the individual image map. It is confirmed that the map is matched to the existing map with an absolute accuracy of 0.75 m. We confirmed the processing time of each step until the visualization of the image-map. When the image-map was generated with GSD 10 cm, it took 1.67 seconds to visualize. It is expected that the proposed system can be applied to real - time monitoring for disaster response.