• Title/Summary/Keyword: Model matching

Search Result 1,381, Processing Time 0.024 seconds

A Fast Digital Elevation Model Extraction Algorithm Using Gradient Correlation (Gradient Correlation을 이용한 고속 수치지형표고 모델 추출 방법)

  • Chul Soo Ye;Byung Min Jeon;Kwae Hi Lee
    • Korean Journal of Remote Sensing
    • /
    • v.14 no.3
    • /
    • pp.250-261
    • /
    • 1998
  • The purpose of this paper is to extract fast DEM (Digital Elevation Model) using satellite images. DEM extraction consists of three parts. First part is the modeling of satellite position and attitude, second part is the matching of two images to find corresponding points of them and third part is to calculate the elevation of each point by using the results of the first and second part. The position and attitude modeling of satellite is processed by using GCPs. A area based matching method is used to find corresponding points between the stereo satellite images. The elevation of each point is calculated using the exterior orientation parameters obtained from modeling and conjugate points from matching. In the DEM generation system, matching procedure holds most of a processing time, therefore to reduce the time for matching, a new fast matching algorithm using gradient correlation and fast similarity measure calculation method is proposed. In this paper, the SPOT satellite images, level 1A 6000$\times$6000 panchromatic images are used to extract DEM. The experiment result shows the possibility of fast DEM extraction with the satellite images.

Isolated Word Recognition Using Segment Probability Model (분할확률 모델을 이용한 한국어 고립단어 인식)

  • 김진영;성경모
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.25 no.12
    • /
    • pp.1541-1547
    • /
    • 1988
  • In this paper, a new model for isolated word recognition called segment probability model is proposed. The proposed model is composed of two procedures of segmentation and modelling each segment. Therefore the spoken word is devided into arbitrary segments and observation probability in each segments is obtained using vector quantization. The proposed model is compared with pattern matching method and hidden Markov model by recognition experiment. The experimental results show that the proposed model is better than exsisting methods in terms of recognition rate and caculation amounts.

  • PDF

Face Texture Generation using an Image Alignment Algorithm based on Variable-Sized Blocks of Cylindrical Prototype Model (실린더형 원형모델의 가변적 블록크기를 기반으로 하는 영상정렬 알고리즘을 이용한 얼굴 텍스쳐 생성)

  • Lee, Joong-Jae;Choi, Hyung-Il
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.11
    • /
    • pp.855-863
    • /
    • 2001
  • We propose an image alignment algorithm based on variable-sized blocks of cylindrical prototype model to generate a face texture for a realistic 3D face model. This is a block matching algorithm which aligns 2D images of a 3D cylindrical model using th correlation between them. While matching blocks, it does not use same sized blocks with considering a curvature of 3D model. And we make a texture of aligned images using a technique of image mosaic. For this purpose, we stitch them with assigning linear weights according to the overlapped region and using the cross-dissolve technique.

  • PDF

On the Heterogeneous Postal Delivery Model for Multicasting

  • Sekharan, Chandra N.;Banik, Shankar M.;Radhakrishnan, Sridhar
    • Journal of Communications and Networks
    • /
    • v.13 no.5
    • /
    • pp.536-543
    • /
    • 2011
  • The heterogeneous postal delivery model assumes that each intermediate node in the multicasting tree incurs a constant switching time for each message that is sent. We have proposed a new model where we assume a more generalized switching time at intermediate nodes. In our model, a child node v of a parent u has a switching delay vector, where the ith element of the vector indicates the switching delay incurred by u for sending the message to v after sending the message to i-1 other children of u. Given a multicast tree and switching delay vectors at each non-root node 5 in the tree, we provide an O(n$^{\frac{5}{2}}$) optimal algorithm that will decide the order in which the internal (non-leaf) nodes have to send the multicast message to its children in order to minimize the maximum end-to-end delay due to multicasting. We also show an important lower bound result that optimal multicast switching delay problem is as hard as min-max matching problem on weighted bipartite graphs and hence O(n$^{\frac{5}{2}}$) running time is tight.

A novel reference model for dental scanning system evaluation: analysis of five intraoral scanners

  • Karakas-Stupar, Irina;Zitzmann, Nicola Ursula;Joda, Tim
    • The Journal of Advanced Prosthodontics
    • /
    • v.14 no.2
    • /
    • pp.63-69
    • /
    • 2022
  • PURPOSE. The aim of this in vitro study was to investigate the accuracy (trueness and precision) of five intraoral scanners (IOS) using a novel reference model for standardized performance evaluation. MATERIALS AND METHODS. Five IOSs (Medit i500, Omnicam, Primescan, Trios 3, Trios 4) were used to digitize the reference model, which represented a simplified full-arch situation with four abutment teeth. Each IOS was used five times by an experienced operator, resulting in 25 STL (Standard Tessellation Language) files. STL data were imported into 3D software (Final Surface®) and examined for inter- and intra-group analyses. Deviations in the parameter matching error were calculated. ANOVA F-test and Kruskal-Wallis test were applied for inter-group comparisons (α = .05); and the coefficient of variation (CV) was calculated for intra-group comparisons (in % ± SD). RESULTS. Primescan (matching error value: 0.015), Trios 3 (0.016), and Trios 4 (0.018) revealed comparable results with significantly higher accuracy compared to Medit i500 (0.035) and Omnicam (0.028) (P < .001). For intra-group comparison, Trios 4 demonstrated the most homogenous results (CV 15.8%). CONCLUSION. The novel reference model investigated in this study can be used to assess the performance of dental scanning technologies in the daily routine setting and in research settings.

THE SPECTRAL SHAPE MATCHING METHOD FOR THE ATMOSPHERIC CORRECTION OF LANDSAT IMAGERY IN SAEMANGEUM COASTAL AREA

  • Min Jee-Eun;Ryu Joo-Hyung;Shanmugam P.;Ahn Yu-Hwan;Lee Kyu-Sung
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.671-674
    • /
    • 2005
  • Atmospheric correction over the ocean part is more important than that over the land because the signal from the ocean is very small about one tenth of that reflected from land. In this study, the Spectral Shape Matching Method (SSMM) developed by Ahn and Shanmugam (2004) is evaluated using Landsat imagery acquired over the highly turbid Saemangeum Coastal Area. The result of SSMM is compared with COST model developed by Chavez (1991 and 1997). In principle, SSMM is simple and easy to implement on any satellite imagery, relying on both field and image properties. To assess the potential use of these methods, several field campaigns were conducted in the Saemangeum coastal area corresponding with Landsat-7 satellite's overpass on 29 May 2005. In-situ data collected from the coastal waters of Saemangeum using optical instruments (ASD field spectroradiometer) consists of ChI, Ap, SS, aooM, F(d). In order to perform SSMM, we use the in-situ water-leaving radiance spectra from clear oceanic waters to estimate the the path radiance from total signal recorded at the top of the atmosphere (TOA), due to the reason that the shape of clear water-leaving radiance spectra is nearly stable than turbid water-leaving radiance spectra. The retrieved water-leaving radiance after subtraction of path signal from TOA signal in this way is compared with that estimated by COST model. The result shows that SSMM enabled retrieval of water-leaving radiance spectra that are consistent with in-situ data obtained from Saemangeum coastal waters. The COST model yielded significantly high errors in these areas.

  • PDF

Intelligent Pattern Matching Based on Geometric Features for Machine Vision Inspection (머신비전검사를 위한 기하학적 특징 기반 지능 패턴 정합)

  • Moon Soon-Hwan;Kim Gyung-Bum;Kim Tae-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.6
    • /
    • pp.1-8
    • /
    • 2006
  • This paper presents an intelligent pattern matching method that can be used to acquire the reliable calibration data for automatic PCB pattern inspection. The inaccurate calibration data is often acquired by geometric pattern variations and selecting an inappropriate model manual. It makes low the confidence of inspection and also the inspection processing time has been delayed. In this paper, the geometric features of PCB patterns are utilized to calculate the accurate calibration data. An appropriate model is selected automatically based on the geometric features, and then the calibration data to be invariant to the geometric variations(translation, rotation, scaling) is calculated. The method can save the inspection time unnecessary by eliminating the need for manual model selection. As the result, it makes a fast, accurate and reliable inspection of PCB patterns.

  • PDF

A Study on Position Matching Technique for 3D Building Model using Existing Spatial Data - Focusing on ICP Algorithm Implementation - (기구축 공간데이터를 활용한 3차원 건물모델의 위치정합 기법 연구 - ICP 알고리즘 구현 중심으로 -)

  • Lee, Jaehee;Lee, Insu;Kang, Jihun
    • Journal of Cadastre & Land InformatiX
    • /
    • v.51 no.1
    • /
    • pp.67-77
    • /
    • 2021
  • Spatial data is becoming very important as a medium that connects various data produced in smart cities, digital twins, autonomous driving, smart construction, and other applications. In addition, the rapid construction and update of spatial information is becoming a hot topic to satisfy the diverse needs of consumers in this field. This study developed a software prototype that can match the position of an image-based 3D building model produced without Ground Control Points using existing spatial data. As a result of applying this software to the test area, the 3D building model produced based on the image and the existing spatial data show a high positional matching rate, so that it can be widely used in applications requiring the latest 3D spatial data.

Local Linear Transform and New Features of Histogram Characteristic Functions for Steganalysis of Least Significant Bit Matching Steganography

  • Zheng, Ergong;Ping, Xijian;Zhang, Tao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.4
    • /
    • pp.840-855
    • /
    • 2011
  • In the context of additive noise steganography model, we propose a method to detect least significant bit (LSB) matching steganography in grayscale images. Images are decomposed into detail sub-bands with local linear transform (LLT) masks which are sensitive to embedding. Novel normalized characteristic function features weighted by a bank of band-pass filters are extracted from the detail sub-bands. A suboptimal feature set is searched by using a threshold selection algorithm. Extensive experiments are performed on four diverse uncompressed image databases. In comparison with other well-known feature sets, the proposed feature set performs the best under most circumstances.

A Study of Inter Prediction using Template Matching (Template Matching을 이용한 화면 간 예측에 대한 연구)

  • Lim, Sung-won;Moon, Joo-hee
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2016.06a
    • /
    • pp.204-206
    • /
    • 2016
  • 본 논문에서는 template matching을 이용한 PMMVD(Pattern Matched Motion Vector Derivation)기술에 대해 움직임 추정 방식에 따라 복잡도를 분석한다. PMMVD 기술은 HEVC의 화면 간 예측 기술과는 다르게 움직임과 관련된 정보를 부호화하지 않으며, 복호화기에서 움직임 벡터를 추정하는 방식이다. 따라서 종래의 기술 대비 높은 효율이 발생하지만 복호화기의 복잡도는 급격히 증가하게 된다. 이러한 이유로 다양한 움직임 추정 방식에 따라 성능을 분석하여 최적의 조합을 찾는 것은 매우 중요한 이슈임을 알 수 있다. 이를 위하여 현재 JVET(Joint Video Exploration Team)에서 FVC(Future Video Coding)를 위해 발표한 참조 소프트웨이인 JEM 2.0(Joint Exploration Test Model 2)을 이용하여 실험을 수행하고 향후 연구 방향을 논의한다.

  • PDF