• Title/Summary/Keyword: Minimal variability

Search Result 30, Processing Time 0.031 seconds

A Note on the Minimal Variability Weighting Function Problem

  • Hong, Dug-Hun;Kim, Kyung-Tae
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.3
    • /
    • pp.991-997
    • /
    • 2006
  • Recently, Liu (2005) proposed a special type of weighting function under a given preference index level with the minimal variability similar to the minimal variability OWA operator weights problem proposed by Fuller and Majlender (2003). He solved this problem using a result of classical optimal control theory. In this note, we give a direct elementary proof of this problem without using any known results.

  • PDF

A Note on the Minimal Variability OWA Operator Weights

  • Hong, Dug-Hun
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.2
    • /
    • pp.499-505
    • /
    • 2006
  • In this note, we give an elementary simple new proof of the main result of $Full{\acute{e}}r$ and Majlender [Fuzzy Sets and systems 136 (2003) 203-215] concerning obtaining minimal variability OWA operator weights.

  • PDF

Feature-Oriented Adaptive Motion Analysis For Recognizing Facial Expression (특징점 기반의 적응적 얼굴 움직임 분석을 통한 표정 인식)

  • Noh, Sung-Kyu;Park, Han-Hoon;Shin, Hong-Chang;Jin, Yoon-Jong;Park, Jong-Il
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02a
    • /
    • pp.667-674
    • /
    • 2007
  • Facial expressions provide significant clues about one's emotional state; however, it always has been a great challenge for machine to recognize facial expressions effectively and reliably. In this paper, we report a method of feature-based adaptive motion energy analysis for recognizing facial expression. Our method optimizes the information gain heuristics of ID3 tree and introduces new approaches on (1) facial feature representation, (2) facial feature extraction, and (3) facial feature classification. We use minimal reasonable facial features, suggested by the information gain heuristics of ID3 tree, to represent the geometric face model. For the feature extraction, our method proceeds as follows. Features are first detected and then carefully "selected." Feature "selection" is finding the features with high variability for differentiating features with high variability from the ones with low variability, to effectively estimate the feature's motion pattern. For each facial feature, motion analysis is performed adaptively. That is, each facial feature's motion pattern (from the neutral face to the expressed face) is estimated based on its variability. After the feature extraction is done, the facial expression is classified using the ID3 tree (which is built from the 1728 possible facial expressions) and the test images from the JAFFE database. The proposed method excels and overcomes the problems aroused by previous methods. First of all, it is simple but effective. Our method effectively and reliably estimates the expressive facial features by differentiating features with high variability from the ones with low variability. Second, it is fast by avoiding complicated or time-consuming computations. Rather, it exploits few selected expressive features' motion energy values (acquired from intensity-based threshold). Lastly, our method gives reliable recognition rates with overall recognition rate of 77%. The effectiveness of the proposed method will be demonstrated from the experimental results.

  • PDF

Dynamic Decisions using Variable Neighborhood Search for Stochastic Resource-Constrained Project Scheduling Problem (확률적 자원제약 스케줄링 문제 해결을 위한 가변 이웃탐색 기반 동적 의사결정)

  • Yim, Dong Soon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.43 no.1
    • /
    • pp.1-11
    • /
    • 2017
  • Stochastic resource-constrained project scheduling problem is an extension of resource-constrained project scheduling problem such that activity duration has stochastic nature. In real situation where activity duration is not known until the activity is finished, open-loop based static policies such as activity-based policy and priority-based policy will not well cope with duration variability. Then, a dynamic policy based on closed-loop decision making will be regarded as an alternative toward achievement of minimal makespan. In this study, a dynamic policy designed to select activities to start at each decision time point is illustrated. The performance of static and dynamic policies based on variable neighborhood search is evaluated under the discrete-event simulation environment. Experiments with J120 sets in PSPLIB and several probability distributions of activity duration show that the dynamic policy is superior to static policies. Even when the variability is high, the dynamic policy provides stable and good solutions.

The Adaptive Congestion Control Using Neural Network in ATM network (ATM 망에서 뉴럴 네트워크를 이용한 적응 폭주제어)

  • Lee, Yong-Il;Kim, Yung-Kwon
    • Journal of IKEEE
    • /
    • v.2 no.1 s.2
    • /
    • pp.134-138
    • /
    • 1998
  • Because of the statistical fluctuations and the high 'time-variability' nature of the traffic, managing the resources of the network require highly dynamic techniques with minimal Intervention and reaction times, and adaptive and learning capabilities. The neural networks normalizes the ATM cell arrival rate and queue length and has the adaptive learning algorithm, and experimentally investigated the method to prevent the congestion generated in ATM networks.

  • PDF

Linearized Methods for Quantitative Analysis and Parametric Mapping of Brain PET (뇌 PET 영상 정량화 및 파라메터영상 구성을 위한 선형분석기법)

  • Kim, Su-Jin;Lee, Jae-Sung
    • Nuclear Medicine and Molecular Imaging
    • /
    • v.41 no.2
    • /
    • pp.78-84
    • /
    • 2007
  • Quantitative analysis of dynamic brain PET data using a tracer kinetic modeling has played important roles in the investigation of functional and molecular basis of various brain diseases. Parametric imaging of the kinetic parameters (voxel-wise representation of the estimated parameters) has several advantages over the conventional approaches using region of interest (ROI). Therefore, several strategies have been suggested to generate the parametric images with a minimal bias and variability in the parameter estimation. In this paper, we will review the several approaches for parametric imaging with linearized methods which include graphical analysis and mulilinear regression analysis.

Leak Detection in a Water Pipe Network Using the Principal Component Analysis (주성분 분석을 이용한 상수도 관망의 누수감지)

  • Park, Suwan;Ha, Jaehong;Kim, Kimin
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2018.05a
    • /
    • pp.276-276
    • /
    • 2018
  • In this paper the potential of the Principle Component Analysis(PCA) technique that can be used to detect leaks in water pipe network blocks was evaluated. For this purpose the PCA was conducted to evaluate the relevance of the calculated outliers of a PCA model utilizing the recorded pipe flows and the recorded pipe leak incidents of a case study water distribution system. The PCA technique was enhanced by applying the computational algorithms developed in this study. The algorithms were designed to extract a partial set of flow data from the original 24 hour flow data so that the variability of the flows in the determined partial data set are minimal. The relevance of the calculated outliers of a PCA model and the recorded pipe leak incidents was analyzed. The results showed that the effectiveness of detecting leaks may improve by applying the developed algorithm. However, the analysis suggested that further development on the algorithm is needed to enhance the applicability of the PCA in detecting leaks in real-world water pipe networks.

  • PDF

Twin anemia polycythemia sequence in a dichorionic diamniotic pregnancy: a case report

  • Lee, Soo-Young;Bae, Jin Young;Hong, Seong Yeon
    • Journal of Yeungnam Medical Science
    • /
    • v.39 no.2
    • /
    • pp.150-152
    • /
    • 2022
  • Complications related to the vascular anastomosis of the placental vessels in monochorionic twins are fatal. The clinical syndromes of feto-fetal transfusion include twin anemia polycythemia sequence (TAPS), twin-twin transfusion syndrome, and twin reversed arterial perfusion sequence. We present an extremely rare case of TAPS in a dichorionic diamniotic pregnancy. A 36-year-old woman, gravida 0, para 0, was referred to our hospital with suspected preterm premature membrane rupture. Although her pelvic examination did not reveal specific findings, the non-stress test result showed minimal variability in the first fetus and late deceleration in the second one. An emergency cesarean section was performed. The placenta was fused, and one portion of the placenta was pale, while the other portion was dark red. The hemoglobin level of the first fetus was 7.8 g/dL and that of the second one was 22.2 g/dL.

Pattern Analysis of Personalized ECG Signal by Q, R, S Peak Variability (Q, R, S 피크 변화에 따른 개인별 ECG 신호의 패턴 분석)

  • Cho, Ik-Sung;Kwon, Hyeog-Soong;Kim, Joo-Man;Kim, Seon-Jong;Kim, Byoung-Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.1
    • /
    • pp.192-200
    • /
    • 2015
  • Several algorithms have been developed to classify arrhythmia which rely on specific ECG(Electrocardiogram) database. Nevertheless personalized difference of ECG signal exist, performance degradation occurs because of carrying out diagnosis by general classification rule. Most methods require accurate detection of P-QRS-T point, higher computational cost and larger processing time. But it is difficult to detect the P and T wave signal because of person's individual difference. Therefore it is necessary to classify the pattern by analyzing personalized ECG signal and extracting minimal feature. Thus, QRS pattern Analysis of personalized ECG Signal by Q, R, S peak variability is presented in this paper. For this purpose, we detected R wave through the preprocessing method and extract eight feature by amplitude and phase variability. Also, we classified nine pattern in realtime through peak and morphology variability. PVC, PAC, Normal, LBBB, RBBB, Paced beat arrhythmia is evaluated by using 43 record of MIT-BIH arrhythmia database. The achieved scores indicate the average of 93.72% in QRS pattern detection classification.

320-Channel Multi-Frequency Trans-Admittance Scanner(TAS) for Anomaly Detection (도전율 및 유전율이 다른 병소의 검출을 위한 320-채널 다주파수 Trans-Admittance Scanner(TAS))

  • Oh, Tong-In;Lee, Min-Hyoung;Kim, Hee-Jin;Woo, Eung-Je
    • Journal of Biomedical Engineering Research
    • /
    • v.28 no.1
    • /
    • pp.84-94
    • /
    • 2007
  • In order to collect information on local distribution of conductivity and permittivity underneath a scan probe, we developed a multi-frequency trans-admittance scanner (TAS). Applying a sinusoidal voltage with variable frequency on a chosen distal part of a human body, we measure exit currents from 320 grounded electrodes placed on a chosen surface of the subject. The electrodes are packaged inside a small and light scan probe. The system includes one voltage source and 17 digital ammeters. Front-end of each ammeter is a current-to-voltage converter with virtual grounding of a chosen electrode. The rest of the ammeter is a voltmeter performing digital phase-sensitive demodulation. Using resistor loads, we calibrate the system including the scan probe to compensate frequency-dependent variability of current measurements and also inter-channel variability among multiple. We found that SNR of each ammeter is about 85dB and the minimal measurable current is 5nA. Using saline phantoms with objects made from TX-151, we verified the performance of the lesion estimation algorithm. The error rate of the depth estimation was about 19.7%. For the size estimate, the error rate was about 15.3%. The results suggest improvement in lesion estimation algorithm based on multi-frequency trans-admittance data.