• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4429-4447
• /
• 2018

Local binary descriptors are well-suited for many real-time and/or large-scale computer vision applications, while their low computational complexity is usually accompanied by the limitation of performance. In this paper, we propose a new optimization framework, RLDB (Robust-LDB), to improve a typical region-based binary descriptor LDB (local difference binary) and maintain its computational simplicity. RLDB extends the multi-feature strategy of LDB and applies a more complete region-comparing configuration. A cascade bit selection method is utilized to select the more representative patterns from massive comparison pairs and an online learning strategy further optimizes descriptor for each specific patch separately. They both incorporate LDP (linear discriminant projections) principle to jointly guarantee the robustness and distinctiveness of the features from various scales. Experimental results demonstrate that this integrated learning framework significantly enhances LDB. The improved descriptor achieves a performance comparable to floating-point descriptors on many benchmarks and retains a high computing speed similar to most binary descriptors, which better satisfies the demands of applications.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.3
• /
• pp.821-831
• /
• 2014

Stochastic rainfall generators or stochastic simulation have been widely employed to generate synthetic rainfall sequences which can be used in hydrologic models as inputs. The calibration of Poisson cluster stochastic rainfall generator (e.g. Modified Bartlett-Lewis Rectangular Pulse, MBLRP) is seriously affected by local minima that is usually estimated from the local optimization algorithm. In this regard, global optimization techniques such as particle swarm optimization and shuffled complex evolution algorithm have been proposed to better estimate the parameters. Although the global search algorithm is designed to avoid the local minima, reliable parameter estimation of MBLRP model is not always feasible especially in a limited parameter space. In addition, uncertainty associated with parameters in the MBLRP rainfall generator has not been properly addressed yet. In this sense, this study aims to develop and test a Bayesian model based parameter estimation method for the MBLRP rainfall generator that allow us to derive the posterior distribution of the model parameters. It was found that the HBM based MBLRP model showed better performance in terms of reproducing rainfall statistic and underlying distribution of hourly rainfall series.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.40 no.3
• /
• pp.215-221
• /
• 2012

In this paper, we introduce an optimization method to improve pursuit performance of a pursuer in a pursuit-evasion game (PEG). Pursuers build a probability map and employ a hybrid pursuit policy which combines the merits of local-max and global-max pursuit policies to search and capture evaders as soon as possible in a 2-dimensional space. We propose an episodic parameter optimization (EPO) algorithm to learn good values for the weighting parameters of a hybrid pursuit policy. The EPO algorithm is performed while many episodes of the PEG are run repeatedly and the reward of each episode is accumulated using reinforcement learning, and the candidate weighting parameter is selected in a way that maximizes the total averaged reward by using the golden section search method. We found the best pursuit policy in various situations which are the different number of evaders and the different size of spaces and analyzed results.

• Journal of computational fluids engineering
• /
• v.11 no.2 s.33
• /
• pp.19-24
• /
• 2006

A research to evaluate the efficiency of design optimization was carried out for aerodynamic design optimization problem in distributed computing environment. The aerodynamic analyses which take most of computational work during design optimization were divided into several jobs and allocated to associated PC clients through network. This is not a parallel process based on domain decomposition in a single analysis rather than a simultaneous distributed-analyses using network-distributed computers. GBOM(gradient-based optimization method), SAO(Sequential Approximate Optimization) and RSM(Response Surface Method) were implemented to perform design optimization of transonic airfoils and evaluate their efficiencies. dimensional minimization followed by direction search involved in the GBOM was found an obstacle against improving efficiency of the design process in the present distributed computing system. The SAO was found fairly suitable for the distributed computing environment even it has a handicap of local search. The RSM is apparently the most efficient algorithm in the present distributed computing environment, but additional trial and error works needed to enhance the reliability of the approximation model deteriorate its efficiency from the practical point of view.

• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.2
• /
• pp.268-283
• /
• 2016

Aircraft manufacturing companies have to consider multiple derivatives to satisfy various market requirements. They modify or extend an existing aircraft to meet new market demands while keeping the development time and cost to a minimum. Many researchers have studied the derivative design process, but these research efforts consider baseline and derivative designs together, while using the whole set of design variables. Therefore, an efficient process that can reduce cost and time for aircraft derivative design is needed. In this research, a more efficient design process is proposed which obtains global changes from local changes in aircraft design in order to develop aircraft derivatives efficiently. Sensitivity analysis was introduced to remove unnecessary design variables that have a low impact on the objective function. This prevented wasting computational effort and time on low priority variables for design requirements and objectives. Additionally, uncertainty from the fidelity of analysis tools was considered in design optimization to increase the probability of optimization results. The Reliability Based Design Optimization (RBDO) and Possibility Based Design Optimization (PBDO) methods were proposed to handle the uncertainty in aircraft conceptual design optimization. In this paper, Collaborative Optimization (CO) based framework with RBDO and PBDO was implemented to consider uncertainty. The proposed method was applied for civil jet aircraft derivative design that increases cruise range and the number of passengers. The proposed process provided deterministic design optimization, RBDO, and PBDO results for given requirements.

• Journal of the Korean Society of Industry Convergence
• /
• v.25 no.1
• /
• pp.121-129
• /
• 2022

With the recent increase in international trade volume the trade volume through ships is also continuously increasing. The treatment of ballast water goes through the following five steps, samples are taken and analyzed at each step, and samples are obtained using a suction pump. These suction pumps have low efficiency and thus need to be improved. In this study, it is to optimize the form of the impeller which affects directly improvements of performance to determine the capacity of suction pump and to fulfill the purpose of this research. To do it, we have carried out parametric design as an input variable, geometric form for the impeller. By conducting the flow analysis for the optimum form, it has confirmed the value of improved results and achieved the purpose to study in this paper. It has selected the necessary parameter for optimizing the form of the pump impeller and analyzed the property using experiment design. And it can reduce the factor of parameter for local optimization from findings to analyze the property of form parameter. To perform MOGA(Multi-Objective Genetic Algorithm) it has generated response surface using parameters for local optimization and conducts the optimization using multi-objective genetic algorithm. with created experiment cases, it has performed the computational fluid dynamics with model applying the optimized impeller form and checked that the capacity of the pump was improved. It could verify the validity concerning the improvement of pump efficiency, via optimization of pump impeller form which is suggested in this study.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.2
• /
• pp.507-528
• /
• 2022

We propose a path integral method to construct a time stepwise local volatility for the stock index market under Dupire's model. Our method is focused on the pricing with the Monte Carlo Method (MCM). We solve the problem of randomness of MCM by applying numerical integration. We reconstruct this task as a matrix equation. Our method provides the analytic Jacobian and Hessian required by the nonlinear optimization solver, resulting in stable and fast calculations.

• Water for future
• /
• v.28 no.2
• /
• pp.169-180
• /
• 1995

The cost of a looped pipe network is affected by a set of loop flows. The mathematical model for optimizing the looped pipe network is expressed in the optimal set of loop flows to apply to a stochastic optimization method. Because the feasible region of the looped pipe network problem is nonconvex with multiple local optima, the Modified Stochastic Probing Method is suggested to efficiently search the feasible region. The method consists of two phase: i) a global search phase(the stochastic probing method) and ii) a local search phase(the nearest neighbor method). While the global search sequentially improves a local minimum, the local search escapes out of a local minimum trapped in the global search phase and also refines a final solution. In order to test the method, a standard test problem from the literature is considered for the optimal design of the paralled expansion of an existing network. The optimal solutions thus found have significantly smaller costs than the ones reported previously by other researchers.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.12
• /
• pp.1048-1055
• /
• 2002

The problem of generating torch paths for 2D laser cutting of a stock plate nested with a set of free-formed parts is investigated. The objective is to minimize the total length of the torch path starting from a blown depot, then visiting all the given Parts, and retuning back to the depot. A torch Path consists of the depot and Piercing Points each of which is to be specified for cutting a part. The torch path optimization problem is shown to be formulated as an extended version of the standard travelling salesman problem To solve the problem, a hybrid genetic algorithm is proposed. In order to improve the speed of evolution convergence, the algorithm employs a genetic algorithm for global search and a combination of an optimization technique and a genetic algorithm for local optimization. Traditional genetic operators developed for continuous optimization problems are used to effectively deal with the continuous nature of piercing point positions. Computational results are provided to illustrate the validity of the proposed algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.857-862
• /
• 2004

This paper analyzes properties of the recently developed nonlinear optimization method, Dynamic Encoding Algorithm for Searches (DEAS) [1]. DEAS locates local minima with binary strings (or binary matrices for multi-dimensional problems) by iterating the two operators; bisectional search (BSS) and unidirectional search (UDS). BSS increases binary strings by one digit (i.e., zero or one), while UDS performs increment or decrement to binary strings with no change of string length. Owing to these search routines, DEAS retains the optimization capability that combines the special features of several conventional optimization methods. In this paper, a special feature of BSS and UDS in DEAS is analyzed. In addition, a effective global search strategy is established by using information of DEAS. Effectiveness of the proposed global search strategy is validated through the well-known benchmark functions.