• Title/Summary/Keyword: Matching Value

Search Result 601, Processing Time 0.03 seconds

In vitro evaluation of color and translucency reproduction of maxillofacial prostheses using a computerized system

  • Nemli, Secil Karakoca;Gungor, Merve Bankoglu;Bagkur, Meral;Bal, Bilge Turhan;Arici, Yeliz Kasko
    • The Journal of Advanced Prosthodontics
    • /
    • v.10 no.6
    • /
    • pp.422-429
    • /
    • 2018
  • PURPOSE. Accurate color matching of maxillofacial prostheses to skin is important for esthetics. A computerized color matching system specific to human skin has recently been developed. The purpose of this study was to evaluate the accuracy in color and translucency matching of the computerized color matching system across different skin colors. MATERIALS AND METHODS. The silicone was colored to simulate 28 different skin colors (n=5) to serve as "target skin colors". Using a spectrocolorometer (e-skin), color codes were determined for "replicate skin color" fabrication. CIELAB Delta-E between target skin color-replicate skin color pairs and translucency parameter were calculated. CIELAB Delta-E values were compared with one-way ANOVA and Tukey multiple-comparison. The agreement between $L^*$, $a^*$, $b^*$ and translucency parameter of target skin colors and replicate skin color were calculated by a two-way mixed average measures intraclass correlation coefficient. Translucency parameter of target skin color- replicate skin color pairs were compared with Paired t-test (${\alpha}=.05$). RESULTS. The mean CIELAB Delta-E value was 3.83 and significant differences were found among colors. The intraclass correlation coefficient showed excellent reliability for $L^*$, $a^*$, $b^*$ and good reliability for translucency parameter (P<.001). The mean translucency parameter of replicate skin colors was significantly higher than that of translucency parameter. CONCLUSION. The computerized color matching system specific to human skin was found to be reliable in terms of color and translucency between target skin colors and replicate skin color.

Modified Weight Filter Algorithm using Pixel Matching in AWGN Environment (AWGN 환경에서 화소매칭을 이용한 변형된 가중치 필터 알고리즘)

  • Cheon, Bong-Won;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.10
    • /
    • pp.1310-1316
    • /
    • 2021
  • Recently, with the development of artificial intelligence and IoT technology, the importance of video processing such as object tracking, medical imaging, and object recognition is increasing. In particular, the noise reduction technology used in the preprocessing process demands the ability to effectively remove noise and maintain detailed features as the importance of system images increases. In this paper, we provide a modified weight filter based on pixel matching in an AWGN environment. The proposed algorithm uses a pixel matching method to maintain high-frequency components in which the pixel value of the image changes significantly, detects areas with highly relevant patterns in the peripheral area, and matches pixels required for output calculation. Classify the values. The final output is obtained by calculating the weight according to the similarity and spatial distance between the matching pixels with the center pixel in order to consider the edge component in the filtering process.

Post-processing Method of Point Cloud Extracted Based on Image Matching for Unmanned Aerial Vehicle Image (무인항공기 영상을 위한 영상 매칭 기반 생성 포인트 클라우드의 후처리 방안 연구)

  • Rhee, Sooahm;Kim, Han-gyeol;Kim, Taejung
    • Korean Journal of Remote Sensing
    • /
    • v.38 no.6_1
    • /
    • pp.1025-1034
    • /
    • 2022
  • In this paper, we propose a post-processing method through interpolation of hole regions that occur when extracting point clouds. When image matching is performed on stereo image data, holes occur due to occlusion and building façade area. This area may become an obstacle to the creation of additional products based on the point cloud in the future, so an effective processing technique is required. First, an initial point cloud is extracted based on the disparity map generated by applying stereo image matching. We transform the point cloud into a grid. Then a hole area is extracted due to occlusion and building façade area. By repeating the process of creating Triangulated Irregular Network (TIN) triangle in the hall area and processing the inner value of the triangle as the minimum height value of the area, it is possible to perform interpolation without awkwardness between the building and the ground surface around the building. A new point cloud is created by adding the location information corresponding to the interpolated area from the grid data as a point. To minimize the addition of unnecessary points during the interpolation process, the interpolated data to an area outside the initial point cloud area was not processed. The RGB brightness value applied to the interpolated point cloud was processed by setting the image with the closest pixel distance to the shooting center among the stereo images used for matching. It was confirmed that the shielded area generated after generating the point cloud of the target area was effectively processed through the proposed technique.

Marker Detection by Using Affine-SIFT Matching Points for Marker Occlusion of Augmented Reality (증강현실에서 가려진 마커를 위한 Affine-SIFT 정합 점들을 이용한 마커 검출 기법)

  • Kim, Yong-Min;Park, Chan-Woo;Park, Ki-Tae;Moon, Young-Shik
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.2
    • /
    • pp.55-65
    • /
    • 2011
  • In this paper, a novel method of marker detection robust against marker occlusion in augmented reality is proposed. the proposed method consists of four steps. In the first step, in order to effectively detect an occluded marker, we first utilize the Affine-SIFT (ASIFT, Affine-Scale Invariant Features Transform) for detecting matching points between an enrolled marker and an input images with an occluded marker. In the second step, we apply the Principal Component Analysis (PCA) for eliminating outlier of the matching points in the enrolled marker. And then matching points are projected to the first and second axis for longest value and the shortest value of an ellipse are determined by average distance between the projected points and a center of the points. In the third step, Convex-hull vertices including matching points are considered as polygon vertices for estimating a geometric affine transformation. In the final step, by estimating the geometric affine transformation of the points, a marker robust against a marker occlusion is detected. Experimental results have shown that the proposed method effectively detects occlude markers.

A Path Storing and Number Matching Method for Management of XML Documents using RDBMS (RDBMS를 이용하여 XML 문서 관리를 위한 경로 저장과 숫자 매칭 기법)

  • Vong, Ha-Ik;Hwang, Byung-Yeon
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.7
    • /
    • pp.807-816
    • /
    • 2007
  • Since W3C proposed XML in 1996, XML documents have been widely spreaded in many internet documents. Because of this, needs for research related with XML is increasing. Especially, it is being well performed to study XML management system for storage, retrieval, and management with XML Documents. Among these studies, XRel is a representative study for XML management and has been become a comparative study. In this study, we suggest XML documents management system based on Relational DataBase Management System. This system is stored not all possible path expressions such as XRel, but filtered path expression which has text value or attribute value. And by giving each node Node Expression Identifier, we try to match given Node Expression Identifier. Finally, to prove efficiency of the suggested technique, this paper shows the result of experiment that compares XPath query processing performance between suggested study and existing technique, XRel.

  • PDF

Digital Filter Algorithm based on Local Steering Kernel and Block Matching in AWGN Environment (AWGN 환경에서 로컬 스티어링 커널과 블록매칭에 기반한 디지털 필터 알고리즘)

  • Cheon, Bong-Won;Kim, Nam-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.7
    • /
    • pp.910-916
    • /
    • 2021
  • In modern society, various digital communication equipment is being used due to the influence of the 4th industrial revolution. Accordingly, interest in removing noise generated in a data transmission process is increasing, and research is being conducted to efficiently reconstruct an image. In this paper, we propose a filtering algorithm to remove the AWGN generated in the digital image transmission process. The proposed algorithm classifies pixels with high similarity by selecting regions with similar patterns around the input pixels according to block matching to remove the AWGN that appears strongly in the image. The selected pixel determines the estimated value by applying the weight obtained by the local steering kernel, and obtains the final output by adding or subtracting the input pixel value according to the standard deviation of the center mask. In order to evaluate the proposed algorithm, it was simulated with existing AWGN removal algorithms, and comparative analysis was performed using enlarged images and PSNR.

Implementation of Object-based Multiview 3D Display Using Adaptive Disparity-based Segmentation

  • Park, Jae-Sung;Kim, Seung-Cheol;Bae, Kyung-Hoon;Kim, Eun-Soo
    • 한국정보디스플레이학회:학술대회논문집
    • /
    • 2005.07b
    • /
    • pp.1615-1618
    • /
    • 2005
  • In this paper, implementation of object-based multiview 3D display using object segmentation and adaptive disparity estimation is proposed and its performance is analyzed by comparison to that of the conventional disparity estimation algorithms. In the proposed algorithm, firstly we can get segmented objects by region growing from input stereoscopic image pair and then, in order to effectively synthesize the intermediate view the matching window size is selected according to the extracted feature value of the input stereo image pair. Also, the matching window size for the intermediate view reconstruction (IVR) is adaptively selected in accordance with the magnitude of the extracted feature value from the input stereo image pair. In addition, some experimental results on the IVR using the proposed algorithm is also discussed and compared with that of the conventional algorithms.

  • PDF

Internal Pattern Matching Algorithm of Logic Built In Self Test Structure (Logic Built In Self Test 구조의 내부 특성 패턴 매칭 알고리즘)

  • Jeon, Yu-Sung;Kim, In-Soo;Min, Hyoung-Bok
    • Proceedings of the KIEE Conference
    • /
    • 2008.07a
    • /
    • pp.1959-1960
    • /
    • 2008
  • The Logic Built In Self Test (LBIST) technique is substantially applied in chip design in most many semiconductor company in despite of unavoidable overhead like an increase in dimension and time delay occurred as it used. Currently common LBIST software uses the MISR (Multiple Input Shift Register) However, it has many considerations like defining the X-value (Unknown Value), length and number of Scan Chain, Scan Chain and so on for analysis of result occurred in the process. So, to solve these problems, common LBIST software provides the solution method automated. Nevertheless, these problems haven't been solved automatically by Tri-state Bus in logic circuit yet. This paper studies the algorithm that it also suggest algorithm that reduce additional circuits and time delay as matching of pattern about 2-type circuits which are CUT(circuit Under Test) and additional circuits so that the designer can detect the wrong location in CUT: Circuit Under Test.

  • PDF

Effective Scheme for File Search Engine in Mobile Environments (모바일 환경에서 파일 검색 엔진을 위한 효과적인 방식)

  • Cho, Jong-Keun;Ha, Sang-Eun
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.11
    • /
    • pp.41-48
    • /
    • 2008
  • This study focuses on the modeling file search engine and suggesting modified file search schema based on weight value using file contents in order to improve the performance in terms of search accuracy and matching time. Most of the file search engines have used string matching algorithms like KMP(Knuth.Morris.Pratt), which may limit portability and fast searching time. However, this kind of algorithms don't find exactly the files what you want. Hence, the file search engine based on weight value using file contents is proposed here in order to optimize the performance for mobile environments. The Comparison with previous research shows that the proposed schema provides better.

Evaluation of Usability Both Oblique Verification for Inserted Fiducial Marker of Prostate Cancer Patients (Fiducial Marker가 삽입된 전립선암 환자를 대상으로 한 양사방향 촬영의 유용성 평가)

  • Kim, Koon Joo;Lee, Jung Jin;Kim, Sung Gi;Lim, Hyun Sil;Kim, Wan Sun;Kang, Su Man
    • The Journal of Korean Society for Radiation Therapy
    • /
    • v.25 no.2
    • /
    • pp.123-129
    • /
    • 2013
  • Purpose: The way check the movement of the fiducial marker insertion in the treatment of patients with prostate cancer. However the existing methods of fiducial marker verification process difficult to identify the specific location of the marker behind the femur and pelvic bone. So to study the evaluation of maker match with using kilo voltage (KV) X-ray by On-board imager to both oblique verification method. Materials and Methods: Five patients were selected for rectal ballooning and inserted fiducial marker. Compare the position of the fiducial marker of reference plan 2D/2D Anterior/Posterior verification method and 2D/2D both oblique verification method. So to measurement the shift score of X, Y, Z (axis) and measure exposure dose given to patients and compare matching time. Results: 2 dimensional OBI KV X-ray imaging using two-dimensional matching image are orthogonal, so locating fiducial marker matching clear and useful DRR (digital reconstruction radiography) OBI souce angle ($45^{\circ}/315^{\circ}$) matching most useful. 2D/2D both oblique verification method was able to see clearly marker behind the pelvic bone. Also matching time can be reduced accordingly. According to the method of each matching results for each patient in each treatment fraction, X, Y, and Z axis the Mean $value{\pm}SD$ (standard deviation) is X axis (AP/LAT: $0.4{\pm}1.67$, OBLIQUE: $0.4{\pm}1.82$) mm, Y axis (AP/LAT: $0.7{\pm}1.73$, OBLIQUE: $0.2{\pm}1.77$) mm, Z axis (AP/LAT: $0.8{\pm}1.94$, OBLIQUE:$1.5{\pm}2.8$) mm. In addition, the KV X-ray source dose radiation exposure given to the patient taking average when AP/LAT matching is (0.1/2.1) cGY, when $315^{\circ}/45^{\circ}$ matching is (0.27/0.26) cGY. Conclusion: In conclusion for inserted fiducial marker of prostate cancer patients 2D/2D both oblique matching method is more accurate verification than 2D/2D AP/LAT matching method. Also the matching time less than the 2D/2D AP/LAT matching method. Taken as the amount of radiation exposure to patients less than was possible. Suggest would improve the treatment quality of care patients more useful to establish a protocol such as case.

  • PDF