• 대한소아치과학회지
• /
• 제51권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.

• 한국측량학회지
• /
• 제28권1호
• /
• pp.73-82
• /
• 2010

지형 참조 항법 기술 중 하나인 TERCOM은 순항미사일에 장착되어 있는 시스템으로 현재까지도 지속적으로 연구되고 있는 기술이다. 본 논문에서는 영역기반 정합 기법과 확장형 칼만필터를 이용하여 TERCOM에 기반한 지형 참조 항법을 시뮬레이션을 통해 분석하였다. 영역기반 정합의 유사성 분석에는 평균제곱오차 알고리즘과 상호상관정합 알고리즘을 적용하였다. 기압 고도계와 레이더 고도계, SRTM DTM을 탑재한 항체가 시속 1000km로 545초 간 장방형 궤적으로 비행하도록 시뮬레이션 하였으며, 그 결과 평균제품오차 기반 알고리즘의 거리 오차의 표준연차는 99.6m 상호상판정합 기반 알고리즘은 34.3m로 상호상관정합 기반 알고리즘이 상대적으로 지형에 덜 민감하고 두 알고리즘 모두 지형의 기복 정도에 따라 항법 정밀도의 편차가 큰 것으로 나타났다. 따라서 완만한 지형에도 민감한 알고리즘과 관성항법 적분오차 증가에 따라 적절한 탐색영역의 크기 결정, 비행환경에 따라 요구되는 최적의 지형 데이터베이스의 해상도 결정 등에 대한 연구가 수행되어야 할 것으로 판단된다.

• 감성과학
• /
• 제17권2호
• /
• pp.123-134
• /
• 2014

스타일이나 색채 톤과 같은 의복 요소에 대한 사용자의 감성은 섬유패션산업에서 소비자와 시장에 대하여 제품의 호소력에 큰 영향을 미친다. 따라서 호소력 높은 섬유패션 제품을 개발하기 위해서는 의복의 감성과 적절한 용도의 관련성과 같은 상호관련 또는 복합적 연구가 필수적이며 이를 위해서는 과학적인 방법을 이용하여야 한다. 본 연구의 목적은 색채 톤과 여성의 대표적인 의복 블라우스의 감성을 측정하고 블라우스 종류에 따른 최적의 색채 톤을 발견하는 것이다. 대학생을 대상으로 설문조사를 통하여 블라우스 종류와 색채 톤 사이에 의미있는 연관성을 발견하였다. 대학생들이 가장 선호하는 종류는 셔츠 블라우스와 브라이트 톤이었다. 비비드 톤도 선호하였지만 블라우스로는 부적합하다고 응답하였다. 블라우스에는 색채톤 중에서 브라이트 톤이 가장 잘 어울린다고 답하였으며 각 블라우스 종류마다 1-2가지 최적 색채 톤이 있다고 답하였으며 블라우스의 감성과 색채 톤의 감성 간에 깊은 상관이 있었으며 블라우스의 감성에 따라서 최적 색채 톤이 결정되었다. 이는 성별, 전공유무와 상관이 없이 거의 동일하였다.

• 정보처리학회논문지B
• /
• 제10B권7호
• /
• pp.811-814
• /
• 2003

본 논문에서는 십자패턴과 육각패턴을 이용한 고속 블록 정합 동작 예측 기법을 제안한다. 블록 기반 탐색에서 전역 탐색방법이 가장 좋은 동작벡터를 찾지만, 탐색영역 내의 모든 전을 검색하기 때문에 많은 시간을 필요로 하게 된다. 본 방법은 대부분의 동영상에서 동작벡터가 블록의 중심 부근에 집중적으로 분포함을 착안하여 십자패턴으로 중앙을 우선 탐색한 다음 움직임이 큰 동작벡터를 육각패턴을 사용하여 찾는다. 실험결과, 본 방법은 기존의 탐색방법보다 화질과 탐색시간에서 대부분의 경우에 좋은 성능을 보임을 알 수 있다.

• 대한수학회보
• /
• 제55권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}$.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 합동 추계학술대회 논문집 정보 및 제어부문
• /
• 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.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권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
• /
• 제8권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• 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.

• 전자공학회논문지C
• /
• 제34C권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.