• Title/Summary/Keyword: adaptive window

Search Result 241, Processing Time 0.026 seconds

A Study on Applying the Adaptive Window to Detect Objects Contour (물체의 윤곽선 검출을 위한 Adaptive Window적용에 관한 연구)

  • 양환석;서요한;강창원;박찬란;이웅기
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.2
    • /
    • pp.57-67
    • /
    • 1998
  • In order to extract the contour of interesting object in the image, Kass suggested the Active Contour Model called "Snakes" The speed of this model is slow and this model is sensitive of initialization. In order to improve these problems, Gunn extracted the accurate contour by using two initializations, and operated to less sensitive of initialization. This method could extract more accurate contour than the existing method, but it had no effect in the speed and it was sensitive of noise. This paper applied to the Energy Minimization Algorithm about only the pixel within the window applying the window of $8{\times}8$ size at each contour point consisting Snakes in order to solve these problems. In order to less sensitive of noise which exists within image, it suggests a method that moves the window to vertical direction for the gradient of each contour point.our point.

  • PDF

Typhoon Wukong (200610) Prediction Based on The Ensemble Kalman Filter and Ensemble Sensitivity Analysis (앙상블 칼만 필터를 이용한 태풍 우쿵 (200610) 예측과 앙상블 민감도 분석)

  • Park, Jong Im;Kim, Hyun Mee
    • Atmosphere
    • /
    • v.20 no.3
    • /
    • pp.287-306
    • /
    • 2010
  • An ensemble Kalman filter (EnKF) with Weather Research and Forecasting (WRF) Model is applied for Typhoon Wukong (200610) to investigate the performance of ensemble forecasts depending on experimental configurations of the EnKF. In addition, the ensemble sensitivity analysis is applied to the forecast and analysis ensembles generated in EnKF, to investigate the possibility of using the ensemble sensitivity analysis as the adaptive observation guidance. Various experimental configurations are tested by changing model error, ensemble size, assimilation time window, covariance relaxation, and covariance localization in EnKF. First of all, experiments using different physical parameterization scheme for each ensemble member show less root mean square error compared to those using single physics for all the forecast ensemble members, which implies that considering the model error is beneficial to get better forecasts. A larger number of ensembles are also beneficial than a smaller number of ensembles. For the assimilation time window, the experiment using less frequent window shows better results than that using more frequent window, which is associated with the availability of observational data in this study. Therefore, incorporating model error, larger ensemble size, and less frequent assimilation window into the EnKF is beneficial to get better prediction of Typhoon Wukong (200610). The covariance relaxation and localization are relatively less beneficial to the forecasts compared to those factors mentioned above. The ensemble sensitivity analysis shows that the sensitive regions for adaptive observations can be determined by the sensitivity of the forecast measure of interest to the initial ensembles. In addition, the sensitivities calculated by the ensemble sensitivity analysis can be explained by dynamical relationships established among wind, temperature, and pressure.

Implementation of Stereo Matching Algorithm using GPU (GPU를 이용한 스테레오 정합 알고리즘의 구현)

  • Choi, Hyun-Jun;Seo, Young-Ho;Kim, Dong-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.3
    • /
    • pp.583-588
    • /
    • 2011
  • In this paper, we propose an adaptive variable-sized matching window method using the characteristic points of the image and a method to increase the reliability of the cross-consistency check to raise the correctness of the final disparity image. The proposed adaptive variable-sized window method segments the image with the color information, finds the characteristic points inside the window. Also the proposed algorithm implement using a graphic processing unit(GPU). The GPU, we used in this paper is GeForce GTX296 (NVIDIA) and we can use programming based on CUDA. The calculation speed realizes a speed approximately 128 times faster than that of a CPU.

A Study on the Improvements of Security and Quality for Analog Speech Scrambler (아날로그 음성 비화기의 비도 및 음질 향상에 관한 연구)

  • 공병구;조동호
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.9
    • /
    • pp.27-35
    • /
    • 1993
  • In this paper, a new algorithm for high level security and quality of speech is proposed. The algorithm is based on the rearrangement of the fast fourier transform (FFT) coefficients with pre and post filter process, hamming window and adaptive pseudo spectrum insertion. Then, the pre and post filters are used for the whitening of speech spectrum and the adaptive pseudo spectrum is inserted for the unclassification of silence/speech. Also, the hamming window technique is applied for the robustness to the syncronization error in the telephone line. According to the simulation results, it can be seen that the security of scrambled signal and the quality of descrambled signal have been improved fairly in both subjective and objective performance test and the new FFT scrambler is robust to the synchronization error.

  • PDF

Adaptive motion estimation based on spatio-temporal correlations (시공간 상관성을 이용한 적응적 움직임 추정)

  • 김동욱;김진태;최종수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.5
    • /
    • pp.1109-1122
    • /
    • 1996
  • Generally, moving images contain the various components in motions, which reange from a static object and background to a fast moving object. To extract the accurate motion parameters, we must consider the various motions. That requires a wide search egion in motion estimation. The wide search, however, causes a high computational complexity. If we have a few knowledge about the motion direction and magnitude before motion estimation, we can determine the search location and search window size using the already-known information about the motion. In this paper, we present a local adaptive motion estimation approach that predicts a block motion based on spatio-temporal neighborhood blocks and adaptively defines the search location and search window size. This paper presents a technique for reducing computational complexity, while having high accuracy in motion estimation. The proposed algorithm is introduced the forward and backward projection techniques. The search windeo size for a block is adaptively determined by previous motion vectors and prediction errors. Simulations show significant improvements in the qualities of the motion compensated images and in the reduction of the computational complexity.

  • PDF

Enhanced Strain Imaging Using Quality Measure

  • Jeong, Mok-Kun;Kwon, Sung-Jae
    • The Journal of the Acoustical Society of Korea
    • /
    • v.27 no.3E
    • /
    • pp.84-94
    • /
    • 2008
  • Displacement estimation is a crucial step in ultrasonic strain imaging. The displacement between a pre- and postcompression signal in the current data window is estimated by first shifting the postcompression signal by the displacement obtained in the previous data window to reduce their decorrelation and then determining the remaining part of the displacement through autocorrelation and conversion of phase difference into time delay. However, since strain image quality tends to vary with the amount of compression applied, we propose two new methods for enhancing strain image quality, i.e., displacement normalization and adaptive persistence. Both in vitro and in vivo experiments are carried out to acquire ultrasound data and produce strain images in real time under the application of quasi static compression. The experimental results demonstrate that the methods are quite effective in improving strain image quality and thus can be applied to implementing an ultrasound elasticity imaging system that operates in real time.

Disparity estimation using adaptive window in hierarchical framework (다중프레임 구조에서 적응적 윈도우를 이용한 변이추정)

  • Yoon, Sang-Un;Min, Dong-Bo;Sohn, Kwang-Hoon
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.433-434
    • /
    • 2006
  • A new disparity estimation method in hierarchical frameworks is proposed. The two main ideas for improving accuracy are to obtain an object boundary map for distinction of homogeneous/object boundary region and to choose adaptive window size/shapes. Moreover, for the reduction of computational complexity, we change reference regions in hierarchical framework. The experimental results show that the proposed method can acquire good results which are robust to homogeneous and object boundary regions.

  • PDF

The Bit Synchronizer of The Frequency Hopping System using Adaptive Window Filter (적응윈도우 필터를 이용한 주파수 도약용 비트 동기방식)

  • 김정섭;황찬식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.8B
    • /
    • pp.1532-1539
    • /
    • 1999
  • In this paper, we propose a bit synchronizer which is suitable for frequency hopping systems. The proposed bit synchronizer is an ADPLL in which the digial loop filter is combined with an error symbol detecting circuit using an adaptive window. Suppressing the tracking process when hop mute and impulse noises are detected improves the performance of the digital loop filter and enhances the probability of the frequency hopping system. The simulation results demonstrate an improved performance of the proposed bit synchronizer compared with existing ones.

  • PDF

Aircraft delivery vehicle with fuzzy time window for improving search algorithm

  • C.C. Hung;T. Nguyen;C.Y. Hsieh
    • Advances in aircraft and spacecraft science
    • /
    • v.10 no.5
    • /
    • pp.393-418
    • /
    • 2023
  • Drones are increasingly used in logistics delivery due to their low cost, high-speed and straight-line flight. Considering the small cargo capacity, limited endurance and other factors, this paper optimized the pickup and delivery vehicle routing problem with time windows in the mode of "truck+drone". A mixed integer programming model with the objective of minimizing transportation cost was proposed and an improved adaptive large neighborhood search algorithm is designed to solve the problem. In this algorithm, the performance of the algorithm is improved by designing various efficient destroy operators and repair operators based on the characteristics of the model and introducing a simulated annealing strategy to avoid falling into local optimum solutions. The effectiveness of the model and the algorithm is verified through the numerical experiments, and the impact of the "truck+drone" on the route cost is analyzed, the result of this study provides a decision basis for the route planning of "truck+drone" mode delivery.

An Adaptive Genetic Algorithm for a Dynamic Lot-sizing and Dispatching Problem with Multiple Vehicle Types and Delivery Time Windows (다종의 차량과 납품시간창을 고려한 동적 로트크기 결정 및 디스패칭 문제를 위한 자율유전알고리즘)

  • Kim, Byung-Soo;Lee, Woon-Seek
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.4
    • /
    • pp.331-341
    • /
    • 2011
  • This paper considers an inbound lot-sizing and outbound dispatching problem for a single product in a thirdparty logistics (3PL) distribution center. Demands are dynamic and finite over the discrete time horizon, and moreover, each demand has a delivery time window which is the time interval with the dates between the earliest and the latest delivery dates All the product amounts must be delivered to the customer in the time window. Ordered products are shipped by multiple vehicle types and the freight cost is proportional to the vehicle-types and the number of vehicles used. First, we formulate a mixed integer programming model. Since it is difficult to solve the model as the size of real problem being very large, we design a conventional genetic algorithm with a local search heuristic (HGA) and an improved genetic algorithm called adaptive genetic algorithm (AGA). AGA spontaneously adjusts crossover and mutation rate depending upon the status of current population. Finally, we conduct some computational experiments to evaluate the performance of AGA with HGA.