• Title/Summary/Keyword: Algorithm of Reference

Search Result 2,192, Processing Time 0.029 seconds

A Fast Algorithm for Target Detection in High Spatial Resolution Imagery

  • Kim Kwang-Eun
    • Proceedings of the KSRS Conference
    • /
    • 2006.03a
    • /
    • pp.7-14
    • /
    • 2006
  • Detection and identification of targets from remotely sensed imagery are of great interest for civilian and military application. This paper presents an algorithm for target detection in high spatial resolution imagery based on the spectral and the dimensional characteristics of the reference target. In this algorithm, the spectral and the dimensional information of the reference target is extracted automatically from the sample image of the reference target. Then in the entire image, the candidate target pixels are extracted based on the spectral characteristics of the reference target. Finally, groups of candidate pixels which form isolated spatial objects of similar size to that of the reference target are extracted as detected targets. The experimental test results showed that even though the algorithm detected spatial objects which has different shape as targets if the spectral and the dimensional characteristics are similar to that of the reference target, it could detect 97.5% of the targets in the image. Using hyperspectral image and utilizing the shape information are expected to increase the performance of the proposed algorithm.

  • PDF

A Fast Algorithm for Target Detection in High Spatial Resolution Imagery

  • Kim Kwang-Eun
    • Korean Journal of Remote Sensing
    • /
    • v.22 no.1
    • /
    • pp.41-47
    • /
    • 2006
  • Detection and identification of targets from remotely sensed imagery are of great interest for civilian and military application. This paper presents an algorithm for target detection in high spatial resolution imagery based on the spectral and the dimensional characteristics of the reference target. In this algorithm, the spectral and the dimensional information of the reference target is extracted automatically from the sample image of the reference target. Then in the entire image, the candidate target pixels are extracted based on the spectral characteristics of the reference target. Finally, groups of candidate pixels which form isolated spatial objects of similar size to that of the reference target are extracted as detected targets. The experimental test results showed that even though the algorithm detected spatial objects which has different shape as targets if the spectral and the dimensional characteristics are similar to that of the reference target, it could detect 97.5% of the targets in the image. Using hyperspectral image and utilizing the shape information are expected to increase the performance of the proposed algorithm.

Fast Multi-Reference Frame Motion Estimation Algorithm Using a Relation of Motion Vector with Distance of Each Reference Frame (움직임 벡터와 참조 프레임간의 거리를 이용한 고속 다중 참조 프레임 움직임 추정)

  • Byun, Ju-Won;Choi, Jin-Ha;Kim, Jae-Seok
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.2
    • /
    • pp.69-76
    • /
    • 2010
  • This paper proposed a new fast multi-reference frame motion estimation algorithm. The proposed algorithm reduces search areas of motion estimation using a linear relation of motion vector with distance of each reference frame. New algorithm executes full search area motion estimation in reference frame 0 and reference frame 1. After that, search areas in reference frame 2, reference frame 3 and reference frame 4 are minimized by distance of each reference frame and results of motion estimation in reference frame 0 and reference frame 1. The proposed algorithm does not use a threshold value which is obstacle of hardware implementation and processing time schedule. Also, it reduced computation quantity of multi-reference motion estimation. Hardware implementation of multi-reference frame motion estimation is possible by these features. Simulation results show that PSNR drop and bitrate increase of proposed algorithm are lower than those of previous fast multi-reference frame motion estimation algorithm The number of computation of new algorithm is reduced 52.5% and quality of result is negligible when compared with full search area motion estimation which has 5 reference frames.

Development of Linearly Interpolated PRC Regenerating Algorithm to Improve Navigation Solution using Multi-DGPS Reference Stations

  • Oh, Kyung-Ryoon;Kim, Jong-Chul;Nam, Gi-Wook
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1618-1622
    • /
    • 2004
  • In this paper, the linearly interpolated PRC(Pseudo Range Correction) regenerating algorithm was applied to improve the DGPS(Differential Global Positioning System) positioning accuracy at user's spot by using the various PRC information obtained from multi-DGPS reference stations. The PRC information of each GPS satellite is not varying rapidly; it is possible to assume that the variation of PRC information of each GPS satellite is linear. So the linearly interpolated PRC regenerating algorithm can be applied to improve the DGPS positioning accuracy at user's spot by using the various PRC information obtained from multi-DGPS reference stations. To test the performance of the linearly interpolated PRC regenerating algorithm, maritime DGPS reference stations' PRC data was used in RTCM format. 11 maritime DGPS reference stations are in service providing DGPS information to public since 1999. Two set of 3 DGPS reference stations are selected to compare the performance of the linearly interpolated PRC regenerating algorithm. The DGPS positioning accuracy was dramatically improved about 40%. Linearly interpolated PRC regenerating algorithm adopted multi-channel DGPS receiver will be developed in near future.

  • PDF

A fast full search algorithm for multiple reference image motion estimation (다중 참조 영상 움직임 추정을 위한 고속 전역탐색법)

  • Kang Hyun-Soo;Park Seong-Mo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.1 s.307
    • /
    • pp.1-8
    • /
    • 2006
  • This paper presents a fast full search algorithm for motion estimation applicable to multiple reference images. The proposed method is an extended version of the rate constrained successive elimination algorithm (RSEA) for multiple reference frame applications. We will show that motion estimation for the reference images temporally preceding the first reference image can be less intensive in computation compared with that for the first reference image. for computational reduction, we will drive a new condition to lead the smaller number of candidate blocks for the best matched block. Simulation results explain that our method reduces computation complexity although it has the same quality as RSEA.

Improved MSI Based Scheduling and Admission Control Algorithm for IEEE 802.l1e Wireless LAN (IEEE 802.l1e 무선랜에서 MSI를 이용한 개선된 스케줄링 및 수락제어 알고리즘)

  • Yang, Geun-Hyuk;Ok, Chi-Young;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.99-109
    • /
    • 2007
  • IEEE 802.lie is being proposed to improve QoS by IEEE 802.11 working group. HCCA (HCF Controlled Channel Access) a centralized polling based mechanism of IEEE 802.11e, needs a scheduling algorithm that decides on how the available radio resources are allocated to the polled STAs. In IEEE 802.l1e standard Reference Scheduler is presented. Reference Scheduler Polls all STAs in a polling list by the same interval that causes ineffectively frequent polling. It increases not only the overhead but it decreases the TXOP (Transmission Opportunity) utilization. In this paper, we propose the scheduling and admission control algorithm that poll stations depending on the MSI (Maximum Service Interval)o( stations to solve these shortcomings. In our proposed algorithm a station is polled by an interval close to its MSI, so polling overhead decrease and TXOP utilization increases than Reference Scheduler. Simulation results show that our algorithm outperforms Reference Scheduler. Our algorithm maintains higher aggregate throughput and services mere stations than Reference Scheduler.

Active noise control algorithm based on noise frequency estimation (소음 주파수 추정 기법을 이용한 능동소음제어 알고리즘)

  • 김선민;박영진
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.321-324
    • /
    • 1997
  • In this paper, Active Noise Control(ANC) algorithm is proposed based on the estimated frequency estimator of the reference signal. The conventional feedforward ANC algorithms should measure the reference and use it to calculate the gradient of the squared error and filter coefficients. For ANC systems applied to aircrafts and passenger ships, engines from which reference signal is usually measured is so far from seats where main part of controller is placed that the scheme might be difficult to implement or very costly. Feedback ANC algorithm which doesn't need to measure the reference uses the error signal to update the filter and is sensitive to unexpected transient noise like a sneeze, clapping of hands and so on The proposed algorithm estimates frequencies of the desired signal in real time using adaptive notch filter. New frequency estimation algorithm is proposed with the improved convergence rate, threshold SNR and computational simplicity. Reference is not measured but created with the estimated frequencies. It has strong similarity to the conventional feedback control because reference is made from error signal. Enhanced error signal is used to update the controller for better performance under the measurement noise and impact noise. The proposed ANC algorithm is compared with the conventional feedback control.

  • PDF

Design of a Fast Multi-Reference Frame Integer Motion Estimator for H.264/AVC

  • Byun, Juwon;Kim, Jaeseok
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.13 no.5
    • /
    • pp.430-442
    • /
    • 2013
  • This paper presents a fast multi-reference frame integer motion estimator for H.264/AVC. The proposed system uses the previously proposed fast multi-reference frame algorithm. The previously proposed algorithm executes a full search area motion estimation in reference frames 0 and 1. After that, the search areas of motion estimation in reference frames 2, 3 and 4 are minimized by a linear relationship between the motion vector and the distances from the current frame to the reference frames. For hardware implementation, the modified algorithm optimizes the search area, reduces the overlapping search area and modifies a division equation. Because the search area is reduced, the amount of computation is reduced by 58.7%. In experimental results, the modified algorithm shows an increase of bit-rate in 0.36% when compared with the five reference frame standard. The pipeline structure and the memory controller are also adopted for real-time video encoding. The proposed system is implemented using 0.13 um CMOS technology, and the gate count is 1089K with 6.50 KB of internal SRAM. It can encode a Full HD video ($1920{\times}1080P@30Hz$) in real-time at a 135 MHz clock speed with 5 reference frames.

A New Algorithm for Determination of Reference Phases in Phase-Shifting Interferometry (위상변이간섭법에서 기준위상 결정을 위한 새로운 알고리즘 개발)

  • 한건수
    • Korean Journal of Optics and Photonics
    • /
    • v.4 no.4
    • /
    • pp.397-402
    • /
    • 1993
  • This paper presents a new computational algorithm of phase-shifting interferometry which can effectively eliminate the uncertainty errors of the reference phases encountered in obtaining multiple interferograms. The algorithm treats the reference phases as additional unknowns and determines their exact values by analyzing interferograms using numerical least square technique. A series of simulations prove that this algorithm can improve measuring accuracy being unaffected by the nonlinear and random errors of phase-shifters.

  • PDF

Fast Motion Estimation Using Multiple Reference Pictures In H.264/Avc (H.264/AVC에서 다중 참조 픽처를 이용한 고속 움직임 추정)

  • Kim, Seong-Hee;Oh, Jeong-Su
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5C
    • /
    • pp.536-541
    • /
    • 2007
  • In video coding standard H.264/AVC, motion estimation using multiple reference pictures improves compression efficiency but the efficiency depends upon image content not the number of reference pictures. So, the motion estimation includes a large amount of computation of no worth according to image. This paper proposes fast motion estimation algorithm that removes worthless computation in the motion estimation using multiple reference pictures. The proposed algorithm classifies a block into valid and invalid blocks for the multiple reference pictures and removes the workless computation by applying a single reference picture to the invalid block. To estimate the proposed algorithm's performance, image quality, bit rate, and motion estimation time are compared with ones of the conventional algorithm in the reference software JM 9.5. The simulation results show that the proposed algorithm can considerably save about 38.67% the averaged motion estimation time while keeping the image quality and the bit rate, whose are average values are -0.02dB and -0.77% respectively, as good as the conventional algorithm.