• Title/Summary/Keyword: Computer image simulations

Search Result 201, Processing Time 0.026 seconds

Comparison of computer-based treatment prediction with true results in bimaxillary protrusion cases (치조성 양악 전돌 환자에서 컴퓨터를 이용한 치료 결과 예측의 정확성)

  • Lee, Rhi-na;Lim, Yong-Kyu;Lee, Dong-Yul
    • The korean journal of orthodontics
    • /
    • v.32 no.3 s.92
    • /
    • pp.155-163
    • /
    • 2002
  • This study was performed to assess the accuracy of computer-based treatment prediction for soft tissue profile using Quick Ceph Image $Pro^{TM}\;&\;Quick\;Ceph\;2000^{TM}$ in bimaxillary protrusion cases. The Ore- and post-treatment lateral cephalograms of 21 female adults treated by low first premolar extraction were imaged and 9 landmarks and 27 specific soft tissue mesurements were digitized for comparing actual treatment results with computer simulations. The results of this study showed that Quick Ceph Image $Pro^{TM}\;&\;Quick\;Ceph\;2000^{TM}$ tends to overestimeate horizontal changes and underestimate vertical changes. In the computer simulation, upper lip showed rolling tendency. The upper lip measurements were disposed to be regular direction hut lower lip measurements were varied case by case even if it was statistically insignificant.

Adaptive Color Snake Model for Real-Time Object Tracking

  • Seo, Kap-Ho;Jang, Byung-Gi;Lee, Ju-Jang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.740-745
    • /
    • 2003
  • Motion tracking and object segmentation are the most fundamental and critical problems in vision tasks suck as motion analysis. An active contour model, snake, was developed as a useful segmenting and tracking tool for rigid or non-rigid objects. Snake is designed no the basis of snake energies. Segmenting and tracking can be executed successfully by energy minimization. In this research, two new paradigms for segmentation and tracking are suggested. First, because the conventional method uses only intensity information, it is difficult to separate an object from its complex background. Therefore, a new energy and design schemes should be proposed for the better segmentation of objects. Second, conventional snake can be applied in situations where the change between images is small. If a fast moving object exists in successive images, conventional snake will not operate well because the moving object may have large differences in its position or shape, between successive images. Snakes's nodes may also fall into the local minima in their motion to the new positions of the target object in the succeeding image. For robust tracking, the condensation algorithm was adopted to control the parameters of the proposed snake model called "adaptive color snake model(SCSM)". The effectiveness of the ACSM is verified by appropriate simulations and experiments.

  • PDF

Hair and Fur Synthesizer via ConvNet Using Strand Geometry Images

  • Kim, Jong-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.5
    • /
    • pp.85-92
    • /
    • 2022
  • In this paper, we propose a technique that can express low-resolution hair and fur simulations in high-resolution without noise using ConvNet and geometric images of strands in the form of lines. Pairs between low-resolution and high-resolution data can be obtained through physics-based simulation, and a low-resolution-high-resolution data pair is established using the obtained data. The data used for training is used by converting the position of the hair strands into a geometric image. The hair and fur network proposed in this paper is used for an image synthesizer that upscales a low-resolution image to a high-resolution image. If the high-resolution geometry image obtained as a result of the test is converted back to high-resolution hair, it is possible to express the elastic movement of hair, which is difficult to express with a single mapping function. As for the performance of the synthesis result, it showed faster performance than the traditional physics-based simulation, and it can be easily executed without knowing complex numerical analysis.

Real-Time Object Tracking and Segmentation Using Adaptive Color Snake Model

  • Seo Kap-Ho;Shin Jin-Ho;Kim Won;Lee Ju-Jang
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.2
    • /
    • pp.236-246
    • /
    • 2006
  • Motion tracking and object segmentation are the most fundamental and critical problems in vision tasks such as motion analysis. An active contour model, snake, was developed as a useful segmenting and tracking tool for rigid or non-rigid objects. In this paper, the development of new snake model called 'adaptive color snake model (ACSM)' for segmentation and tracking is introduced. The simple operation makes the algorithm runs in real-time. For robust tracking, the condensation algorithm was adopted to control the parameters of ACSM. The effectiveness of the ACSM is verified by appropriate simulations and experiments.

Novel Adaptive De-interlacing Algorithm using Temporal Correlation

  • Ku, Su-Il;Jung, Tae-Young;Jeong, Je-Chang
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.199-202
    • /
    • 2009
  • This paper proposes a novel adaptive algorithm for deinterlacing. In the proposed algorithm, the previously developed Enhanced ELA [6], Chen [9] and Li [10] algorithms were used as a basis. The fundamental mechanism was the selection and application of the appropriate algorithm according to the correlation with the previous and next field using temporal information. Extensive simulations were conducted for video sequences and showed good performance in terms of peak signal-to-ratio (PSNR) and subjective quality.

  • PDF

2D Image Reconstruction of Earth Model by Electrical Resistance Tomography (ERT를 이용한 2차원 대지모델 영상복원)

  • Boo, Chang-Jin;Kim, Ho-Chan;Kang, Min-Jae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.7
    • /
    • pp.3460-3467
    • /
    • 2013
  • The In this paper, we have made numerical experiments to compare 2D image reconstruction algorithm of earth model by electrical resistance tomograpy (ERT). Gauss-Newton, simultaneous iterative reconstruction technieque (SIRT) and truncated least squares (TLS) approaches for Wenner and Schlumberger electrode arrays are presented for the solution of the ERT image reconstruction. Computer simulations show that the Gauss-Newton and TLS approach in ERT are proper for 2D image reconstruction of an earth model.

Localization of a Monocular Camera using a Feature-based Probabilistic Map (특징점 기반 확률 맵을 이용한 단일 카메라의 위치 추정방법)

  • Kim, Hyungjin;Lee, Donghwa;Oh, Taekjun;Myung, Hyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.4
    • /
    • pp.367-371
    • /
    • 2015
  • In this paper, a novel localization method for a monocular camera is proposed by using a feature-based probabilistic map. The localization of a camera is generally estimated from 3D-to-2D correspondences between a 3D map and an image plane through the PnP algorithm. In the computer vision communities, an accurate 3D map is generated by optimization using a large number of image dataset for camera pose estimation. In robotics communities, a camera pose is estimated by probabilistic approaches with lack of feature. Thus, it needs an extra system because the camera system cannot estimate a full state of the robot pose. Therefore, we propose an accurate localization method for a monocular camera using a probabilistic approach in the case of an insufficient image dataset without any extra system. In our system, features from a probabilistic map are projected into an image plane using linear approximation. By minimizing Mahalanobis distance between the projected features from the probabilistic map and extracted features from a query image, the accurate pose of the monocular camera is estimated from an initial pose obtained by the PnP algorithm. The proposed algorithm is demonstrated through simulations in a 3D space.

A Design of High-speed Phase Calculator for 3D Depth Image Extraction from TOF Sensor Data (TOF 센서용 3차원 Depth Image 추출을 위한 고속 위상 연산기 설계)

  • Koo, Jung-Youn;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.355-362
    • /
    • 2013
  • A hardware implementation of phase calculator for extracting 3D depth image from TOF(Time-Of-Flight) sensor is described. The designed phase calculator, which adopts a pipelined architecture to improve throughput, performs arctangent operation using vectoring mode of CORDIC algorithm. Fixed-point MATLAB modeling and simulations are carried out to determine the optimized bit-widths and number of iteration. The designed phase calculator is verified by FPGA-in-the-loop verification using MATLAB/Simulink, and synthesized with a TSMC 0.18-${\mu}m$ CMOS cell library. It has 16,000 gates and the estimated throughput is about 9.6 Gbps at 200Mhz@1.8V.

FPGA Implementation of Differential CORDIC-based high-speed phase calculator for 3D Depth Image Extraction (3차원 Depth Image 추출용 Differential CORDIC 기반 고속 위상 연산기의 FPGA 구현)

  • Koo, Jung-youn;Shin, Kyung-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.350-353
    • /
    • 2013
  • In this paper, a hardware implementation of phase calculator for extracting 3D depth image from TOF(Time-Of-Flight) sensor is proposed. The designed phase calculator, which adopts redundant binary number systems and a pipelined architecture to improve throughput and speed, performs arctangent operation using vectoring mode of DCORDIC algorithm. Fixed-point MATLAB simulations are carried out to determine the optimized bit-widths and number of iteration. The designed phase calculator is verified by emulating the restoration of virtual 3D data using MATLAB/Simulink and FPGA-in-the-loop verification, and the estimated performance is about 7.5 Gbps at 469 MHz clock frequency.

  • PDF

An Efficient Intra-Field Deinterlacing Algorithm using Edges Extracted from the Interpolated Binary Image (보간된 이진 영상으로부터 검출된 정확한 에지를 이용한 효율적인 디인터레이싱 알고리즘)

  • Son, Joo-Yung;Lee, Sang-Hoon;Lee, Dong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.5C
    • /
    • pp.514-520
    • /
    • 2009
  • This paper proposes a new deinterlacing algorithm which improves the performance of the spatial filter. Extracting exact edges is very important element of deinterlacing performance. So the proposed algorithm has interpolated locally adaptive-thresholded binary image, and extracted exact edges from the interpolated binary image. The values of pixels on edges extracted from binary image are interpolated using neighborhood lines on the same edge. With computer simulations for a variety of images, it is shown that the proposed algorithm is much better than traditional methods.