• Title/Summary/Keyword: match weight

Search Result 99, Processing Time 0.021 seconds

Image Retrieval with Fuzzy Triples to Support Inexact and Concept-based Match (근사 정합과 개념 기반 정합을 지원하는 퍼지 트리플 기반 이미지 검색)

  • Jeong, Seon-Ho;Yang, Jae-Dong;Yang, Hyeong-Jeong
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.8
    • /
    • pp.964-973
    • /
    • 1999
  • 본 논문에서는 퍼지 트리플을 사용하는 내용 기반 이미지 검색 방법을 제안한다. 이미지 내 객체들 사이의 공간 관계는 내용 기반 이미지 검색을 위해 사용되는 주요한 속성들 중의 하나이다. 그러나, 기존의 트리플을 이용한 이미지 검색 시스템들은 개념 기반 검색 방법을 지원하지 못하고, 방향들 사이의 근사 정합을 처리하지 못하는 문제점을 가지고 있다. 이 문제를 해결하기 위하여 본 논문에서는 개념 기반 정합과 근사 정합을 지원하는 퍼지 트리플을 이용한 이미지 검색 방법을 제안한다. 개념 기반 정합을 위해서는 퍼지 소속성 집합으로 이루어진 시소러스가 사용되며, 근사 정합을 위해서는 방향들 사이의 관계를 정량화 하기 위한 k-weight 함수가 각각 이용된다. 이 두 가지 정합은 퍼지 트리플 간의 퍼지 정합을 통하여 균일하게 지원될 수 있다. 본 논문에서는 또한, 개념 기반 정합과 근사 정합에 대한 검색 효과를 정량적으로 평가하는 작업을 수행한다. Abstract This paper proposes an inexact and a concept-based image match technique based on fuzzy triples. The most general method adopted to index and retrieve images based on this spatial structure may be triple framework. However, there are two significant drawbacks in this framework; one is that it can not support a concept-based image retrieval and the other is that it fails to deal with an inexact match among directions. To compensate these problems, we develope an image retrieval technique based on fuzzy triples to make the inexact and concept-based match possible. For the concept-based match, we employ a set of fuzzy membership functions structured like a thesaurus, whereas for the inexact match, we introduce k-weight functions to quantify the similarity between directions. In fuzzy triples, the two facilities are uniformly supported by fuzzy matching. In addition, we analyze the retrieval effectiveness of our framework regarding the degree of the conceptual matching and the inexact matching.

Effect of Fatigue on Force-Matching in the Quadriceps Muscle

  • Song, Young-Hee;Lee, Su-Young;Kwon, Oh-Yun
    • Physical Therapy Korea
    • /
    • v.13 no.4
    • /
    • pp.10-15
    • /
    • 2006
  • This study examined the ability of human subjects to match a force in their quadriceps muscle during fatigue. Twenty subjects (mean age: 23.4 yrs, mean height: 167.8 cm, mean weight, 62.6 kg) were enrolled in the experiment. In the force-matching task, the quadriceps muscle generated 50% of the MVIC (maximum voluntary isometric contraction) torque under visual control and then without visual feedback. After inducing fatigue in the quadriceps muscle, the subjects were required to match 50% of the MVIC torque without visual feedback. The perceived magnitude of the force and force-matching errors were measured. 50% of the MVIC torque was perceived from 39.96 Nm in the pre-fatigue condition to 44.95 Nm in the post-fatigue condition. 50% of the MVIC torque-matching errors increased significantly from .55% in the pre-fatigue condition to 9.6% in the post-fatigue condition (p<.001). in addition, there were significantly more force-matching errors in women than in men (p<.01). In conclusion muscle fatigue can interfere with a subject's ability to match a force. This suggests that muscle fatigue may contributes to the sensitization of the proprioception.

  • PDF

A System Dynamics Model for Growth Prediction of Low Birth Weight Infants (시스템다이내믹스를 이용한 저출생체중아의 성장예측모형)

  • Yi, Young-Hee
    • Korean System Dynamics Review
    • /
    • v.11 no.3
    • /
    • pp.5-31
    • /
    • 2010
  • The purpose of this study is to develop a system dynamics model for growth prediction of low birth weight infants(LBWIs) based on nutrition. This growth prediction model consists of 9 modules; body weight, height, carbohydrate, protein, lipid, micronutrient, water, activity and energy module. The results of the model simulation match well with the percentiles of weights and heights of the Korean infants, also with the growth records of 55 LBWIs, under 37 weeks of gestational age, whose weights are appropriate for their gestational age. This model can be used to understand the current growth mode of LBWIs, predict the future growth of LBWIs, and be utilized as a tool for controlling the nutrient intake for the optimal growth of LBWIs in actual practice.

  • PDF

A Method for Selecting Ground Motions Considering Target Response Spectrum Mean, Variance and Correlation - I Algorithm (응답 스펙트럼의 평균과 분산, 상관관계를 모두 고려한 지반운동 선정 방법 - I 알고리즘)

  • Han, Sang Whan;Ha, Seong Jin;Cho, Sun Wook
    • Journal of the Earthquake Engineering Society of Korea
    • /
    • v.20 no.1
    • /
    • pp.55-62
    • /
    • 2016
  • It is important to select an accurate set of ground motions when conducting linear and nonlinear response history analyses of structures. This study proposes a method for selecting ground motions from a ground motion library with response spectra that match the target response spectrum mean, variance and correlation structures. This study also has addressed the determination of an appropriate value for the weight factor of a correlation structure. The proposed method is conceptually simple and straightforward, and does not involve a simulation algorithm. In this method, a desired number of ground motions are sequentially selected from first to last. The proposed method can be also used for selecting ground motions with response spectra that match the conditional spectrum. The accuracy and efficiency of the proposed procedure are verified with numerical examples.

A DNA Index Structure using Frequency and Position Information of Genetic Alphabet (염기문자의 빈도와 위치정보를 이용한 DNA 인덱스구조)

  • Kim Woo-Cheol;Park Sang-Hyun;Won Jung-Im;Kim Sang-Wook;Yoon Jee-Hee
    • Journal of KIISE:Databases
    • /
    • v.32 no.3
    • /
    • pp.263-275
    • /
    • 2005
  • In a large DNA database, indexing techniques are widely used for rapid approximate sequence searching. However, most indexing techniques require a space larger than original databases, and also suffer from difficulties in seamless integration with DBMS. In this paper, we suggest a space-efficient and disk-based indexing and query processing algorithm for approximate DNA sequence searching, specially exact match queries, wildcard match queries, and k-mismatch queries. Our indexing method places a sliding window at every possible location of a DNA sequence and extracts its signature by considering the occurrence frequency of each nucleotide. It then stores a set of signatures using a multi-dimensional index, such as R*-tree. Especially, by assigning a weight to each position of a window, it prevents signatures from being concentrated around a few spots in index space. Our query processing algorithm converts a query sequence into a multi-dimensional rectangle and searches the index for the signatures overlapped with the rectangle. The experiments with real biological data sets revealed that the proposed method is at least three times, twice, and several orders of magnitude faster than the suffix-tree-based method in exact match, wildcard match, and k- mismatch, respectively.

Analysis of Scoring Difficulty in Different Match Situations in Relation to First Athlete to Score in World Taekwondo Athletes (세계태권도 겨루기 선수들의 선제득점에 따른 경기 내용별 득점 난이도 분석)

  • Mi-Na Jin;Jung-Hyun Yun;Chang-Jin Lee
    • Journal of Industrial Convergence
    • /
    • v.22 no.4
    • /
    • pp.21-29
    • /
    • 2024
  • This study analyzed the difficulty of scoring in different match situations in relation to which competitor scored first. The study analyzed the data from the 2022 Guadalajara World Taekwondo Championships. The analysis was performed for two separate weight classes: lightweight and heavyweight. Four game content variables were used: whether the athlete scored first, attack type, attack area, and game situation. Descriptive statistics, the Rasch model, and discrimination function questions were applied for data processing. SPSS and Winsteps were used for the statistical analysis, and the statistical significance level was set at 0.05. Consequently, in the lightweight class, the scoring frequency of the first scorer was high for all the game variables. In the heavyweight class, the scoring frequency for the first scorer was high for the attack type and attack area. By contrast, those who did not score first were more frequently found to be in a loss situation. By analyzing the scoring difficulties in different match situations based on whether the competitor scored first, the athletes who scored first in attack type most easily scored first. In losing situations, the athletes who scored first in attack area scored most easily, whereas those who did not score first scored most easily in body and match situations. For the heavyweight class, those who scored first in terms of attack type, counter-attack, and attack area scored the most easily while winning in body and match situations.

Optimization of Weighting Matrix selection (상태 비중 행렬의 선택에 대한 최적화)

  • 권봉환;윤명중
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.3
    • /
    • pp.91-94
    • /
    • 1985
  • A method optimizing selection of a state weighting matrix is presented. The state weight-ing matrix is chosen so that the closed-loop system responses closely match to the ideal model responses. An algorithm is presented which determines a positive semidefinite state weighting matrix in the linear quadratic optimal control design problem and an numerical example is given to show the effect of the present algorithm.

  • PDF

Postdischarge growth assessment in very low birth weight infants

  • Park, Joon-Sik;Han, Jungho;Shin, Jeong Eun;Lee, Soon Min;Eun, Ho Seon;Park, Min-Soo;Park, Kook-In;Namgung, Ran
    • Clinical and Experimental Pediatrics
    • /
    • v.60 no.3
    • /
    • pp.64-69
    • /
    • 2017
  • Purpose: The goal of nutritional support for very-low-birth-weight (VLBW) infants from birth to term is to match the in utero growth rates; however, this is rarely achieved. Methods: We evaluated postdischarge growth patterns and growth failure in 81 Korean VLBW infants through a retrospective study. Weight and height were measured and calculated based on age percentile distribution every 3 months until age 24 months. Growth failure was defined as weight and height below the 10th percentile at 24 months. For the subgroup analysis, small-for-gestational age (SGA) and extremely low birth weight (ELBW) infants were evaluated. The growth patterns based on the Korean, World Health Organization (WHO), or Centers for Disease Control and Prevention (CDC) standard were serially compared over time. Results: At postconception age (PCA) 40 weeks, 47 (58%) and 45 infants (55%) showed growth failure in terms of weight and height, respectively. At PCA 24 months, 20 infants (24%) showed growth failure for weight and 14 (18%) for height. Growth failure rates were higher for the SGA infants than for the appropriate-weight-for-gestational age infants at PCA 24 months (P=0.045 for weight and P=0.038 for height). Growth failure rates were higher for the ELBW infants than for the non-ELBW infants at PCA 24 months (P<0.001 for weight and P=0.003 for height). Significant differences were found among the WHO, CDC, and Korean standards (P<0.001). Conclusion: Advancements in neonatal care have improved the catch-up growth of VLBW infants, but this is insufficient. Careful observation and aggressive interventions, especially in SGA and ELBW infants, are needed.

Light Weight Korean Morphological Analysis Using Left-longest-match-preference model and Hidden Markov Model (좌최장일치법과 HMM을 결합한 경량화된 한국어 형태소 분석)

  • Kang, Sangwoo;Yang, Jaechul;Seo, Jungyun
    • Korean Journal of Cognitive Science
    • /
    • v.24 no.2
    • /
    • pp.95-109
    • /
    • 2013
  • With the rapid evolution of the personal device environment, the demand for natural language applications is increasing. This paper proposes a morpheme segmentation and part-of-speech tagging model, which provides the first step module of natural language processing for many languages; the model is designed for mobile devices with limited hardware resources. To reduce the number of morpheme candidates in morphological analysis, the proposed model uses a method that adds highly possible morpheme candidates to the original outputs of a conventional left-longest-match-preference method. To reduce the computational cost and memory usage, the proposed model uses a method that simplifies the process of calculating the observation probability of a word consisting of one or more morphemes in a conventional hidden Markov model.

  • PDF

Retrieval of Identical Clothing Images Based on Non-Static Color Histogram Analysis

  • Choi, Yoo-Joo;Moon, Nam-Mee;Kim, Ku-Jin
    • Journal of Broadcast Engineering
    • /
    • v.14 no.4
    • /
    • pp.397-408
    • /
    • 2009
  • In this paper, we present a non-static color histogram method to retrieve clothing images that are similar to a query clothing. Given clothing area, our method automatically extracts major colors by using the octree-based quantization approach[16]. Then, a color palette that is composed of the major colors is generated. The feature of each clothing, which can be either a query or a database clothing image, is represented as a color histogram based on its color palette. We define the match color bins between two possibly different color palettes, and unify the color palettes by merging or deleting some color bins if necessary. The similarity between two histograms is measured by using the weighted Euclidean distance between the match color bins, where the weight is derived from the frequency of each bin. We compare our method with previous histogram matching methods through experiments. Compared to HSV cumulative histogram-based approach, our method improves the retrieval precision by 13.7 % with less number of color bins.