• Title/Summary/Keyword: Range estimation

Search Result 2,004, Processing Time 0.025 seconds

Probability Constrained Search Range Determination for Fast Motion Estimation

  • Kang, Hyun-Soo;Lee, Si-Woong;Hosseini, Hamid Gholam
    • ETRI Journal
    • /
    • v.34 no.3
    • /
    • pp.369-378
    • /
    • 2012
  • In this paper, we propose new adaptive search range motion estimation methods where the search ranges are constrained by the probabilities of motion vector differences and a search point sampling technique is applied to the constrained search ranges. Our new methods are based on our previous work, in which the search ranges were analytically determined by the probabilities. Since the proposed adaptive search range motion estimation methods effectively restrict the search ranges instead of search point sampling patterns, they provide a very flexible and hardware-friendly approach in motion estimation. The proposed methods were evaluated and tested with JM16.2 of the H.264/AVC video coding standard. Experiment results exhibit that with negligible degradation in PSNR, the proposed methods considerably reduce the computational complexity in comparison with the conventional methods. In particular, the combined method provides performance similar to that of the hybrid unsymmetrical-cross multi-hexagon-grid search method and outstanding merits in hardware implementation.

Sum of Squares-Based Range Estimation of an Object Using a Single Camera via Scale Factor

  • Kim, Won-Hee;Kim, Cheol-Joong;Eom, Myunghwan;Chwa, Dongkyoung
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.6
    • /
    • pp.2359-2364
    • /
    • 2017
  • This paper proposes a scale factor based range estimation method using a sum of squares (SOS) method. Many previous studies measured distance by using a camera, which usually required two cameras and a long computation time for image processing. To overcome these disadvantages, we propose a range estimation method for an object using a single moving camera. A SOS-based Luenberger observer is proposed to estimate the range on the basis of the Euclidean geometry of the object. By using a scale factor, the proposed method can realize a faster operation speed compared with the previous methods. The validity of the proposed method is verified through simulation results.

Fast Motion Estimation with Adaptive Search Range Adjustment using Motion Activities of Temporal and Spatial Neighbor Blocks (시·공간적 주변 블록들의 움직임을 이용하여 적응적으로 탐색 범위 조절을 하는 고속 움직임 추정)

  • Lee, Sang-Hak
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.4
    • /
    • pp.372-378
    • /
    • 2010
  • This paper propose the fast motion estimation algorithm with adaptive search range adjustment using motion activities of temporal and spatial neighbor blocks. The existing fast motion estimation algorithms with adaptive search range adjustment use the maximum motion vector of all blocks in the reference frame. So these algorithms may not control a optimum search range for slow moving block in current frame. The proposed algorithm use the maximum motion vector of neighbor blocks in the reference frame to control a optimum search range for slow moving block. So the proposed algorithm can reduce computation time for motion estimation. The experiment results show that the proposed algorithm can reduce the number of search points about 15% more than Simple Dynamic Search Range(SDSR) algorithm while maintaining almost the same bit-rate and motion estimation error.

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.

A Study on the Measurement Time-Delay Estimation of Tightly-Coupled GPS/INS system (강결합방식의 GPS/INS 시스템에 대한 측정치 시간지연 추정 연구)

  • Lee, Youn-Seon;Lee, Sang-Jeong
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.11 no.4
    • /
    • pp.116-123
    • /
    • 2008
  • In this paper we study the performance of the measurement time-delay estimation of tightly-coupled GPS/INS(Global positioning system/Inertial Navigation system) system. Generally, the heading error estimation performance of loosely-coupled GPS/INS system using GPS's Navigation Solution is poor. In the case of tightly-coupled GPS/INS system using pseudo-range and pseudo-range rate, the heading error estimation performance is better. However, the time-delay error on the measurement(pseudo-range rate) make the heading error estimation performance degraded. So that, we propose the time-delay model on the measurement and compose the time-delay estimator. And we confirm that the heading error estimation performance in the case of measurement time-delay existence is similar with the case of no-delay by Monte-Carlo simulation.

A Study on Estimation and Factors of VHF Data Link Range (VHF 데이터통신 통달거리 예측 및 요소 분석)

  • Lee, Young-Joong;Kim, In-Seon;Park, Joo-Rae
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.3
    • /
    • pp.413-420
    • /
    • 2010
  • An Estimation of VHF data link range for EW(Electronic Warfare) equipment in the sea environment was studied to predict the data link range between transmitting and receiving station. The theoretical estimation predicts within 3% error with actual measurement of VHF data link range at sea. Data link range factors including refraction and reflection are added in the basic wave propagation equation. The effect of refraction and reflection to the range is analysed with quantity level.

Analysis of High Resolution Range Estimation for Moving Target Using Stepped Frequency Radar with Coherent Pulse Train (코히어런트 펄스열을 갖는 계단 주파수 레이더를 이용한 이동표적의 고해상도 거리 추정 분석)

  • Sim, Jae-Hun;Bae, Keun-Sung
    • Journal of IKEEE
    • /
    • v.22 no.3
    • /
    • pp.599-604
    • /
    • 2018
  • A Stepped Frequency Radar(SFR) is a method that realizes high resolution range estimation by increasing the frequency of transmission pulses at regular intervals to generate a wide synthetic bandwidth. However, in the case of a moving target, accurate range estimation becomes difficult due to the range-Doppler coupling. In this paper, the process of high resolution range estimation by compensation of the range-Doppler coupling with estimated velocity of the moving target using the SFR waveform with Coherent Pulse Train(CPT) is analyzed and it was verified through simulation.

AdaMM-DepthNet: Unsupervised Adaptive Depth Estimation Guided by Min and Max Depth Priors for Monocular Images

  • Bello, Juan Luis Gonzalez;Kim, Munchurl
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2020.11a
    • /
    • pp.252-255
    • /
    • 2020
  • Unsupervised deep learning methods have shown impressive results for the challenging monocular depth estimation task, a field of study that has gained attention in recent years. A common approach for this task is to train a deep convolutional neural network (DCNN) via an image synthesis sub-task, where additional views are utilized during training to minimize a photometric reconstruction error. Previous unsupervised depth estimation networks are trained within a fixed depth estimation range, irrespective of its possible range for a given image, leading to suboptimal estimates. To overcome this suboptimal limitation, we first propose an unsupervised adaptive depth estimation method guided by minimum and maximum (min-max) depth priors for a given input image. The incorporation of min-max depth priors can drastically reduce the depth estimation complexity and produce depth estimates with higher accuracy. Moreover, we propose a novel network architecture for adaptive depth estimation, called the AdaMM-DepthNet, which adopts the min-max depth estimation in its front side. Intensive experimental results demonstrate that the adaptive depth estimation can significantly boost up the accuracy with a fewer number of parameters over the conventional approaches with a fixed minimum and maximum depth range.

  • PDF

Coherent Pulse Train Based Velocity Estimation and Compensation for High Resolution Range Profile of Moving Target in Stepped Frequency Radar (계단 주파수 레이더에서 이동표적의 고해상도 거리 추정을 위한 코히어런트 펄스열 기반의 속도 추정 및 보상)

  • Sim, Jae-Hun;Bae, Keun-Sung
    • Journal of IKEEE
    • /
    • v.22 no.2
    • /
    • pp.309-315
    • /
    • 2018
  • A Stepped Frequency Radar(SFR) is a method of achieving high range resolution by gradually increasing the frequency of a transmitted pulse to create a wide synthetic bandwidth. However, in the case of moving target, accurate range estimation can not be performed due to the range-Doppler coupling phenomenon, so it is necessary to compensate through accurate velocity estimation. In this paper, we propose a stepped frequency radar waveform with a Coherent Pulse Train(CPT), velocity estimation results according to parameters using this method and VMD(Velocity Measurement Data) were compared and analyzed by numerical simulations.

The shifted Chebyshev series-based plug-in for bandwidth selection in kernel density estimation

  • Soratja Klaichim;Juthaphorn Sinsomboonthong;Thidaporn Supapakorn
    • Communications for Statistical Applications and Methods
    • /
    • v.31 no.3
    • /
    • pp.337-347
    • /
    • 2024
  • Kernel density estimation is a prevalent technique employed for nonparametric density estimation, enabling direct estimation from the data itself. This estimation involves two crucial elements: selection of the kernel function and the determination of the appropriate bandwidth. The selection of the bandwidth plays an important role in kernel density estimation, which has been developed over the past decade. A range of methods is available for selecting the bandwidth, including the plug-in bandwidth. In this article, the proposed plug-in bandwidth is introduced, which leverages shifted Chebyshev series-based approximation to determine the optimal bandwidth. Through a simulation study, the performance of the suggested bandwidth is analyzed to reveal its favorable performance across a wide range of distributions and sample sizes compared to alternative bandwidths. The proposed bandwidth is also applied for kernel density estimation on real dataset. The outcomes obtained from the proposed bandwidth indicate a favorable selection. Hence, this article serves as motivation to explore additional plug-in bandwidths that rely on function approximations utilizing alternative series expansions.