• 대한치과보철학회지
• /
• 제42권5호
• /
• pp.544-555
• /
• 2004

Statement of problem: Shade selection has traditionally been accomplished by visual examination, which is particularly relevant to the shade selection of anterior teeth, but the subjective nature of visual analysis can lead to errors in shade matching. Recently shade selection systems have been developed to provide a more objective and scientific approach to understanding and clarifying shade selection. Purpose : The purpose of this study was analysis of various shade analyzing equipment with the goal of providing a more objective shade selection. Materials and method: Visual shade matching system selection(Vita Lumin Vacuum shade guide, Vitapan 3D Master shade guide) and mechanical shade matching method($ShadeEye^{(R)}$-EX Chroma Meter, $Shadescan^{TM}$ System) used for this study. The shade guide tap specimens for 10 extracted maxillary anterior teeth were produced by selecting shades using each shade matching system. The accuracy of the selection of shades for the teeth and fabricated specimens were evaluated by analyzing the calculated shade difference(${\Delta}E^*$), using a spectrophotometer and calculating the output of value $L^*,\;a^*,\;b^*$. Results and conclusion: The results show that the average ${\{Delta}E^*$ value (difference of shade) of the shade tap specimens to the actual specimen decreased in the following order: Vita Lumin Vacuum Shade Guide(VL), $ShadeEye^{(R)}$-EX Chroma Meter(SE) Vitapan 3D Master Shade guide(V3), and $Shadescan^{TM}$ System(55) : and that there are significant statistical differences between the VL and SS (p<0.05). In the analysis of the ${\Delta}E^*$ (difference of shade) value,40% of the VL group was found to be less than 3.3 (limit value of shade tap specimens clinically acceptable), 60% in the V3 group, 50% in the SE group, and 80% in the SS group.

• Journal of Information Processing Systems
• /
• 제16권6호
• /
• pp.1343-1358
• /
• 2020

In the stagewise arithmetic orthogonal matching pursuit algorithm, the weak threshold used in sparsity estimation is determined via maximum iterations. Different maximum iterations correspond to different thresholds and affect the performance of the algorithm. To solve this problem, we propose an improved variable weak threshold based on the stagewise arithmetic orthogonal matching pursuit algorithm. Our proposed algorithm uses the residual error value to control the weak threshold. When the residual value decreases, the threshold value continuously increases, so that the atoms contained in the atomic set are closer to the real sparsity value, making it possible to improve the reconstruction accuracy. In addition, we improved the generalized Jaccard coefficient in order to replace the inner product method that is used in the stagewise arithmetic orthogonal matching pursuit algorithm. Our proposed algorithm uses the covariance to replace the joint expectation for two variables based on the generalized Jaccard coefficient. The improved generalized Jaccard coefficient can be used to generate a more accurate calculation of the correlation between the measurement matrixes. In addition, the residual is more accurate, which can reduce the possibility of selecting the wrong atoms. We demonstrate using simulations that the proposed algorithm produces a better reconstruction result in the reconstruction of a one-dimensional signal and two-dimensional image signal.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권10호
• /
• pp.2514-2526
• /
• 2013

This paper presents a detection method for least significant bit matching revisited (LSBMR) steganography. Previous research shows that the adjacent pixels of natural images are highly correlated and the value 0 appears most frequently in pixel difference. Considering that the message embedding process of LSBMR steganography has a weighted-smoothing effect on the distribution of pixel difference, the frequency of the occurrence of value 0 in pixel difference changes most significantly whereas other values approximately remain unchanged during message embedding. By analyzing the effect of LSBMR steganography on pixel difference distribution, an equation is deduced to estimate the frequency of difference value 0 using the frequencies of difference values 1 and 2. The sum of the ratio of the estimated value to the actual value as well as the ratio of the frequency of difference value 1 to difference value 0 is used as the steganalytic detector. Experimental results show that the proposed method can effectively detect LSBMR steganography and can outperform previous proposed methods.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권8호
• /
• pp.335-343
• /
• 2002

A segment matching algorithm in stereo vision via the fusion of multiple features on long edge segments is proposed. One problem of the previous segment matching algorithm is the similarity among the segments caused from its short length. In the proposed algorithm, edges are composed of longer segments which are obtained by breaking the edges only at the locations with distinguished changes of the shape. Such long segments can contain extra features such as curvature ratio and length of segments which could not be included in shorter ones. Use of such additional features enhances the matching accuracy significantly To fuse multiple features for matching, weighting value determination algorithm which is computed according to the degree of the contribution of each factor is proposed. The stereo matching simulations with the proposed algorithm are done about various images and their results are included.

• 대한임베디드공학회논문지
• /
• 제8권1호
• /
• pp.51-59
• /
• 2013

This paper researches location estimating method in CDMA system. Previously proposed positioning algorithms are difficult to estimate accurate position in indoor environments, and possible to limited position. This paper proposes enhanced algorithm using received PN pilot signals from base stations to enhance previous algorithms. For estimating position, we set the threshold value and use over the threshold value in received signals. After selecting signals, we estimate position using TDOA algorithm. And the cases which TDOA algorithm cannot use to estimate position, we use Pattern Matching algorithm. The proposed method system showed the improved performance in estimating parameters and locating positions by computer simulations.

• Journal of the Korean Data and Information Science Society
• /
• 제18권4호
• /
• pp.879-890
• /
• 2007

Statistical matching is a method of data integration for data sources that do not share the same units. It could produce rapidly lots of new information at low cost and decrease the response burden affecting the quality of data. This paper proposes a statistical matching technique combining k-NN (k-nearest neighborhood) and regression methods. We select k records in a donor file that have similarity in value with a specific observation of the common variable in a recipient file and estimate an imputation value for the recipient file, using regression modeling in the donor file. An empirical comparison study is conducted to show the properties of the proposed method.

• Journal of Multimedia Information System
• /
• 제5권2호
• /
• pp.143-146
• /
• 2018

The eigen value problem of a coaxial cavity and a modified pill box cavity is investigated using the mode matching technique. The coaxial cavity has a cylindrical cavity with beam ports and center conductor. The pill box cavity is the same as a coaxial cavity without center conductor. The electric field and magnetic field are formulated in propagation region and resonance region. The boundary and orthogonal conditions are applied to the electric and magnetic fields. We derived the eigen value equation by the proposed procedure in a coaxial cavity and a modified pill box cavity. The electromagnetic field of the real structure is disturbed by the coaxial wire. The effect of the coaxial wire in pill box cavity with beam ports increase the dominant resonant frequency. The coaxial line method of the coupling impedance is not adequate for a cylindrical cavity. The results of the mode matching technique and simulation agree well. The results confirm the proposed formulation is valid.

• 한국컴퓨터정보학회논문지
• /
• 제20권5호
• /
• pp.65-72
• /
• 2015

본 논문에서는 색맹인 사람들을 위한 스마트 폰 기반 색상 매칭 기법을 제안한다. 색맹인 사람들을 위해 기존 연구로 모바일 기반 애플리케이션들이 제공되기는 하였으나, 대부분의 연구가 사진 촬영 후 색상의 값, 이름만 제공할 뿐 동일 색상을 실시간으로 비교하지 못하는 불편함이 있다. 이러한 불편함을 해소하기 위해 우리는 스마트 폰의 카메라로 색상 비교를 위해 사진을 촬영하여 화면 옆에 두고, 실시간 입력되는 카메라 영상을 비교하여 유사 색상을 알려줌으로써 실시간 비교가 가능한 색상 매칭 알고리즘과 이를 이용한 애플리케이션을 개발하였다. 색상 매칭 알고리즘은 실시간 비교를 위해 Red, Green, Blue 그리고 Hue 값을 이용하여 코사인 유사도를 계산하며, 유사도 값에 따라 매칭 결과를 실시간으로 알려준다. 제안 방법의 성능을 판단하기 위해 색상 매칭 실험을 하였으며, 그 결과 매칭 성공률은 약 98%를 나타냈다. 따라서 제안 방법은 색맹인 사용자가 스마트 폰을 이용하여 자신이 원하는 색을 찾는데 효과적인 기법이 될 것이다.

• 대한원격탐사학회지
• /
• 제38권1호
• /
• pp.33-43
• /
• 2022

This study presents a method to restore an optical satellite image with distortion and occlusion due to fog, haze, and clouds to one that minimizes degradation factors by referring to the same type of peripheral image. Specifically, the time and cost of re-photographing were reduced by partially occluding a region. To maintain the original image's pixel value as much as possible and to maintain restored and unrestored area continuity, a simulation restoration technique modified with the Cycle Generative Adversarial Network (CycleGAN) method was developed. The accuracy of the simulated image was analyzed by comparing CycleGAN and histogram matching, as well as the pixel value distribution, with the original image. The results show that for Site 1 (out of three sites), the root mean square error and R² of CycleGAN were 169.36 and 0.9917, respectively, showing lower errors than those for histogram matching (170.43 and 0.9896, respectively). Further, comparison of the mean and standard deviation values of images simulated by CycleGAN and histogram matching with the ground truth pixel values confirmed the CycleGAN methodology as being closer to the ground truth value. Even for the histogram distribution of the simulated images, CycleGAN was closer to the ground truth than histogram matching.

• Journal of the Korean Data and Information Science Society
• /
• 제18권2호
• /
• pp.279-287
• /
• 2007

Data fusion is the process of combining multiple data in order to produce information of tactical value to the user. Data fusion is generally defined as the use of techniques that combine data from multiple sources and gather that information in order to achieve inferences. Data fusion is also called data combination or data matching. Data fusion is divided in five branch types which are exact matching, judgemental matching, probability matching, statistical matching, and data linking. In this paper, we develop was macro program for statistical matching which is one of five branch types for data fusion. And then we apply data fusion and association rule techniques to environmental data.