• Title/Summary/Keyword: adaptive experimental points

Search Result 50, Processing Time 0.021 seconds

The Image Segmentation Method using Adaptive Watershed Algorithm for Region Boundary Preservation

  • Kwon, Dong-Jin
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.39-46
    • /
    • 2019
  • This paper proposes an adaptive threshold watershed algorithm, which is the method used for image segmentation and boundary detection, which extends the region on the basis of regional minimum point. First, apply adaptive thresholds to determine regional minimum points. Second, it extends the region by applying adaptive thresholds based on determined regional minimum points. Traditional watershed algorithms create over-segmentation, resulting in the disadvantages of breaking boundaries between regions. These segmentation results mainly from the boundary of the object, creating an inaccurate region. To solve these problems, this paper applies an improved watershed algorithm applied with adaptive threshold in regional minimum point search and region expansion in order to reduce over-segmentation and breaking the boundary of region. This resulted in over-segmentation suppression and the result of having the boundary of precisely divided regions. The experimental results show that the proposed algorithm can apply adaptive thresholds to reduce the number of segmented regions and see that the segmented boundary parts are correct.

B-spline Curve Approximation Based on Adaptive Selection of Dominant Points (특징점들의 적응적 선택에 근거한 B-spline 곡선근사)

  • Lee J.H.;Park H.J.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.1
    • /
    • pp.1-10
    • /
    • 2006
  • This paper addresses B-spline curve approximation of a set of ordered points to a specified toterance. The important issue in this problem is to reduce the number of control points while keeping the desired accuracy in the resulting B-spline curve. In this paper we propose a new method for error-bounded B-spline curve approximation based on adaptive selection of dominant points. The method first selects from the given points initial dominant points that govern the overall shape of the point set. It then computes a knot vector using the dominant points and performs B-spline curve fitting to all the given points. If the fitted B-spline curve cannot approximate the points within the tolerance, the method selects more points as dominant points and repeats the curve fitting process. The knots are determined in each step by averaging the parameters of the dominant points. The resulting curve is a piecewise B-spline curve of order (degree+1) p with $C^{(p-2)}$ continuity at each knot. The shape index of a point set is introduced to facilitate the dominant point selection during the iterative curve fitting process. Compared with previous methods for error-bounded B-spline curve approximation, the proposed method requires much less control points to approximate the given point set with the desired shape fidelity. Some experimental results demonstrate its usefulness and quality.

A Study on feedrate Optimization System for Cutting Force Regulation (절삭력 추종을 위한 이송속도 최적화 시스템에 관한 연구)

  • 김성진;정영훈;조동우
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.4
    • /
    • pp.214-222
    • /
    • 2003
  • Studies on the optimization of machining process can be divided into two different approaches: off-line feedrate scheduling and adaptive control. Each approach possesses its respective strong and weak points compared to each other. That is, each system can be complementary to the other. In this regard, a combined system, which is a feedrate control system fur cutting force optimization, was proposed in this paper to make the best of each approach. Experimental results show that the proposed system could overcome the weak points of the off-line feedrate scheduling system and the adaptive control system. In addition, from the figure, it can be confirmed that the off-line feedrate scheduling technique can improve the machining quality and can fulfill its function in the machine tool which has a adaptive controller.

A Study on Feedrate Optimization System for Cutting Force Optimization (절삭력 최적화를 위한 이송속도 제어 시스템에 관한 연구)

  • 김성진;정영훈;조동우
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2002.10a
    • /
    • pp.135-140
    • /
    • 2002
  • Studies on the optimization of machining process can be divided into two different approaches: off-line feedrate scheduling and adaptive control. Each approach possesses its respective strong and weak points compared to each other. That is, each system can be complementary to the other. In this regard, a combined system, which is a feedrate control system for cutting force optimization, was proposed in this paper to make the best of each approach. Experimental results show that the proposed system could overcome the weak points of two systems.

  • PDF

Lyapunov Based Adaptive-Robust Control of the Non-Minimum phase DC-DC Converters Using Input-Output Linearization

  • Salimi, Mahdi;Zakipour, Adel
    • Journal of Power Electronics
    • /
    • v.15 no.6
    • /
    • pp.1577-1583
    • /
    • 2015
  • In this research, a combined adaptive-robust current controller is developed for non-minimum-phase DC-DC converters in a wide range of operations. In the proposed nonlinear controller, load resistance, input voltage and zero interval of the inductor current are estimated using developed adaptation rules and knowing the operating mode of the converter for the closed-loop control is not required; hence, a single controller can be employed for a wide load and line changes in discontinuous and continuous conduction operations. Using the TMS320F2810 digital signal processor, the experimental response of the proposed controller is presented in different operating points of the buck/boost converter. During transition between different modes of the converter, the developed controller has a better dynamic response compared with previously reported adaptive nonlinear approach. Moreover, output voltage steady-state error is zero in different conditions.

Nonlinear dynamics of an adaptive energy harvester with magnetic interactions and magnetostrictive transduction

  • Pedro V. Savi;Marcelo A. Savi
    • Smart Structures and Systems
    • /
    • v.33 no.4
    • /
    • pp.281-290
    • /
    • 2024
  • This work investigates the mechanical energy harvesting from smart and adaptive devices using magnetic interactions. The energy harvester is built from an elastic beam connected to an electric circuit by a magnetostrictive material that promotes energy transduction. Besides, magnetic interactions define the system stability characterizing multistable configurations. The adaptiveness is provided by magnets that can change their position with respect to the beam, changing the system configuration. A mathematical model is proposed considering a novel model to describe magnetic interactions based on the single-point magnet dipole method, but employing multiple points to represent the magnetic dipole, which is more effective to match experimental data. The adaptive behavior allows one to alter the system stability and therefore, its dynamical response. A nonlinear dynamics analysis is performed showing the possibilities to enhance energy harvesting capacity from the magnet position change. The strategy is to perform a system dynamical characterization and afterward, alter the energetic barrier according to the environmental energy sources. Results show interesting conditions where energy harvesting capacity is dramatically increased by changing the system characteristics.

Many-objective Evolutionary Algorithm with Knee point-based Reference Vector Adaptive Adjustment Strategy

  • Zhu, Zhuanghua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.2976-2990
    • /
    • 2022
  • The adaptive adjustment of reference or weight vectors in decomposition-based methods has been a hot research topic in the evolutionary community over the past few years. Although various methods have been proposed regarding this issue, most of them aim to diversify solutions in the objective space to cover the true Pareto fronts as much as possible. Different from them, this paper proposes a knee point-based reference vector adaptive adjustment strategy to concurrently balance the convergence and diversity. To be specific, the knee point-based reference vector adaptive adjustment strategy firstly utilizes knee points to construct the adaptive reference vectors. After that, a new fitness function is defined mathematically. Then, this paper further designs a many-objective evolutionary algorithm with knee point-based reference vector adaptive adjustment strategy, where the mating operation and environmental selection are designed accordingly. The proposed method is extensively tested on the WFG test suite with 8, 10 and 12 objectives and MPDMP with state-of-the-art optimizers. Extensive experimental results demonstrate the superiority of the proposed method over state-of-the-art optimizers and the practicability of the proposed method in tackling practical many-objective optimization problems.

An efficient response surface method considering the nonlinear trend of the actual limit state

  • Zhao, Weitao;Qiu, Zhiping;Yang, Yi
    • Structural Engineering and Mechanics
    • /
    • v.47 no.1
    • /
    • pp.45-58
    • /
    • 2013
  • In structural reliability analysis, the response surface method is a powerful method to evaluate the probability of failure. However, the location of experimental points used to form a response surface function must be selected in a judicious way. It is necessary for the highly nonlinear limit state functions to consider the design point and the nonlinear trend of the limit state, because both of them influence the probability of failure. In this paper, in order to approximate the actual limit state more accurately, experimental points are selected close to the design point and the actual limit state, and consider the nonlinear trend of the limit state. Linear, quadratic and cubic polynomials without mixed terms are utilized to approximate the actual limit state. The direct Monte Carlo simulation on the approximated limit state is carried out to determine the probability of failure. Four examples are given to demonstrate the efficiency and the accuracy of the proposed method for both numerical and implicit limit states.

An Advanced Successive Elimination Algorithm Using Mean Absolute Difference of Neighboring Search Points (경계점의 절대 오차 평균을 이용한 개선된 연속 제거 알고리즘)

  • Jung, Soo-Mok
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.5
    • /
    • pp.755-760
    • /
    • 2004
  • In this paper, an advanced successive elimination algorithm was proposed using mean absolute difference of neighboring search points. By using mean absolute difference of neighboring search points, the search point in motion estimation can be eliminated effeciently without matching evaluation that requires very intensive computations. By using adaptive MAD calculation algorithm, the candidate matching block can be eliminated early. So, the number of the proposed algrorithm was verified by experimental results.

  • PDF

Surf points based Moving Target Detection and Long-term Tracking in Aerial Videos

  • Zhu, Juan-juan;Sun, Wei;Guo, Bao-long;Li, Cheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5624-5638
    • /
    • 2016
  • A novel method based on Surf points is proposed to detect and lock-track single ground target in aerial videos. Videos captured by moving cameras contain complex motions, which bring difficulty in moving object detection. Our approach contains three parts: moving target template detection, search area estimation and target tracking. Global motion estimation and compensation are first made by grids-sampling Surf points selecting and matching. And then, the single ground target is detected by joint spatial-temporal information processing. The temporal process is made by calculating difference between compensated reference and current image and the spatial process is implementing morphological operations and adaptive binarization. The second part improves KALMAN filter with surf points scale information to predict target position and search area adaptively. Lastly, the local Surf points of target template are matched in this search region to realize target tracking. The long-term tracking is updated following target scaling, occlusion and large deformation. Experimental results show that the algorithm can correctly detect small moving target in dynamic scenes with complex motions. It is robust to vehicle dithering and target scale changing, rotation, especially partial occlusion or temporal complete occlusion. Comparing with traditional algorithms, our method enables real time operation, processing $520{\times}390$ frames at around 15fps.