• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.1
• /
• pp.151-163
• /
• 2013

Recently the attention on digital hologram that is regarded as to be the final goal of the 3-dimensional video technology has been increased. Digital hologram is calculated by modeling the interference phenomenon between an object wave and a reference wave. The modeling for digital holograms is called by computer generated hologram (CGH) Generally, CGH requires a very large amount of calculation. So if holograms are generated in real time, high-speed method should be needed. In this paper, we analyzed CGH equation, optimized it for mapping general purpose graphic processing unit (GPGPU), and proposed a optimized CGH calculation technique for GPGPU by resource allocation and various experiments which include block size changing, memory selection, and hologram tiling. The implemented results showed that a digital hologram that has $1,024{\times}1,024$ resolution can be generated during approximately 24ms, using 1K point clouds. In the experiment, we used two GTX 580 GPGPU of nVidia Inc.

• ETRI Journal
• /
• v.38 no.6
• /
• pp.1240-1249
• /
• 2016

With the number of IP cores in a multicore system-on-chip increasing to up to tens or hundreds, the role of on-chip interconnection networks is vital. We propose a networks-on-chip-style bus network as a compromise and redefine the exploration problem to find the best IP tiling patterns and communication path combinations. Before solving the problem, we estimate the time complexity and validate the infeasibility of the solution. To reduce the time complexity, we propose two fast exploration algorithms and develop a program to implement these algorithms. The program is executed for several experiments, and the exploration time is reduced to approximately 1/22 and 7/1,200 at the first and second steps of the exploration process, respectively. However, as a trade-off for the time saving, the time cost (TC) of the searched architecture is increased to up to 4.7% and 11.2%, respectively, at each step compared with that of the architecture obtained through full-case exploration. The reduction ratio can be decreased to 1/4,000 by simultaneously applying both the algorithms even though the resulting TC is increased to up to 13.1% when compared with that obtained through full-case exploration.

• International Journal of CAD/CAM
• /
• v.8 no.1
• /
• pp.21-28
• /
• 2009

In the present work, an attempt has been made to construct branching surface from 2-D contours, which are given at different layers and may have branches. If a layer having more than one contour and corresponds to contour at adjacent layers, then it is termed as branching problem and approximated by adding additional points in between the layers. Firstly, the branching problem is converted to single contour case in which there is no branching at any layer and the final branching surface is obtained by skinning. Contours are constructed from the given input points at different layers by energy-based B-Spline approximation. 3-D curves are constructed after adding additional points into the contour points for all the layers having branching problem by using energy-based B-Spline formulation. Final 3-D surface is obtained by skinning 3-D curves and 2-D contours. There are three types of branching problems: (a) One-to-one, (b) One-to-many and (c) Many-to-many. Oneto-one problem has been done by plethora of researchers based on minimizations of twist and curvature and different tiling techniques. One-to-many problem is the one in which at least one plane must have more than one contour and have correspondence with the contour at adjacent layers. Many-to-many problem is stated as m contours at i-th layer and n contours at (i+1)th layer. This problem can be solved by combining one-to-many branching methodology. Branching problem is very important in CAD, medical imaging and geographical information system(GIS).

• Korean Journal of Remote Sensing
• /
• v.31 no.1
• /
• pp.1-9
• /
• 2015

Mobility and cloud platform have become the dominant paradigm to develop web services dealing with huge and diverse digital contents for scientific solution or engineering application. These two trends are technically combined into mobile cloud computing environment taking beneficial points from each. The intention of this study is to design and implement a mobile cloud application for remotely sensed image fusion for the further practical geo-based mobile services. In this implementation, the system architecture consists of two parts: mobile web client and cloud application server. Mobile web client is for user interface regarding image fusion application processing and image visualization and for mobile web service of data listing and browsing. Cloud application server works on OpenStack, open source cloud platform. In this part, three server instances are generated as web server instance, tiling server instance, and fusion server instance. With metadata browsing of the processing data, image fusion by Bayesian approach is performed using functions within Orfeo Toolbox (OTB), open source remote sensing library. In addition, similarity of fused images with respect to input image set is estimated by histogram distance metrics. This result can be used as the reference criterion for user parameter choice on Bayesian image fusion. It is thought that the implementation strategy for mobile cloud application based on full open sources provides good points for a mobile service supporting specific remote sensing functions, besides image fusion schemes, by user demands to expand remote sensing application fields.

• Proceedings of the KSR Conference
• /
• 2008.11b
• /
• pp.897-904
• /
• 2008

The major objective of this study is to investigate the effective improvement plan for the curve sections in the conventional lines which the tilting train runs on. In order to the speed-up of conventional lines that have many curve lines, there needs a improvement construction of substructure such as the straight or double track work and so on. But in this case, it needs to have a plenty of the cost and the period. Therefore, the tilting train which provides the high-speed service effectively in curve tracks and is operating at abroad, was been studying to be suited to natural features. So, in this paper we investigate the improvement method at the sections only where need the extension of the transition curves, and the present status of them for the effective tiling train service using results which were examined on the preceding study which was the development of track system innovation technology for speed-up of them. And we look forward to playing a decisive role as reference material for the decision of the linear fitness in order to operate effectively on the conventional lines for the commercial service of the tilting train, on the basis of checking out the sufficient condition concerned in the track alignment and the velocity which are required in the railway construction rules and the design criteria.

• Proceedings of the KSR Conference
• /
• 2008.11b
• /
• pp.79-87
• /
• 2008

The major objective of this study is to investigate the effective maintenance system for the infrastructure on the conventional lines in which the tilting train runs. In order to the speed-up of conventional lines that have many curve lines, there needs a improvement construction of substructure such as the straight or double track work and so on. But in this case, it needs to have a plenty of the cost and the period. Therefore, the tilting train which provides the high-speed service effectively in curve tracks was developed. Besides, the efficiency prediction and the linear fitness of the existing conventional lines for a tiling train service were examined on the preceding study which was the development of track system innovation technology for speed-up of them. So, in this paper we propose the more effective maintenance method than the existing it in order to securing the high reliability and safety classified by the infrastructure, in analyzing foreign materials and the maintenance as well as the inspection cycle concerning domestic infrastructures of the track and the catenary etc. on the railway. And we look forward to playing a decisive role as reference material for the effective improvement of the existing maintenance about the infra on the conventional lines for the commercial service of the tilting train.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.291-304
• /
• 2019

This paper proposes a dynamic-tiling-based bandwidth-efficient (DTBE) virtual reality (VR) streaming scheme. We consider 360-degree VR contents with multiple view points such as the front, back, upper, and bottom sides. At a given time, the focus of a client is always bound to a certain view among multiple view points. By utilizing this perspective, under our proposed scheme, tiles with high encoding rates are selectively assigned to the focused view where multiple view points consist of multiple tiles with different encoding rates. The other tiles with low encoding rates are assigned to the remaining view points. Furthermore, for reducing view adaptation delay, we design a novel rapid view adaptation mechanism that selectively delivers an I-frame during view point updates by using frame indexing. We implement the proposed scheme on a commercial VR test bed where we adopt the MPEG media transport (MMT) standard with high-efficiency video coding (HEVC) tile modes. The measurement-based experiments show that the proposed scheme achieves an average data usage reduction of almost 65.2% as well as average view adaptation delay reduction of almost 57.7%.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.629-654
• /
• 2003

A new multiresolutional scheme that reconstructs a polygonal mesh from the set of contours is presented. In the first step, we apply a radial gradient method to extract the contours on the sampled slices from a volume data. After classifying the types of the edges on the contours, we represent the contour using the context-free grammar. The polygons between two neighboring contours are generated through the traversal of the derivation trees of the context-free grammar. The polygonal surface of the coarsest resolution is refined through the refinement of the contours, which is executed by casting more rays on the slices. The topologies between the polygonal surfaces of various resolutions are maintained from the fact that the radial gradient method preserves the topologies of the contours of various resolutions. The proposed scheme provides efficient computation and compression methods for the tiling procedure with the feature preservation.

• Journal of the Korea Convergence Society
• /
• v.6 no.3
• /
• pp.51-57
• /
• 2015

This paper proposes an efficient method such as Extended Three Region Partitioning Method for nested loops with irregular dependences for maximizing parallelism. Our approach is based on the Convex Hull theory, and also based on minimum dependence distance tiling, the unique set oriented partitioning, and three region partitioning methods. In the proposed method, we eliminate anti dependences from the nested loop by variable renaming. After variable renaming, we present algorithm to select one or more appropriate lines among given four lines such as LMLH, RMLH, LMLT and RMLT. If only one line is selected, the method divides the iteration space into two parallel regions by the selected line. Otherwise, we present another algorithm to find a serial region. The selected lines divide the iteration space into two parallel regions as large as possible and one or less serial region as small as possible. Our proposed method gives much better speedup and extracts more parallelism than other existing three region partitioning methods.

• Korean Journal of Construction Engineering and Management
• /
• v.13 no.3
• /
• pp.99-108
• /
• 2012

The rough design information is only available from BIM(Building Information Model) based schematic design. So, it is difficult to obtain sufficient information for generating BOQ. Like 2D design, there are some problems that the results are depend on what the choice of cost estimator. However, the most research of BIM based cost estimation are focus on quantity takeoff, the consideration of work item for generating BOQ is insufficient. Therefore, this paper present automatic inference process of work items in a BOQ using ontology. The proposed process and ontology is validated through applying tiling construction. If the proposed process is utilized, it is expected the basis of developing generation method for consistent BOQ by resolving intervention of cost estimator's arbitrary decision.