• Title/Summary/Keyword: interpolation method

Search Result 1,888, Processing Time 0.028 seconds

Spatial Estimation of the Site Index for Pinus densiplora using Kriging (크리깅을 이용한 소나무림 지위지수 공간분포 추정)

  • Kim, Kyoung-Min;Park, Key-Ho
    • Journal of Korean Society of Forest Science
    • /
    • v.102 no.4
    • /
    • pp.467-476
    • /
    • 2013
  • Site index information given from forest site map only exist in the sampled locations. In this study, site index for unsampled locations were estimated using kriging interpolation method which can interpolate values between point samples to generate a continuous surface. Site index of Pinus densiplora in Danyang area were calculated using Chapman-Richards model by plot unit. Then site index for unsampled locations were interpolated by theoretical variogram models and ordinary kriging. Also in order to assess parameter selection, cross-validation was performed by calculating mean error (ME), average standard error (ASE) and root mean square error (RMSE). In result, gaussian model was excluded because of the biggest relative nugget (37.40%). Then spherical model (16.80%) and exponential model (8.77%) were selected. Site index estimates of Pinus densiplora throughout the entire area in Danyang showed 4.39~19.53 based on exponential model, and 4.54~19.23 based on spherical model. By cross-validation, RMSE had almost no difference. But ME and ASE from spherical model were slightly lower than exponential model. Therefore site index prediction map from spherical model were finally selected. Average site index from site prediction map was 10.78. It can be expected that regional variance can be considered by site index prediction map in order to estimate forest biomass which has big spatial variance and eventually it is helpful to improve an accuracy of forest carbon estimation.

Development of Information Technology Infrastructures through Construction of Big Data Platform for Road Driving Environment Analysis (도로 주행환경 분석을 위한 빅데이터 플랫폼 구축 정보기술 인프라 개발)

  • Jung, In-taek;Chong, Kyu-soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.3
    • /
    • pp.669-678
    • /
    • 2018
  • This study developed information technology infrastructures for building a driving environment analysis platform using various big data, such as vehicle sensing data, public data, etc. First, a small platform server with a parallel structure for big data distribution processing was developed with H/W technology. Next, programs for big data collection/storage, processing/analysis, and information visualization were developed with S/W technology. The collection S/W was developed as a collection interface using Kafka, Flume, and Sqoop. The storage S/W was developed to be divided into a Hadoop distributed file system and Cassandra DB according to the utilization of data. Processing S/W was developed for spatial unit matching and time interval interpolation/aggregation of the collected data by applying the grid index method. An analysis S/W was developed as an analytical tool based on the Zeppelin notebook for the application and evaluation of a development algorithm. Finally, Information Visualization S/W was developed as a Web GIS engine program for providing various driving environment information and visualization. As a result of the performance evaluation, the number of executors, the optimal memory capacity, and number of cores for the development server were derived, and the computation performance was superior to that of the other cloud computing.

Prestack Depth Migration for Gas Hydrate Seismic Data of the East Sea (동해 가스 하이드레이트 탄성파자료의 중합전 심도 구조보정)

  • Jang, Seong-Hyung;Suh, Sang-Yong;Go, Gin-Seok
    • Economic and Environmental Geology
    • /
    • v.39 no.6 s.181
    • /
    • pp.711-717
    • /
    • 2006
  • In order to study gas hydrate, potential future energy resources, Korea Institute of Geoscience and Mineral Resources has conducted seismic reflection survey in the East Sea since 1997. one of evidence for presence of gas hydrate in seismic reflection data is a bottom simulating reflector (BSR). The BSR occurs at the interface between overlaying higher velocity, hydrate-bearing sediment and underlying lower velocity, free gas-bearing sediment. That is often characterized by large reflection coefficient and reflection polarity reverse to that of seafloor reflection. In order to apply depth migration to seismic reflection data. we need high performance computers and a parallelizing technique because of huge data volume and computation. Phase shift plus interpolation (PSPI) is a useful method for migration due to less computing time and computational efficiency. PSPI is intrinsically parallelizing characteristic in the frequency domain. We conducted conventional data processing for the gas hydrate data of the Ease Sea and then applied prestack depth migration using message-passing-interface PSPI (MPI_PSPI) that was parallelized by MPI local-area-multi-computer (MPI_LAM). Velocity model was made using the stack velocities after we had picked horizons on the stack image with in-house processing tool, Geobit. We could find the BSRs on the migrated stack section were about at SP 3555-4162 and two way travel time around 2,950 ms in time domain. In depth domain such BSRs appear at 6-17 km distance and 2.1 km depth from the seafloor. Since energy concentrated subsurface was well imaged we have to choose acquisition parameters suited for transmitting seismic energy to target area.

An Analysis of Forest Fire Occurrence Hazards by Changing Temperature and Humidity of Ten-day Intervals for 30 Years in Spring (우리나라의 봄철 순평년 온습도 변화에 따른 산불발생위험성 분석)

  • Won, Myoung-Soo;Koo, Kyo-Sang;Lee, Myung-Bo
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.8 no.4
    • /
    • pp.250-259
    • /
    • 2006
  • This study looks into forest fire occurrence hazards according to the change of temperature and humidity over thirty years at interval of ten days. We used data from the forest fire inventory from 1995 to 2004 and weather data such as average temperature and relative humidity for 30 years from 1971 to 2000. These data were expressed as a database with ten-day intervals for 76 weather stations. Forest fire hazards occurred in the spring season from the end of March to the middle of April. For the first step, the primitive surface of temperature and humidity was interpolated by IDW (the standard interpolation method). These thematic maps have a 1 km by 1 km grid spacing resolution. Next, we executed a simple regression analysis after extracting forest fire frequency, temperature and humidity values from 76 weather stations. The results produced a coefficient of determination ($R^2$) ranging from 0.4 to 0.6. Moreover, the estimation of forest fire occurrence hazards during early April was very high at Gyeongbuk Interior, Chungcheong Interior and part of Gangwon. The range of temperature and humidity having an influence on forest fire occurrence was as follows: average temperature and relative humidity in early April was $9-12^{\circ}C$ and 61-65%. At the end of March, temperature was $6-10^{\circ}C$, humidity 62-67%, and temperature was $11-14^{\circ}C$ and humidity 60-67% in the middle of April.

Construction of Ionospheric TEC Retrieval System Using Korean GNSS Network (국내 GNSS 관측 자료를 이용한 전리권 총전자밀도 산출 시스템 구축)

  • Lee, Jeong-Deok;Shin, Daeyun;Kim, Dohyeong;Oh, Seung Jun
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.3
    • /
    • pp.30-34
    • /
    • 2012
  • National Meteorological Satellite Center(NMSC) of Korea Meteorological Administration(KMA) has launched to implement the application development to get prepared for the space weather operation since 2010. As a action of KMA's space weather work, NMSC constructed Global Navigation Satellite System(GNSS) application system for meteorology and space weather. We will introduce NMSC's space weather application system which derives regional TEC(Total Electron Content) in near real time using nation-wide GNSS network data. First, We constructed system for collecting GNSS data, which is currently collecting about 80 stations operated by agencies like NGII(National Geographic Information Institute), Central Office of DGPS(Differential GPS), and KASI(Korea Astronomy and Space Science) including KMA's own data of 2 stations. In order to retreive regional TEC over Korean peninsular, we build up the automatic processes running every 1-hour. In these processes, firstly, GNSS data of every stations with 24 hours time window are processed to derive DCBs(Differential Code Biases) of each GNSS station and TEC values on every ionosphere piercing point(IPP). Then we made gridded regional TEC map with resolution of 0.25 degree from 31N, 121E to 41N, 135E by combination of all station results within 30 minutes window with assumption that TEC of a given point during a given 30 minutes window would have a constant value. The grid points without TEC value are interpolated using Barnes objective analysis. We presentour regional TEC maps, which can describe better on the status of ionosphere over Korean peninsular compared to IGS TEC maps.

Log-Polar Image Watermarking based on Invariant Centroid as Template (불변의 무게중심을 템플릿으로 이용한 대수-극 좌표계 영상 워터마킹 기법)

  • 김범수;유광훈;김우섭;곽동민;송영철;최재각;박길흠
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.3
    • /
    • pp.341-351
    • /
    • 2003
  • Digital image watermarking is the method that can protect the copyright of the image by embedding copyright information, which is called watermark. Watermarking must have robustness to intentional or unintentional data changing, called attack. The conventional watermarking schemes are robust to waveform attacks such as image compression, filtering etc. However, they are vulnerable to geometrical attacks such as rotation, scaling, translation, and cropping. Accordingly, this paper proposes new watermarking scheme that is robust to geometrical attacks by using invariant centroid. Invariant centroid is the gravity center of a central area in a gray scale image that remains unchanged even when the image is attacked by RST including cropping and proposed scheme uses invariant centroids of original and inverted image as the template. To make geometrically invariant domain, template and angle compensated Log -Polar Map(LPM) is used. Then Discrete Cosine Transform(DCT) is performed and the watermark is embedded into the DCT coefficients. Futhermore, to prevent a watermarked image from degrading due to interpolation during coordinate system conversion, only the image of the watermark signal is extracted and added to the original image. Experimental results show that the proposed scheme is especially robust to RST attacks including cropping.

Implementation of Web-based Remote Multi-View 3D Imaging Communication System Using Adaptive Disparity Estimation Scheme (적응적 시차 추정기법을 이용한 웹 기반의 원격 다시점 3D 화상 통신 시스템의 구현)

  • Ko Jung-Hwan;Kim Eun-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.1C
    • /
    • pp.55-64
    • /
    • 2006
  • In this paper, a new web-based remote 3D imaging communication system employing an adaptive matching algorithm is suggested. In the proposed method, feature values are extracted from the stereo image pair through estimation of the disparity and similarities between each pixel of the stereo image. And then, the matching window size for disparity estimation is adaptively selected depending on the magnitude of this feature value. Finally, the detected disparity map and the left image is transmitted into the client region through the network channel. And then, in the client region, right image is reconstructed and intermediate views be synthesized by a linear combination of the left and right images using interpolation in real-time. From some experiments on web based-transmission in real-time and synthesis of the intermediate views by using two kinds of stereo images of 'Joo' & 'Hoon' captured by real camera, it is analyzed that PSNRs of the intermediate views reconstructed by using the proposed transmission scheme are highly measured by 30dB for 'Joo', 27dB for 'Hoon' and the delay time required to obtain the intermediate image of 4 view is also kept to be very fast value of 67.2ms on average, respectively.

Performance Analysis of a Statistical Packet Voice/Data Multiplexer (통계적 패킷 음성 / 데이터 다중화기의 성능 해석)

  • 신병철;은종관
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.11 no.3
    • /
    • pp.179-196
    • /
    • 1986
  • In this paper, the peformance of a statistical packet voice/data multiplexer is studied. In ths study we assume that in the packet voice/data multiplexer two separate finite queues are used for voice and data traffics, and that voice traffic gets priority over data. For the performance analysis we divide the output link of the multiplexer into a sequence of time slots. The voice signal is modeled as an (M+1) - state Markov process, M being the packet generation period in slots. As for the data traffic, it is modeled by a simple Poisson process. In our discrete time domain analysis, the queueing behavior of voice traffic is little affected by the data traffic since voice signal has priority over data. Therefore, we first analyze the queueing behavior of voice traffic, and then using the result, we study the queueing behavior of data traffic. For the packet voice multiplexer, both inpur state and voice buffer occupancy are formulated by a two-dimensional Markov chain. For the integrated voice/data multiplexer we use a three-dimensional Markov chain that represents the input voice state and the buffer occupancies of voice and data. With these models, the numerical results for the performance have been obtained by the Gauss-Seidel iteration method. The analytical results have been verified by computer simylation. From the results we have found that there exist tradeoffs among the number of voice users, output link capacity, voic queue size and overflow probability for the voice traffic, and also exist tradeoffs among traffic load, data queue size and oveflow probability for the data traffic. Also, there exists a tradeoff between the performance of voice and data traffics for given inpur traffics and link capacity. In addition, it has been found that the average queueing delay of data traffic is longer than the maximum buffer size, when the gain of time assignment speech interpolation(TASI) is more than two and the number of voice users is small.

  • PDF

Study on the procedure to obtain an attainable speed in pack ice

  • Kim, Hyun Soo;Jeong, Seong-Yeob;Woo, Sun-Hong;Han, Donghwa
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.10 no.4
    • /
    • pp.491-498
    • /
    • 2018
  • The cost evaluation for voyage route planning in an ice-covered sea is one of the major topics among ship owners. Information of the ice properties, such as ice type, concentration of ice, ice thickness, strength of ice, and speed-power relation under ice conditions are important for determining the optimal route in ice and low operational cost perspective. To determine achievable speed at any designated pack ice condition, a model test of resistance, self-propulsion, and overload test in ice and ice-free water were carried out in a KRISO ice tank and towing tank. The available net thrust for ice and an estimation of the ice resistance under any pack ice condition were also performed by I-RES. The in-house code called 'I-RES', which is an ice resistance estimation tool that applies an empirical formula, was modified for the pack ice module in this study. Careful observations of underwater videos of the ice model test made it possible to understand the physical phenomena of underneath of the hull bottom surface and determine the coverage of buoyancy. The clearing resistance of ice can be calculated by subtracting the buoyance and open water resistance form the pre-sawn ice resistance. The model test results in pack ice were compared with the calculation results to obtain a correlation factor among the pack ice resistance, ice concentration, and ship speed. The resulting correlation factors were applied to the calculation results to determine the pack ice resistance under any pack ice condition. The pack ice resistance under the arbitrary pack ice condition could be estimated because software I-RES could control all the ice properties. The available net thrust in ice, which is the over thrust that overcomes the pack ice resistance, will change the speed of a ship according to the bollard pull test results and thruster characteristics (engine & propulsion combination). The attainable speed at a certain ice concentration of pack ice was determined using the interpolation method. This paper reports a procedure to determine the attainable speed in pack ice and the sample calculation using the Araon vessel was performed to confirm the entire process. A more detailed description of the determination of the attainable speed is described. The attainable speed in 1.0 m, 90% pack ice and 540 kPa strength was 13.3 knots.

An Efficient Dead Pixel Detection Algorithm Implementation for CMOS Image Sensor (CMOS 이미지 센서에서의 효율적인 불량화소 검출을 위한 알고리듬 및 하드웨어 설계)

  • An, Jee-Hoon;Shin, Seung-Gi;Lee, Won-Jae;Kim, Jae-Seok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.4
    • /
    • pp.55-62
    • /
    • 2007
  • This paper proposes a defective pixel detection algorithm and its hardware structure for CCD/CMOS image sensor. In previous algorithms, the characteristics of image have not been considered. Also, some algorithms need quite a time to detect defective pixels. In order to make up for those disadvantages, the proposed defective pixel detection method detects defective pixels efficiently by considering the edges in the image and verifies them using several frames while checking scene-changes. Whenever scene-change is occurred, potentially defective pixels are checked and confirmed whether it is defective or not. Test results showed that the correct detection rate in a frame was increased 6% and the defective pixel verification time was decreased 60%. The proposed algorithm was implemented with verilog HDL. The edge indicator in color interpolation block was reused. Total logic gate count was 5.4k using 0.25um CMOS standard cell library.