• Title/Summary/Keyword: Minimization

Search Result 2,669, Processing Time 0.028 seconds

Weighted Parameter Analysis of L1 Minimization for Occlusion Problem in Visual Tracking (영상 추적의 Occlusion 문제 해결을 위한 L1 Minimization의 Weighted Parameter 분석)

  • Wibowo, Suryo Adhi;Jang, Eunseok;Lee, Hansoo;Kim, Sungshin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.101-103
    • /
    • 2016
  • Recently, the target object can be represented as sparse coefficient vector in visual tracking. Due to this reason, exploitation of the compressibility in the transform domain by using L1 minimization is needed. Further, L1 minimization is proposed to handle the occlusion problem in visual tracking, since tracking failures mostly are caused by occlusion. Furthermore, there is a weighted parameter in L1 minimization that influences the result of this minimization. In this paper, this parameter is analyzed for occlusion problem in visual tracking. Several coefficients that derived from median value of the target object, mean value of the arget object, the standard deviation of the target object are, 0, 0.1, and 0.01 are used as weighted parameter of L1 minimization. Based on the experimental results, the value which is equal to 0.1 is suggested as weighted parameter of L1 minimization, due to achieved the best result of success rate and precision performance parameter. Both of these performance parameters are based on one pass evaluation (OPE).

  • PDF

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.

Exerted force minimization for weak points in cooperating multiple robot arms

  • Shin, Young-Dal;Chung, Myung-Jin
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1990.10b
    • /
    • pp.1167-1172
    • /
    • 1990
  • This paper discusses a force distribution scheme which minimizes the weighted norm of the forces/torques applied on weak points of cooperating multiple robot arms. The scheme is proposed to avoid the damage or unwanted motion of any weak point of robots or object stemming from excessive forces/torques. Since the proposed scheme can be used for either the joint torque minimization or the exerted force minimization on the object, it can be regarded as a unified force minimization method for multiple robot arms. The computational complexity in this scheme is analyzed using the properties of Jarcobian. Simulation of two identical PUMA robots held an object is carried out to illustrate the proposed scheme. By the proper choice of the weighting matrix in the performance index, we show that force minimization for a weak point can be achieved, and that the exerted force minimization on the object can be changed to the joint torque minimization.

  • PDF

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.

Evaluation of Image Quality in Micro-CT System Using Constrained Total Variation (TV) Minimization (Micro-CT 시스템에서 제한된 조건의 Total Variation (TV) Minimization을 이용한 영상화질 평가)

  • Jo, Byung-Du;Choi, Jong-Hwa;Kim, Yun-Hwan;Lee, Kyung-Ho;Kim, Dae-Hong;Kim, Hee-Joung
    • Progress in Medical Physics
    • /
    • v.23 no.4
    • /
    • pp.252-260
    • /
    • 2012
  • The reduction of radiation dose from x-ray is a main concern in computed tomography (CT) imaging due to the side-effect of the dose on human body. Recently, the various methods for dose reduction have been studied in CT and one of the method is a iterative reconstruction based on total variation (TV) minimization at few-views data. In this paper, we evaluated the image quality between total variation (TV) minimization algorithm and Feldkam-Davis-kress (FDK) algorithm in micro computed tomography (CT). To evaluate the effect of TV minimization algorithm, we produced a cylindrical phantom including contrast media, water, air inserts. We can acquire maximum 400 projection views per rotation of the x-ray tube and detector. 20, 50, 90, 180 projection data were chosen for evaluating the level of image restoration by TV minimization. The phantom and mouse image reconstructed with FDK algorithm at 400 projection data used as a reference image for comparing with TV minimization and FDK algorithm at few-views. Contrast-to-noise ratio (CNR), Universal quality index (UQI) were used as a image evaluation metric. When projection data are not insufficient, our results show that the image quality of reconstructed with TV minimization is similar to reconstructed image with FDK at 400 view. In the cylindrical phantom study, the CNR of TV image was 5.86, FDK image was 5.65 and FDK-reference was 5.98 at 90-views. The CNR of TV image 0.21 higher than FDK image CNR at 90-views. UQI of TV image was 0.99 and FDK image was 0.81 at 90-views. where, the number of projection is 90, the UQI of TV image 0.18 higher than FDK image at 90-views. In the mouse study UQI of TV image was 0.91, FDK was 0.83 at 90-views. the UQI of TV image 0.08 higher than FDK image at 90-views. In cylindrical phantom image and mouse image study, TV minimization algorithm shows the best performance in artifact reduction and preserving edges at few view data. Therefore, TV minimization can potentially be expected to reduce patient dose in clinics.

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.

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.

Development of Step Drill Geometry for Burr Minimization (버형성 최소화를 위한 스텝드릴 개발)

  • 장재은;고성림
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.19 no.11
    • /
    • pp.183-191
    • /
    • 2002
  • Drilling tests were carried out using drills with various drill shapes for burr minimization. Final objective of this study is to develop compatible drill shape for minimization of burr formation. For experiments, general carbide drills, round drills, chamfered drills and step drills are designed and manufactured. Burrs are formed by various cutting conditions and in 4 different work materials. Laser sensor is used to measure burr geometries. Cutting forces in drilling are also measured and compared in every drill. As a result of the experiments, step drills with specific step angle and step diameter are suggested for burr minimization.

New Loss Minimization Vector Control for Induction Motors (새로운 유도전동기 손실 최소화 벡터제어)

  • Lee, Hong-Hee;Khojakhan, Yerganat
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.6
    • /
    • pp.1140-1145
    • /
    • 2011
  • This paper proposes a new loss minimization control method for the vector controlled induction motors. The aim of the proposed loss minimization method is how to determine the optimal flux reference to minimize the total loss of induction motor. Even though the proposed algorithm is based on the equivalent circuit of induction motor including iron loss and leakage inductance, the algorithm is easy to be found and simple to be implemented. Futhermore, the proposed loss minimization algorithm can be applied easily to the traditional vector control system without any additional hardware. Simulation and experimental results are given to validate the effectiveness of the proposed method.