• Title/Summary/Keyword: Space-Time Adaptive Processing

Search Result 59, Processing Time 0.029 seconds

Simulink Model Implementation of MVDR Adaptive Beamformer for GPS Anti-Jamming

  • Han, Jeongwoo;Park, Hoon;Kim, Bokki;Han, Jin-Hee
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.9 no.2
    • /
    • pp.51-57
    • /
    • 2020
  • For the purpose of development of anti-jamming GPS receiver we have developed an anti-jamming algorithm and its Simulink implementation model. The algorithm used here is a form of Space-Time Adaptive Processing (STAP) filter which is well known as an effective way to remove wideband jamming signals. We have chosen Minimum Variance Distortionless Response (MVDR) block-adaptive beamforming algorithm for our development since it can provide relatively fast convergence speed to reach optimal weights, stable and high suppression capability on various types of jamming signals. We will show modeling results for this MVDR type adaptive beamformer and some simulation results. We also show the integrity of the demodulated satellite signals and the accuracy of resulting navigation solutions after anti-jamming operation.

Performance Analysis of Pseudorange Error in STAP Beamforming Algorithm for Array Antenna

  • Lee, Kihoon;So, Hyungmin;Song, Kiwon
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.3 no.2
    • /
    • pp.37-44
    • /
    • 2014
  • The most effective method to overcome GPS jamming problem is to use an adaptive array antenna which has the capability of beamforming or nulling to a certain direction. In this paper, Space Time Adaptive Processing (STAP) beamforming algorithm of four elements array antenna will be designed and the anti-jamming performance will be analyzed. According to the analysis, the signal to noise ratio (SNR) and anti-jamming performance can be enhanced by beamforming algorithm. Also, the time tap effect of STAP algorithm will be analyzed theoretically and verified with array antenna modeling and simulation. Specially, the cautious selection of reference time tap in STAP can prevent the degradation of position accuracy performance.

An Intelligent Automatic Early Detection System of Forest Fire Smoke Signatures using Gaussian Mixture Model

  • Yoon, Seok-Hwan;Min, Joonyoung
    • Journal of Information Processing Systems
    • /
    • v.9 no.4
    • /
    • pp.621-632
    • /
    • 2013
  • The most important things for a forest fire detection system are the exact extraction of the smoke from image and being able to clearly distinguish the smoke from those with similar qualities, such as clouds and fog. This research presents an intelligent forest fire detection algorithm via image processing by using the Gaussian Mixture model (GMM), which can be applied to detect smoke at the earliest time possible in a forest. GMMs are usually addressed by making the model adaptive so that its parameters can track changing illuminations and by making the model more complex so that it can represent multimodal backgrounds more accurately for smoke plume segmentation in the forest. Also, in this paper, we suggest a way to classify the smoke plumes via a feature extraction using HSL(Hue, Saturation and Lightness or Luminanace) color space analysis.

Color Segmentation of Vehicle License Plates in the RGB Color Space Using Color Component Binarization (RGB 색상 공간에서 색상 성분 이진화를 이용한차량 번호판 색상 분할)

  • Jung, Min Chul
    • Journal of the Semiconductor & Display Technology
    • /
    • v.13 no.4
    • /
    • pp.49-54
    • /
    • 2014
  • This paper proposes a new color segmentation method of vehicle license plates in the RGB color space. Firstly, the proposed method shifts the histogram of an input image rightwards and then stretches the image of the histogram slide. Secondly, the method separates each of the three RGB color components and performs the adaptive threshold processing with the three components, respectively. Finally, it combines the three components under the condition of making up a segment color and removes noises with the morphological processing. The proposed method is implemented using C language in an embedded Linux system for a high-speed real-time image processing. Experiments were conducted by using real vehicle images. The results show that the proposed algorithm is successful for most vehicle images. However, the method fails in some vehicles when the body and the license plate have the same color.

An Efficient Bit-Level Lossless Grayscale Image Compression Based on Adaptive Source Mapping

  • Al-Dmour, Ayman;Abuhelaleh, Mohammed;Musa, Ahmed;Al-Shalabi, Hasan
    • Journal of Information Processing Systems
    • /
    • v.12 no.2
    • /
    • pp.322-331
    • /
    • 2016
  • Image compression is an essential technique for saving time and storage space for the gigantic amount of data generated by images. This paper introduces an adaptive source-mapping scheme that greatly improves bit-level lossless grayscale image compression. In the proposed mapping scheme, the frequency of occurrence of each symbol in the original image is computed. According to their corresponding frequencies, these symbols are sorted in descending order. Based on this order, each symbol is replaced by an 8-bit weighted fixed-length code. This replacement will generate an equivalent binary source with an increased length of successive identical symbols (0s or 1s). Different experiments using Lempel-Ziv lossless image compression algorithms have been conducted on the generated binary source. Results show that the newly proposed mapping scheme achieves some dramatic improvements in regards to compression ratios.

Fine Grain Real-Time Code Scheduling Using an Adaptive Genetic Algorithm (적합 유전자 알고리즘을 이용한 실시간 코드 스케쥴링)

  • Chung, Tai-Myoung
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.6
    • /
    • pp.1481-1494
    • /
    • 1997
  • In hard real-time systems, a timing fault may yield catastrophic results. Dynamic scheduling provides the flexibility to compensate for unexpected events at runtime; however, scheduling overhead at runtime is relatively large, constraining both the accuracy of the timing and the complexity of the scheduling analysis. In contrast, static scheduling need not have any runtime overhead. Thus, it has the potential to guarantee the precise time at which each instruction implementing a control action will execute. This paper presents a new approach to the problem of analyzing high-level language code, augmented by arbitrary before and after timing constraints, to provide a valid static schedule. Our technique is based on instruction-level complier code scheduling and timing analysis, and can ensure the timing of control operations to within a single instruction clock cycle. Because the search space for a valid static schedule is very large, a novel adaptive genetic search algorithm was developed.

  • PDF

SAR-GMTI 기술의 원리

  • Jeon, Ju-Hwan
    • The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.22 no.6
    • /
    • pp.68-79
    • /
    • 2011
  • 본 논문은 tutorial로서 synthetic aperture radar(SAR) 및 ground moving target indicator(GMTI)의 원리 및 이들이 왜 함께 사용되어야 하는지를 설명하고자 한다. 우선 SAR의 영상 형성 방법을 설명하고, 지상에서 움직이는 점 표적(point target)이 SAR 영상에서 어떻게 나타나는지를 이해하고, 마지막으로 GMTI 목적으로 사용될 수 있는 space-time adaptive processing(STAP)의 기본원리를 소개한다. 최신기술 동향은 생략하고 기본원리만 깊이 다루고자 한다.

A Real-time Face Tracking Algorithm using Improved CamShift with Depth Information

  • Lee, Jun-Hwan;Jung, Hyun-jo;Yoo, Jisang
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.5
    • /
    • pp.2067-2078
    • /
    • 2017
  • In this paper, a new face tracking algorithm is proposed. The CamShift (Continuously adaptive mean SHIFT) algorithm shows unstable tracking when there exist objects with similar color to that of face in the background. This drawback of the CamShift is resolved by the proposed algorithm using Kinect's pixel-by-pixel depth information and the skin detection method to extract candidate skin regions in HSV color space. Additionally, even when the target face is disappeared, or occluded, the proposed algorithm makes it robust to this occlusion by the feature point matching. Through experimental results, it is shown that the proposed algorithm is superior in tracking performance to that of existing TLD (Tracking-Learning-Detection) algorithm, and offers faster processing speed. Also, it overcomes all the existing shortfalls of CamShift with almost comparable processing time.

Preliminary Simulation on Spaceborne Sparse Array Millimeter Wave Radar for GMTI

  • Kang, Xueyan;Zhang, Yunhua
    • Journal of electromagnetic engineering and science
    • /
    • v.10 no.4
    • /
    • pp.322-327
    • /
    • 2010
  • Spaceborne sparse array radar for ground moving targets indication (GMTI) has outstanding advantage over full array radar for constructing ultra-large aperture. Rapid development of millimeter wave (MMW) technology make it possible for realizing MMW GMTI radar, which is much more sensitive to slow moving ground target. The paper presented the system model of a multi-carrier frequency sparse array MMW radar as well as preliminary simulation results, which showed future application of the system is very promising.

Skin Region Extraction Using Color Information and Skin-Color Model (컬러 정보와 피부색 모델을 이용한 피부 영역 검출)

  • Park, Sung-Wook;Park, Jong-Kwan;Park, Jong-Wook
    • 전자공학회논문지 IE
    • /
    • v.45 no.4
    • /
    • pp.60-67
    • /
    • 2008
  • Skin color is a very important information for an automatic face recognition. In this paper, we proposed a skin region extraction method using color information and skin color model. We use the adaptive lighting compensation technique for improved performance of skin region extraction. Also, using an preprocessing filter, normally large areas of easily distinct non skin pixels, are eliminated from further processing. And we use the modified ST color space, where undesired effects are reduced and the skin color distribution fits better than others color space. Experimental results show that the proposed method has better performance than the conventional methods, and reduces processing time by $35{\sim}40%$ on average.