• Title/Summary/Keyword: recalculation

Search Result 52, Processing Time 0.02 seconds

Computational load reduction by avoiding the recalculation of angular redundancy in computer-generated holograms

  • Jia, Jia;Chen, Jhensi;Chu, Daping
    • ETRI Journal
    • /
    • v.41 no.1
    • /
    • pp.52-60
    • /
    • 2019
  • A fast hologram calculation approach is proposed to reduce computational load by avoiding the recalculation of redundancy information. In the proposed method, the hologram is divided into several sub-holograms that record and reconstruct different views of 3D objects. The sub-hologram is generated from its adjacent calculated sub-holograms by only adding the holograms of difference images between an adjacent pair of views. The repetitive information of two adjacent views is called angular redundancy. Therefore, avoiding the recalculation of this angular redundancy can considerably reduce the computational load. Experimental results confirm that the proposed method can reduce the computational time for the statue head, rabbits, and car to 4.73%, 6.67%, and 10.4%, respectively, for uniform intensity, and to 56.34%, 57.9%, and 66.24%, respectively, for 256 levels intensity, when compared to conventional methods.

Recalculation of Forest Growing Stock for National Greenhouse Gas Inventory (국가 온실가스 통계 산정을 위한 임목축적 재계산)

  • Lee, Sun Jeoung;Yim, Jong-Su;Son, Yeong Mo;Kim, Raehyun
    • Journal of Climate Change Research
    • /
    • v.7 no.4
    • /
    • pp.485-492
    • /
    • 2016
  • For reporting national greenhouse gas inventory in forest sector, the forest growing stock from the National Forest Inventory (NFI) system has used as activity data sources. The National Forest Inventory system was changed from rotation system by province to annual system by 5 years across the country. The forest growing stocks based on the new inventory system produced a different trend compared to the previous estimations. This study was implemented to recalculate previous forest growing stocks for time series consistency at a national level. The recalculation of forest growing stock was conducted in an overlap approach by the IPCC guideline. In order to support the more consistency data, we used calibration factors between applied stand volumes in 1985 and 2012, respectively. As a result, the time series of recalculated forest growing stock was to be consistency using the overlap approach and the calibration factor with the lower middle/middle site index. According to the applied overlap period, however, we will recalculate activity data using more complete data from national forest inventory system.

INCREMENTAL INDUCTIVE LEARNING ALGORITHM IN THE FRAMEWORK OF ROUGH SET THEORY AND ITS APPLICATION

  • Bang, Won-Chul;Bien, Zeung-Nam
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.308-313
    • /
    • 1998
  • In this paper we will discuss a type of inductive learning called learning from examples, whose task is to induce general description of concepts from specific instances of these concepts. In many real life situations, however, new instances can be added to the set of instances. It is first proposed within the framework of rough set theory, for such cases, an algorithm to find minimal set of rules for decision tables without recalculation for overcall set of instances. The method of learning presented here is base don a rough set concept proposed by Pawlak[2][11]. It is shown an algorithm to find minimal set of rules using reduct change theorems giving criteria for minimum recalculation with an illustrative example. Finally, the proposed learning algorithm is applied to fuzzy system to learn sampled I/O data.

  • PDF

Inductive Learning Algorithm using Rough Set Theory (Rough Set 이론을 이용한 연역학습 알고리즘)

  • 방원철;변증남
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.10a
    • /
    • pp.331-337
    • /
    • 1997
  • In this paper we will discuss a type of inductive learning called learning from examples, whose task is to induce general descriptions of concepts from specific instances of these concepts. In many real life situations however new instances can be added to the set of instances. It is first proposed within the framework of rough set theory, for such cases, an algorithm to find minimal set of rules for decision tables without recalculation for overall set of instances. The method of learning presented here is based on a rough set concept proposed by Pawlak[2]. It is shown an algorithm to fund minimal set of rules using reduct change theorems giving criteria for minimum recalculation and an illustrative example.

  • PDF

Approximation to the Probability of Downlink Blocking between cdma2000 1X and WCDMA in Urban Handover Areas (도심 핸드오프 지역에서의 cdma2000 1X와 WCDMA간의 다운링크 블록킹 확률 근사)

  • 박승근;조경록;박덕규
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.14 no.2
    • /
    • pp.89-95
    • /
    • 2003
  • This paper proposes downlink blocking model and approximation equation using lower bound approximation in order to determine the proper guard band between cdma2000 1X and WCDMA in handover areas. The frequency sharing conditions obtained by the model and approximation equation on blocking probability proposed in the paper, are co-site of base station and guard band higher than 1 MHz. Also, the proposed equation is in the form of Q-function. It is an analytical solution overcoming the drawback of recalculation, belonged to Monte-Carlo technique.

Reconstruction of Alignment elements in Railway using GPS (GPS 기법을 이용한 철도 선형제원의 복원)

  • Jeong, Eui-Hwan;Lee, Nam-Soo
    • Proceedings of the KSR Conference
    • /
    • 2003.10b
    • /
    • pp.123-128
    • /
    • 2003
  • The first design elements of horizontal alignment are very important things for improvement or movement in Railway. When the design elements are lost or damaged, it is necessary to recalculation. In this paper, an investigation is made on the method of representation of horizontal alignment as a result of design element using GPS method. The results show that northing calculated about $2\~10$ meters and easting calculated about $0\~7$ meters between calculated and design data in center points.

  • PDF

Response Force Distribution Factors of Members and Mutuality of Response Forces between Members (부재응력분포계수와 부재간 응력 상관성)

  • 김치경;이시은;홍건호
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2004.10a
    • /
    • pp.363-370
    • /
    • 2004
  • This Paper presents the response force distribution factor(RDF) and its application to recalculation of member forces in case of partial changes of structures. Using RDF, the mutuality of response forces between members can be estimated. The reanalysis technique recalculates directly any displacement or member force under consideration in real time without a full reanalysis in spite of local changes in member stiffness or connectivity using RDF. It is expected that RDF and the reanalysis technique can be used to develop efficient analysis techniques for tall buildings.

  • PDF

A study of comparison of position accuracy of territorial basepoints using the united network of territorial basepoints (영해기점단일망을 이용한 영해기점 정확도 비교)

  • 김병국;최정민;조영포;우인제
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2003.04a
    • /
    • pp.75-79
    • /
    • 2003
  • Nowadays, the value of the ocean is growing noticeably throughout the world in accordance with the development of the industrial society and increase in the number of the ocean related economic activities. Therefore the pursuit of more waters has led more disputes amongst many maritime powers in the world. In this study, the territorial basepoints are recalculated methods to develop their accuracies to settle a boundary issue among nations.

  • PDF

An Efficient Updates Processing Using Labeling Scheme In Dynamic Ordered XML Trees (동적 순서 XML 트리에서 레이블링 기법을 이용한 효율적인 수정처리)

  • Lee, Kang-Woo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.12
    • /
    • pp.2219-2225
    • /
    • 2008
  • Labeling schemes which don't consider about frequent update in dynamic XML documents need relabeling process to reflect the changed label information whenever the tree of XML document is update. There is disadvantage of considerable expenses in the dynamic XML document which can occurs frequent update. To solve this problem, we suggest prime number labeling scheme that doesn't need relabeling process. However the prime number labeling scheme does not consider that it needs to update the sibling order of nodes in the XML tree of document. This update process needs much costs because the most of the XML tree of document has to be relabeling and recalculation. In this paper, we propose the prime number labeling scheme with sibling order value that can maintain the sibling order without relabeling or recalculation the XML tree of documents.

Fast Computation of the Visibility Region Using the Spherical Projection Method

  • Chu, Gil-Whoan;Chung, Myung-Jin
    • Transactions on Control, Automation and Systems Engineering
    • /
    • v.4 no.1
    • /
    • pp.92-99
    • /
    • 2002
  • To obtain visual information of a target object, a camera should be placed within the visibility region. As the visibility region is dependent on the relative position of the target object and the surrounding object, the position change of the surrounding object during a task requires recalculation of the visibility region. For a fast computation of the visibility region so as to modify the camera position to be located within the visibility region, we propose a spherical projection method. After being projected onto the sphere the visibility region is represented in $\theta$-$\psi$ spaces of the spherical coordinates. The reduction of calculation space enables a fast modification of the camera location according to the motion of the surrounding objects so that the continuous observation of the target object during the task is possible.