• Title/Summary/Keyword: 편집 알고리즘

Search Result 152, Processing Time 0.024 seconds

Motion Adjustment for Dynamic Balance (동적 균형을 위한 동작 변환)

  • Tak, Se-Yun;Song, O-Yeong;Go, Hyeong-Seok
    • Journal of the Korea Computer Graphics Society
    • /
    • v.5 no.2
    • /
    • pp.33-41
    • /
    • 1999
  • This paper presents a new algorithm about motion adjustment for dynamic balance. It adjusts an unbalanced motion to an balanced motion while preserving the nuance of original motion. We solve dynamic balancing problem using the zero moment point (ZMP) which is often used for controlling the balance of biped robot. Our algorithm is consists of four steps. First, it fits joint angle data to spline curves for reducing noise. Second, the algorithm analyzes the ZMP trajectory so that it can detects the dynamically-unbalanced duration. Third, the algorithm project the ZMP trajectory into the supporting area if the trajectory deviates from the area. Finally, the algorithm produces the balanced motion that satisfies the new ZMP trajectory. In this step, the constrained optimization method is used so that the new motion keeps the original motion characteristics as much as possible. We make several experiments in order to prove that our algorithm is useful to add physical realism to a kinematically edited motion.

  • PDF

Generating and Controlling an Interlinking Network of Technical Terms to Enhance Data Utilization (데이터 활용률 제고를 위한 기술 용어의 상호 네트워크 생성과 통제)

  • Jeong, Do-Heon
    • Journal of the Korean Society for information Management
    • /
    • v.35 no.1
    • /
    • pp.157-182
    • /
    • 2018
  • As data management and processing techniques have been developed rapidly in the era of big data, nowadays a lot of business companies and researchers have been interested in long tail data which were ignored in the past. This study proposes methods for generating and controlling a network of technical terms based on text mining technique to enhance data utilization in the distribution of long tail theory. Especially, an edit distance technique of text mining has given us efficient methods to automatically create an interlinking network of technical terms in the scholarly field. We have also used linked open data system to gather experimental data to improve data utilization and proposed effective methods to use data of LOD systems and algorithm to recognize patterns of terms. Finally, the performance evaluation test of the network of technical terms has shown that the proposed methods were useful to enhance the rate of data utilization.

UCC-Resilient HD Content Watermarking Scheme on DCT Compressed Domain (UCC 편집에 강인한 DCT 압축영역 기반 고화질 영상 워터마킹 기법)

  • Kim, Jung-Youn;Nam, Je-Ho
    • Journal of Broadcast Engineering
    • /
    • v.13 no.4
    • /
    • pp.489-500
    • /
    • 2008
  • We propose a novel high-definition content watermarking algorithm that is highly feasible in UCC (User Created Contents) environment. We begin by addressing an association between broadcasting content and UCC in a view of copyrights, then present watermark requirements by analyzing various UCC editing-effect. Also, we provide a brief review of previous watermarking techniques that are supposed to satisfy the requirements. Our proposed scheme inserts a invisible watermark into both DC and AC components on $8{\times}8$ block DCT domain and extracts them after synchronization using DC image. Experimental results show that our technique satisfies the requirements of invisibility and robustness to a variety of attacks such as rotation, scaling, cropping, and JPEG compression, etc. Note that the proposed scheme is highly resilient to UCC edit attacks that are combined by many different types of watermark attacks.

Development of Dynamic Simulator for Light Rail Transit Depot (경량전철 차량기지 동적 시뮬레이터 개발)

  • Yang, Won-Mo
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.1
    • /
    • pp.9-18
    • /
    • 2011
  • Recently, in the era of low carbon and green growth, the importance of railway transportation is being emphasized However, there is a lack of research on simulation for railway depot. This paper presents the development of the dynamic simulator for LRT(Light Rail Transit) depot. This study presents explanations of requirement analysis, architecture, database design, simulation algorithm, and design and development of the simulation tool. The dynamic LRT depot simulation tool consists of four modules; a Network Editor to create and modify information regarding railroad, train, signal, turnout, job and station, a Simulator to calculate train movement algorithm, a Reporter to show simulation results in table and graphs, and an Animator to animate simulation results dynamically. It is hoped that this study on general details of structure, design and development of LRT depot dynamic simulator will perform as a good reference to future development of new simulation tools.

The MPEG-7 based Video Database (MPEG-7에 기반한 동영상 데이터베이스)

  • Lee, Soon-Hee
    • Journal of the Korea Computer Industry Society
    • /
    • v.8 no.2
    • /
    • pp.103-106
    • /
    • 2007
  • In order to construct a Video Database, shot change detection should be made first. But, because these processes are not automated perfectly, we need a lot of time and efforts now. And, there are many shot change detection algorithms, which can't always insure the perfect result because of the editing effects such as cut, wipe, and dissolves used in film production. Therefore, in order to receive the exact shot change, It needs the verification and correction by manual processing at any cost. Spatiotemporal slice is a simple image condensing method for the content changes of video. The editing effects are expressed on the Spatiotemporal slice in the visually noticed form of vertical line, diagonal line, curved line and gradual color changes, etc. Accordingly the parts doubted as a shot change can be easily detected by the change of the Spatiotemporal slice without replaying the video. The system proposed in this study makes it possible to delete the false detected key frames, and create the undetected key frames on the Spatiotemporal slice.

  • PDF

Design and Implementation of the Golf Swing Analysis System through Captured Motion Picture (골프 동작 분석을 위한 동영상 편집시스템 설계 및 구현)

  • Park, Young-Bom
    • The KIPS Transactions:PartB
    • /
    • v.9B no.4
    • /
    • pp.453-458
    • /
    • 2002
  • It is not easy to analyze dynamic sports motion, but it can be done easily by using an interactive playback of the recorded motion. Everybody is able to capture a golf swing owing to the popularization of PC and digital camcorder in these days. In this study, the system that can provide golf swing analysis is selected and implemented. Furthermore, editing method that can represent motion is applied and moving object tracking algorithm that can make this profess easy is applied to provide easy golf swing analysis.

Attitude and Position Estimation of a Helmet Using Stereo Vision (스테레오 영상을 이용한 헬멧의 자세 및 위치 추정)

  • Shin, Ok-Shik;Heo, Se-Jong;Park, Chan-Gook
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.38 no.7
    • /
    • pp.693-701
    • /
    • 2010
  • In this paper, it is proposed that an attitude and position estimation algorithm based on a stereo camera system for a helmet tracker. Stereo camera system consists of two CCD camera, a helmet, infrared LEDs and a frame grabber. Fifteen infrared LEDs are feature points which are used to determine the attitude and position of the helmet. These features are arranged in triangle pattern with different distance on the helmet. Vision-based the attitude and position algorithm consists of feature segmentation, projective reconstruction, model indexing and attitude estimation. In this paper, the attitude estimation algorithm using UQ (Unit Quaternion) is proposed. The UQ guarantee that the rotation matrix is a unitary matrix. The performance of presented algorithm is verified by simulation and experiment.

Identification Method of Geometric and Filtering Change Regions in Modified Digital Images (수정된 디지털 이미지에서 기하학적 변형 및 필터링 변형 영역을 식별하는 기법)

  • Hwang, Min-Gu;Cho, Byung-Joo;Har, Dong-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.11
    • /
    • pp.1292-1304
    • /
    • 2012
  • Recently, digital images are extremely forged by editors or advertisers. Also, amateurs can modify images throughout easy editing programs. In this study, we propose identification and analytical methods for the modified images to figure out those problems. In modified image analysis, we classify two parts; a filtering change and a geometric change. Those changes have an algorithm based on interpolation so that we propose the algorithm which is able to analyze a trace on a modified area. With this algorithm, we implement a detection map of interpolation using minimum filter, laplacian algorithm, and maximum filter. We apply the proposed algorithm to modified image and are able to analyze its modified trace using the detection map.

Change Detection of Hangul Documents Based on X-treeDiff+ (X-treeDiff+ 기반의 한글 문서에 대한 변화 탐지)

  • Lee, Suk-Kyoon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.4
    • /
    • pp.29-37
    • /
    • 2010
  • The change detection of XML documents is a major research area. However, though XML becomes a file format for Hangul documents, research on change detection of Hangul documents based on the characteristics of Hangul documents is rather scarce. Since format data in Hangul documents are very large, which is different from ordinary XML documents, it is not proper to apply general XML change detection algorithms such as X-treeDiff+ to Hangul documents without any change. In this paper, we propose new contents-based matching algorithm and implement it in X-treeDiff+. The result of our testing shows better performance for most documents in editing process.

Change Reconciliation on XML Repetitive Data (XML 반복부 데이터의 변경 협상 방법)

  • Lee Eunjung
    • The KIPS Transactions:PartA
    • /
    • v.11A no.6
    • /
    • pp.459-468
    • /
    • 2004
  • Sharing XML trees on mobile devices has become more and more popular. Optimistic replication of XML trees for mobile devices raises the need for reconciliation of concurrently modified data. Especially for reconciling the modified tree structures, we have to compare trees by node mapping which takes O($n^2$) time. Also, using semantic based conflict resolving policy is often discussed in the literature. In this research, we focused on an efficient reconciliation method for mobile environments, using edit scripts of XML data sent from each device. To get a simple model for mobile devices, we use the XML list data sharing model, which allows inserting/deleting subtrees only for the repetitive parts of the tree, based on the document type. Also, we use keys for repetitive part subtrees, keys are unique between nodes with a same parent. This model not only guarantees that the edit action always results a valid tree but also allows a linear time reconciliation algorithm due to key based list reconciliation. The algorithm proposed in this paper takes linear time to the length of edit scripts, if we can assume that there is no insertion key conflict. Since the previous methods take a linear time to the size of the tree, the proposed method is expected to provide a more efficient reconciliation model in the mobile environment.