• Title/Summary/Keyword: Minimization methods

Search Result 343, Processing Time 0.024 seconds

RECENT ADVANCES IN DOMAIN DECOMPOSITION METHODS FOR TOTAL VARIATION MINIMIZATION

  • LEE, CHANG-OCK;PARK, JONGHO
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.24 no.2
    • /
    • pp.161-197
    • /
    • 2020
  • Total variation minimization is standard in mathematical imaging and there have been numerous researches over the last decades. In order to process large-scale images in real-time, it is essential to design parallel algorithms that utilize distributed memory computers efficiently. The aim of this paper is to illustrate recent advances of domain decomposition methods for total variation minimization as parallel algorithms. Domain decomposition methods are suitable for parallel computation since they solve a large-scale problem by dividing it into smaller problems and treating them in parallel, and they already have been widely used in structural mechanics. Differently from problems arising in structural mechanics, energy functionals of total variation minimization problems are in general nonlinear, nonsmooth, and nonseparable. Hence, designing efficient domain decomposition methods for total variation minimization is a quite challenging issue. We describe various existing approaches on domain decomposition methods for total variation minimization in a unified view. We address how the direction of research on the subject has changed over the past few years, and suggest several interesting topics for further research.

Object Tracking Based on Exactly Reweighted Online Total-Error-Rate Minimization (정확히 재가중되는 온라인 전체 에러율 최소화 기반의 객체 추적)

  • JANG, Se-In;PARK, Choong-Shik
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.4
    • /
    • pp.53-65
    • /
    • 2019
  • Object tracking is one of important steps to achieve video-based surveillance systems. Object tracking is considered as an essential task similar to object detection and recognition. In order to perform object tracking, various machine learning methods (e.g., least-squares, perceptron and support vector machine) can be applied for different designs of tracking systems. In general, generative methods (e.g., principal component analysis) were utilized due to its simplicity and effectiveness. However, the generative methods were only focused on modeling the target object. Due to this limitation, discriminative methods (e.g., binary classification) were adopted to distinguish the target object and the background. Among the machine learning methods for binary classification, total error rate minimization can be used as one of successful machine learning methods for binary classification. The total error rate minimization can achieve a global minimum due to a quadratic approximation to a step function while other methods (e.g., support vector machine) seek local minima using nonlinear functions (e.g., hinge loss function). Due to this quadratic approximation, the total error rate minimization could obtain appropriate properties in solving optimization problems for binary classification. However, this total error rate minimization was based on a batch mode setting. The batch mode setting can be limited to several applications under offline learning. Due to limited computing resources, offline learning could not handle large scale data sets. Compared to offline learning, online learning can update its solution without storing all training samples in learning process. Due to increment of large scale data sets, online learning becomes one of essential properties for various applications. Since object tracking needs to handle data samples in real time, online learning based total error rate minimization methods are necessary to efficiently address object tracking problems. Due to the need of the online learning, an online learning based total error rate minimization method was developed. However, an approximately reweighted technique was developed. Although the approximation technique is utilized, this online version of the total error rate minimization could achieve good performances in biometric applications. However, this method is assumed that the total error rate minimization can be asymptotically achieved when only the number of training samples is infinite. Although there is the assumption to achieve the total error rate minimization, the approximation issue can continuously accumulate learning errors according to increment of training samples. Due to this reason, the approximated online learning solution can then lead a wrong solution. The wrong solution can make significant errors when it is applied to surveillance systems. In this paper, we propose an exactly reweighted technique to recursively update the solution of the total error rate minimization in online learning manner. Compared to the approximately reweighted online total error rate minimization, an exactly reweighted online total error rate minimization is achieved. The proposed exact online learning method based on the total error rate minimization is then applied to object tracking problems. In our object tracking system, particle filtering is adopted. In particle filtering, our observation model is consisted of both generative and discriminative methods to leverage the advantages between generative and discriminative properties. In our experiments, our proposed object tracking system achieves promising performances on 8 public video sequences over competing object tracking systems. The paired t-test is also reported to evaluate its quality of the results. Our proposed online learning method can be extended under the deep learning architecture which can cover the shallow and deep networks. Moreover, online learning methods, that need the exact reweighting process, can use our proposed reweighting technique. In addition to object tracking, the proposed online learning method can be easily applied to object detection and recognition. Therefore, our proposed methods can contribute to online learning community and object tracking, detection and recognition communities.

Loss Minimization Control of Interior Permanent Magnet Synchronous Motors Considering Self-Saturation and Cross-Saturation

  • Pairo, Hamidreza;Khanzade, Mohammad;Shoulaie, Abbas
    • Journal of Power Electronics
    • /
    • v.18 no.4
    • /
    • pp.1099-1110
    • /
    • 2018
  • In this paper, a loss minimization control method for interior permanent magnet synchronous motors is presented with considering self-saturation and cross saturation. According to variation of the d-axis and q-axis inductances by different values of the d-axis and q-axis components of currents, it is necessary to consider self-saturation and cross saturation in the loss minimization control method. In addition, the iron loss resistance variation due to frequency variation is considered in the condition of loss minimization. Furthermore, the loss minimization control method is compared with maximum torque per ampere (MTPA), unity power factor (UPF) and $i_d=0$ control methods. Experimental results verify the performance and proper dynamic response of the loss minimization control method with considering self-saturation and cross saturation.

Edge Detection using Enhanced Cost Minimization Methods

  • Seong-Hoon Lee
    • International journal of advanced smart convergence
    • /
    • v.13 no.2
    • /
    • pp.88-93
    • /
    • 2024
  • The main problem with existing edge detection techniques is that they have many limitations in detecting edges for complex and diverse images that exist in the real world. This is because only edges of a defined shape are discovered based on an accurate definition of the edge. One of the methods to solve this problem is the cost minimization method. In the cost minimization method, cost elements and cost functions are defined and used. The cost function calculates the cost for the candidate edge model generated according to the candidate edge generation strategy, and if the cost is found to be satisfactory, the candidate edge model becomes the edge for the image. In this study, we proposed an enhanced candidate edge generation strategy to discover edges for more diverse types of images in order to improve the shortcoming of the cost minimization method, which is that it only discovers edges of a defined type. As a result, improved edge detection results were confirmed.

Cost Minimization of Solidity Smart Contracts on Blockchain Systems

  • Lee, Wan Yeon
    • International journal of advanced smart convergence
    • /
    • v.9 no.2
    • /
    • pp.157-163
    • /
    • 2020
  • Recently the blockchain technology has been actively studied due to its great potentiality. The smart contract is a key mechanism of the blockchain system. Due to the short history of the smart contract, many issues have not been solved yet. One main issue is vulnerability and another main issue is cost optimization. While the vulnerability of smart contract has been actively studied, the cost optimization has been rarely studied. In this paper, we propose two cost optimization methods for smart contracts running on the blockchain system. Triggering a function in a smart contract program code may require costs and it is repeated continuously. So the minimization of costs required to trigger a function of smart contract while maintaining the performance equally is very important. The proposed two methods minimize the usage of expensive permanent variables deployed on the blockchain system. We apply the proposed two methods to three prevalent blockchain platforms: Ethereum, Klaytn and Tron. Evaluation experiments verify that the proposed scheme significantly reduces the costs of functions in the smart contract written with Solidity.

Geometric Hermite Curves Based on Curvature Variation Minimization

  • Chi, Jing;Zhang, Caiming;Wu, Xiaoming
    • International Journal of CAD/CAM
    • /
    • v.6 no.1
    • /
    • pp.65-71
    • /
    • 2006
  • Based on the smoothness criterion of minimum curvature variation of the curve, tangent angle constraints guaranteeing an optimized geometric Hermite (OGH) curve both mathematically and geometrically smooth is given, and new methods for constructing composite optimized geometric Hermite (COH) curves are presented in this paper. The comparison of the new methods with Yong and Cheng's methods based on strain energy minimization is included.

A Visual-Based Logic Minimization Method

  • Kim, Eun-Gi
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.16 no.5
    • /
    • pp.9-19
    • /
    • 2011
  • In many instances a concise form of logic is often required for building today's complex systems. The method described in this paper can be used for a wide range of industrial applications that requires Boolean type of logic minimization. Unlike some of the previous logic minimization methods, the proposed method can be used to better gain insights into the logic minimization process. Based on the decimal valued matrix, the method described here can be used to find an exact minimized solution for a given Boolean function. It is a visual based method that primarily relies on grouping the cell values within the matrix. At the same time, the method is systematic to the extent that it can also be computerized. Constructing the matrix to visualize a logic minimization problem should be relatively easy for the most part, particularly if the computer-generated graphs are accompanied.

The solution of single-variable minimization using neural network

  • Son, Jun-Hyug;Seo, Bo-Hyeok
    • Proceedings of the KIEE Conference
    • /
    • 2004.07d
    • /
    • pp.2528-2530
    • /
    • 2004
  • Neural network minimization problems are often conditioned and in this contribution way to handle this will be discussed. It is shown that a better conditioned minimization problem can be obtained if the problem is separated with respect to the linear parameters. This will increase the convergence speed of the minimization. One of the most powerful uses of neural networks is in function approximation(curve fitting)[1]. A main characteristic of this solution is that function (f) to be approximated is given not explicitly but implicitly through a set of input-output pairs, named as training set, that can be easily obtained from calibration data of the measurement system. In this context, the usage of Neural Network(NN) techniques for modeling the systems behavior can provide lower interpolation errors when compared with classical methods like polynomial interpolation. This paper solve of single-variable minimization using neural network.

  • PDF

A MEMORY EFFICIENT INCREMENTAL GRADIENT METHOD FOR REGULARIZED MINIMIZATION

  • Yun, Sangwoon
    • Bulletin of the Korean Mathematical Society
    • /
    • v.53 no.2
    • /
    • pp.589-600
    • /
    • 2016
  • In this paper, we propose a new incremental gradient method for solving a regularized minimization problem whose objective is the sum of m smooth functions and a (possibly nonsmooth) convex function. This method uses an adaptive stepsize. Recently proposed incremental gradient methods for a regularized minimization problem need O(mn) storage, where n is the number of variables. This is the drawback of them. But, the proposed new incremental gradient method requires only O(n) storage.

A Study on Optimization of Lane-Use and Traffic Signal Timing at a Signalized Intersection (신호교차로의 차로 배정과 신호시간 최적화 모형에 관한 연구)

  • Kim, Ju Hyun;Shin, Eon Kyo
    • International Journal of Highway Engineering
    • /
    • v.17 no.5
    • /
    • pp.93-103
    • /
    • 2015
  • PURPOSES : The purpose of this study is to present a linear programing optimization model for the design of lane-based lane-uses and signal timings for an isolated intersection. METHODS: For the optimization model, a set of constraints for lane-uses and signal settings are identified to ensure feasibility and safety of traffic flow. Three types of objective functions are introduced for optimizing lane-uses and signal operation, including 1) flow ratio minimization of a dual-ring signal control system, 2) cycle length minimization, and 3) capacity maximization. RESULTS : The three types of model were evaluated in terms of minimizing delay time. From the experimental results, the flow ratio minimization model proved to be more effective in reducing delay time than cycle length minimization and capacity maximization models and provided reasonable cycle lengths located between those of other two models. CONCLUSIONS : It was concluded that the flow ratio minimization objective function is the proper one to implement for lane-uses and signal settings optimization to reduce delay time for signalized intersections.