• 제목/요약/키워드: tiling

검색결과 115건 처리시간 0.028초

GPGPU기반의 디지털 홀로그램 콘텐츠의 고속 생성 기법 (High-Speed Generation Technique of Digital holographic Contents based on GPGPU)

  • 이윤혁;김동욱;서영호
    • 디지털산업정보학회논문지
    • /
    • 제9권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.

Design Space Exploration for NoC-Style Bus Networks

  • Kim, Jin-Sung;Lee, Jaesung
    • ETRI Journal
    • /
    • 제38권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.

Construction of Branching Surface from 2-D Contours

  • Jha, Kailash
    • International Journal of CAD/CAM
    • /
    • 제8권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).

Evaluation of Geo-based Image Fusion on Mobile Cloud Environment using Histogram Similarity Analysis

  • Lee, Kiwon;Kang, Sanggoo
    • 대한원격탐사학회지
    • /
    • 제31권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.

틸팅열차 상용화대비 기존선 곡선구간 개량방안 검토 (Investigation of Improvement Scheme for the Curve Sections on the Conventional Line Prepared for the Tilting Train Service)

  • 안광열;이창훈;유근수;김종태
    • 한국철도학회:학술대회논문집
    • /
    • 한국철도학회 2008년도 추계학술대회 논문집
    • /
    • 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.

  • PDF

틸팅열차 상용화대비 기존선 인프라시스템의 효율적 유지보수체계 검토 (Investigation of Effective Maintenance System for the Infra on the Conventional Line Prepared for the Tilting Train Service)

  • 유근수;이창훈;안광열;김종태
    • 한국철도학회:학술대회논문집
    • /
    • 한국철도학회 2008년도 추계학술대회 논문집
    • /
    • 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.

  • PDF

Bandwidth-Efficient Live Virtual Reality Streaming Scheme for Reducing View Adaptation Delay

  • Lee, Jongmin;Lee, Joohyung;Lim, Jeongyeon;Kim, Maro
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권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%.

윤곽선을 이용한 다중해상도적 복원 (Multiresolutional Reconstruction from Contours)

  • 민경하;이인권
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제30권11호
    • /
    • pp.629-654
    • /
    • 2003
  • 본 논문에서는 윤곽선들의 집합으로부터 다각형 곡면을 복원하는 다중해상도적 방법을 제안한다. 그 방법의 첫 단계에서는 방사 조사법을 적용해서 체적 데이타로부터 추출된 여러 장의 영상들로부터 윤곽선을 추출한다. 그리고 이 윤곽선을 구성하는 선분들의 유형들을 분류한 다음, 이를 이용해서 윤곽선을 context-free 문법으로 표현하는 방법을 제시한다. 두 번째 단계에서는 이웃하는 두 윤곽선들 사이에 다각형들을 생성하는 것으로, 이를 위하여 context-free 문법의 유도 트리를 검색함으로써 두 윤곽선들 사이에서 서로 대응되는 꼭지점과 선분을 찾는 방법을 제시한다. 이러한 단계를 거쳐서 생성된 가장 낮은 해상도의 다각형 곡면은 각 윤곽선을 세분화함으로써 더 높은 해상도의 다각형 곡면으로 세분화된다. 여기서 윤곽선은 각 영상에서 더 많은 광선을 방사함으로써 세분화된다. 본 연구에서는 방사 조사법을 이용해서 추출된 다양한 해상도의 윤곽선들의 연결도가 일정하게 유지됨을 이용해서 다양한 해상도의 다각형 곡면들의 연결도는 일정하게 유지됨을 보장한다. 제안된 방법은 효율적인 복원과 복원된 물체의 외형적인 특징을 보장하는 압축 방법을 제공한다.

비규칙 종속성을 가진 루프의 확장된 세지역 분할 방법 (Extended Three Region Partitioning Method of Loops with Irregular Dependences)

  • 정삼진
    • 한국융합학회논문지
    • /
    • 제6권3호
    • /
    • pp.51-57
    • /
    • 2015
  • 본 논문은 비규칙 종속성을 가진 내포된 루프의 수행 속도를 향상시키기 위해서 Extended Three Region Partitioning Method 라는 효과적인 루프 분할 방법에 대해서 연구하였다. 본 논문에서 제안된 루프 분할 방법은 변수 재명명에 의해서 역종속성을 가진 내포된 루프를 제거한 후 네 개의 선중에 하나 혹은 그 이상의 적절한 선을 선택하는 알고리즘을 개발한다. 한 개의 선이 선택되면 선택된 선에 의해서 전체 영역은 두 개의 병렬지역으로 분할된다. 한 개 이상의 선이 선택되면 그 선들에 의해서 하나의 순차지역과 두 개의 병렬지역으로 분할한다. 제안된 분할 방법은 기존의 분할 방법보다 성능이 우수함을 성능 분석에서 보여준다.

BIM과 온톨로지를 활용한 표준내역항목 추론 자동화 (Automatic Inference of Standard BOQ(Bill of Quantities) Items using BIM and Ontology)

  • 이슬기;김가람;유정호
    • 한국건설관리학회논문집
    • /
    • 제13권3호
    • /
    • pp.99-108
    • /
    • 2012
  • BIM(Building Information Model) 기반으로 기본설계를 수행한 경우에도 개략적인 설계 정보만 제공되므로, 내역작성에 필요한 충분한 정보를 설계도면으로부터 확보하는 것이 어렵다. 하지만 대부분 BIM기반 공사비산정 관련 연구들은 물량산출 자동화 또는 BIM 기반 물량산출결과의 정확도 향상을 위한 방안 제시하는 것이 대부분이며, 건설사업의 공사비산정에서 요구되고 있는 표준품셈 및 일위대가에 대한 고려가 미흡하다. 따라서 본 연구에서는 BIM 활용의 장점을 활용하고 여기에 온톨로지 기술을 접목하여, BIM 기반의 기본설계 정보로부터 내역서 생성에 필요한 작업내역을 자동으로 추출하는 프로세스를 제시한다. 이 프로세스를 적용할 경우, BIM 정보의 활용성이 더욱 향상될 것으로 기대되며, 견적자의 자의적 판단이 개입되던 문제를 해결하여 동일한 BIM이라면 동일한 견적결과를 얻을 수 있는 일관성 있는 내역작성 방법 개발의 기초가 될 것으로 기대된다.