• Title/Summary/Keyword: Shift algorithm

Search Result 683, Processing Time 0.03 seconds

Shape Segmentation by Watersheds (Watershed에 의한 형태분할)

  • 김태진;김주영;고광식
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.573-576
    • /
    • 1999
  • This paper presents a new shape segmentation algorithm. The procedure to achieve complete segmentation consists of two steps : the first step is mapping shape into two dimension by the using Distance Transform, the second step is partitioning the region by using the Watershed algorithm. As a application of the proposed algorithm, we perform the matching experiment for several objects by the use of segmented region. Simulation results demonstrate the efficiency of the proposed method, and the method has scale, rotation, and shift invariant properties.

  • PDF

The Development of Program for Time Domain Simulation of Railway Dynamics (철도차량 동역학의 시간영역 시뮬레이션 프로그램 개발)

  • No, Chang-Su
    • 한국기계연구소 소보
    • /
    • s.18
    • /
    • pp.87-97
    • /
    • 1988
  • The algorithm for relation of contact status, track shift, and contact force caused from wheel/rail contact geometry is presented. Grafting this algorithm into a algorithm of general program analyzing mechanical system, the program for time domain simulation of railway vehicle dynamics, called CASOTD, was developed. In addition, as applied example of CASOTD, the dynamic simulation of railway vehicle running on a rail joint and a irregularly alinemented rail is done in this paper.

  • PDF

Using Mean Shift Algorithm and Self-adaptive Canny Algorithm for I mprovement of Edge Detection (경계선 검출의 향상을 위한 Mean Shift 알고리즘과 자기 적응적 Canny 알고리즘의 활용)

  • Shin, Seong-Yoon;Pyo, Seong-Bae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.7
    • /
    • pp.33-40
    • /
    • 2009
  • Edge detection is very significant in low level image processing. However, majority edge detection methods are not only effective enough cause of the noise points' influence, even not flexible enough to different input images. In order to sort these problems, in this paper an algorithm is presented that has an extra noise reduction stage at first, and then automatically selects the both thresholds depending on gradient amplitude histogram and intra class minimum variance. Using this algorithm, can fade out almost all of the sensitive noise points, and calculate the propose thresholds for different images without setting up the practical parameters artificially, and then choose edge pixels by fuzzy algorithm. In finally, get the better result than the former Canny algorithm.

Motion Recognitions Based on Local Basis Images Using Independent Component Analysis (독립성분분석을 이용한 국부기저영상 기반 동작인식)

  • Cho, Yong-Hyun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.18 no.5
    • /
    • pp.617-623
    • /
    • 2008
  • This paper presents a human motion recognition method using both centroid shift and local basis images. The centroid shift based on 1st moment balance technique is applied to get the robust motion images against position or size changes, the extraction of local basis images based on independent component analysis(ICA) is also applied to find a set of statistically independent motion features, which is included in each motions. Especially, ICA of fixed-point(FP) algorithm based on Newton method is used for being quick to extract a local basis images of motions. The proposed method has been applied to the problem for recognizing the 160(1 person * 10 animals * 16 motions) sign language motion images of 240*215 pixels. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. The experimental results show that the proposed method has a superior recognition performances(speed, rate) than the method using local eigen images and the method using local basis images without centroid shift respectively.

Object Tracking Algorithm Using Weighted Color Centroids Shifting (가중 컬러 중심 이동을 이용한 물체 추적 알고리즘)

  • Choi, Eun-Cheol;Lee, Suk-Ho;Kang, Moon-Gi
    • Journal of Broadcast Engineering
    • /
    • v.15 no.2
    • /
    • pp.236-247
    • /
    • 2010
  • Recently, mean shift tracking algorithms have been proposed which use the information of color histogram together with some spatial information provided by the kernel. In spite of their fast speed, the algorithms are suffer from an inherent instability problem which is due to the use of an isotropic kernel for spatiality and the use of the Bhattacharyya coefficient as a similarity function. In this paper, we analyze how the kernel and the Bhattacharyya coefficient can arouse the instability problem. Based on the analysis, we propose a novel tracking scheme that uses a new representation of the location of the target which is constrained by the color, the area, and the spatiality information of the target in a more stable way than the mean shift algorithm. With this representation, the target localization in the next frame can be achieved by one step computation, which makes the tracking stable, even in difficult situations such as low-rate-frame environment, and partial occlusion.

Fast Stitching Algorithm by using Feature Tracking (특징점 추적을 통한 다수 영상의 고속 스티칭 기법)

  • Park, Siyoung;Kim, Jongho;Yoo, Jisang
    • Journal of Broadcast Engineering
    • /
    • v.20 no.5
    • /
    • pp.728-737
    • /
    • 2015
  • Stitching algorithm obtain a descriptor of the feature points extracted from multiple images, and create a single image through the matching process between the each of the feature points. In this paper, a feature extraction and matching techniques for the creation of a high-speed panorama using video input is proposed. Features from Accelerated Segment Test(FAST) is used for the feature extraction at high speed. A new feature point matching process, different from the conventional method is proposed. In the matching process, by tracking region containing the feature point through the Mean shift vector required for matching is obtained. Obtained vector is used to match the extracted feature points. In order to remove the outlier, the RANdom Sample Consensus(RANSAC) method is used. By obtaining a homography transformation matrix of the two input images, a single panoramic image is generated. Through experimental results, we show that the proposed algorithm improve of speed panoramic image generation compared to than the existing method.

An Object Tracking Method for Studio Cameras by OpenCV-based Python Program (OpenCV 기반 파이썬 프로그램에 의한 방송용 카메라의 객체 추적 기법)

  • Yang, Yong Jun;Lee, Sang Gu
    • The Journal of the Convergence on Culture Technology
    • /
    • v.4 no.1
    • /
    • pp.291-297
    • /
    • 2018
  • In this paper, we present an automatic image object tracking system for Studio cameras on the stage. For object tracking, we use the OpenCV-based Python program using PC, Raspberry Pi 3 and mobile devices. There are many methods of image object tracking such as mean-shift, CAMshift (Continuously Adaptive Mean shift), background modelling using GMM(Gaussian mixture model), template based detection using SURF(Speeded up robust features), CMT(Consensus-based Matching and Tracking) and TLD methods. CAMshift algorithm is very efficient for real-time tracking because of its fast and robust performance. However, in this paper, we implement an image object tracking system for studio cameras based CMT algorithm. This is an optimal image tracking method because of combination of static and adaptive correspondences. The proposed system can be applied to an effective and robust image tracking system for continuous object tracking on the stage in real time.

Depth Map Pre-processing using Gaussian Mixture Model and Mean Shift Filter (혼합 가우시안 모델과 민쉬프트 필터를 이용한 깊이 맵 부호화 전처리 기법)

  • Park, Sung-Hee;Yoo, Ji-Sang
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.5
    • /
    • pp.1155-1163
    • /
    • 2011
  • In this paper, we propose a new pre-processing algorithm applied to depth map to improve the coding efficiency. Now, 3DV/FTV group in the MPEG is working for standard of 3DVC(3D video coding), but compression method for depth map images are not confirmed yet. In the proposed algorithm, after dividing the histogram distribution of a given depth map by EM clustering method based on GMM, we classify the depth map into several layered images. Then, we apply different mean shift filter to each classified image according to the existence of background or foreground in it. In other words, we try to maximize the coding efficiency while keeping the boundary of each object and taking average operation toward inner field of the boundary. The experiments are performed with many test images and the results show that the proposed algorithm achieves bits reduction of 19% ~ 20% and computation time is also reduced.

Vision-based Target Tracking for UAV and Relative Depth Estimation using Optical Flow (무인 항공기의 영상기반 목표물 추적과 광류를 이용한 상대깊이 추정)

  • Jo, Seon-Yeong;Kim, Jong-Hun;Kim, Jung-Ho;Lee, Dae-Woo;Cho, Kyeum-Rae
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.37 no.3
    • /
    • pp.267-274
    • /
    • 2009
  • Recently, UAVs (Unmanned Aerial Vehicles) are expected much as the Unmanned Systems for various missions. These missions are often based on the Vision System. Especially, missions such as surveillance and pursuit have a process which is carried on through the transmitted vision data from the UAV. In case of small UAVs, monocular vision is often used to consider weights and expenses. Research of missions performance using the monocular vision is continued but, actually, ground and target model have difference in distance from the UAV. So, 3D distance measurement is still incorrect. In this study, Mean-Shift Algorithm, Optical Flow and Subspace Method are posed to estimate the relative depth. Mean-Shift Algorithm is used for target tracking and determining Region of Interest (ROI). Optical Flow includes image motion information using pixel intensity. After that, Subspace Method computes the translation and rotation of image and estimates the relative depth. Finally, we present the results of this study using images obtained from the UAV experiments.

A study on frequency gain control of frequency shift keying signals using the preamble error rate for underwater acoustic communications (수중 음향 통신에서 주파수 편이 변조 신호의 프리엠블 오류율을 이용한 주파수 이득 조절 연구)

  • Jeong, Hyun-Woo;Jung, Ji-Won;Kim, Wan-Jin
    • The Journal of the Acoustical Society of Korea
    • /
    • v.41 no.2
    • /
    • pp.218-226
    • /
    • 2022
  • The main characteristics of the underwater acoustic channel have varying multipath and fast fading. Especially, Frequency Shift Keying (FSK) signals with multiple frequency bands caused loss of information bits allocated on the specific frequencies due to selective fading phenomenon. Therefore, this paper proposes frequency gain control algorithm based on preamble error rates. The proposed algorithm estimates optimal gain value in the range of preamble error rate with less than 10 % for specific faded frequency. By employing turbo equalized FSK signals with rate of 1/3, the experiment was conducted on a lake in Munkyeong city with distance of 300 m to 500 m. The result confirms that packets are decoded successfully by applying proposed algorithm as increasing number of iterations.