• Journal of the Korean Statistical Society
• /
• v.36 no.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)
• /
• v.14 no.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.

• Journal of Broadcast Engineering
• /
• v.15 no.6
• /
• pp.768-782
• /
• 2010

Because of the different shooting position between multi-view cameras and the imperfect camera calibration, Illumination mismatches of multi-view video can happen. This variation can bring about the performance decrease of multi-view video coding(MVC) algorithm. A histogram matching algorithm can be applied to recompensate these inconsistencies in a prefiltering step. Once all camera frames of a multi-view sequence are adjusted to a predefined reference through the histogram matching, the coding efficiency of MVC is improved. However the histogram distribution can be different not only between neighboring views but also between sequential views on account of movements of camera angle and some objects, especially human. Therefore the histogram matching algorithm which references all frames in chose view is not appropriate for compensating the illumination differences of these sequence. Thus we propose new algorithms both the image classification algorithm which is applied two criteria to improve the correlation between inter-view frames and the histogram matching which references and matches with a group of pictures(GOP) as a unit to advance the correlation between successive frames. Experimental results show that the compression ratio for the proposed algorithm is improved comparing with the conventional algorithms.

• Journal of Broadcast Engineering
• /
• v.19 no.2
• /
• pp.227-239
• /
• 2014

This paper proposes an enhance prediction for conventional near-lossless coder to effectively lower external memory bandwidth in image processing SoC. First, we utilize an already reconstructed green component as a base of predictor of the other color component because high correlation between RGB color components usually exists. Next, we can improve prediction performance by applying variable block size prediction. Lastly, we use minimum internal memory and improve a temporal prediction performance by using a template dictionary that is sampled in previous frame. Experimental results show that the proposed algorithm shows better performance than the previous works. Natural images have approximately 30% improvement in coding efficiency and CG images have 60% improvement on average.

• Journal of Korean Medical classics
• /
• v.34 no.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
• /
• v.10 no.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.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1996.06b
• /
• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3C
• /
• pp.288-296
• /
• 2009

In POCS (projection onto convex sets)-based reconstruction of HR (high resolution) image, the quality of reconstructed image is gradually improved through iterative motion estimation and image restoration. The amount of computation, however, increases because of the repeated inter-frame motion estimation. In this paper, an HR reconstruction algorithm is proposed where modified ARPS (adaptive rood pattern search) and POCS are simultaneously performed. In the modified ARPS, the motion estimates obtained from phase correlation or from the previous steps in POCS restoration are utilized as the initial reference in the motion estimation. Moreover, estimated motion is regularized with reference to the neighboring blocks' motion to enhance the reliability. Computer simulation results show that, when compared to conventional methods which are composed of full search block matching and POCS restoration, the proposed method is about 30 times faster and yet produces HR images of almost equal or better quality.

• Asia pacific journal of information systems
• /
• v.18 no.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.

• Korean Journal of Construction Engineering and Management
• /
• v.14 no.1
• /
• pp.82-90
• /
• 2013

In the construction industry, there are so many qualitative factors affecting the performance of a project. So it is crucial to measure the factors in an effective way in order to analyze the interrelationship among the various factors. To improve the performance level of a project, it is also important to identify the most appropriate management practices which are inter-linked with the subject project. The purpose of this study is to develop a project performance management system (PPMS) to quantitatively analyze the variety of project performance data and identify the best management practice to increase the potential level of a particular performance area. Using a comparative statistical method, this study developed a quantification method and web-based computerized system to enhance the usage of the system. The system, however, is still under the validation stage because of the shortage of data set. In the future, when more and more completed project data are stored in the system, the system would play a crucial role in predicting the performance level and matching the best management practice for a subject project. In addition, the system can also be modified as a tool for a business- or industry-level system by incorporating the existing enterprise resource programs.