• The KIPS Transactions:PartD
• /
• v.14D no.7
• /
• pp.819-828
• /
• 2007

In this paper, we propose a topic maps matching and merging approach based on the syntactic or semantic characteristics and constraints of the topic maps. Previous schema matching approaches have been developed to enhance effectiveness and generality of matching techniques. However they are inefficient because the approaches should transform input ontologies into graphs and take into account all the nodes and edges of the graphs, which ended up requiring a great amount of processing time. Now, standard languages for developing ontologies are RDF/OWL and Topic Maps. In this paper, we propose an enhanced version of matching and merging technique based on topic partitioning, several matching operations and merging conflict detection.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.87.3-87
• /
• 2001

The principle of matching is a new framework for control systems design that requires the matching between the control system and the environment (the source of exogenous inputs). The principle is especially useful for the design of the critical control systems where the responses of the control systems should be kept below the prescribed values. The design problem is reduced to find controller satisfying inequality constraints. However, conventional optimization techniques do not possess structural model selection ability and designers are required to select appropriate controller model. We propose to use a genetic algorithm to find an appropriate controller satisfying the matching conditions. The proposed genetic algorithm ...

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.11a
• /
• pp.293-296
• /
• 2006

This paper presents new sufficient conditions to an intelligent digital redesign (IDR). The purpose of the IDR is to effectively convert an existing continuous-time fuzzy controller to an equivalent sampled-data fuzzy controller in the sense of the state-matching. The state-matching error between the closed-loop trajectories is carefully analyzed using the integral quadratic functional approach. The problem of designing the sampled-data fuzzy controller to minimize the state-matching error as well as to guarantee the stability is formulated and solved as the convex optimization problem with linear matrix inequality (LMI) constraints.

• ETRI Journal
• /
• v.34 no.1
• /
• pp.87-97
• /
• 2012

This study presents an automatic matching method for generating a dense, accurate, and discontinuity-preserved digital surface model (DSM) using multiple images acquired by an aerial digital frame camera. The proposed method consists of two main procedures: area-based multi-image matching (AMIM) and stereo-pair epipolar line matching (SELM). AMIM evaluates the sum of the normalized cross correlation of corresponding image points from multiple images to determine the optimal height of an object point. A novel method is introduced for determining the search height range and incremental height, which are necessary for the vertical line locus used in the AMIM. This procedure also includes the means to select the best reference and target images for each strip so that multi-image matching can resolve the common problem over occlusion areas. The SELM extracts densely positioned distinct points along epipolar lines from the multiple images and generates a discontinuity-preserved DSM using geometric and radiometric constraints. The matched points derived by the AMIM are used as anchor points between overlapped images to find conjugate distinct points using epipolar geometry. The performance of the proposed method was evaluated for several different test areas, including urban areas.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.10
• /
• pp.2437-2445
• /
• 1993

In this work, a new method is presented for generating the manipulator path which significantly reduces residual vibration under the torque constraints. The desired path is optimally designed so that the required movement can be achieved with minimum residual vibration. From the previous research works, the dynamic model had been established including both the link and the joint flexibilities. The performance index is selected to minimize the maximum amplitude of residual vibration. The path to be designed is developed by a combined Fourier series and polynomial function to satisfy both the convergence and boundary condition matching problems. The concept of correlation coefficients is used to select the minimum number of design variables, i.e. Fourier coefficients, the only ones which have a considerable effect on the reduction of residual vibration. A two-link Manipulator is used to evaluate this method. Results show that residual vibration can be drastically reduced by selecting an appropriate manipulator path to both of unlimited and torque-limited cases.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2005.04a
• /
• pp.680-687
• /
• 2005

This study presents a schema matching technique which can be applied to XML semantic model of structural calculation reports of steel-box bridges. The semantic model of structural calculation documents was developed by extracting the optimized common elements from the analyses of various existing structural calculation documents, and the standardized semantic model was schematized by using XML Schema. In addition, the similarity measure technique and the relaxation labeling technique were employed to develop the schema matching algorithm. The former takes into account the element categories and their features, and the latter considers the structural constraints in the semantic model. The standardized XML semantic model of steel-box bridge's structural calculation documents called target schema was compared with existing nonstandardized structural calculation documents called primitive schema by the developed schema matching algorithm Some application examples show the importance of the development of standardized target schema for structural calculation documents and the effectiveness and efficiency of schema matching technique in the examination of the degree of document standardization in structural calculation reports.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.2
• /
• pp.211-221
• /
• 1998

It is becoming apparent that stereo matching algorithms need much information from high level cognitive processes. Otherwise, conventional algorithms based on bottom-up control alone are susceptible to local minima. We introduce a system that consists of two levels. A lower level, using a usual matching method, is based upon the local neighborhood and a second level, that can integrate the partial information, is aimed at contextual matching. Conceptually, the introduction of bottom-up and top-down feedback loop to the usual matching algorithm improves the overall performance. For this purpose, we model the image attributes using a Markov random field (MRF) and thereupon derive a maximum a posteriori (MAP) estimate. The energy equation, corresponding to the estimate, efficiently represents the natural constraints such as occlusion and the partial informations from the other levels. In addition to recognition, we derive a training method that can determine the system informations from the other levels. In addition to recognition, we derive a training method that can determine the system parameters automatically. As an experiment, we test the algorithms using random dot stereograms (RDS) as well as natural scenes. It is proven that the overall recognition error is drastically reduced by the introduction of contextual matching.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.9 no.4
• /
• pp.233-239
• /
• 2009

A mixed CT/DT 2-1 cascaded ${\Sigma\Delta}M$ which includes a first stage CT ${\Sigma\Delta}M$ and a second stage mismatch insensitive two-channel time-interleaved DT ${\Sigma\Delta}M$ is proposed. With this approach, the advantages of both CT and DT ${\Sigma\Delta}Ms$ including high speed operation, inherent anti-aliasing filter, and good coefficient matching can be achieved. The two-channel time-interleaved ${\Sigma\Delta}M$ used in the second stage alleviates the speed constraints of the DT ${\Sigma\Delta}M$, whereas enables better matching between the analog and digital filter coefficients compared to CT ${\Sigma\Delta}Ms$.

• Journal of Navigation and Port Research
• /
• v.32 no.5
• /
• pp.355-361
• /
• 2008

Stereo matching is one of the most active research areas in computer vision. In this paper, we propose a stereo matching scheme using genetic algorithm for object depth recognition. The proposed approach considers the matching environment as an optimization problem and finds the optimal solution by using an evolutionary strategy. Accordingly, genetic operators are adapted for the circumstances of stereo matching. An individual is a disparity set. Horizontal pixel line of image is considered as a chromosome. A cost function is composed of certain constraints which are commonly used in stereo matching. Since the cost function consists of intensity, similarity and disparity smoothness, the matching process is considered at the same time in each generation. The LoG(Laplacian of Gaussian) edge is extracted and used in the determination of the chromosome. We validate our approach with experimental results on stereo images.