• Title/Summary/Keyword: Tree-Reconstruction

Search Result 108, Processing Time 0.032 seconds

Climate and Growth Relationship in Blue Pine (Pinus wallichiana) from the Western Himalaya, India (인도 서히말리아산 블루파인(Pinus wallichiana)의 연륜생장과 기후와의 관계)

  • Yadav, R. R.;Amalava, B.
    • The Korean Journal of Ecology
    • /
    • v.20 no.2
    • /
    • pp.95-102
    • /
    • 1997
  • Ring width chronologies of blue pine (pinus wallichiana) from two mesic sites, Kanasar(2, 400 m) and Gangotri(3, 000 m), in the western Himalayan region. India were developed to understand tree growth-climate relationship and its applicability in proxy climate studies. The resoponse function analyses of the two chronologies show that the site conditions play an important role in modulating the effect of climatic variables on tree growth. Winter temperature, prior to the growth year, has been found to play positive influence on blue pine growth at both sites. Summer temperature also has very similar response except for June and August. June temperature has negative influence at the lower in contrary to at the higher site. Low August temperature favors tree growth to precipitation has been found to vary which could be due to different precipitation regime at the two sites. Winter precipitation is important for tree growth at the higher, whereas summer at the lower sits. The present study suggests that the tree ring materials of blue pine from the temperate Himalayan regions could be used to develop chronologies for the reconstruction of seasonal climatic variables.

  • PDF

Dendrochronological Dating for the Gwanghanru Pavilion, Namwon, Korea (남원 광한루 목부재의 연륜연대 분석)

  • Park, Won-kyu;Kim, Yo-jung;Han, Sang-hyo
    • Korean Journal of Heritage: History & Science
    • /
    • v.47 no.1
    • /
    • pp.152-163
    • /
    • 2014
  • In this study, Gwanghanru Pavilion (Namwon-si, Cheonbuk Province) was dated by tree rings of pines (Pinus densiflora Sieb. et Zucc., 'sonamu' in Korean). The present Gwanghanru Pavilion is composed of three parts: main, wing and entrance parts. The main part is known to have been built in 1626 and the entrance hall in 1879, but the date of construction of the wing part is still unknown. We dated a total of 55 wood samples which were replaced during the repair process in 2001~2002. Tree-ring dates indicated that both main and wing parts were built in 1626. Tree rings also revealed that the entrance hall was constructed in 1880~1881, and both main and wing parts were heavily repaired together while appending the entrance hall. In conclusion, dendrochronology, i.e., tree-ring dating, was a useful and accurate method to identify the critical dates-such as the dates of original construction, reconstruction, repairs and extensions-for the history of Korean traditional buildings.

Design of Lazy Classifier based on Fuzzy k-Nearest Neighbors and Reconstruction Error (퍼지 k-Nearest Neighbors 와 Reconstruction Error 기반 Lazy Classifier 설계)

  • Roh, Seok-Beom;Ahn, Tae-Chon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.1
    • /
    • pp.101-108
    • /
    • 2010
  • In this paper, we proposed a new lazy classifier with fuzzy k-nearest neighbors approach and feature selection which is based on reconstruction error. Reconstruction error is the performance index for locally linear reconstruction. When a new query point is given, fuzzy k-nearest neighbors approach defines the local area where the local classifier is available and assigns the weighting values to the data patterns which are involved within the local area. After defining the local area and assigning the weighting value, the feature selection is carried out to reduce the dimension of the feature space. When some features are selected in terms of the reconstruction error, the local classifier which is a sort of polynomial is developed using weighted least square estimation. In addition, the experimental application covers a comparative analysis including several previously commonly encountered methods such as standard neural networks, support vector machine, linear discriminant analysis, and C4.5 trees.

Sparse Signal Recovery Using A Tree Search (트리검색 기법을 이용한 희소신호 복원기법)

  • Lee, Jaeseok;Shim, Byonghyo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.12
    • /
    • pp.756-763
    • /
    • 2014
  • In this paper, we introduce a new sparse signal recovery algorithm referred to as the matching pursuit with greedy tree search (GTMP). The tree search in our proposed method is implemented to minimize the cost function to improve the recovery performance of sparse signals. In addition, a pruning strategy is employed to each node of the tree for efficient implementation. In our performance guarantee analysis, we provide the condition that ensures the exact identification of the nonzero locations. Through empirical simulations, we show that GTMP is effective for sparse signal reconstruction and outperforms conventional sparse recovery algorithms.

An efficient search of binary tree for huffman decoding based on numeric interpretation of codewords

  • Kim, Byeong-Il;Chang, Tae-Gyu;Jeong, Jong-Hoon
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.133-136
    • /
    • 2002
  • This paper presents a new method of Huffman decoding which gives a significant improvement of processing efficiency based on the reconstruction of an efficient one-dimensional array data structure incorporating the numeric interpretation of the accrued codewords in the binary tree. In the Proposed search method, the branching address is directly obtained by the arithematic operation with the incoming digit value eliminating the compare instruction needed in the binary tree search. The proposed search method gives 30% of improved Processing efficiency and the memory space of the reconstructed Huffman table is reduced to one third compared to the ordinary ‘compare and jump’ based binary tree. The experimental result with the six MPEG-2 AAC test files also shows about 198% of performance improvement compared to those of the widely used conventional sequential search method.

  • PDF

Tree-Ring Dating of Wood Elements Used for the Jeongjagak and Bigak Buildings of Kangrung (King Myoungjong's Tomb) (강릉 (명종) 정자각과 비각 목부재의 연륜연대 분석)

  • Lee, Kwang-Hee;Kim, Sang-Kyu;Park, Won-Kyu
    • Journal of the Korea Furniture Society
    • /
    • v.19 no.3
    • /
    • pp.219-228
    • /
    • 2008
  • Kangrung is a royal tomb for King Myoungjong and his wife, Queen Jeongsun. According the record, Myoungjong died on 1567 and was buried in the present location at Gongrungdong, Nowonku, Seoul. During the 2006 repair for the Jeongjagak (memorial hall) and Bigak (tombs' house) of Kangrung, a dendrochronological analysis had been conducted. We took 79 samples, 74 from Jeongjagak and 5 from Bigak, respectively, for dating. There were three major cutting groups, i.e., 1692-1694, 1737, and 1859-1861. The first group was well matched with the date of reconstruction, which was written on the 'Sangryangmun', a formal record about building activities. The tree-ring results confirmed that the present buildings of Jeongjagak and Bigak in Kangrung were reconstructed in 1695. The second and third cutting groups indicated major repairs in Bigak.

  • PDF

Sparse Signal Recovery via a Pruning-based Tree Search (트리제거 기법을 이용한 희소신호 복원)

  • Kim, Sangtae;Shim, Byonghyo
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2015.11a
    • /
    • pp.1-3
    • /
    • 2015
  • In this paper, we propose a sparse signal reconstruction method referred to as the matching pursuit with a pruning-based tree search (PTS-MP). Two key ingredients of PTS-MP are the pre-selection to put a restriction on columns of the sensing matrix to be investigated and the tree pruning to eliminate unpromising paths from the search tree. In our simulations, we confirm that PTS-MP is effective in recovering sparse signals and outperforms conventional sparse recovery algorithms.

  • PDF

3D Shape Reconstruction based on Superquadrics and Single Z-buffer CSG Rendering (Superquadric과 Z-버퍼 CSG 렌더링 기반의 3차원 형상 모델링)

  • Kim, Tae-Eun
    • Journal of Digital Contents Society
    • /
    • v.9 no.2
    • /
    • pp.363-369
    • /
    • 2008
  • In this paper, we have proposed 3D shape reconstruction using superquadrics and single z-buffer Constructive Solid Geometry (CSG) rendering algorithm. Superquadrics can obtain various 3D model using 11 parameters and both superquadrics and deformed-superquadrics play a role of primitives which are consisted of CSG tree. In addition, we defined some effective equations using z-buffer algorithm and stencil buffer for synthesizing 3D model. Using this proposed algorithm, we need not to consider the coordinate of each 3D model because we simply compare the depth value of 3D model.

  • PDF

Reconstruction of May Precipitation (317 Years: AD. 1682~1998) using Tree Rings of Pinus densiflora S. et. Z. in Western Sorak Mt. (설악산 서부 소나무의 연륜을 이용한 317년 (A.D. 1682~1998)간의 5월 강수량 복원)

  • 서정욱;박원규
    • The Korean Journal of Quaternary Research
    • /
    • v.16 no.1
    • /
    • pp.29-36
    • /
    • 2002
  • May rainfall (317 years: A.D. 1682~A.D. 1998) of western region of Sorak Mt. was reconstructed using a tree-ring chronology of Pinus densiflora 5. et 2. The reconstruction indicated that the 1690~1710년, 1745~1755 and 1847~1853 periods were the least May rainfalls, whereas 1715~1733 and 1835~1845 the greatest ones. The wet period of 1835~1845 was agreed with that found in Songni Mt., central Korea. This wet epoch seems to be widely spreaded in Korea. There were found no significant differences among the means of the 18th, 19th and 20th century's May rainfalls. The major periodicity of May rainfalls was 2~4 years.

  • PDF

A Study on the Wavelet Based Algorithm for Lossless and Lossy Image Compression (무손실.손실 영상 압축을 위한 웨이브릿 기반 알고리즘에 관한 연구)

  • An, Chong-Koo;Chu, Hyung-Suk
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.55 no.3
    • /
    • pp.124-130
    • /
    • 2006
  • A wavelet-based image compression system allowing both lossless and lossy image compression is proposed in this paper. The proposed algorithm consists of the two stages. The first stage uses the wavelet packet transform and the quad-tree coding scheme for the lossy compression. In the second stage, the residue image taken between the original image and the lossy reconstruction image is coded for the lossless image compression by using the integer wavelet transform and the context based predictive technique with feedback error. The proposed wavelet-based algorithm, allowing an optional lossless reconstruction of a given image, transmits progressively image materials and chooses an appropriate wavelet filter in each stage. The lossy compression result of the proposed algorithm improves up to the maximum 1 dB PSNR performance of the high frequency image, compared to that of JPEG-2000 algorithm and that of S+P algorithm. In addition, the lossless compression result of the proposed algorithm improves up to the maximum 0.39 compression rates of the high frequency image, compared to that of the existing algorithm.