• Title/Summary/Keyword: Mapping error

Search Result 449, Processing Time 0.029 seconds

InSAR-based Glacier Velocity Mapping in the Parlung Zangbo River Basin, Tibetan Plateau, China

  • Ke, Chang-Qing;Lee, Hoonyol;Li, Lan-Yu
    • Korean Journal of Remote Sensing
    • /
    • v.35 no.1
    • /
    • pp.15-28
    • /
    • 2019
  • By applying the method of SAR interferometry to X-band synthetic aperture radar (SAR) image of COSMO-SkyMed, detailed motion patterns of five glaciers in the Parlung Zangbo River basin, Tibetan Plateau, in January 2010 have been derived. The results indicate that flow patterns are generally constrained by the valley geometry and terrain complexity. The maximum of $123.9ma^{-1}$ is observed on glacier No.1 and the minimum of $39.4ma^{-1}$ is found on glacier No.3. The mean values of five glaciers are between 22.9 and $98.2ma^{-1}$. Glaciers No.1, No.2, No.4 and No.5 exhibit high velocities in their upper sections with big slope and low velocities in the lower sections. A moraine lake accelerates the speed of mass exchange leading to a fast flow at the terminal of glacier No.3. These glaciers generally move along the direction of decreased elevation and present a macroscopic illustration of the motion from the northwest to the southeast. The accuracy of DEM and registration conditions of DEM-simulated terrain phases has certain effects on calculations of glacier flow direction and velocity. The error field is relatively fragmented in areas inconsistent with the main flow line of the glaciers, and the shape and uniformity of glacier are directly related to the continuous distribution of flow velocity errors.

A Real Time Traffic Flow Model Based on Deep Learning

  • Zhang, Shuai;Pei, Cai Y.;Liu, Wen Y.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2473-2489
    • /
    • 2022
  • Urban development has brought about the increasing saturation of urban traffic demand, and traffic congestion has become the primary problem in transportation. Roads are in a state of waiting in line or even congestion, which seriously affects people's enthusiasm and efficiency of travel. This paper mainly studies the discrete domain path planning method based on the flow data. Taking the traffic flow data based on the highway network structure as the research object, this paper uses the deep learning theory technology to complete the path weight determination process, optimizes the path planning algorithm, realizes the vehicle path planning application for the expressway, and carries on the deployment operation in the highway company. The path topology is constructed to transform the actual road information into abstract space that the machine can understand. An appropriate data structure is used for storage, and a path topology based on the modeling background of expressway is constructed to realize the mutual mapping between the two. Experiments show that the proposed method can further reduce the interpolation error, and the interpolation error in the case of random missing is smaller than that in the other two missing modes. In order to improve the real-time performance of vehicle path planning, the association features are selected, the path weights are calculated comprehensively, and the traditional path planning algorithm structure is optimized. It is of great significance for the sustainable development of cities.

Performance Analysis on Declustering High-Dimensional Data by GRID Partitioning (그리드 분할에 의한 다차원 데이터 디클러스터링 성능 분석)

  • Kim, Hak-Cheol;Kim, Tae-Wan;Li, Ki-Joune
    • The KIPS Transactions:PartD
    • /
    • v.11D no.5
    • /
    • pp.1011-1020
    • /
    • 2004
  • A lot of work has been done to improve the I/O performance of such a system that store and manage a massive amount of data by distributing them across multiple disks and access them in parallel. Most of the previous work has focused on an efficient mapping from a grid ceil, which is determined bY the interval number of each dimension, to a disk number on the assumption that each dimension is split into disjoint intervals such that entire data space is GRID-like partitioned. However, they have ignored the effects of a GRID partitioning scheme on declustering performance. In this paper, we enhance the performance of mapping function based declustering algorithms by applying a good GRID par-titioning method. For this, we propose an estimation model to count the number of grid cells intersected by a range query and apply a GRID partitioning scheme which minimizes query result size among the possible schemes. While it is common to do binary partition for high-dimensional data, we choose less number of dimensions than needed for binary partition and split several times along that dimensions so that we can reduce the number of grid cells touched by a query. Several experimental results show that the proposed estimation model gives accuracy within 0.5% error ratio regardless of query size and dimension. We can also improve the performance of declustering algorithm based on mapping function, called Kronecker Sequence, which has been known to be the best among the mapping functions for high-dimensional data, up to 23 times by applying an efficient GRID partitioning scheme.

A Feasibility Study for Mapping Using The KOMPSAT-2 Stereo Imagery (아리랑위성 2호 입체영상을 이용한 지도제작 가능성 연구)

  • Lee, Kwang-Jae;Kim, Youn-Soo;Seo, Hyun-Duck
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.15 no.1
    • /
    • pp.197-210
    • /
    • 2012
  • The KOrea Multi-Purpose SATellite(KOMPSAT)-2 has a capability to provide a cross-track stereo imagery using two different orbits for generating various spatial information. However, in order to fully realize the potential of the KOMPSAT-2 stereo imagery in terms of mapping, various tests are necessary. The purpose of this study is to evaluate the possibility of mapping using the KOMPSAT-2 stereo imagery. For this, digital plotting was conducted based on the stereoscopic images. Also the Digital Elevation Model(DEM) and an ortho-image were generated using digital plotting results. An accuracy of digital plotting, DEM, and ortho-image were evaluated by comparing with the existing data. Consequently, we found that horizontal and vertical error of the modeling results based on the Rational Polynomial Coefficient(RPC) was less than 1.5 meters compared with the Global Positioning System(GPS) survey results. The maximum difference of vertical direction between the plotted results in this study and the existing digital map on the scale of 1/5,000 was more than 5 meters according as the topographical characteristics. Although there were some irregular parallax on the images, we realized that it was possible to interpret and plot at least seventy percent of the layer which was required the digital map on the scale of 1/5,000. Also an accuracy of DEM, which was generated based on the digital plotting, was compared with the existing LiDAR DEM. We found that the ortho-images, which were generated using the extracted DEM in this study, sufficiently satisfied with the requirement of the geometric accuracy for an ortho-image map on the scale of 1/5,000.

The Development of a Machine Vision Algorithm for Automation of Pavement Crack Sealing (도로면 크랙실링 자동화를 위한 머신비전 알고리즘의 개발)

  • Yoo Hyun-Seok;Lee Jeong-Ho;Kim Young-Suk;Kim Jung-Ryeol
    • Korean Journal of Construction Engineering and Management
    • /
    • v.5 no.2 s.18
    • /
    • pp.90-105
    • /
    • 2004
  • Machines for crack sealing automation have been continually developed since the early 1990's because of the effectiveness of crack sealing that would be able to improve safety, quality and productivity. It has been considered challenging problem to detect crack network in pavement which includes noise (oil marks, skid marks, previously sealed cracks and inherent noise). Moreover, it is required to develop crack network mapping and modeling algorithm in order to accurately inject sealant along to the middle of cut crack network. The primary objective of this study is to propose machine vision algorithms (digital image processing algorithm and path planning algorithm) for fully automated pavement crack sealing. It is anticipated that the effective use of the proposed machine vision algorithms would be able to reduce error rate in image processing for detecting, mapping and modeling crack network as well as improving quality and productivity compared to existing vision algorithms.

DNA Watermarking Method based on Random Codon Circular Code (랜덤 코돈 원형 부호 기반의 DNA 워터마킹)

  • Lee, Suk-Hwan;Kwon, Seong-Geun;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.3
    • /
    • pp.318-329
    • /
    • 2013
  • This paper proposes a DNA watermarking method for the privacy protection and the prevention of illegal copy. The proposed method allocates codons to random circular angles by using random mapping table and selects triplet codons for embedding target with the help of the Lipschitz regularity value of local modulus maxima of codon circular angles. Then the watermark is embedded into circular angles of triplet codons without changing the codes of amino acids in a DNA. The length and location of target triplet codons depend on the random mapping table for 64 codons that includes start and stop codons. This table is used as the watermark key and can be applied on any codon sequence regardless of the length of sequence. If this table is unknown, it is very difficult to detect the length and location of them for extracting the watermark. We evaluated our method and DNA-crypt watermarking of Heider method on the condition of similar capacity. From evaluation results, we verified that our method has lower base changing rate than DNA-crypt and has lower bit error rate on point mutation and insertions/deletions than DNA-crypt. Furthermore, we verified that the entropy of random mapping table and the locaton of triplet codons is high, meaning that the watermark security has high level.

Performance Analysis Based On Log-Likelihood Ratio in Orthogonal Code Hopping Multiplexing Systems Using Multiple Antennas (다중 안테나를 사용한 직교 부호 도약 다중화 시스템에서 로그 우도비 기반 성능 분석)

  • Jung, Bang-Chul;Sung, Kil-Young;Shin, Won-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.12
    • /
    • pp.2534-2542
    • /
    • 2011
  • In this paper, we show that performance can be improved by using multiple antennas in the conventional orthogonal code hopping multiplexing (OCHM) scheme, which was proposed for accommodating a larger number of users with low channel activities than the number of orthogonal codewords used in code division multiple access (CDMA)-based communication systems through downlink statistical multiplexing. First, we introduce two different types of OCHM systems together with orthogonal codeword allocation strategies, and then derive their mathematical expression for log-likelihood ratio (LLR) values according to the two different schemes. Next, when a turbo encoder based on the LLR computation is used, we evaluate performance on the frame error rate (FER) for the aformentioned OCHM system. For comparison, we also show performance for the existing symbol mapping method using multiple antennas, which was used in 3GPP standards. As a result, it is shown that our OCHM system with multiple antennas based on the proposed orthogonal codeword allocation strategy leads to performance gain over the conventional system---energy required to satisfy a target FER is significantly reduced.

A Method based on Ontology for detecting errors in the Software Design (온톨로지 기반의 소프트웨어 설계에러검출방법)

  • Seo, Jin-Won;Kim, Young-Tae;Kong, Heon-Tag;Lim, Jae-Hyun;Kim, Chi-Su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.10
    • /
    • pp.2676-2683
    • /
    • 2009
  • The objective of this thesis is to improve the quality of a software product based on the enhancement of a software design quality using a better error detecting method. Also, this thesis is based on a software design method called as MOA(Methodology for Object to Agents) which uses an ontology based ODES(A Method based on Ontology for Detecting Errors in the Software Design) model as a common information model. At this thesis, a new format of error detecting method was defined. The method is implemented during a transformation process from UML model to ODES model using a ODES model, a Inter-View Inconsistency Detection technique and a combination of ontologic property of consistency framework and related rules. Transformation process to ODES model includes lexicon analysis and meaning analysis of a software design using of multiple mapping table at algorithm for the generation of ODES model instance.

Fundamental Experiment for the Development of Water Pipeline Locator (상수도관로 위치탐사 장비개발을 위한 기초실험)

  • Park, Sang-Bong;Kim, Jin-Won;Oh, Kyeong-Seok;Kim, Min-Cheol;Koo, Ja-yong
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.30 no.3
    • /
    • pp.253-261
    • /
    • 2016
  • A variety of methods for detecting the location of an underground water pipeline are being used across the world; the current main methods used in South Korea, however, have the problems of low precision and efficiency and the limitations in actual application. On this, this study developed locator capable of detecting the location of a water pipe by the use of an IMU sensor, and technology for using the extended karman filter to correct error in location detection and to plot the location on the coordinate system. This study carried out a tract test and a road test as basic experiments to measure the performance of the developed technology and equipment. As a result of the straight line, circular and ellipse track tests, the 1750 IMU sensor showed the average error of 0.08-0.11%; and thus it was found that the developed locator can detect a location precisely. As a result of the 859.6-m road test, it was found that the error was 0.31 m in case the moving rate of the sensor was 0.3-0.6 m/s; and thus it was judged that the equipment developed by this study can be applied to long-distance water pipes of over 1 km sufficiently. It is planned to evaluate its field applicability in the future through an actual pipe network pilot test, and it is expected that locator capable of detecting the location of a water pipe more precisely will be developed through research for the enhancement of accuracy in the algorithm of location detection.

Comparison and Evaluation on DEM Error by the Resolution of Airborne Laser Scanning Data (항공레이저 측량 자료의 해상도에 따른 DEM 오차 비교평가 연구)

  • Lee, Geun-Sang;Koh, Deuk-Koo;Chae, Hyo-Seok;Shin, Young-Ho
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.6 no.3
    • /
    • pp.33-42
    • /
    • 2003
  • As airborne laser scanning technique is developed with high vertical accuracy recently, there come many studies on DEM(digital elevation model creation, building extraction, flood risk mapping and 3D virtual city modeling. This study applied point comparative method, contour comparative method and digital map with scale 1/5,000 to calculate RMSE of DEM in according to resolution that was constructed using rawdata being acquired by airborne laser scanning. As a result, point comparative method showed lower DEM standard error than contour comparative method, it is a reason that contour comparative method was not carried out detailed grid calculation for point comparative method. Also, digital map with scale 1/5,000 showed higher DEM standard error than point comparative method and contour comparative method in below 25.4m that is average horizontal distance among contour line, and showed similar result with contour comparative method in over 25.4m.

  • PDF