• Title/Summary/Keyword: k-d tree

Search Result 678, Processing Time 0.032 seconds

Analysis on the characteristics for upper bound of [1,2]-domination in trees (트리의 [1,2]-지배 수 상계에 대한 특성 분석)

  • Lee, Hoon;Sohn, Moo Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.12
    • /
    • pp.2243-2251
    • /
    • 2016
  • In this paper, we propose a theoretical model for characterization and upper bounds of [1,2]-domination set of network which has tree structure. In detail, we propose a theoretic model for upper bounds on [1,2]-domination set of a tree network which has some typical constrains. To that purpose, we introduce a graph theory to model and analyze the characteristics of tree structure networks. We assume a node subset D of a graph G=(V,E). We define that D is a [1,2]-dominant set if for any node v in set V which is not an element of a set D is adjacent to a node or two nodes of an element in a set D (that is, $1{\leq}{\mid}N({\upsilon}){\bigcap}D{\mid}{\leq}2$ for every node $v{\in}V-D$). The minimum cardinality of a [1,2]-dominating set of G, which is denoted by ${\gamma}_{[1,2]}(G)$, is called the [1,2]-domination number of G. In this paper, we show new upper bounds and characteristics about the [1,2]-domination number of tree.

Image Coding Using DCT Map and Binary Tree-structured Vector Quantizer (DCT 맵과 이진 트리 구조 벡터 양자화기를 이용한 영상 부호화)

  • Jo, Seong-Hwan;Kim, Eung-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.1
    • /
    • pp.81-91
    • /
    • 1994
  • A DCT map and new cldebook design algorithm based on a two-dimension discrete cosine transform (2D-DCT) is presented for coder of image vector quantizer. We divide the image into smaller subblocks, then, using 2D DCT, separate it into blocks which are hard to code but it bears most of the visual information and easy to code but little visual information, and DCT map is made. According to this map, the significant features of training image are extracted by using the 2D DCT. A codebook is generated by partitioning the training set into a binary tree based on tree-structure. Each training vector at a nonterminal node of the binary tree is directed to one of the two descendants by comparing a single feature associated with that node to a threshold. Compared with the pairwise neighbor (PPN) and classified VQ(CVQ) algorithm, about 'Lenna' and 'Boat' image, the new algorithm results in a reduction in computation time and shows better picture quality with 0.45 dB and 0.33dB differences as to PNN, 0.05dB and 0.1dB differences as to CVQ respectively.

  • PDF

Multi-query Indexing Technique for Efficient Query Processing on Stream Data in Sensor Networks (센서 네트워크에서 스트림 데이터 질의의 효율적인 처리를 위한 다중 질의 색인 기법)

  • Lee, Min-Soo;Kim, Yearn-Jeong;Yoon, Hye-Jung
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.11
    • /
    • pp.1367-1383
    • /
    • 2007
  • A sensor network consists of a network of sensors that can perform computation and also communicate with each other through wireless communication. Some important characteristics of sensor networks are that the network should be self administered and the power efficiency should be greatly considered due to the fact that it uses battery power. In sensor networks, when large amounts of various stream data is produced and multiple queries need to be processed simultaneously, the power efficiency should be maximized. This work proposes a technique to create an index on multiple monitoring queries so that the multi-query processing performance could be increased and the memory and power could be efficiently used. The proposed SMILE tree modifies and combines the ideas of spatial indexing techniques such as k-d trees and R+-trees. The k-d tree can divide the dimensions at each level, while the R+-tree improves the R-tree by dividing the space into a hierarchical manner and reduces the overlapping areas. By applying the SMILE tree on multiple queries and using it on stream data in sensor networks, the response time for finding an indexed query takes in some cases 50% of the time taken for a linear search to find the query.

  • PDF

Change of electrical properties of XLPE with electirical-tree degradation (XLPE의 전기트리 열화에 따른 전기적특성의 변화)

  • Kang, D.S.;Ryoo, H.S.;Sun, J.H.;Choi, S.D.;Lee, H.J.
    • Proceedings of the KIEE Conference
    • /
    • 1999.07e
    • /
    • pp.2136-2138
    • /
    • 1999
  • In this study, we describe the change of electrical properties of XLPE with electrical-tree degradation. XLPE insulation was used as specimen which was cut off from 22.9kV XLPE insulated cable and made in a type of block. The applying voltages are 8kV, 10kV, 12kV and frequency is 60Hz Ogra needles having tip radius of 10$\mu\textrm{m}$ were inserted in blocks. PD quantity and $tan{\delta}$ and DC current were measured from inception of tree to breakdown and their characteristics were analyzed.

  • PDF

An indexing method for moving or static objects in limited region (제한된 영역에서의 이동 및 고정 객체에 대한 색인 기법)

  • Yoon Jong-sun;Park Hyun-ju
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.11a
    • /
    • pp.15-18
    • /
    • 2004
  • 이동 객체를 효율적으로 처리하기 위해 여러 가지 색인 기법들이 제안되었다. 이들 중 3D R-tree와 같은 색인 기법은 시간과 공간을 동일한 차원으로 생각하고 있으나, 실제로 이 두 차원은 단위와 성격이 다르므로 분리해서 처리해야 한다. 특히 본 논문에서 고려하는 환경은 실내와 같은 한정된 공간이므로, 이런 환경에서는 시간과 공간이 같이 성장하는 것이 아니라 공간은 한정되어 있는 반면 시간 차원만이 성장한다. 따라서 R-tree와 1차원(시간차원)의 TB-tree 두 개의 색인을 유지하여, 공간정보와 고정된 객체는 R-tree에, 시간 정보와 이동 객체는 TB-tree에 저장하는 시공간 분리 트리(STS-tree : Separation of Time and Space tree)를 제안한다.

  • PDF

Studies on the Estimation of Annual Tree Volume Growth for the Use as Basic Data on the Plan of Timber Supply and Demand in Korea - The Sub-sampling Oriented - (우리나라 목재수급계획(木材需給計劃)의 기초자료(基礎資料)로 활용(活用)키 위한 연간(年間) 임목성장량(林木成長量)의 추정(推定)에 관한 연구(硏究) - 부차추출법(副次抽出法)을 중심(中心)으로 -)

  • Lee, Jong Lak
    • Journal of Korean Society of Forest Science
    • /
    • v.61 no.1
    • /
    • pp.37-44
    • /
    • 1983
  • This study was to estimate total annual volume growth by the measurement of mean tree growth during the last 10 years. Surveyed Forest stand was the second block (20.80 ha.)of Kyung Hee University Forests located at San 58 and 64, Gaegok-Ri, Gapyung-Yeup, Gapyung-Goon, Kyunggi province in Korea. The stand was mainly composed of uneven-aged Pinus densiflora and the estimation of tree volume was conducted by taking the cores at the D.B.H. of the sample tree which was selected by sub-sampling. The results obtained were as follows; 1) The regression between the diameter (D) and diameter growth ($\hat{I}$) was $\hat{I}=0.5499+0.0101D$. 2) The estimated equation of confidence interval for the diameter growth was $S^2{\hat{I}}=0.00817(0.09538-0.00952D+0.00027D^2$) 3) The equation for estimating tree height (H) from diameter was $H=1.32376D^{0.77958}$ 4) The equation for estimating tree volume from diameter and height $V=0.0000622D^{1.6918}H^{1.1397}$ 5) Total annual tree volume growth was $5.4041m^3/ha$, and ranged from 5.6131 to $5.1984m^3/ha$. 6) Annual growth rate of total tree volume and its error were 8.8% and 3.9%, respectively. The annual volume growth per tree for any districts can be estimated by this method, and the annual volume growth will be successfully predicted. Because of poor forest growing stock in Korea, annual amount of allowable cut should not exceed annual tree volume growth for better forest management. Accordingly, annual amount of allowable cut should be either equal to or less than annual tree volume growth for the balanced establishment between timber supply and demand in Korea. Demand shortage will be substituted with imported timber. Such plans enable Korean Government to develop a better policy of forest resources management.

  • PDF

Tree-Ring Dating of Wood Elements for Jeongjagak of Seonreung, Seoul, Korea (선릉 정자각 목부재의 연륜연대 분석)

  • Son, Byung-Hwa;Han, Sang-Hyo;Park, Won-Kyu
    • Journal of the Korea Furniture Society
    • /
    • v.23 no.2
    • /
    • pp.222-228
    • /
    • 2012
  • Seonreung is the tomb of Seong-jong (A.D. 1457~1494), the 9th king of Joseon Dynasty (1392-1910) and his second queen Jeonghyeon-wanghu (1462~1530). We obtained dendrochronological dates of Jeongjagak (ceremonial hall) of Seonreung. It was known first built in 1495 and reconstructed in October 1706, We obtained tree-ring dates of 20 wood elements (beams, pillars, truss posts, cant strips, roof boards and roof loaders). Their outermost rings were dated from 1630 to 1705. The dates of bark rings in four elements were A.D. 1705 with completed latewoods, indicating that these woods were cut some time between the autumn of 1705 and spring of 1706. The results confirmed the reconstruction date Jeongjagak of Seonreung in 1706, suggesting that there was not so long period for wood drying or storage, i.e., less than 6 months. The dates of outermost rings prior to 1705 in other elements indicated that some outer rings of these elements were removed during wood processing. Tree-ring dating proved that the present Jeongjagak of Seonreung had been well preserved for more than 300 years.

  • PDF

The Study of Distribution Changing and Community Characteristics of Daphniphyllum macropodum (National Monument No. 91) in Naejangsan National Park (내장산국립공원 굴거리나무군락의 군집특성 및 분포 변화 연구)

  • Shin, Jin-Ho;Jeon, Yong-Sam;Son, Ji-Won
    • Journal of the Korean Society of Environmental Restoration Technology
    • /
    • v.19 no.3
    • /
    • pp.45-57
    • /
    • 2016
  • This study was focused on the northernmost limit of the distribution changing of Daphniphyllum macropodum and studied characteristic of plant communities of natural monument No. 91 in Najangsan national park, Korea. The results of this study were as follows : 1. The highest importance percentage(I.P.) value at tree layer in Quercus. mongolica community was Q. mongolica, 37.8%. But the highest value of mean importance percentage(M.I.P.) was D. macropodum, 32.8%. 2. The highest I.P. value at tree layer in Carpinus laxiflora community was C. laxiflora, 47.4%. The highest M.I.P. value was C. laxiflora, 28.8% and M.I.P. value of D. macropodum was 24.0%. 3. The highest I.P. value at tree layer in D. macropodum community was D. macropodum, 55.6%. C. laxiflora and Q. mogolica I.P. value was 14.8% and 6.8%, respectively. The highest M.I.P. value was D. macropodum, 47.9%. Sapium japonicum and C. laxiflora M.I.P. value was 11.4% and 10.7%, respectively. 4. The highest I.P. value at tree layer in Quercus variabilis community was C. laxiflora, 20.8%. Q. variabilis and Acer pseudosieboldianum I.P. value was 15.3% and 12.5%, respectively. The highest M.I.P. value was D. macropodum, 21.5%. It needs to the continuous monitoring of vegetation and importance percentage change in tree layer and subtree layer of D. macropodum. The researching results of D. macropodum distribution, the distribution range of D. macropodum showed expanded more than range of Lim and Oh' result(1999). In other words, it was distributed low density level between Najangsa temple and Byeokryeonam, and distributed in upper Keumsun waterfall and Wonjeok upper valley. D. macropodum was appeared on hiking trails around from Wonjeokam to Bulchulbong. Especially, it was found in this study that D. macropodum was distributed on Seoraebong's north which placed outside area of Naejangsa region. In this study, it was considered that distribution range of D. macropodum was expanded. Also, it is expected to be used as a result of the field study of changing distribution study of broad leaved evergreen forest due to global warming.

A Decision Tree Approach for Identifying Defective Products in the Manufacturing Process

  • Choi, Sungsu;Battulga, Lkhagvadorj;Nasridinov, Aziz;Yoo, Kwan-Hee
    • International Journal of Contents
    • /
    • v.13 no.2
    • /
    • pp.57-65
    • /
    • 2017
  • Recently, due to the significance of Industry 4.0, the manufacturing industry is developing globally. Conventionally, the manufacturing industry generates a large volume of data that is often related to process, line and products. In this paper, we analyzed causes of defective products in the manufacturing process using the decision tree technique, that is a well-known technique used in data mining. We used data collected from the domestic manufacturing industry that includes Manufacturing Execution System (MES), Point of Production (POP), equipment data accumulated directly in equipment, in-process/external air-conditioning sensors and static electricity. We propose to implement a model using C4.5 decision tree algorithm. Specifically, the proposed decision tree model is modeled based on components of a specific part. We propose to identify the state of products, where the defect occurred and compare it with the generated decision tree model to determine the cause of the defect.

Color Image Encryption Technique Using Quad-tree Decomposition Method (쿼드트리 분할 기술을 이용한 컬러 영상 암호화 기술)

  • Choi, Hyunjun
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.6
    • /
    • pp.625-630
    • /
    • 2016
  • Recently, various types of image contents are being produced, and interest in copyright protection technology is increasing. In this paper, we propose an image encryption technology for color images. This technique divides the image into RGB color components and then performs quad-tree decomposition based on the edge of image. After the quad-tree partitioning, encryption is performed on the selected blocks. Encryption is performed on color components to measure encryption efficiency, and encryption efficiency is measured even after reconstitution into a color image. The encryption efficiency uses a visual measurement method and an objective image quality evaluation method. The PSNR values were measured as 7~10 dB for color difference components and 16~19 dB for color images. The proposed image encryption technology will be used to protect copyright of various digital image contents in the future.