• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.1
• /
• pp.12-18
• /
• 2012

Stereo correspondence is the central problem of stereo vision. In this paper, we propose a stereo matching scheme based on a genetic algorithm using a multi-resolution method and AD-Census. The proposed approach considers the matching environment as an optimization problem and finds the disparity by using a genetic algorithm And adaptive chronosome structure using edge pixels and crossover mechanism are employed in this technique. A cost function is composes of certain constraints whice are commonly used in stereo matching. AD-Census measure is applied to reduce disparity error. To increase the efficiency of process, we apply image pyramid method to stereo matching and calculate the initial disparity map at the coarsest resolution. Then initial disparity map is propagated to the next finer resolution, interpolated and performed disparity refinement using local feature vector. We valid our method not only reduces the search time for correspondence compared with conventional GA-based method but also ensures the validity of matching.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.11
• /
• pp.861-867
• /
• 2003

We propose a sliding surface design method for linear systems with mismatched uncertainties in the state space model. In terms of LMIs, we derive a necessary and sufficient condition for the existence of a linear sliding surface such that the reduced-order equivalent sliding mode dynamics restricted to the linear sliding surface is not only stable but completely invariant to mismatched uncertainties. We give an explicit formula of all such linear switching surfaces in terms of solution matrices to the LMI existence condition. We also give a switching feedback control law, together with a design algorithm. Additionally, we give some hints for designing linear switching surfaces guaranteeing pole clustering constraints or linear quadratic performance bound constraints. Finally, we give a design example in order to show the effectiveness of the proposed methodology.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.6
• /
• pp.781-788
• /
• 1999

In this paper, an expert system is proposed, which can be effectively applied to the large-scale systems with the diversity time constraints, the objectives and the unfixed system structure. The inference scheme of the expert system have the integrated structure composed of the intuitive inference module and logical inference module in order to support effectively the operating constraints of system. The intuitive inference module is designed using the pattern matching or pattern recognition method in order to search a same or similar pattern under the fixed system structure. On the other hand, the logical inference module is designed as the structure with the multiple inference mode based on the heuristic search method in order to determine the optimal or near optimal control strategies satisfing the time constraints for system events under the unfixed system structure, and in order to use as knowledge generator. Here, inference mode consists of the best-first, the local-minimum tree, the breadth-iterative, the limited search width/time method. Finally, the application results for large-scale distribution SCADA system proves that the inference scheme of the expert system is very effective for the large-scale system. The expert system is implemented in C language for the dynamic mamory allocation method, database interface, compatability.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.109-117
• /
• 1997

A new relaxation algorithm based on distribution of matched errors and possibility is proposed to solve efficiently correspondence problem. This algorithm can be applied to various method, such as BMA, feature-, and region-based matching methods, by modifying its smoothness function. It consists of two stages which are transformation and iteration process. In transformation stage, the errors obtained by any matching algorithm are transformed to possibility values according to these statistical distribution. Each grade of possility is updated by some constraints which are defined as smoothness, uniqueness, and discontinuity factor in iteration stage. The discontinuity factor is used to reserve discontinuity of disparity. In conventional methods, it is difficult to find proper weights and stop condition, because only two factors, smoothness and uniqueness, have been used. However, in the proposed mthod, the more smoothing is not ocurred because of discontinuity factor. And it is efective to the various image, even if the image has a severe noise and repeating patterns. In addition, it is shown that the convergence rate and the quality of output are improved.

• International Journal of Advanced Culture Technology
• /
• v.9 no.3
• /
• pp.232-237
• /
• 2021

Pre-Corona cultural content was largely formed face to face. For example, the service was great while visiting tourist attractions, visiting performances to see K-Pop, or visiting lectures to learn K-Beauty. However, after the coronation, the virtual world-centered Metaverse began to take the spotlight as non-face-to-face services changed. IT and cultural contents have been combined and developed into various digital services. In that sense, Metaverse, which breaks the boundaries between real-world space and virtual space, has the potential to escape from physical time and space constraints. However, Korea still lacks a Metaverse platform for cultural content. In particular, it is necessary to match each other's necessary services by providing Metaverse -oriented cultural contents that users want, including experienced cultural contents such as K-pop and K-beauty, away from cultural contents that are developed around history museums. Therefore, in this paper, we would like to propose a Metaverse-based cultural content matching platform where users can experience cultural content directly or indirectly.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.6
• /
• pp.1048-1057
• /
• 2008

This paper represents a design method for PID or low-order controllers cascaded with a linear plant in the unit feedback system where it is required to meet the given time response specifications such as overshoot and settling time. This problem is difficult to solve because the zeros of the controller appear in the numerator of the overall system and thus those zeros may make the time response design difficult. In this paper, we propose a new approach based on the partial model matching and the so called K-polynomial. The partial matching problem is formulated to an optimization problem in which a quadratic function of coefficient errors between a target model and the resulting closed loop system is minimized. For the sake of satisfying the closed loop stability, a set of quadratic constraints associated with the cost function is introduced. As a result, the controller designed meets both time response requirements and the closed loop stability, if any. It is shown through several examples that the present method can be easily applied to these problems.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.11 no.6
• /
• pp.38-43
• /
• 1974

A design problem is studied for a nonuniform transmission line (NUTL) section to be inserted between an arbitrary source impedance and an arbitary load impedance for the purpose of impedance matching or providing a minimum input reflection coefficient over a frequency ranee as wide as possible. A special class of NUTL's, yet comprehensive enough to include almost all smoothly varying lines, are considered. Power series expansions of the ABCD parameters of such lines are used in the calculation of the input reflection coefficient. The design problem is formulated as a nonlinear programming problem withnonlinear constraints and is solved by a combined use of the sequential unconstrained minimization technique and tile Fletcher-Powell method. As a result, a line section was obtained which shows a marked improvement over any one hitherto published as a wide-band impedance matching device.

• The Journal of Industrial Distribution & Business
• /
• v.11 no.1
• /
• pp.19-28
• /
• 2020

Purpose: This research aims to empirically investigate the motivation of corporate voluntary disclosure by exploring the impact of historical loss on corporate social responsibility disclosure (CSRD). Research design, data, and methodology: This paper takes Chinese A-share listed firms that issued standalone social responsibility reports during the period of 2009-2017 as a sample. Drawing on extant literature, this paper defines historical loss firms as firms with net profit greater than or equal to 0 and undistributed profit less than 0. The tendency score matching method (PSM) is used to find matching samples for historical loss firms. Then OLS regression is conducted to investigate the relationship between historical loss and corporate social disclosure. Results: The results show that historical loss has a significant positive impact on the quality of corporate social responsibility disclosure. After changing the measurement of independent and dependent variables as well as adopting different matching methods to screen the control group, the results still hold. Further research indicates that the relationship between historical loss and CSRD is influenced by corporate financing constraints and industry competition. Conclusions: This research supports the resource motivation hypothesis of corporate social responsibility disclosure, and provides empirical evidence for regulators to strengthen supervision on corporate disclosure.

• The Journal of Korea Robotics Society
• /
• v.4 no.3
• /
• pp.185-191
• /
• 2009

This paper presents a new shape-based algorithm using affine category shape model for object category recognition and model learning. Affine category shape model is a graph of interconnected nodes whose geometric interactions are modeled using pairwise potentials. In its learning phase, it can efficiently handle large pose variations of objects in training images by estimating 2-D homography transformation between the model and the training images. Since the pairwise potentials are defined on only relative geometric relationship betweenfeatures, the proposed matching algorithm is translation and in-plane rotation invariant and robust to affine transformation. We apply spectral matching algorithm to find feature correspondences, which are then used as initial correspondences for RANSAC algorithm. The 2-D homography transformation and the inlier correspondences which are consistent with this estimate can be efficiently estimated through RANSAC, and new correspondences also can be detected by using the estimated 2-D homography transformation. Experimental results on object category database show that the proposed algorithm is robust to pose variation of objects and provides good recognition performance.

• Journal of Information Processing Systems
• /
• v.18 no.4
• /
• pp.549-561
• /
• 2022

In the Khmer writing system, the Khmer script is the official letter of Cambodia, written from left to right without a space separator; it is complicated and requires more analysis studies. Without clear standard guidelines, a space separator in the Khmer language is used inconsistently and informally to separate words in sentences. Therefore, a segmented method should be discussed with the combination of the future Khmer natural language processing (NLP) to define the appropriate rule for Khmer sentences. The critical process in NLP with the capability of extensive data language analysis necessitates applying in this scenario. One of the essential components in Khmer language processing is how to split the word into a series of sentences and count the words used in the sentences. Currently, Microsoft Word cannot count Khmer words correctly. So, this study presents a systematic library to segment Khmer phrases using the bi-directional maximal matching (BiMM) method to address these problematic constraints. In the BiMM algorithm, the paper focuses on the Bidirectional implementation of forward maximal matching (FMM) and backward maximal matching (BMM) to improve word segmentation accuracy. A digital or prefix tree of data structure algorithm, also known as a trie, enhances the segmentation accuracy procedure by finding the children of each word parent node. The accuracy of BiMM is higher than using FMM or BMM independently; moreover, the proposed approach improves dictionary structures and reduces the number of errors. The result of this study can reduce the error by 8.57% compared to FMM and BFF algorithms with 94,807 Khmer words.