• Title/Summary/Keyword: essential minimization

Search Result 78, Processing Time 0.031 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.

An Improved Quine-McCluskey Algorithm for Circuit Minimization (회로 최소화를 위한 개선된 Quine-McCluskey 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.3
    • /
    • pp.109-117
    • /
    • 2014
  • This paper revises the Quine-McCluskey Algorithm to circuit minimization problems. Quine-McCluskey method repeatedly finds the prime implicant and employs additional procedures such as trial-and-error, branch-and-bound, and Petrick's method as a means of circuit minimization. The proposed algorithm, on the contrary, produces an implicant chart beforehand to simplify the search for the prime implicant. In addition, it determines a set cover to streamline the search for $1^{st}$ and $2^{nd}$ essential prime implicants. When applied to 3-variable and 4-variable experimental data, the proposed algorithm has indeed proved to obtain the optimal solutions much more simply and accurately than the Quine-McCluskey method.

A Study of the Expressions of the Silhouette in the Fashion Illustrations (패션 일러스트레이션에 나타난 실루엣 표현 연구)

  • Choi, Yoo-Jin;Choi, Jung-Hwa
    • Fashion & Textile Research Journal
    • /
    • v.14 no.2
    • /
    • pp.184-192
    • /
    • 2012
  • This study analyzed silhouette expressions in the fashion illustrations by theory based on results of studying the characteristics of the forms and meanings of the silhouette expressions in art historically. For the actual considering this study collected and categorized fashion illustrations from 1990 to the present limitedly, and clarified the meaning of the silhouette expressions. Those expressions in fashion illustrations were categorized to the 5 items; black & white silhouette, color silhoutte, pattern silhouette, paper silhouette, line silhouette. Silhouette expressions of the fashion illustrations were categorized to 3 items: metaphorical fantasy, essential minimization, anonymous representation.

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 New Algorithm for Boolean Function Minimization (부울함수의 간소화를 위한 새 방법)

  • 이우이
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.21 no.4
    • /
    • pp.43-51
    • /
    • 1984
  • In the case of Quine Mccluskey's methode for Boolean function minimization, we have to examine each bits of binary represented minterms. In this paper, cube relations between misterms that are represented by means of decimal number, and all sorts of rules for Boolean function minimization are described as theorems, and they are verified. And based on these theorems, the new fast algorithm for Boolean function minimization is proposed. An example of manual operation is sholvn, and the process is writed out by a FORTRAN program. In this program, the essential pl.imp implicants of the Boolean function that has 100 each of minterms including redundant minterms, are finked and printed out, (the more minterms can be treated if we take the more larger size of arrays) and the outputs are coincided with the results of manual operation.

  • PDF

ZERO-EMISSION MATERIALS CYCLE IN PRODUCTION PROCESS AND REGIONAL SCALE

  • FUJIE, Koichi
    • Clean Technology
    • /
    • v.3 no.2
    • /
    • pp.13-24
    • /
    • 1997
  • The present paper aims to give basic information to establish zero emission material cycle including the minimization of emissions from industrial production processes and the area in regional scale. Strategies and methodologies to analyze emissions from the production processes and our human activities and to reduce those emissions by refining and/or replacing the unit process with the alternatives are introduced as well. Quantitative evaluation and management systems of any raw materials and the production process are from vie points of treatment are essential. Estabiishment of a process networking for the recycle of discharged non-products materials by the intra-process, trans-process and the trans-industries are proposed. Procedures and priorities to formulate industrial and regional zero emission system are proposed as well.

  • PDF

East minimization of switching functions by DA-TABLE method (DA 표법에 의한 스위칭함수의 신속 최소화)

  • 황희륭;박충규;김민환
    • 전기의세계
    • /
    • v.30 no.2
    • /
    • pp.101-111
    • /
    • 1981
  • This paper describes two methods which generate all the prime implicants (PI's) quickly by using the directions of adjacency tavle (DA-table) that gives the knowledge of adjacency relations among the given minterms. One is a graphical method that enables us to generate PI's by hand, the other is a checking method that determines the existance of PI's quickly when it is programmed on a digital computer. And a fast minimization algorithm will be shown in this paper that can be implemented with reduced computational effort by selecting essential prime implicants (EPI's) first of all and using the concept of the integration of the PI identification and selection procedure. The procedure, proposed in this paper, has all the advantage of Karnaugh mapping, so the procedure is simple and easy.

  • PDF

Effects of Collective Promotion on the Attainment of Goals of Basic Education in English-Speaking Primary Schools in Cameroon

  • Lyonga, Ngemunang Agnes Ngale;Fosso, Nzjofou Vivian
    • Journal of Science Education
    • /
    • v.44 no.2
    • /
    • pp.259-272
    • /
    • 2020
  • This study aims at investigating the effects of collective promotion on the attainment of literacy, numeracy, and essential life skills by primary school pupils and also to find out if the policy of collective promotion meets its objective of minimization of wastage in basic education. The study used written tests for pupils in the final class (Level II, class 6) to collect data in some selected English-speaking primary schools in Meme Division of Cameroon. Descriptive statistics and a one way ANOVA were used for analyzing data. The results revealed that the policy of collective promotion negatively affects the attainment of literacy, numeracy, and essential life skills of pupils in Kumba, Meme Division. Teachers who assisted in the study through personal communication with the researcher argued that collective promotion in basic education does not achieve its objective of minimizing wastage of educational resources; neither does it positively improve the literacy, numeracy, and essential life skills of pupils. This study recommends that the policy of collective promotion can be revisited and that focus be placed not only on minimizing wastage of resources but also on investing on quality education system so as to equip the would-be leaders of tomorrow with skills, knowledge, and attitudes which will make them functional and responsible citizens in their society.

Trends of Disassembly Technique on End of Life Vehicle (폐자동차의 해체기술 동향)

  • 이현용;송준엽;강재훈
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2001.05a
    • /
    • pp.211-215
    • /
    • 2001
  • In the last year, the number of registered vehicles in Korea surpassed the 12 million mark, and increase in number continuously Nowdays, this tendency has raised some problems inevitably in the view of expansion of ELV(end of life vehicle) and earth environment pollution resulted from it. For the proper scope with this environment pollution, recycling of parts and materials, minimization of wastes are desirable. And application of disassembly technology is required for it necessarily. Therefore it is essential to study systematically about disassembly technology of ELV with high efficiency for improvement recycling ratio and diminution shredder dust amount also in Korea.

  • PDF

Application of Subarray Averaging and Entropy Minimization Algorithm to Stepped-Frequency ISAR Autofocus (부배열 평균과 엔트로피 최소화 기법을 이용한 stepped-frequency ISAR 자동초점 기법 성능 향상 연구)

  • Jeong, Ho-Ryung;Kim, Kyung-Tae;Lee, Dong-Han;Seo, Du-Chun;Song, Jeong-Heon;Choi, Myung-Jin;Lim, Hyo-Suk
    • Proceedings of the KSRS Conference
    • /
    • 2008.03a
    • /
    • pp.158-163
    • /
    • 2008
  • In inverse synthetic aperture radar (ISAR) imaging, An ISAR autofocusing algorithm is essential to obtain well-focused ISAR images. Traditional methods have relied on the approximation that the phase error due to target motion is a function of the cross-range dimension only. However, in the stepped-frequency radar system, it tends to become a two-dimensional function of both down-range and cross-range, especially when target's movement is very fast and the pulse repetition frequency (PRF) is low. In order to remove the phase error along down-range, this paper proposes a method called SAEM (subarray averaging and entropy minimization) [1] that uses a subarray averaging concept in conjunction with the entropy cost function in order to find target motion parameters, and a novel 2-D optimization technique with the inherent properties of the proposed entropy-based cost function. A well-focused ISAR image can be obtained from the combination of the proposed method and a traditional autofocus algorithm that removes the phase error along the cross-range dimension. The effectiveness of this method is illustrated and analyzed with simulated targets comprised of point scatters.

  • PDF