• Journal of the Korean Statistical Society
• /
• 제36권1호
• /
• pp.77-91
• /
• 2007

This paper considers development of noninformative priors for the familial data when the families have equal number of offspring. Several noninformative priors including the widely used Jeffreys' prior as well as the different reference priors are derived. Also, a simultaneously-marginally-probability-matching prior is considered and probability matching priors are derived when the parameter of interest is inter- or intra-class correlation coefficient. The simulation study implemented by Gibbs sampler shows that two-group reference prior is slightly edge over the others in terms of coverage probability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권2호
• /
• pp.757-770
• /
• 2020

We propose a hand gesture recognition method that is compatible with a head-up display (HUD) including small processing resource. For fast link adaptation with HUD, it is necessary to rapidly process gesture recognition and send the minimum amount of driver hand gesture data from the wearable device. Therefore, we use a method that recognizes each hand gesture with an inertial measurement unit (IMU) sensor based on revised correlation matching. The method of gesture recognition is executed by calculating the correlation between every axis of the acquired data set. By classifying pre-defined gesture values and actions, the proposed method enables rapid recognition. Furthermore, we evaluate the performance of the algorithm, which can be implanted within wearable bands, requiring a minimal process load. The experimental results evaluated the feasibility and effectiveness of our decomposed correlation matching method. Furthermore, we tested the proposed algorithm to confirm the effectiveness of the system using pre-defined gestures of specific motions with a wearable platform device. The experimental results validated the feasibility and effectiveness of the proposed hand gesture recognition system. Despite being based on a very simple concept, the proposed algorithm showed good performance in recognition accuracy.

• 방송공학회논문지
• /
• 제15권6호
• /
• pp.768-782
• /
• 2010

다시점 비디오의 조명 불일치 현상은 서로 다른 카메라의 위치와 카메라간의 불완전한 보정(calibration)으로 인하여 발생한다. 이러한 인접 시점간의 색상 불일치는 획득된 영상을 참조 영상으로 이용하여 부호화하는 다시점 비디오 부호화(multi-view video coding)의 성능을 저하시키는 요인이 된다. 이러한 조명 불일치를 보상하기 위한 방법 중에서 히스토그램 매칭(histogram matching)을 이용한 전처리 기법이 있다. 히스토그램 매칭을 통해 모든 시점 영상의 히스토그램은 정해진 참조 시점 영상의 히스토그램으로 매칭되어지고 다시점 비디오 부호화의 성능을 개선할 수 있다. 그러나 다시점 비디오 시퀀스는 카메라와 등장인물의 이동으로 인하여 시점 간 영상뿐만 아니라, 한 시점 내에 시간의 흐름에 따른 영상간의 히스토그램 분포가 서로 다를 수 있다. 참조 시점 시퀀스에 속한 모든 영상을 참조하는 기존의 히스토그램 매칭 기법은 시공간적으로 상관성이 높지 않은 영상의 조명을 효과적으로 보상하기에 적합하지 않다. 본 논문에서는 시점 영상 간의 색상 분포의 차이를 보이는 다시점 비디오를 보상하여 공간적 상관성을 높이기 위해 두 조건식이 반영된 영상분리 기법을 적용한 레이어별 히스토그램 매칭 기법과 시간의 흐름에 따라 색상 분포의 차이를 보이는 다시점 비디오를 비디오 부호화의 단위인 화면 그룹(group of pictures : GOP)별로 보상하여 시간적 상관성을 높이는 개별적인 히스토그램 매칭 기법을 제안한다. 실험을 통해 제안하는 조명 보상 기법이 기존의 조명 보상 기법보다 향상된 다시점 비디오 부호화 효율을 보이는 것을 확인하였다.

• 방송공학회논문지
• /
• 제19권2호
• /
• pp.227-239
• /
• 2014

본 논문은 영상처리용 SoC에서 외부 메모리 대역폭을 효과적으로 낮추기 위한 near-lossless 이미지 코더의 압축 성능을 향상시키는 새로운 예측 기법을 제안한다. 먼저, RGB 간 correlation을 고려하여 이미 복원된 G 성분을 기반으로 R과 B 성분을 효과적으로 예측하는 inter-color prediction을 수행한다. 다음으로 가변 블록 예측을 통해 예측 성능을 향상시킨다. 마지막으로 이전 프레임에서 sampling된 템플릿 dictionary를 이용해 G 성분 예측 시 최소한의 내부 메모리만을 사용하여 시간 축 예측 성능을 개선시키는 방법을 제안한다. 실험 결과를 통해 자연 영상의 경우 기존 기법 대비 평균적으로 약 30%의 코딩 효율 향상을 보이고, CG 영상의 경우에는 평균 60% 정도의 성능 향상을 보임을 알 수 있다.

• 대한한의학원전학회지
• /
• 제34권3호
• /
• pp.101-123
• /
• 2021

Objectives : To examine the six positions correlation[六部定位] principle that is the basis of the wrist pulse diagnosis in the Neijing. Methods : The basis for argument was established by correcting an interpretation error of the theory of chi (尺) skin diagnosis. In order to accomplish this, the annotations of Yang Shangshan and Wangbing were investigated first, after which the specific meaning and methodology of the chi diagnostic method as written in many chapters of the Neijing were examined. The evidence and reasoning for the six positions correlation[六部定位] was looked into, in relation to Wangbing's annotation of the chapter, Maiyaojingweilun. The theoretical basis of the six positions correlation was searched throughout the entire Neijing, based on the correlation between Liuhe and the six positions, the five elements inter-supporting theory embedded in the six positions correlation as a diagnosis model that integrates zhangfu and meridians/channels, and the meaning of the spacial concepts used when describing the tactile technique within the chapter. Lastly, contents related to the five zhang channels within the Neijing were reviewed, to determine whether the six positions correlation was applied in wrist pulse taking Results & Conclusions : Some interpretations of the verse on matching the positions in the Maiyaojingweilun chapter of the Neijing are erroneous, while the argument that the three positions[cun-guan-chi] cannot be found in the Neijing is false as well. The wrist pulse taking in the Neijing is precisely based on the three positions correlation that divides the cun-guan-chi positions into three, and the correlation verse in the Maiyaojingweilun chapter clearly suggests the principle of matching the zhangfu and meridian/channels to the six positions of the cun-guan-chi of both left and right.

• The Journal of Advanced Prosthodontics
• /
• 제10권3호
• /
• pp.252-258
• /
• 2018

PURPOSE. The purpose of this study was to evaluate the repeatability and matching accuracy between two identical intraoral spectrophotometers. MATERIALS AND METHODS. The maxillary right central incisor, canine, and mandibular left central incisor of each of 30 patients were measured using 2 identical intraoral spectrophotometers with different serial numbers (EasyShade V). The color of each shade tab from 3 shade guides (VITA 3D-Master) was also determined with both devices. All measurements were performed by a single operator. Statistical analyses were performed to verify the repeatability, accuracy, and the differences between the devices with paired t-tests, one-way ANOVA, and intra-class correlation coefficients (ICCs) (${\alpha}=.05$). RESULTS. A high level of measurement repeatability (ICC>0.90) among $L^*$, $a^*$, and $b^*$ color components was observed within and between devices (P<.001). Intra-device matching agreement rates were 80.00% and 81.11%, respectively, while inter-device matching agreement rate was 51.85%. ANOVA revealed no significant different color values within each device, while paired t-test provided significant different color values between both devices. The CIEDE2000 color differences between both devices were $2.28{\pm}1.61$ ${\Delta}E_{00}$ for in-vivo readings. Regarding the clinical matching accuracy of both devices, ${\Delta}E_{00}$ values between teeth and matching shade tabs were $3.05{\pm}1.19$ and $2.86{\pm}1.02$, respectively. CONCLUSION. Although two EasyShade V devices with different serial numbers show high repeatability of CIE $L^*$, $a^*$, and $b^*$ measurements, they could provide different color values and shade for the same tooth.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1996년도 Proceedings International Workshop on New Video Media Technology
• /
• pp.72-76
• /
• 1996

We propose a novel algorithm for fractal video sequence coding, based on the circular prediction mapping (CPM), in which each range block is approximated by a domain block in the circularly previous frame. In our approach, the size of the domain block is set to be same as that of the range block for exploiting the high temporal correlation between the adjacent frames, while most other fractal coders use the domain block larger than the range block. Therefore the domain-range mapping in the CPM is similar to the block matching algorithm in the motion compensation techniques, and the advantages of this similarity are discussed. Also we show that the CPM can be combined with non-contractive inter-frame mapping (NCIM), improving the performance of the fractal sequence coder further. The computer simulation results on real image sequences demonstrate that the proposed algorithm provides very promising performance at low bit-rate, ranging from 40 Kbps to 250 Kbps.

• 한국통신학회논문지
• /
• 제34권3C호
• /
• pp.288-296
• /
• 2009

POCS (projection onto convex sets)를 이용하는 고해상도 영상 재구성에서는 재구성 연산 사이에 프레임간 움직임을 추정함으로써 양질의 HR (high resolution) 영상을 얻을 수 있으나, 반복적인 움직임 추정으로 인해 연산량은 증가한다. 본 논문에서는 기존의 ARPS (adaptive rood pattern search) 움직임 추정법을 수정하여 연산량을 줄이면서, 움직임 추정과 POCS 복원을 동시에 수행하는 HR 영상의 재구성 알고리즘을 제안한다. ARPS에서 필요한 기준 움직임의 값으로 POCS 복원의 이전 단계에서 추정한 움직임 벡터의 값과 위상 상관도법으로 얻은 값을 이용하여 연산량을 줄였다. 또한, 추정된 움직임을 정규화하여 그 정확도를 더욱 향상시켰다. 실험 결과, 전체탐색 블록 정합법과 POCS를 동시에 수행하여 영상을 재구성한 경우와 비교했을 때 유사한 화질의 HR 영상을 약 30배 빠르게 재구성하였다.

• Asia pacific journal of information systems
• /
• 제18권1호
• /
• pp.79-96
• /
• 2008

One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching for expanding results from an exact matching engine to query the OWL(Web Ontology Language) MIT Process Handbook. MIT Process Handbook is an electronic repository of best-practice business processes. The Handbook is intended to help people: (1) redesigning organizational processes, (2) inventing new processes, and (3) sharing ideas about organizational practices. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. Many previous studies devised artificial dataset composed of randomly generated numbers without real meaning and used subjective ratings for correct answers and similarity values between processes. To generate a semantic-preserving test data set, we create 20 variants for each target process that are syntactically different but semantically equivalent using mutation operators. These variants represent the correct answers of the target process. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We use simple similarity algorithms for text retrieval such as TF-IDF and Levenshtein edit distance to devise our approaches, and utilize tree edit distance measure because semantic processes are appeared to have a graph structure. Also, we design similarity algorithms considering similarity of process structure such as part process, goal, and exception. Since we can identify relationships between semantic process and its subcomponents, this information can be utilized for calculating similarities between processes. Dice's coefficient and Jaccard similarity measures are utilized to calculate portion of overlaps between processes in diverse ways. We perform retrieval experiments to compare the performance of the devised similarity algorithms. We measure the retrieval performance in terms of precision, recall and F measure? the harmonic mean of precision and recall. The tree edit distance shows the poorest performance in terms of all measures. TF-IDF and the method incorporating TF-IDF measure and Levenshtein edit distance show better performances than other devised methods. These two measures are focused on similarity between name and descriptions of process. In addition, we calculate rank correlation coefficient, Kendall's tau b, between the number of process mutations and ranking of similarity values among the mutation sets. In this experiment, similarity measures based on process structure, such as Dice's, Jaccard, and derivatives of these measures, show greater coefficient than measures based on values of process attributes. However, the Lev-TFIDF-JaccardAll measure considering process structure and attributes' values together shows reasonably better performances in these two experiments. For retrieving semantic process, we can think that it's better to consider diverse aspects of process similarity such as process structure and values of process attributes. We generate semantic process data and its dataset for retrieval experiment from MIT Process Handbook repository. We suggest imprecise query algorithms that expand retrieval results from exact matching engine such as SPARQL, and compare the retrieval performances of the similarity algorithms. For the limitations and future work, we need to perform experiments with other dataset from other domain. And, since there are many similarity values from diverse measures, we may find better ways to identify relevant processes by applying these values simultaneously.

• 한국건설관리학회논문집
• /
• 제14권1호
• /
• pp.82-90
• /
• 2013

건설 산업의 속성상 프로젝트의 성과를 정량적으로 분석하기 위해서는 다양한 영향인자에 대한 고려가 필수적이다. 프로젝트의 특성과 성과와의 관계를 파악하고, 프로젝트에 가장 적합한 관리기법을 적용시켜서 프로젝트의 성과를 향상시키기 위해서는 성과관련 정보를 축적시켜 관리하기 위한 시스템적인 접근이 요구되고 있다. 그럼에도 불구하고 많은 성과관련 시스템들은 성과결과의 분석에만 치중하여 프로젝트의 특성이나 관리기법 등 성과에 영향을 미치는 인자에 대한 심도 있는 분석방법과 접근방식에 대한 고려 부족으로 인해 성과시스템의 활발한 적용을 기대할수 없었다. 이에 본 연구는 건설 프로젝트의 특성을 고려하여 성과를 사전에 예측하고 성과체계를 정량적으로 모델링할수 있는 성과정보시스템을 개발하는 데 목적을 두었다. 이를 위해 실제 사례프로젝트의 성과관련 정보를 바탕으로 성과결과와 프로젝트 특성, 관리기법 간의 상관관계를 분석함으로써 해당 프로젝트에 가장 적합한 관리기법을 도출할수 있는 방안을 수립하였다. 그 결과, 성과영역별로 다양한 관점에서 프로젝트의 성과비교가 가능할 수 있는 정량화 방안을 정립하였고, 상관관계 분석을 통해 성과예측이 가능한 모델을 제안하였으며, 기존 데이터 분석을 통해 최적 관리기법을 선정할수 있는 시스템을 개발하였다. 웹기반 프로그램으로 구축된 시스템은 향후 데이터베이스의 지속한 관리와 보완을 통해서 성과정보의 양을 확대시킨다면 통계적으로 유의미한 결과를 바탕으로 신뢰성 있는 프로젝트 성과 관리를 도모할수 있을 것으로 사료된다.