• International Journal of Contents
• /
• v.7 no.4
• /
• pp.108-115
• /
• 2011

The current study aims to analyze the acceptance of International Standard Terminology (IST) related to herbs and formulas used in Korea. It also intends to examine limitations of each term source by linking texts for herbal medicine research and formula research used in schools of oriental medicine with medicinal substance-formula classification names within the IST framework. This study examined 64 medicinal classification names of IST, including synonyms, 41 formula classification names, 65 classification names of "Herbal Medicine Study," 89 medicinal classification names of "Shin's Clinical Herbal Medicine Study," and lastly 83 formula classification names of "Formula Study." Data on their chief virtue, efficacy and characteristics as medicinal substances were extracted from their definitions, and such data were used to perform Chinese character-English mapping using the IST. The outcomes of the mapping were then analyzed in terms of both lexical matching and semantic matching. In terms of classification names for medicinal substances, "Herbal Medicine Study" had 60.0% lexical matching, whereas "Shin's Clinical Herbal Medicine Study" had 48.3% lexical matching. When semantic matching was also applied, "Herbal Medicine Study" showed a value of 87.7% and "Shin's Clinical Herbal Medicine Study" 74.2%. In terms of formula classification names, lexical matching was 28.9% of 83 subjects, and when semantic matching was also considered, the value was 30.1%. When the conceptual elements of this study were applied, some IST terms that are classified with other codes were found to be conceptually consistent, and some terms were not accepted due to different depths in the classification systems of each source.

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

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.7
• /
• pp.589-598
• /
• 2002

The color measuring/matching expert system is implemented with a new color measuring method that combines intelligent algorithms with image processing techniques. Color measuring part of the proposed system preprocesses the scanned original color input images to eliminate their distorted components by means of the image histogram technique of image pixels, and then extracts RGB(Red, Green, Blue)data among color information from preprocessed color input images. If the extracted RGB color data does not exist on the matching recipe databases, we can measure the colors for the user who want to implement the model that can search the rules for the color mixing information, using the intelligent modeling techniques such as fuzzy inference system and adaptive neuro-fuzzy inference system. Color matching part can easily choose images close to the original color for the user by comparing information of preprocessed color real input images with data-based measuring recipe information of the expert, from the viewpoint of the delta Eformula used in practical process.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.689-692
• /
• 1998

Matching two images is an essential step for many computer vision applications. A new approach to the scale and rotation invariant scene matching is presented. A set of andidate parameters are hypthesized by mapping the angular difference and a new distance measure to the hough space and by detecting maximally consistent points. The proposed method is shown to be much faster than the conventinal one where the relaxation process is repeated until convergence, while providing robust matching performance, without a priori information on the geometrical transformation parameters.

• 한국데이터정보과학회:학술대회논문집
• /
• 2003.05a
• /
• pp.27-37
• /
• 2003

In this paper, we develop noninformative priors for two parameter Pareto distribution. Specially, we derive Jeffrey's prior, probability matching prior and reference prior for the parameter of interest. In our case, the probability matching prior is only a first order and there does not exist a second order matching prior. Some simulation reveals that the matching prior performs better to achieve the coverage probability. And a real example will be given.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.605-608
• /
• 2002

A text-dependent speaker recognition system using a robust matching process is studied. The feature histogram of LPC cepstral coefficients for matching is used. The matching process uses mixture network with penalty scores. Using probability and shape comparison of two feature histograms, similarity values are obtained. The experiment results will be shown to show the effectiveness of the proposed algorithm.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.579-580
• /
• 2008

DRAM설계시 DDR2에서부터 고속 동작으로 인해 반송파에 의한 신호외곡으로 impedance matching의 필요성이 대두되었다. 이로 인해 제안된 방법은 외부 Termination 저항(RZQ)을 기준으로 impedance matching을 위한 Rtt 저항의 생성이다.[1] 제안된 ZQ Calibration 회로는 기존의conventional ZQ Calibration 회로에 After ZQ calibration block을 추가하여 한 번 더 교정함으로써 마지막 PMOS Array와 NMOS Array 저항 값이 Termination 저항 값에 가깝도록 설계하였다. 따라 전력효율은 그대로 유지하면서 ${\Delta}VM$의 오차범위를 기존의 ${\pm}5%$이내에서 skew 조건에 따라 ${\pm}1.33%$까지 향상시키는 것을 볼 수 있다. (JEDEC spec. ${\pm}5%$이내).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.628-633
• /
• 2010

This paper proposes a block matching algorithm to improve the sub-block matching algorithm that uses partial sub-blocks being a great contribution to the block matching. Unlike the conventional algorithm using the one sub-block group the proposed algorithm uses two sub-block groups. The matching using the small group selects a candidate block to be a good possibility of a similar block with a small computation cost and the additional matching using the large group in the selected block decreases a wrong matching. Simulation results show that the proposed algorithm always has good image quality at the same computation cost as compared to the conventional algorithm and it has an outstanding performance at the matching using a few sub-blocks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.6
• /
• pp.280-298
• /
• 2008

For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf’s center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.34-39
• /
• 2002

Road information is very important for topographic mapping, transportation application, urban planning and other related application fields. Therefore, automatic detection of road networks from spatial imagery, such as aerial photos and satellite imagery can play a central role in road information acquisition. In this paper, we use least squares correlation matching alone for road center tracking and show that it works. We assumed that (bright) road centerlines would be visible in the image. We further assumed that within a same road segment, there would be only small differences in brightness values. This algorithm works by defining a template around a user-given input point, which shall lie on a road centerline, and then by matching the template against the image along the orientation of the road under consideration. Once matching succeeds, new match proceeds by shifting a matched target window further along road orientation at the target window. By repeating the process above, we obtain a series of points, which lie on a road centerline successively. A 1m resolution IKONOS images over Seoul and Daejeon were used for tests. The results showed that this algorithm could extract road centerlines in any orientation and help in fast and exact he ad-up digitization/vectorization of cartographic images.