• Title/Summary/Keyword: Discrete Space Problem

Search Result 104, Processing Time 0.018 seconds

A Study on Improvement in Digital Image Restoration by a Recursive Vector Processing (순환벡터처리에 의한 디지털 영상복원에 관한 연구)

  • 이대영;이윤현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.8 no.3
    • /
    • pp.105-112
    • /
    • 1983
  • This paper discribes technique of the recursive restoration for the images degraded by linear space invariant blur and additive white Gaussian noise. The image is characterized statistically by tis mean and correlation function. An exponential autocorrelation function has been used to model neighborhood model. The vector model was used because of analytical simplicitly and capability to implement brightness correlation function. Base on the vector model, a two-dimensional discrete stochastic a 12 point neighborhood model for represeting images was developme and used the technique of moving window processing to restore blurred and noisy images without dimensionality increesing, It has been shown a 12 point neighborhood model was found to be more adequate than a 8 point pixel model to obtain optimum pixel estimated. If the image is highly correlated, it is necessary to use a large number of points in the neighborhood in order to have improvements in restoring image. It is believed that these result could be applied to a wide range of image processing problem. Because image processing thchniques normally required a 2-D linear filtering.

  • PDF

Propulsion System Design and Optimization for Ground Based Interceptor using Genetic Algorithm

  • Qasim, Zeeshan;Dong, Yunfeng;Nisar, Khurram
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2008.03a
    • /
    • pp.330-339
    • /
    • 2008
  • Ground-based interceptors(GBI) comprise a major element of the strategic defense against hostile targets like Intercontinental Ballistic Missiles(ICBM) and reentry vehicles(RV) dispersed from them. An optimum design of the subsystems is required to increase the performance and reliability of these GBI. Propulsion subsystem design and optimization is the motivation for this effort. This paper describes an effort in which an entire GBI missile system, including a multi-stage solid rocket booster, is considered simultaneously in a Genetic Algorithm(GA) performance optimization process. Single goal, constrained optimization is performed. For specified payload and miss distance, time of flight, the most important component in the optimization process is the booster, for its takeoff weight, time of flight, or a combination of the two. The GBI is assumed to be a multistage missile that uses target location data provided by two ground based RF radar sensors and two low earth orbit(LEO) IR sensors. 3Dimensional model is developed for a multistage target with a boost phase acceleration profile that depends on total mass, propellant mass and the specific impulse in the gravity field. The monostatic radar cross section (RCS) data of a three stage ICBM is used. For preliminary design, GBI is assumed to have a fixed initial position from the target launch point and zero launch delay. GBI carries the Kill Vehicle(KV) to an optimal position in space to allow it to complete the intercept. The objective is to design and optimize the propulsion system for the GBI that will fulfill mission requirements and objectives. The KV weight and volume requirements are specified in the problem definition before the optimization is computed. We have considered only continuous design variables, while considering discrete variables as input. Though the number of stages should also be one of the design variables, however, in this paper it is fixed as three. The elite solution from GA is passed on to(Sequential Quadratic Programming) SQP as near optimal guess. The SQP then performs local convergence to identify the minimum mass of the GBI. The performance of the three staged GBI is validated using a ballistic missile intercept scenario modeled in Matlab/SIMULINK.

  • PDF

A Finite Memory Structure Smoothing Filter and Its Equivalent Relationship with Existing Filters (유한기억구조 스무딩 필터와 기존 필터와의 등가 관계)

  • Kim, Min Hui;Kim, Pyung Soo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.2
    • /
    • pp.53-58
    • /
    • 2021
  • In this paper, an alternative finite memory structure(FMS) smoothing filter is developed for discrete-time state-space model with a control input. To obtain the FMS smoothing filter, unbiasedness will be required beforehand in addition to a performance criteria of minimum variance. The FMS smoothing filter is obtained by directly solving an optimization problem with the unbiasedness constraint using only finite measurements and inputs on the most recent window. The proposed FMS smoothing filter is shown to have intrinsic good properties such as deadbeat and time-invariance. In addition, the proposed FMS smoothing filter is shown to be equivalent to existing FMS filters according to the delay length between the measurement and the availability of its estimate. Finally, to verify intrinsic robustness of the proposed FMS smoothing filter, computer simulations are performed for a temporary model uncertainty. Simulation results show that the proposed FMS smoothing filter can be better than the standard FMS filter and Kalman filter.

Modeling and Simulation Analysis of the Setup Reduction Method in Automobile Painting Process (자동차 도장 공정의 셋업 감소 방법 모델링 및 시뮬레이션 분석)

  • Han, Yong-Hee
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.3
    • /
    • pp.147-154
    • /
    • 2009
  • In this study we investigate the problem of reducing color change cost at painting operations in an automobile assembly plant. Changing control logic at conveyor junction points prior to the top coat line has been proposed and analyzed using the discrete event simulation model we developed using AutoMod. We also discussed the project which initiated this research as well as the details of painting operations. Simulation analysis showed that the grouping ratio increases from 1.8 to 2.5 if the proposed control logic change is applied to the plant. Contrary to other approaches such as using dedicated equipment for resequencing, our approach has the merit of less investment cost, no need for additional space consumption. We finally note that the grouping ratio can be further increased if our algorithms is implemented as well as CRS (Color Rescheduling Storage) is installed.