• Title/Summary/Keyword: Fixed Matching

Search Result 191, Processing Time 0.068 seconds

Stereo object Tracking System using Block Matching Algorithm and optical JTC (블록정합 알고리즘과 광 JTC를 이용한 스테레오 물체추적 시스템)

  • 이재수;이용범;김은수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.3B
    • /
    • pp.549-556
    • /
    • 2000
  • In this paper, we propose a new adaptive stereo object tracking system that can be used when the back ground image is complex and the cameras are not fixed . In this method, we used the Block Matching Algorithm to separate the tracking object form the background image and then the optical JTC system is used to obtain the convergence-controlling and pa/tilt-controlling values fro the left and right cameras. the experimental results are found to track the object robustly & adaptively for the object tracking in various background images, and the possibility of real-time implementation of the proposed system by using the optical JTC is also suggested.

  • PDF

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.

Multi-Cattle tracking with appearance and motion models in closed barns using deep learning

  • Han, Shujie;Fuentes, Alvaro;Yoon, Sook;Park, Jongbin;Park, Dong Sun
    • Smart Media Journal
    • /
    • v.11 no.8
    • /
    • pp.84-92
    • /
    • 2022
  • Precision livestock monitoring promises greater management efficiency for farmers and higher welfare standards for animals. Recent studies on video-based animal activity recognition and tracking have shown promising solutions for understanding animal behavior. To achieve that, surveillance cameras are installed diagonally above the barn in a typical cattle farm setup to monitor animals constantly. Under these circumstances, tracking individuals requires addressing challenges such as occlusion and visual appearance, which are the main reasons for track breakage and increased misidentification of animals. This paper presents a framework for multi-cattle tracking in closed barns with appearance and motion models. To overcome the above challenges, we modify the DeepSORT algorithm to achieve higher tracking accuracy by three contributions. First, we reduce the weight of appearance information. Second, we use an Ensemble Kalman Filter to predict the random motion information of cattle. Third, we propose a supplementary matching algorithm that compares the absolute cattle position in the barn to reassign lost tracks. The main idea of the matching algorithm assumes that the number of cattle is fixed in the barn, so the edge of the barn is where new trajectories are most likely to emerge. Experimental results are performed on our dataset collected on two cattle farms. Our algorithm achieves 70.37%, 77.39%, and 81.74% performance on HOTA, AssA, and IDF1, representing an improvement of 1.53%, 4.17%, and 0.96%, respectively, compared to the original method.

Video Matching Algorithm of Content-Based Video Copy Detection for Copyright Protection (저작권보호를 위한 내용기반 비디오 복사검출의 비디오 정합 알고리즘)

  • Hyun, Ki-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.3
    • /
    • pp.315-322
    • /
    • 2008
  • Searching a location of the copied video in video database, signatures should be robust to video reediting, channel noise, time variation of frame rate. Several kinds of signatures has been proposed. Ordinal signature, one of them, is difficult to describe the spatial characteristics of frame due to the site of fixed window, $N{\times}N$, which is compute the average gray value. In this paper, I studied an algorithm of sequence matching in video copy detection for the copyright protection, employing the R-tree index method for retrieval and suggesting a robust ordinal signatures for the original video clips and the same signatures of the pirated video. Robust ordinal has a 2-dimensional vector structures that has a strong to the noise and the variation of the frame rate. Also, it express as MBR form in search space of R-tree. Moreover, I focus on building a video copy detection method into which content publishers register their valuable digital content. The video copy detection algorithms compares the web content to the registered content and notifies the content owners of illegal copies. Experimental results show the proposed method is improve the video matching rate and it has a characteristics of signature suitable to the large video databases.

  • PDF

Fast Detection of Video Copy Using Spatio-Temporal Group Feature (시공간 그룹특징을 사용한 동영상 복사물의 고속 검색)

  • Jeong, Jae Hyup;Lee, Jun Woo;Kang, Jong Wook;Jeong, Dong Seok
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.11
    • /
    • pp.64-73
    • /
    • 2012
  • In this paper, we propose a method to search for identical videos. The proposed method is spatio-temporal group feature fingerprinting. Frame of video is extracted from fixed rate method and is partitioned into vertical group and horizontal group. Descriptor is made of each group feature that is extracted from binary fingerprinting. Next, use descriptor of original video to build a two type of fingerprinting database and matching with query video. To efficient and effective video copy detection, method have high robustness, independence, matching speed. In proposed method, group feature have high robustness and independence in variable modification of video. Building a original fingerprinting database is able to fast matching with query video. The proposed method shows performance improvement in variable modifications in comparison to the existing methods. Especially, very singular performance in speed improvement is great advantage of this paper.

A New Block Matching Motion Estimation using Predicted Direction Search Algorithm (예측 방향성 탐색 알고리즘을 이용한 새로운 블록 정합 움직임 추정 방식)

  • Seo, Jae-Su;Nam, Jae-Yeol;Gwak, Jin-Seok;Lee, Myeong-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2S
    • /
    • pp.638-648
    • /
    • 2000
  • This paper introduces a new technique for block is matching motion estimation. Since the temporal correlation of the image sequence, the motion vector of a block is highly related to the motion vector of the same coordinate block in the previous image frame. If we can obtain useful and enough information from the motion vector of the same coordinate block of the previous frame, the total number of search points used to find the motion vector of the current block may be reduced significantly. Using that idea, an efficient predicted direction search algorithm (PDSA) for block matching algorithm is proposed. Based on the direction of the blocks of the two successive previous frames, if the direction of the to successive blocks is same, the first search point of the proposed PDSA is moved two pixels to the direction of the block. The searching process after moving the first search point is processed according to the fixed search patterns. Otherwise, full search is performed with search area $\pm$2. Simulation results show that PSNR values are improved up to the 3.4dB as depend on the image sequences and improved about 1.5dB on an average. Search times are reduced about 20% than the other fast search algorithms. Simulation results also show that the performance of the PDSA scheme gives better subjective picture quality than the other fast search algorithms and is closer to that of the FS(Full Search) algorithm.

  • PDF

The Verification of Image Merging for Lumber Scanning System (제재목 화상입력시스템의 화상병합 성능 검증)

  • Kim, Byung Nam;Kim, Kwang Mo;Shim, Kug-Bo;Lee, Hyoung Woo;Shim, Sang-Ro
    • Journal of the Korean Wood Science and Technology
    • /
    • v.37 no.6
    • /
    • pp.556-565
    • /
    • 2009
  • Automated visual grading system of lumber needs correct input image. In order to create a correct image of domestic red pine lumber 3.6 m long feeding on a conveyer, part images were captured using area sensor and template matching algorithm was applied to merge part images. Two kinds of template matching algorithms and six kinds of template sizes were adopted in this operation. Feature extracted method appeared to have more excellent image merging performance than fixed template method. Error length was attributed to a decline of similarity related by difference of partial brightness on a part image, specific pattern and template size. The mismatch part was repetitively generated at the long grain. The best size of template for image merging was $100{\times}100$ pixels. In a further study, assignment of exact template size, preprocessing of image merging for reduction of brightness difference will be needed to improve image merging.

A Boundary Matching and Post-processing Method for the Temporal Error Concealment in H.264/AVC (H.264/AVC의 시간적 오류 은닉을 위한 경계 정합과 후처리 방법)

  • Lee, Jun-Woo;Na, Sang-Il;Won, In-Su;Lim, Dae-Kyu;Jeong, Dong-Seok
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.11
    • /
    • pp.1563-1571
    • /
    • 2009
  • In this paper, we propose a new boundary matching method for the temporal error concealment and a post processing algorithm for perceptual quality improvement of the concealed frame. Temporal error concealment is a method that substitutes error blocks with similar blocks from the reference frame. In conventional H.264/AVC standard, it compares outside pixels of erroneous block with inside pixels of reference block to find the most similar block. However, it is very possible that the conventional method substitutes erroneous block with the wrong one because it compares only narrow spatial range of pixels. In this paper, for substituting erroneous blocks with more correct blocks, we propose enhanced boundary matching method by comparing inside and outside pixels of reference block with outside pixels of erroneous block and setting up additional candidate motion vector in the fixed search range based on maximum and minimum value of candidate motion vectors. Furthermore, we propose a post processing method to smooth edges between concealed and decoded blocks without error by using the modified deblocking filter. We identified that the proposed method shows quality improvement of about 0.9dB over the conventional boundary matching methods.

  • PDF

Adaptive Actuator Failure Compensation Designs for Linear Systems

  • Chen, Shuhao;Tao, Gang;Joshi, Suresh M.
    • International Journal of Control, Automation, and Systems
    • /
    • v.2 no.1
    • /
    • pp.1-14
    • /
    • 2004
  • This paper surveys some existing direct adaptive feedback control schemes for linear time-invariant systems with actuator failures characterized by the failure pattern that some inputs are stuck at some unknown fixed or varying values at unknown time instants, and applications of those schemes to aircraft flight control system models. Controller structures, plant-model matching conditions, and adaptive laws to update controller parameters are investigated for the following cases for continuous-time systems: state tracking using state feed-back, output tracking using state feedback, and output tracking using output feedback. In addition, a discrete-time output tracking design using output feedback is presented. Robustness of this design with respect to unmodeled dynamics and disturbances is addressed using a modified robust adaptive law.

Design of Broadband Hybrid Mixer using Dual-Gate FET (이중게이트 FET 를 이용한 광대역 하이브리드 믹서 설계)

  • Jin, Zhe-Jun;Lee, Kang-Ho;Koo, Kyung-Heon
    • Proceedings of the IEEK Conference
    • /
    • 2005.11a
    • /
    • pp.197-200
    • /
    • 2005
  • This paper presents the design of a broadband hybrid mixer using dual-gate FET topology with a low-pass filter which improves return loss of output to isolate RF and LO signal. The low-pass filter shows the isolation whose RF and LO signal is better than 40 dBc at 2 GHz and 5 GHz band. The dual-gate mixer which has been designed by using cascade topology operates when the lower FET is biased in linear region and the upper FET is in saturation. The input matching circuit has been designed to have conversion gain from 2 GHz to 6 GHz. The designed mixer with low-pass filter shows the conversion gain of better than 7 dB from 2 GHz to 6 GHz at a low LO power level of 0 dBm with the fixed IF frequency of 21.4 MHz.

  • PDF