• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1359-1371
• /
• 2020

In transmitting and receiving such a large amount of data, reliable data communication is crucial for normal operation of a device and to prevent abnormal operations caused by errors. Therefore, in this paper, it is assumed that an error correction code (ECC) that can detect and correct errors by itself is used in an environment where massive data is sequentially received. Because an embedded system has limited resources, such as a low-performance processor or a small memory, it requires efficient operation of applications. In this paper, we propose using an accelerated ECC-decoding technique with a graphics processing unit (GPU) built into the embedded system when receiving a large amount of data. In the matrix-vector multiplication that forms the Hamming code used as a function of the ECC operation, the matrix is expressed in compressed sparse row (CSR) format, and a sparse matrix-vector product is used. The multiplication operation is performed in the kernel of the GPU, and we also accelerate the Hamming code computation so that the ECC operation can be performed in parallel. The proposed technique is implemented with CUDA on a GPU-embedded target board, NVIDIA Jetson TX2, and compared with execution time of the CPU.

• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.97-110
• /
• 2005

Recently, many WMS(Web Map Services) and POI(Point of Interest) services come to be in service on the Internet using Web GIS(Geographic Information System) as Information Technology and computer H/W are evolved faster in its speed, network bandwidth and features. The Web GIS is, however, limited and constrained on the specification of its system configuration, the service class provided and the presentation methodology of a map. As the mobile Internet becomes popular in mobile service, Web GIS service on mobile environment is strongly required and to be provided by location based WMS(Web Map Service) on a mobile client such as PDA with location information of the user. In this paper, we made an effort to design and implement a GIS computing environment by thin client for mobile web map service. For implementing the thin client GIS computing environment. we were using NGII's(National Geographic Information Institute's) DXF map, representing the map by SVG(Scalable Vector Graphics) recommended by OGC(OpenGis Consortium), and adapting standard XML web service to provide the thin client GIS service on PDA by applying the location information of the user in realtime with GPS on mobile environment.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.269-277
• /
• 2006

We propose a new expert system for recovering the broken fragments of relics into an original form using computer graphics and image processing. This paper presents a system with an application to tombstones objects of flat plane with letters carved in for assembling the fragments by placing their respective fragments in the right position. The matching process contains three sub-processes: aligning the front and letters of an object, identifying the matching directions, and determining the detailed matching positions. We apply least squares fitting, vector inner product, and geometric and RGB errors to the matching process. It turned out that 2-D translations via fragments-alignment enable us to save the computational load significantly. Based on experimental results from the damaged cultural fragments, the performance of the proposed method is illustrated.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.5
• /
• pp.29-38
• /
• 2017

We propose a method for tree-inspired chair modeling that can generate a tree-branch pattern in the skeleton of an arbitrary chair shape. Unlike existing methods that merge multiple-input models, the proposed method requires only one mesh as input, namely the contour mesh of the user's desired part, to model the chair with a branch pattern generated by tree-growth simulation. We propose a new method for the efficient extraction of the contour-mesh region in the tree-branch pattern. First, we extract the contour mesh based on the face area of the input mesh. We then use the front and back mesh information to generate a skeleton mesh that reconstructs the connection information. In addition, to obtain the tree-branch pattern matching the shape of the input model, we propose a three-way tree-growth simulation method that considers the tangent vector of the shape surface. The proposed method reveals a new type of furniture modeling by using an existing furniture model and simple parameter values to model tree branches shaped appropriately for the input model skeleton. Our experiments demonstrate the performance and effectiveness of the proposed method.

• Journal of the Korea Computer Graphics Society
• /
• v.21 no.5
• /
• pp.21-27
• /
• 2015

In this paper, we presents visual effect(water, fire, smoke) simulation and interaction system for TV virtual studio. TV virtual studio seamlessly synthesizes CG background and a live performer standing on a TV green studio. Previous virtual studios focus on the registration of CG background and a performer in real world. In contrast to the previous systems, we can afford to make new types of TV scenes more easily by simulating interactive visual effects according to a performer. This requires the extraction of the performer motion to be transformed 3D vector field and simulate fluids by applying the vector field to Navier Stokes equation. To add realism to water VFX simulation and interaction, we also simulate the dynamic behavior of splashing fluids on the water surface. To provide real-time recording of TV programs, real-time VFX simulation and interaction is presented through a GPU programming. Experimental results show this system can be used practically for realizing water, fire, smoke VFX simulation and the dynamic behavior simulation of fish flocks inside ocean.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1588-1596
• /
• 2004

Recently, many WMS(Web Mapping Services) and POI(Point of Interest) service on to be in service on the Internet using Web CIS(Geographic Information System) as information Technology and computer HW are evolved faster in its speed, network bandwidth and features. The Web GIS is, however, limited and constrained on the specification of its system configuration, the service class provided and the presentation methodology of a map. As the mobile Internet becomes popular in mobile service, Web GIS service on mobile environment is strongly required and to be provided by LBS(Location Based Service) on a mobile client such as PDA with location information of the user. In this paper, we made an effort to design and implement a GIS computing environment by thin client for mobile web mapping service. For implementing the thin client GIS computing environment, we were using NGII's(National Geographic Information Institute's) DXF map, representing the map by SVG(Scalable Vector Graphics) recommended by OGC(OpenGis Consortium), and adapting standard XML web service to provide the thin client GIS service on PDA by applying the location information of the user in realtime with GPS on mobile environment.

• Journal of the Korea Computer Graphics Society
• /
• v.9 no.3
• /
• pp.23-29
• /
• 2003

There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of the previous block. If we can obtain useful and enough information from the motion vector of the same coordinate block of the previous frame, the total number of search points used to find the motion vector of the current block may be reduced significantly. In this paper, we propose the block-matching motion estimation using an adaptive initial search point by the predicted motion information from the same block of the previous frame. And the first search point of the proposed algorithm is moved an initial point on the location of being possibility and the searching process after moving the first search point is processed according to the fast search pattern. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved UP to the 1.05dB as depend on the image sequences and improved about 0.33~0.37dB on an average. Search times are reduced about 29~97% than the other fast search algorithms. Simulation results also show that the performance of the proposed scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS(Full Search) algorithm.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.133-138
• /
• 2006

Electronic Navigational Charts(ENCs) are official nautical charts which are equivalent to paper charts with supplementary information. Although their main purpose is to be used for the safe navigation of ships, they also contain much information on coasts and seas which may be interesting to ordinary people. However, there is no easy way to access them because of therir specialized data format, access method and visualization. This paper proposes on implementation of SVG for the access and services of ENCs. SVG(Scalable Vector Graphic) makes it possible to make use of Vector graphics for servicing maps in basic internet browsing environment. Implement of SVG for ENC applications by this research is free of special server side GIS mapping system and client side extra technology. The implementation of SVG for ENC Applications can be summarized as follows: Firstly, SVG provides spatial information to possess searching engine to embody SVG map. Secondly, SVG can provide high-quality vector map graphics and interactive facility without special Internet GIS system. It makes it possible to use services with very low cost. Thirdly, SVG information service targeting on maritime transportation can be used as template, so it can be used dynamically any other purpose such as traffic management and vessel monitoring. Many good characteristics of SVG in mapping at computer screen and reusability of SVG document provide new era of visualization of marine geographic information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.10
• /
• pp.1930-1936
• /
• 2007

Electronic Navigational Charts(ENCs) are official nautical charts which are equivalent to paper charts with supplementary information. Although their main purpose is to be used for the safe navigation of ships, they also contain much information on coasts and seas which may be interesting to ordinary people. However, there is no easy way to access them because of their specialized data format, access method and visualization. This paper proposes m implementation of SVG for the access and services of ENCs. SVG(Scalable Vector Graphic) makes it possible to make use of Vector graphics for map services in basic internet browsing environment. Implementation of SVG for ENC applications by this research is free of special server side GIS mapping system and client side extra technology. The Implementation of SVG for ENC Applications can be summarized as follows: Firstly, SVG provides spatial information to possess searching engine to embody SVG map. Secondly SVG can provide high-quality vector map graphics and interactive facility without special Internet GIS system. It makes it possible to use services with very low cost. Thirdly, SVG information service targeting on maritime transportation can be used as template, so it can be used dynamically any other purpose such as traffic management and vessel monitoring. Many good characteristics of SVG in mapping at computer screen and reusability of SVG document provide new era of visualization of marine geographic information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1562-1578
• /
• 2020

Vector data compression algorithm can meet requirements of different levels and scales by reducing the data amount of vector graphics, so as to reduce the transmission, processing time and storage overhead of data. In view of the fact that large threshold leading to comparatively large error in Douglas-Peucker vector data compression algorithm, which has difficulty in maintaining the uncertainty of shape features and threshold selection, a segmented Douglas-Peucker algorithm based on node importance is proposed. Firstly, the algorithm uses the vertical chord ratio as the main feature to detect and extract the critical points with large contribution to the shape of the curve, so as to ensure its basic shape. Then, combined with the radial distance constraint, it selects the maximum point as the critical point, and introduces the threshold related to the scale to merge and adjust the critical points, so as to realize local feature extraction between two critical points to meet the requirements in accuracy. Finally, through a large number of different vector data sets, the improved algorithm is analyzed and evaluated from qualitative and quantitative aspects. Experimental results indicate that the improved vector data compression algorithm is better than Douglas-Peucker algorithm in shape retention, compression error, results simplification and time efficiency.