• Journal of the korean academy of Pediatric Dentistry
• /
• v.51 no.2
• /
• pp.176-184
• /
• 2024

This study aimed to compare color matching between single-shade composite resin-restored teeth with various pulp capping materials and the dentin surrounding the restoration through instrumental analysis and visual evaluation of the color difference. Fifty maxillary right central incisor acrylic resin teeth were prepared with standardized Class III cavities on the proximal surfaces. These teeth were divided into five groups: restored with single-shade composite resin only; Ultra-Blend^TM plus followed by single-shade composite resin; TheraCal PT^TM followed by single-shade composite resin; Endocem^® MTA premixed followed by single-shade composite resin; and Well-root PT^TM followed by single-shade composite resin. The color difference (ΔE_ab^*) between the restored area and the center of the resin teeth was measured using a spectrophotometer. No significant color difference was observed in groups restored with only single-shade composite resin, Ultra-Blend^TM plus, and TheraCal PT^TM. The visual evaluation revealed that Ultra-Blend^TM plus exhibited the best color matching score, whereas the Endocem^® MTA premixed and Well-root PT^TM groups showed significantly lower color matching scores than the single-shade composite resin-only group. When opting for single-shade composite resin usage for anterior tooth restorations with the aim of reducing chair time, pulp capping materials Ultra-Blend^TM plus and TheraCal PT^TM provide esthetically pleasing results.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.1
• /
• pp.73-82
• /
• 2010

TERCOM(TERrain COntour Matching), which is the one of the Terrain Referenced Navigation and used in the cruise missile navigation system, is still under development. In this study, the TERCOM based on area-based matching algorithm and extended Kalman filter is analysed through simulation. In area-based matching, the mean square difference (MSD) and cross-correlation matching algorithms are applied. The simulation supposes that the barometric altimeter, radar altimeter and SRTM DTM loaded on board. Also, it navigates along the square track for 545 seconds with the velocity of 1000km per hour. The MSD and cross-correlation matching algorithms show the standard deviation of position error of 99.6m and 34.3m, respectively. The correlation matching algorithm is appeared to be less sensitive than the MSD algorithm to the topographic undulation and the position accuracy of the both algorithms is extremely depends on the terrain. Therefore, it is necessary to develop an algorithm that is more sensitive to less terrain undulation for reliable terrain referenced navigation. Furthermore, studies on the determination of proper matching window size in long-term flight and the determination of the best terrain database resolution needed by the flight velocity and area should be conducted.

• Science of Emotion and Sensibility
• /
• v.17 no.2
• /
• pp.123-134
• /
• 2014

Sensibilities to the clothing components such as style and color tone of fashion product are considered important to the consumers in fashion industry today. So the combinational study of clothing sensibility and proper end-use style are needed to improve the product refinements in developing process through scientific research method. The purpose of this study is to measure the sensibilities of the blouse type as a clothing component for it is a representative garment of women and to look for the best matching color tone according to blouse type. We surveyed the questionnaire to two hundred college students and found that there was a meaningful relational consistency between blouse type and color tone. Blouses have been told the best if they are of Bright color tone. They preferred Shirt blouse type and Bright color tone best of all. They are fond of Vivid color tone but they think Vivid tone is not so proper to the blouses. Each blouse has 1~2 best-fit color tones, and color sensibility affect the harmony of blouse style and color tone. The sensibilities of blouse type and color tone are deeply correlated each other regardless of subject's major or gender except a few cases.

• The KIPS Transactions:PartB
• /
• v.10B no.7
• /
• pp.811-814
• /
• 2003

In this paper, we propose a fast block-matching motion estimation method using the cross pattern and the hexagonal pattern. For the block-matching motion estimation method, full search finds the best motion estimation, but it requires huge search time because it has to check every search point within the search window. The proposed method makes use of the fact that most of motion vectors lie near the center of block. The proposed method first uses the cross pattern to search near the center of block, and then uses the hexagonal pattern to search larger motion vectors. Experimental results show that our method is better than recently proposed search algorithms in terms of mean-square error performance and required search time.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.5
• /
• pp.1523-1528
• /
• 2018

For $r{\geq}2$, let ${\mathcal{H}}$ be an r-uniform hypergraph with n vertices and m hyperedges. Let R be a random vertex set obtained by choosing each vertex of ${\mathcal{H}}$ independently with probability p. Let ${\mathcal{H}}[R]$ be the subhypergraph of ${\mathcal{H}}$ induced on R. We obtain an upper bound on the matching number ${\nu}({\mathcal{H}}[R])$ and a lower bound on the independence number ${\alpha}({\mathcal{H}}[R])$ of ${\mathcal{H}}[R]$. First, we show that if $mp^r{\geq}{\log}\;n$, then ${\nu}(H[R]){\leq}2e^{\ell}mp^r$ with probability at least $1-1/n^{\ell}$ for each positive integer ${\ell}$. It is best possible up to a constant factor depending only on ${\ell}$ if $m{\leq}n/r$. Next, we show that if $mp^r{\geq}{\log}\;n$, then ${\alpha}({\mathcal{H}}[R]){\geq}np-{\sqrt{3{\ell}np\;{\log}\;n}-2re^{\ell}mp^r$ with probability at least $1-3/n^{\ell}$.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.159-162
• /
• 2002

This paper presents a modified localization scheme of a mobile robot. When it navigates, the position error of a robot is increased and doesn't go to a goal point where the robot intends to go at the beginning. The objective of localization is to estimate the position of a robot precisely. Many algorithms were developed and still are being researched for localization of a mobile robot at present. Among them, a localization algorithm named continuous localization proposed by Schultz has some merits on real-time navigation and is easy to be implemented compared to other localization schemes. Continuous Localization (CL) is based on map-matching algorithm with global and local maps using only ultrasonic sensors for making grid maps. However, CL has some problems in the process of searching the best-scored-map, when it is applied to a mobile robot. We here propose fast and powerful map-matching algorithm for localization of a mobile robot by experiments.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.4
• /
• pp.212-222
• /
• 2003

The ability to efficiently and robustly recover accurate 3D terrain models from sets of stereoscopic images is important to many civilian and military applications. A stereo matching has been an important tool for reconstructing three dimensional terrain. However, there exist many factors causing stereo matching error, such as occlusion, no feature or repetitive pattern in the correlation window, intensity variation, etc. Among them, occlusion can be only resolved by true multi-image stereo. In this paper, we present multi-image stereo method using DEM fusion as one of efficient and reliable true multi-image methods. Elevations generated by all pairs of images are combined by the fusion process which accepts an accurate elevation and rejects an outlier. We propose three fusion schemes: THD(Thresholding), BPS(Best Pair Selection) and MS(Median Selection). THD averages elevations after rejecting outliers by thresholding, while BPS selects the most reliable elevation. To determine the reliability of a elevation or detect the outlier, we employ the measure of self-consistency. The last scheme, MS, selects the median value of elevations. We test the effectiveness of the proposed methods with a quantitative analysis using simulated images. Experimental results indicate that all three fusion schemes showed much better improvement over the conventional binocular stereo in natural terrain of 29 Palms and urban site of Avenches.

• Journal of Information Processing Systems
• /
• v.8 no.3
• /
• pp.389-398
• /
• 2012

Texture is an important visual feature for image analysis. Many approaches have been proposed to model and analyze texture features. Although these approaches significantly contribute to various image-based applications, most of these methods are sensitive to the changes in the scale and orientation of the texture pattern. Because textures vary in scale and orientations frequently, this easily leads to pattern mismatching if the features are compared to each other without considering the scale and/or orientation of textures. This paper suggests an Orientation Matching Scheme (OMS) to ease the problem of mismatching rotated patterns. In OMS, a pair of texture features will be compared to each other at various orientations to identify the best matched direction for comparison. A database including rotated texture images was generated for experiments. A synthetic retrieving experiment was conducted on the generated database to examine the performance of the proposed scheme. We also applied OMS to the similarity computation in a K-means clustering algorithm. The purpose of using K-means is to examine the scheme exhaustively in unpromising conditions, where initialized seeds are randomly selected and algorithms work heuristically. Results from both types of experiments show that the proposed OMS can help improve the performance when dealing with rotated patterns.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.153-155
• /
• 2004

This paper proposes a real-time approach on the rotational motion estimation and correction for the roll stabilization of the sight system. This method first estimates a rotation center by the least-mean square algorithm based on the motion vectors of some feature points. And, then, a rotation angle is searched for a best matching block between a reference block image and seccessive input images using MPC(maximum pixel count) matching criterion. Finally, motion correction is performed by the bilinear interpolation technique. Various computer simulations show that the estimation performance is good and the proposed algorithm is a real-time implementable one to the TMS320C6415(500MHz) DSP.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.9
• /
• pp.84-101
• /
• 1997

Inferring and recognizing 3D objects form a 2D occuluded image has been an important research area of computer vision. The octree model, a hierarchical volume description of 3D objects, may be utilized to generate projected images from arbitrary viewing directions, thereby providing an efficient means of the data base for 3D object recognition. We present a fast algorithm of finding the 4 pairs of feature points to estimate the viewing direction. The method is based on matching the object contour to the reference occuluded shapes of 49 viewing directions. The initially best matched viewing direction is calibrated by searching for the 4 pairs of feature points between the input image and the image projected along the estimated viewing direction. Then the input shape is recognized by matching to the projectd shape. The computational complexity of the proposed method is shown to be O(n$^{2}$) in the worst case, and that of the simple combinatorial method is O(m$^{4}$.n$^{4}$) where m and n denote the number of feature points of the 3D model object and the 2D object respectively.