• Title/Summary/Keyword: Smoothing algorithm

Search Result 436, Processing Time 0.024 seconds

Launch Point Estimation for a Ballistic Missile using the Phase Division Least Square Method (단계 분리형 최소 자승법을 이용한 탄도 미사일의 발사지점 예측 연구)

  • Kim, Jun-Ki;Lee, Dong-Kwan;Cho, Kil-Seok;Song, Taek-Lyul
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.4
    • /
    • pp.414-421
    • /
    • 2014
  • This paper presents a method of ballistic missile launch point estimation using phase division least squares. The proposed algorithm employs smoothing to enhance estimation accuracy and generates functions of time for total velocity, flight path angle and heading angle, allowing extrapolation to estimate the launch point. Performance of the proposed algorithm is tested in conjunction with the extended Kalman filter and the Kalman filter.

Hybrid Deinterlacing Algorithm with Motion Vector Smoothing

  • Khvan, Dmitriy;Jeon, Gwanggil;Jeong, Jechang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.07a
    • /
    • pp.262-265
    • /
    • 2012
  • In this paper we propose a new deinterlacing method with block classification and motion vector smoothing. The proposed method classifies a block, then depending on the region it belongs to, the motion estimation or line averaging is applied. To classify a block its variance is calculated. Then, for those blocks that belong to simple non-texture region the line averaging is done while motion estimation is applied to complex region. The motion vector field is smoothed using median filter what yields more accurate interpolation. In the experiments for the subjective evaluation, the proposed method bas shown satisfying results in terms of computation time consumption and peak signal-to-noise ratio. Due to the simplicity of the algorithm computation time was drastically decreased.

  • PDF

A Study on the Characteristics of noise smoothing in FIR-Median Hybrid Filters (메디안 혼성 필터의 잡음 특성 개선)

  • 최삼길;김창규;전계록;김명기;변건식
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.11
    • /
    • pp.1185-1198
    • /
    • 1992
  • In this paper, the differential weighted algorithm proposed in order to improve th noise smoothing characteristics of conventional Median filter and FIR-Median Hybrid filter. Performance of some image restoration filter(median filter, FIR-Median Hybird filter, FIR-Median Hybrid filter to proposed differential weighted algorithm) are compared and evaluated on the noise smoothing characteristics and sharp edge conservation characteristics. Test and Real images used in this paper are Lenna and Urological images corrupted by impulse, gaussian, exponential and laplacian noise. Experimental results show that the FIR-Median Hybrid filter applied to the differential weighted algorithm are comparatively superior to others. But the filter orders have increased, the more time consumed to image processing. Hence if the adequate filtering by the type of image is selected. now after a great support will be take consideration into the various parts of application by computer science and of medical image processing.

  • PDF

An Image Denoising Algorithm for the Mobile Phone Cameras (스마트폰 카메라를 위한 영상 잡음 제거 알고리즘)

  • Kim, Sung-Un
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.9 no.5
    • /
    • pp.601-608
    • /
    • 2014
  • In this study we propose an image denoising algorithm appropriate for mobile smart phone equipped with limited computing ability, which has better performance and at the same time comparable quality comparing with previous studies. The proposed image denoising algorithm for mobile smart phone cameras in low level light environment reduces computational complexity and also prevents edge smoothing by extracting just Gaussian noises from the noisy input image. According to the experiment result, we verified that our algorithm has much better PSNR value than methods applying mean filter or median filter. Also the result image from our algorithm has better clear quality since it preserves edges while smoothing input image. Moreover, the suggested algorithm reduces computational complexity about 52% compared to the method applying original Laplacian mask computation, and we verified that our algorithm has good denoising quality by implementing the algorithm in Android smart phone.

Real-Time Continuous-Scale Image Interpolation with Directional Smoothing (방향적응적인 연속 비율 실시간 영상 보간 방식 -방향별 가우시안 필터를 사용한 연속 비율 지원 영상 보간 필터-)

  • Yoo, Yoon-Jong;Jun, Sin-Young;Maik, Vivek;Paik, Joon-Ki
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.615-619
    • /
    • 2009
  • A real-time, continuous-scale image interpolation method is proposed based on bi-linear interpolation with directionally adaptive low-pass filtering. The proposed algorithm has been optimized for hardware implementation. The original bi-linear interpolation method has blocking artifact. The proposed algorithm solves this problem using directionally adaptive low-pass filtering. It can also solve the severely problem by selection choosing low-pass filter coefficients. Therefore the proposed interpolation algorithm can realize a high-quality image scaler for various imaging systems, such as digital camera, CCTV and digital flat panel display, to name a few.

  • PDF

Advanced Distributed Arrival Time Control for Single Machine Problem in Dynamic Scheduling Environment (동적 스케줄링을 위한 분산 도착시간 제어 (Distributed Arrival Time Control) 알고리즘의 개량)

  • Ko, Jea-Ho;Ok, Chang-Soo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.38 no.1
    • /
    • pp.31-40
    • /
    • 2012
  • Distributed arrival time control (DATC) is a distributed feedback control algorithm for real-time scheduling problems in dynamic operational environment. Even though DATC has provided excellent performance for dynamic scheduling problems, it can be improved by considering the following considerations. First, the original DATC heavily depends on the quality of initial solution. In this paper, well-known dispatching rules are incorporated DATC algorithm to enhance its performance. Second, DATC improves its solution with adjusting virtual arrival times of jobs to be scheduled in proportion to the gap between completion time and due date iteratively. Since this approach assigns the same weight to all gaps generated with iterations, it fails to utilize significantly more the latest information (gap) than the previous ones. To overcome this issue we consider exponential smoothing which enable to assign different weight to different gaps. Using these two consideration This paper proposes A-DATC (Advanced-DATC). We demonstrate the effectiveness of the proposed scheduling algorithm through computational results.

Instantaneous frequency extraction in time-varying structures using a maximum gradient method

  • Liu, Jing-liang;Wei, Xiaojun;Qiu, Ren-Hui;Zheng, Jin-Yang;Zhu, Yan-Jie;Laory, Irwanda
    • Smart Structures and Systems
    • /
    • v.22 no.3
    • /
    • pp.359-368
    • /
    • 2018
  • A method is proposed for the identification of instantaneous frequencies (IFs) in time-varying structures. The proposed method combines a maximum gradient algorithm and a smoothing operation. The maximum gradient algorithm is designed to extract the wavelet ridges of response signals. The smoothing operation, based on a polynomial curve fitting algorithm and a threshold method, is employed to reduce the effects of random noises. To verify the effectiveness and accuracy of the proposed method, a numerical example of a signal with two frequency modulated components is investigated and an experimental test on a steel cable with time-varying tensions is also conducted. The results demonstrate that the proposed method can extract IFs from the noisy multi-component signals and practical response signals successfully. In addition, the proposed method can provide a better IF identification results than the standard synchrosqueezing wavelet transform.

An Improved Multi-resolution image fusion framework using image enhancement technique

  • Jhee, Hojin;Jang, Chulhee;Jin, Sanghun;Hong, Yonghee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.12
    • /
    • pp.69-77
    • /
    • 2017
  • This paper represents a novel framework for multi-scale image fusion. Multi-scale Kalman Smoothing (MKS) algorithm with quad-tree structure can provide a powerful multi-resolution image fusion scheme by employing Markov property. In general, such approach provides outstanding image fusion performance in terms of accuracy and efficiency, however, quad-tree based method is often limited to be applied in certain applications due to its stair-like covariance structure, resulting in unrealistic blocky artifacts at the fusion result where finest scale data are void or missed. To mitigate this structural artifact, in this paper, a new scheme of multi-scale fusion framework is proposed. By employing Super Resolution (SR) technique on MKS algorithm, fine resolved measurement is generated and blended through the tree structure such that missed detail information at data missing region in fine scale image is properly inferred and the blocky artifact can be successfully suppressed at fusion result. Simulation results show that the proposed method provides significantly improved fusion results in the senses of both Root Mean Square Error (RMSE) performance and visual improvement over conventional MKS algorithm.

Delaunay mesh generation technique adaptive to the mesh Density using the optimization technique (최적화 방법을 이용한 Delaunay 격자의 내부 격자밀도 적응 방법)

  • Hong J. T.;Lee S. R.;Park C. H.;Yang D. Y.
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2004.10a
    • /
    • pp.75-78
    • /
    • 2004
  • A mesh generation algorithm adapted to the mesh density map using the Delaunay mesh generation technique is developed. In the finite element analyses of the forging processes, the numerical error increases as the process goes on because of discrete property of the finite elements or severe distortion of elements. Especially, in the region where stresses and strains are concentrated, the numerical discretization error will be highly increased. However, it is too time consuming to use a uniformly fine mesh in the whole domain to reduce the expected numerical error. Therefore, it is necessary to construct locally refined mesh at the region where the error is concentrated such as at the die corner. In this study, the point insertion algorithm is used and the mesh size is controlled by moving nodes to optimized positions according to a mesh density map constructed with a posteriori error estimation. An optimization technique is adopted to obtain a good position of nodes. And optimized smoothing techniques are also adopted to have smooth distribution of the mesh and improve the mesh element quality.

  • PDF

A Path Planning to Maximize Survivability for Unmanned Aerial Vehicle by using $A^*PS$-PGA ($A^*PS$-PGA를 이용한 무인 항공기 생존성 극대화 경로계획)

  • Kim, Ki-Tae;Jeon, Geon-Wook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.34 no.3
    • /
    • pp.24-34
    • /
    • 2011
  • An Unmanned Aerial Vehicle (UAV) is a powered pilotless aircraft, which is controlled remotely or autonomously. UAVs are an attractive alternative for many scientific and military organizations. UAVs can perform operations that are considered to be risky or uninhabitable for human. UA V s are currently employed in many military missions such as reconnaissance, surveillance, enemy radar jamming, decoying, suppression of enemy air defense (SEAD), fixed and moving target attack, and air-to-air combat. UAVs also are employed in a number of civilian applications such as monitoring ozone depletion, inclement weather, traffic congestion, and taking images of dangerous territory. For accomplishing the UAV's missions, guarantee of survivability should be preceded. The main objective of this study is to suggest a mathematical programming model and a $A^*PS$-PGA (A-star with Post Smoothing-Parallel Genetic Algorithm) for an UAV's path planning to maximize survivability. A mathematical programming model is composed by using MRPP (Most Reliable Path Problem) and TSP (Traveling Salesman Problem). A path planning algorithm for UAV is applied by transforming MRPP into SPP (Shortest Path Problem).