• Title/Summary/Keyword: Approximation algorithm

Search Result 983, Processing Time 0.027 seconds

Initial Point Optimization for Square Root Approximation based on Newton-Raphson Method (Newton-Raphson 방식의 제곱근 근사를 위한 초기값의 최적화)

  • Choi Chang-Soon;Lee Jin-Yong;Kim Young-Lok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.3 s.345
    • /
    • pp.15-20
    • /
    • 2006
  • A Newton-Raphson Method for table driven algorithm is presented in this paper. We concentrate the approximation of square root by using Newton-Raphson method. We confirm that this method has advantages of accurate and fast processing with optimized initial point. Hence the selection of the fitted initial points used in approximation of Newton-Raphson algorithm is important issue. This paper proposes that log scale based on geometric wean is most profitable initial point. It shows that the proposed method givemore accurate results with faster processing speed.

A Global Robust Optimization Using the Kriging Based Approximation Model (크리깅 근사모델을 이용한 전역적 강건최적설계)

  • Park Gyung-Jin;Lee Kwon-Hee
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.9 s.240
    • /
    • pp.1243-1252
    • /
    • 2005
  • A current trend of design methodologies is to make engineers objectify or automate the decision-making process. Numerical optimization is an example of such technologies. However, in numerical optimization, the uncertainties are uncontrollable to efficiently objectify or automate the process. To better manage these uncertainties, the Taguchi method, reliability-based optimization and robust optimization are being used. To obtain the target performance with the maximum robustness is the main functional requirement of a mechanical system. In this research, a design procedure for global robust optimization is developed based on the kriging and global optimization approaches. The DACE modeling, known as the one of Kriging interpolation, is introduced to obtain the surrogate approximation model of the function. Robustness is determined by the DACE model to reduce real function calculations. The simulated annealing algorithm of global optimization methods is adopted to determine the global robust design of a surrogated model. As the postprocess, the first order second-moment approximation method is applied to refine the robust optimum. The mathematical problems and the MEMS design problem are investigated to show the validity of the proposed method.

Determination of Initial Billet Size using The Artificial Neural Networks and The Finite Element Method for a Forged Product (신경망과 유한요소법을 이용한 단조품의 초기 소재 형상 결정)

  • 김동진;고대철;김병민;최재찬
    • Transactions of Materials Processing
    • /
    • v.4 no.3
    • /
    • pp.214-221
    • /
    • 1995
  • In the paper, we have proposed a new method to determine the initial billet for the forged products using a function approximation in the neural network. The architecture of neural network is a three-layer neural network and the back propagation algorithm is employed to train the network. By utilizing the ability of function approximation of a neural network, an optimal billet is determined by applying the nonlinear mathematical relationship between the aspect ratios in the initial billet and the final products. The amount of incomplete filling in the die is measured by the rigid-plastic finite element method. The neural network is trained with the initial billet aspect ratios and those of the unfilled volumes. After learning, the system is able to predict the filling regions which are exactly the same or slightly different to the results of finite element simulation. This new method is applied to find the optimal billet size for the plane strain rib-web product in cold forging. This would reduce the number of finite element simulation for determining the optimal billet size of forging product, further it is usefully adapted to physical modeling for the forging design.

  • PDF

Conservative Approximation-Based Full-Search Block Matching Algorithm Architecture for QCIF Digital Video Employing Systolic Array Architecture

  • Ganapathi, Hegde;Amritha, Krishna R.S.;Pukhraj, Vaya
    • ETRI Journal
    • /
    • v.37 no.4
    • /
    • pp.772-779
    • /
    • 2015
  • This paper presents a power-efficient hardware realization for a motion estimation technique that is based on the full-search block matching algorithm (FSBMA). The considered input is the quarter common intermediate format of digital video. The mean of absolute difference (MAD) is the distortion criteria employed for the block matching process. The conventional architecture considered for the hardware realization of FSBMA is that of the shift register-based 2-D systolic array. For this architecture, a conservative approximation technique is adapted to eliminate unnecessary MAD computations involved in the block matching process. Upon introducing the technique to the conventional architecture, the power and complexity of its implantation is reduced, while the accuracy of the motion vector extracted from the block matching process is preserved. The proposed architecture is verified for its functional specifications. A performance evaluation of the proposed architecture is carried out using parameters such as power, area, operating frequency, and efficiency.

Skin Region Detection Using a Mean Shift Algorithm Based on the Histogram Approximation

  • Byun, Ki-Won;Nam, Ki-Gon;Ye, Soo-Young
    • Transactions on Electrical and Electronic Materials
    • /
    • v.13 no.1
    • /
    • pp.10-15
    • /
    • 2012
  • In conventional, skin detection methods using for skin color definitions is based on prior knowledge. By experimentation, the threshold value for dividing the background from the skin region is determined subjectively. A drawback of such techniques is that their performance is dependent on a threshold value which is estimated from repeated experiments. To overcome this, the present paper introduces a skin region detection method. This method uses a histogram approximation based on the mean shift algorithm. This proposed method applies the mean shift procedure to a histogram of a skin map of the input image. It is generated by comparing with the standard skin colors in the $C_bC_r$ color space. It divides the background from the skin region by selecting the maximum value according to the brightness level. As the histogram has the form of a discontinuous function. It is accumulated according to the brightness values of the pixels. It is then, approximated by a Gaussian mixture model (GMM) using the Bezier curve technique. Thus, the proposed method detects the skin region using the mean shift procedure to determine a maximum value. Rather than using a manually selected threshold value, as in existing techniques this becomes the dividing point. Experiments confirm that the new procedure effectively detects the skin region.

Optimal Design of Fuzzy-Neural Networkd Structure Using HCM and Hybrid Identification Algorithm (HCM과 하이브리드 동정 알고리즘을 이용한 퍼지-뉴럴 네트워크 구조의 최적 설계)

  • Oh, Sung-Kwun;Park, Ho-Sung;Kim, Hyun-Ki
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.50 no.7
    • /
    • pp.339-349
    • /
    • 2001
  • This paper suggests an optimal identification method for complex and nonlinear system modeling that is based on Fuzzy-Neural Networks(FNN). The proposed Hybrid Identification Algorithm is based on Yamakawa's FNN and uses the simplified inference as fuzzy inference method and Error Back Propagation Algorithm as learning rule. In this paper, the FNN modeling implements parameter identification using HCM algorithm and hybrid structure combined with two types of optimization theories for nonlinear systems. We use a HCM(Hard C-Means) clustering algorithm to find initial apexes of membership function. The parameters such as apexes of membership functions, learning rates, and momentum coefficients are adjusted using hybrid algorithm. The proposed hybrid identification algorithm is carried out using both a genetic algorithm and the improved complex method. Also, an aggregated objective function(performance index) with weighting factor is introduced to achieve a sound balance between approximation and generalization abilities of the model. According to the selection and adjustment of a weighting factor of an aggregate objective function which depends on the number of data and a certain degree of nonlinearity(distribution of I/O data), we show that it is available and effective to design an optimal FNN model structure with mutual balance and dependency between approximation and generalization abilities. To evaluate the performance of the proposed model, we use the time series data for gas furnace, the data of sewage treatment process and traffic route choice process.

  • PDF

The Study of Pre-processing Algorithm for Improving Efficiency of Optical Flow Method on Ultrasound Image (초음파 영상에서의 Optical Flow 추적 성능 향상을 위한 전처리 알고리즘 개발 연구)

  • Kim, Sung-Min;Lee, Ju-Hwan;Roh, Seung-Gyu;Park, Sung-Yun
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.47 no.5
    • /
    • pp.24-32
    • /
    • 2010
  • In this study, we have proposed a pre-processing algorithm newly developed for improving the tracking efficiency of the optical flow method. The developed pre-processing algorithm consists of a median filter, binarization, morphology, canny edge, contour detecting and an approximation method. In order to evaluate whether the optical flow tracking capacity increases, this study applied the pre-processing algorithm to the Lucas-Kanade(LK) optical flow algorithm, and comparatively analyzed its images and tracking results with those of optical flow without the pre-processing algorithm and with the existing pre-processing algorithm(composed of median filter and histogram equalization). As a result, it was observed that the tracking performance derived from the LK optical flow algorithm with the pre-processing algorithm, shows better tracking accuracy, compared to the one without the pre-processing algorithm and the one with the existing pre-processing algorithm. It seems to have resulted by successful segmentation for characteristic areas and subdivision into inner and outer contour lines.

Wavelet network approximation and coefficient learning of linear-time-varying system (시변 선형 시스템의 웨이브렛망 근사화와 가중치의 학습)

  • 이영석;김동옥;서보혁
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1997.10a
    • /
    • pp.728-731
    • /
    • 1997
  • This paper discusses approximation modelling of discrete-time linear time-varying system(LTVS). The wavelet transform is considered as a tool for representing and approximating a LTVS. The joint time-frequency properties of wave analysis are appropriate for describing the LTVS. Simulation results is included to illustrate the potential application of the technique.

  • PDF

Robust Control of Piezo Actuator using Wavelet Networks (웨이블릿 네트워크를 이용한 압전 구동기의 견실제어)

  • Yang, Chang-Kwan;Lim, Joon-Hong
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.723-725
    • /
    • 2004
  • An iterative robust control design for PZT using Gaussian wavelet networks is proposed. A Gaussian wavelet network with accurate approximation capability is employed to approximate the nonlinear hysteresis dynamics of PZT systems by using an iterative control algorithm. Depending on the finite number of wavelet basis functions which results in unavoidable approximation errors, a robust control law is provided to guarantee the stability of the closed-loop nano positioning system. Finally, the effectiveness of the robust control approach is illustrated through comparative simulations on a PZT.

  • PDF

Generation of SAC using a ASMOD and a Hybrid curve approximation (ASMOD와 혼합 곡선 근사법을 이용한 SAC의 생성)

  • 김현철;이경선;김수영
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.10a
    • /
    • pp.435-438
    • /
    • 1997
  • This paper presents the process generating a SAC(Sectional Area Cure) by using ASMOD(Adaptive Spline Modeling of Observation Data). That is, we define SACs of real ships as B-spline curves by a hybrid cure approximation(which is the combination method of a B-spline fitting method and a genetic algorithm) and accumulate a database of control points. Then we let ASMOD learn from the correlation principal dimensions with control points.

  • PDF