• Title/Summary/Keyword: range data

Search Result 11,574, Processing Time 0.037 seconds

A Fast Map-matching Method using a Laser Range Finder

  • Moon, Jung-Hyun;You, Bum-Jae;Oh, Sang-Rok;Kim, Hag-bae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.38.4-38
    • /
    • 2002
  • We propose a fast map-matching algorithm based on the length and the slope for the sequence of lines extracted from a laser range finder and a map. After finding two feature set from laser data and a map, the position and heading of the mobile robot can be determined exactly.

  • PDF

Privacy-Preserving Parallel Range Query Processing Algorithm Based on Data Filtering in Cloud Computing (클라우드 컴퓨팅에서 프라이버시 보호를 지원하는 데이터 필터링 기반 병렬 영역 질의 처리 알고리즘)

  • Kim, Hyeong Jin;Chang, Jae-Woo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.9
    • /
    • pp.243-250
    • /
    • 2021
  • Recently, with the development of cloud computing, interest in database outsourcing is increasing. However, when the database is outsourced, there is a problem in that the information of the data owner is exposed to internal and external attackers. Therefore, in this paper, we propose a parallel range query processing algorithm that supports privacy protection. The proposed algorithm uses the Paillier encryption system to support data protection, query protection, and access pattern protection. To reduce the operation cost of a checking protocol (SRO) for overlapping regions in the existing algorithm, the efficiency of the SRO protocol is improved through a garbled circuit. The proposed parallel range query processing algorithm is largely composed of two steps. It consists of a parallel kd-tree search step that searches the kd-tree in parallel and safely extracts the data of the leaf node including the query, and a parallel data search step through multiple threads for retrieving the data included in the query area. On the other hand, the proposed algorithm provides high query processing performance through parallelization of secure protocols and index search. We show that the performance of the proposed parallel range query processing algorithm increases in proportion to the number of threads and the proposed algorithm shows performance improvement by about 5 times compared with the existing algorithm.

The relationship between the array invariant-based ranging and the effective range in a weakly range-dependent environment (거리 종속 환경에서의 배열 불변성 기반 거리추정과 상응 거리와의 관계)

  • Donghyeon Kim;Gihoon Byun;Daehwan Kim;Jeasoo Kim
    • The Journal of the Acoustical Society of Korea
    • /
    • v.43 no.4
    • /
    • pp.455-465
    • /
    • 2024
  • In shallow water, the array invariant, known as the effective range estimation method, is developed based on the broadband dispersion characteristics in an ideal waveguide, which can be summarized by the waveguide invariant. It is robust enough to estimate both the array tilt and range simultaneously, even in situations where array tilt exists. Recently, it has been extended to fully consider the angle dependence of the waveguide invariant. However, applying the array invariant in range-dependent environments instead of range-independent environments can lead to range estimation errors due to bathymetry mismatch. In this paper, we interpret such range estimation errors by introducing the concept of effective range. Through numerical simulations and experimental data in a weakly range-dependent environment, we demonstrate the relationship between range estimation errors and effective range.

A Case Study of Sea Bottom Detection Within the Expected Range and Swell Effect Correction for the Noisy High-resolution Air-gun Seismic Data Acquired off Yeosu (잡음이 포함된 여수근해 고해상 에어건 탄성파 탐사자료에 대한 예상 범위에서의 해저면 선정 및 너울영향 보정 사례)

  • Lee, Ho-Young
    • Geophysics and Geophysical Exploration
    • /
    • v.22 no.3
    • /
    • pp.116-131
    • /
    • 2019
  • In order to obtain high-quality high-resolution marine seismic data, the survey needs to be carried out at very low-sea condition. However, the survey is often performed with a slight wave, which degrades the quality of data. In this case, it is possible to improve the quality of seismic data by detecting the exact location of the sea bottom signal and eliminating the influence of waves or swells automatically during data processing. However, if noise is included or the sea bottom signal is weakened due to sea waves, sea bottom detection errors are likely to occur. In this study, we applied a method reducing such errors by estimating the sea bottom location, setting a narrow detection range and detecting the sea bottom location within this range. The expected location of the sea bottom was calculated using previously detected sea bottom locations for each channel of multi-channel data. The expected location calculated in each channel is also compared and verified with expected locations of other channels in a shot gather. As a result of applying this method to the noisy 8-channel high-resolution air-gun seismic data acquired off Yeosu, the errors in selecting the strong noise before sea bottom or the strong subsurface reflected signal after the sea bottom signal are remarkably reduced and it is possible to produce the high-quality seismic section with the correction of ~ 2.5 m swell effect.

A Statistical Correction of Point Time Series Data of the NCAM-LAMP Medium-range Prediction System Using Support Vector Machine (서포트 벡터 머신을 이용한 NCAM-LAMP 고해상도 중기예측시스템 지점 시계열 자료의 통계적 보정)

  • Kwon, Su-Young;Lee, Seung-Jae;Kim, Man-Il
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.23 no.4
    • /
    • pp.415-423
    • /
    • 2021
  • Recently, an R-based point time series data validation system has been established for the statistical post processing and improvement of the National Center for AgroMeteorology-Land Atmosphere Modeling Package (NCAM-LAMP) medium-range prediction data. The time series verification system was used to compare the NCAM-LAMP with the AWS observations and GDAPS medium-range prediction model data operated by Korea Meteorological Administration. For this comparison, the model latitude and longitude data closest to the observation station were extracted and a total of nine points were selected. For each point, the characteristics of the model prediction error were obtained by comparing the daily average of the previous prediction data of air temperature, wind speed, and hourly precipitation, and then we tried to improve the next prediction data using Support Vector Machine( SVM) method. For three months from August to October 2017, the SVM method was used to calibrate the predicted time series data for each run. It was found that The SVM-based correction was promising and encouraging for wind speed and precipitation variables than for temperature variable. The correction effect was small in August but considerably increased in September and October. These results indicate that the SVM method can contribute to mitigate the gradual degradation of medium-range predictability as the model boundary data flows into the model interior.

On Shape Recovery of 3D Object from Multiple Range Images (시점이 다른 다수의 거리 영상으로부터 3차원 물체의 형상 복원)

  • Kim, Jun-Young;Yun, Il-Dong;Lee, Sang-Uk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.1
    • /
    • pp.1-15
    • /
    • 2000
  • To reconstruct 3- D shape, It is a common strategy to acquire multiple range Images from different viewpoints and integrate them into a common coordinates In this paper, we particularly focus on the registration and integration processes for combining all range Images into one surface model. For the registration, we propose the 2-step registration algorithm, which consists of 2 steps the rough registration step using all data points and the fine registration step using the high-curved data points For the integration, we propose a new algorithm, referred to as ‘multi-registration’ technique, to alleviate the error accumulation problem, which occurs during applying the pair-wise registration to each range image sequentially, in order to transform them into a common reference frame Intensive experiments are performed on the various real range data In experiments, all range images were registered within 1 minutes on Pentium 150MHz PC The results show that the proposed algorithms registrate and integrate multiple range Images within a tolerable error bound in a reasonable computation time, and the total error between all range Images are equalized with our proposed algorithms.

  • PDF

A Study of Measurement on Range of Joint Mobility for Middle-Aged Korean Adults (한국 중장년층의 동작범위에 관한 연구)

  • Yun, Hun-Yong;Lee, Sang-Do;Lee, Dong-Chun
    • Journal of the Ergonomics Society of Korea
    • /
    • v.21 no.2
    • /
    • pp.35-46
    • /
    • 2002
  • This study was performed to determine the voluntary range of joint mobility for middle-aged Korean adults. One hundred and eighty-eight subjects(99 males and 89 females) at the age range of 40 to 60 participated for this study. Thirty body movements at various joints were conducted to measure the range of joint mobility. Subjects were grouped by Rohrer's into four based on 25th percentile. The data were analyzed to see the differences of range of joint mobility between sexes and Rohrer's index groups. The results of this study and previous studies were compared to see the differences of range of joint mobility due to the aging. Results of this study indicate that females are generally more flexible than males. Significant differences were found to exist in fourteen movement between sexes and in ten movements, females have larger range of joint mobility than males. There were no significant differences in range of joint mobility may have a tendency to decrease with ages. The results of this study provide important information in dynamic dimensions for middle-aged Korean and can be used to design the various and work places for the middle-aged.

A vision system for autonomous material handling by static and dynamic range finding (정적 및 동적 range 검출에 의한 원료 처리 자동화용 vision 시스템)

  • 안현식;최진태;이관희;신기태;하영호
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.10
    • /
    • pp.59-70
    • /
    • 1997
  • Until now, considerable progress has been made in the application of range finding techanique performing direct 3-D measurement from the object. However, ther are few use of the method in the area of the application of material handing. We present a range finding vision system consisting of static and dynamic range finders to automate a reclaimer used for material handling. A static range finder detects range data of the front part of the piles of material, and a height map is obtained from the proposed image processing algorithm. The height map is used to calculate the optimal job path as features for required information for material handling function. A dynamic range finder attached on the side of the arm of the reclaimer detects the change of the local properties of the material with the handling function, which is used for avoiding collision and detecting the ending point for changing direction. the developed vision systm was applied to a 1/20 simulator and the results of test show that it is appropriate to use for automating the material handling.

  • PDF

Fast-convergence trilinear decomposition algorithm for angle and range estimation in FDA-MIMO radar

  • Wang, Cheng;Zheng, Wang;Li, Jianfeng;Gong, Pan;Li, Zheng
    • ETRI Journal
    • /
    • v.43 no.1
    • /
    • pp.120-132
    • /
    • 2021
  • A frequency diverse array (FDA) multiple-input multiple-output (MIMO) radar employs a small frequency increment across transmit elements to produce an angle-range-dependent beampattern for target angle and range detection. The joint angle and range estimation problem is a trilinear model. The traditional trilinear alternating least square (TALS) algorithm involves high computational load due to excessive iterations. We propose a fast-convergence trilinear decomposition (FC-TD) algorithm to jointly estimate FDA-MIMO radar target angle and range. We first use a propagator method to obtain coarse angle and range estimates in the data domain. Next, the coarse estimates are used as initialized parameters instead of the traditional TALS algorithm random initialization to reduce iterations and accelerate convergence. Finally, fine angle and range estimates are derived and automatically paired. Compared to the traditional TALS algorithm, the proposed FC-TD algorithm has lower computational complexity with no estimation performance degradation. Moreover, Cramer-Rao bounds are presented and simulation results are provided to validate the proposed FC-TD algorithm effectiveness.

The Hedging Effectiveness of Shrimp Futures Contract and Futures Contract Design (새우 선물계약의 헤징유효성과 선물계약 설계)

  • Kang, Seok-Kyu
    • The Journal of Fisheries Business Administration
    • /
    • v.41 no.1
    • /
    • pp.73-91
    • /
    • 2010
  • The objective of this study is to examine the hedging effectiveness of shrimp futures market. Hedging effectiveness is measured by OLS model based on rolling windows. Analysis data are obtained from Kansai Commodities Exchange in Osaka and are weekly data of frozen shrimp futures and cash prices in the time period from July 9, 2003, to May 9, 2007. The empirical results are summarized as follows:First, the correlation coefficients between the nearby futures price changes and the cash(16/20) price changes are very low and have range from 0.141 to 0.208 values. Second, the minimum variance hedge ratios($\hat{\beta}$) are all statistically different from 0 at the 5% level and range from 0.0477 to 0.5039 values excluding Indian shrimps(26/30). Ex post hedging effectiveness, as measured by the coefficient of determination, $R^2$, is relatively very low and range from a low of 0.4% for west-south Indian shrimps(26/30) to a high 4.3% for Vietnamese shrimps(16/20). Third, ex ante hedging effectiveness, as measured by out-of-sample hedging period, is also very low and range from a low of -4.4% for west-south Indian shrimps(21/25) to a high of 3.4% for Vietnamese shrimps(16/20). This indicates that the shrimp futures market doesn't behave as risk management instrument of shrimp spot.