• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1123-1133
• /
• 1999

In this paper, we applied mode matching and generalized scattering matrix methods to three plane mode matching method for analyzing T-junctions. We calculated all scattering matrix elements by only three times and considered several incident modes. By proposed analysis method, we could analyze various waveguide discontinuity structures more conveniently and accurately. Using the stepped T-junction, we would be able to reduce the reflection coefficient at an input port and use it over wider band. Simulated and HFSS data of T-junctions are compared, showing good agreement for scattering matrix elements. Considering step numbers, height, length and position, we extracted for optimum dimensions and equivalent circuit parameters.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.353-356
• /
• 2005

A loop RFID tag antenna and a dipole RFID antenna with a T-matching method have been designed. The characteristic of loop and dipole with T-matching antenna structures of RFID tag antennas have been studied. The impedance of different sizes of loop and dipole antenna structures are found. This paper shows parametric research of loop RFID antenna structure and RFID dipole antenna with T-matching method to match the impedance of commercially available RFID chips.

• IE interfaces
• /
• v.10 no.3
• /
• pp.133-143
• /
• 1997

In this paper, an improved method is developed for automatic inspection system using simbology patterns. The developed method uses the two previously developed matching methods the template maching method and the feature matching method. The template matching method is very sensitive to variations of target images such as translation and rotation of objects. On the other hand, the feature matching method doesn't extract proper features in some types of symbology patterns. The proposed method shows the improvement of precision in recognition of defects and flexibility of different types of symbology patterns.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.3
• /
• pp.32-40
• /
• 1999

In this paper, we present a fast block matching motion estimation algorithm based on successive elimination algorithm (SEA). Based on the characteristic of center-biased motion vector distribution in the search area, the proposed method improves the performance of the SEA with a reduced the number of the search positions in the search area, In addition, to reduce the computational load, this method is combined with both the reduced bits mean absolute difference (RBMAD) matching criterion which can be reduced the computation complexity of pixel comparison in the block matching and pixel decimation technique which reduce the number of pixels used in block matching. Simulation results show that the proposed method provides better performance than existing fast algorithms and similar to full-search block motion estimation algorithm.

• 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.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2209-2211
• /
• 1998

This paper presents the matching algorithm with the satellite images using the image warping method. Two stereo images, which are used for the DEM(Digital Elevation Model) extraction, are generally distorted because the images are acquired at different locations and angles. Therefore, the matching Process can't be executed with the original images. To solve this problem, a dynamic triangular image warping method is proposed. At first, the initial matching is executed with seed point, and then, using the matched points from the initial matching, the distorted images is compensated. We experimented this algorithm with the parts of the $6000{\times}6000$ SPOT satellite images. The experiment results show this algorithm is superior to other warping algorithm.

• Textile Coloration and Finishing
• /
• v.13 no.6
• /
• pp.397-404
• /
• 2001

The accurate representation of the colors of dyed fabric on a color CRT(cathode ray tube) screen is the basis for the automatic process in dyeing industry. In the former study, we had focused on the theoretically color matching method between CIE(International Commission on illumination) and RGB color coordinates, but In this study we tried simulating the colors obtained from fabrics on the color CRT by using experimental method. we obtained the following results. 1. We could simulate all of the color CRT by gamut mapping method, even though some of the KOSCOTE(Korea Standard Color of Textile) colors represented on the color CRT didn't exist in the region of color region 2. We could do conditional matching by CIE system, even though it was hard to do invariant matching the Red, Green, Blue phosphors of the color CRT because of the SPD(Spectral Power Distribution) which had been set up before. 3. We could simulate all the colors obtained from fabrics on the color CRT by matching those two color groups from KOSCOTE fabrics and color CRT using match algorithm and matching programs. 4. If we get over on obstacles by grafting CCM and CCK machines which have been used in educational and industrial areas by matching KOSCOTE with color CRT we will be able to invent color simulation system controled automatically.

• Textile Coloration and Finishing
• /
• v.13 no.6
• /
• pp.39-39
• /
• 2001

The accurate representation of the colors of dyed fabric on a color CRT(cathode ray tube) screen is the basis for the automatic process in dyeing industry. In the former study, we had focused on the theoretically color matching method between CIE(International Commission on Illumination) and RGB color coordinates, but In this study we tried simulating the colors obtained from fabrics on the color CRT by using experimental method. we obtained the following results. 1. We could simulate all of the color CRT by gamut mapping method, even though some of the KOSCOTE(Korea Standard Color of Textile) colors represented on the color CRT didn′t exist in the region of color region. 2. We could do conditional matching by CIE system, even though it was hard to do invariant matching the Red, Green, Blue phosphers of the color CRT because of the SPD(Spectral Power Distribution) which had been set up before. 3. We could simulate all the colors obtained from fabrics on the color CRT by matching those two color groups from KOSCOTE fabrics and color CRT using match algorithm and matching programs. 4. If we get over on obstacles by grafting CCM and CCK machines which have been used in educational and industrial areas by matching KOSCOTE with color CRT we will be able to invent color simulation system controled automatically.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.11
• /
• pp.1620-1627
• /
• 2017

In this paper, we design an observer-based $H_{\infty}$ fuzzy controller for interval type-2 Takagi-Sugeno (T-S) fuzzy systems under imperfect premise matching. The designed observer-based controller can effectively estimate the state of the system and make fuzzy system satisfy the $H_{\infty}$ disturbance attenuation performance. Using the slack matrix, the derived stabilization condition is expressed in terms of a linear matrix inequality. Finally, the effectiveness of the proposed method is verified through a simulation example.

• Journal of the Korea Management Engineers Society
• /
• v.23 no.4
• /
• pp.105-123
• /
• 2018

The purpose of this study is to verify whether the technology grade, which is the result of technology appraisal by Technology Credit Bureau, can be extended and applied to the venture certification system. We confirmed that there was a significant difference in the average financial performance for three years after the certification and appraisal of the two groups after matching the venture certification enterprise group and the technology appraisal enterprise group in 2015 through the propensity score matching method. As a result, there was no significant difference in the financial performance of venture certified firms and technology appraisal firms, so we confirmed that the technology grade can be expanded and applied to the venture certification system. As a result of estimating the technology grade conforming to the venture certification system, it was concluded that technology outstanding firm(T1-T4) is a technology grade suitable for the venture certification system.