• 제목/요약/키워드: sequence information

검색결과 4,003건 처리시간 0.032초

비디오 영상에 가상물체의 그림자 삽입을 통한 향상된 AR 구현 (Enhanced Augmented Reality with Realistic Shadows of Graphic Generated Objects)

  • 김태원;홍기상
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 제13회 신호처리 합동 학술대회 논문집
    • /
    • pp.619-622
    • /
    • 2000
  • In this paper, we propose a method for generating graphic objects having realistic shadows inserted into video sequence for the enhanced augmented reality. Our purpose is to extend the work of [1], which is applicable to the case of a static camera, to video sequence. However, in case of video, there are a few challenging problems, including the camera calibration problem over video sequence, false shadows occurring when the video camera moves and so on. We solve these problems using the convenient calibration technique of [2] and the information from video sequence . We present the experimental results on real video sequences.

  • PDF

효율적인 서열 분석을 위한 sequence finishing program의 구현 (Implementation of Sequence Finishing Program for Efficient Sequence Analysis)

  • 문상훈;정우철;김진
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2003년도 춘계학술발표논문집 (중)
    • /
    • pp.927-930
    • /
    • 2003
  • Automated sequencer로부터 얻게된 서열은 PCR이나 sequencing의 영향 등으로 기존의 자료 또는 분자생물학자가 원하는 서열과는 조금씩 차이점을 나타내게 되고, 이를 보정하기 위해 수작업으로 처리하게 된다. 이는 아주 간단함 작업임에도 불구하고 30분에서 1시간, 많게는 몇 시간씩 걸리는 불편함을 감수하고 있다. 본 논문에서는 분자 생물학자들이 효율적으로 서열을 분석하게 하는 sequence finishing program의 구현에 관하여 논의하였다.

  • PDF

MUIO와 shortest path를 이용한 개선된 시험순서생성 (Test sequence generation using MUIO and shortest paths)

  • 정윤희;홍범기
    • 한국통신학회논문지
    • /
    • 제21권5호
    • /
    • pp.1193-1199
    • /
    • 1996
  • This paper introduces an algorithm which uses MUIO and the shortest paths to minimize the length of test sequence. The length of test sequence is equal to the total number of the edges in a symmetric test graph $G^{*}$. Therefore, it is important to make a $G^{*}$ with the least number of the edges. This algorithm is based on the one proposed Shen[2]. It needs the complexity to make shortest paths but reduces the thest sequence by 1.0~9.8% over the Shen's algorithm. and this technique, directly, derives a symmetric test graph from an FMS.

  • PDF

S-box 형태의 다 수열 발생기에 관한 연구 (On a Multiple-cycle Binary Sequence Genrator Based on S-box)

  • 이훈재
    • 한국정보처리학회논문지
    • /
    • 제7권5호
    • /
    • pp.1474-1481
    • /
    • 2000
  • The number of keystream cycle sequences has been proposed as a characteristic of binary sequence generator for cryptographic application, but in general the most of binary sequence generators have a single cycle. On the other hand, S-box has been used to block cipher for a highly nonlinear element and then we apply it to the stream cipher with a high crypto-degree. In this paper, we propose a multiple-cycle binary sequence generator based on S-box which has a high nonlinearity containing SAC property and analyze its period, linear complexity, randomness and the number of keystream cycle sequences.

  • PDF

A Novel Hitting Frequency Point Collision Avoidance Method for Wireless Dual-Channel Networks

  • Quan, Hou-De;Du, Chuan-Bao;Cui, Pei-Zhang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권3호
    • /
    • pp.941-955
    • /
    • 2015
  • In dual-channel networks (DCNs), all frequency hopping (FH) sequences used for data channels are chosen from the original FH sequence used for the control channel by shifting different initial phases. As the number of data channels increases, the hitting frequency point problem becomes considerably serious because DCNs is non-orthogonal synchronization network and FH sequences are non-orthogonal. The increasing severity of the hitting frequency point problem consequently reduces the resource utilization efficiency. To solve this problem, we propose a novel hitting frequency point collision avoidance method, which consists of a sequence-selection strategy called sliding correlation (SC) and a collision avoidance strategy called keeping silent on hitting frequency point (KSHF). SC is used to find the optimal phase-shifted FH sequence with the minimum number of hitting frequency points for a new data channel. The hitting frequency points and their locations in this optimal sequence are also derived for KSHF according to SC strategy. In KSHF, the transceivers transmit or receive symbol information not on the hitting frequency point, but on the next frequency point during the next FH period. Analytical and simulation results demonstrate that unlike the traditional method, the proposed method can effectively reduce the number of hitting frequency points and improve the efficiency of the code resource utilization.

Design and Implementation of an LED Mood Lighting System Using Personalized Color Sequence Generation

  • Jeong, Gu-Min;Yeo, Jong-Yun;Won, Dong Mook;Bae, Sung-Han;Park, Kyung-Joon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권12호
    • /
    • pp.3182-3196
    • /
    • 2012
  • In this paper, we present a new LED (Light Emitting Diode) mood lighting system interacting with smartphones based on the generation of different light sequences. In the proposed system, one light sequence is considered to be one unit of the service contents, which is then transmitted through a network and played in an LED lighting system. To this end, we propose a novel generation scheme using a smartphone, and a decoding/playing mechanism in an LED lighting system. The lighting sequences have a fixed period divided into predefined time units. Two modes - basic and interpolation - are supported in each time unit when playing a color sequence. In the basic mode, the color is maintained for the entire time unit, whereas in the interpolation mode the color is interpolated. The sequence is decoded and played in the lighting circuit by changing the duty cycle of a PWM (Pulse Width Modulation) signal. A demonstration system of the overall proposed method was using smartphones, a server and an LED lighting system. The results from this experiment show the validity and applicability of the proposed scheme.

Method for Feature Extraction of Radar Full Pulses Based on EMD and Chaos Detection

  • Guo, Qiang;Nan, Pulong
    • Journal of Communications and Networks
    • /
    • 제16권1호
    • /
    • pp.92-97
    • /
    • 2014
  • A novel method for extracting frequency slippage signal from radar full pulse sequence is presented. For the radar full pulse sequence received by radar interception receiver, radio frequency (RF) and time of arrival (TOA) of all pulses constitute a two-dimensional information sequence. In a complex and intensive electromagnetic environment, the TOA of pulses is distributed unevenly, randomly, and in a nonstationary manner, preventing existing methods from directly analyzing such time series and effectively extracting certain signal features. This work applies Gaussian noise insertion and structure function to the TOA-RF information sequence respectively such that the equalization of time intervals and correlation processing are accomplished. The components with different frequencies in structure function series are separated using empirical mode decomposition. Additionally, a chaos detection model based on the Duffing equation is introduced to determine the useful component and extract the changing features of RF. Experimental results indicate that the proposed methodology can successfully extract the slippage signal effectively in the case that multiple radar pulse sequences overlap.

A Method for Fault detecting on Power Transmission Network by use of M-sequence Correlation

  • Nishiyama, Eiji;Kuwanami, Kenshi;Owaki, Kosuke
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.2570-2575
    • /
    • 2003
  • Monitoring a power transmission line is significant for power electric companies. In this paper, we propose a new method for detecting an fault point of power transmission line by use of M-sequence correlation technique. In this method, detecting signal is used as one or plural M-sequences ( same characteristic polynomial, including normal and reverse mark, synchronized ). In receiving point, we make same sequence with the input one and take crosscorrelation function between M-sequence and the received signal. We can see transfer fanctions of plural paths between inputs and a output taps separated from different of delay times on the crosscorrelation function, and from these transfer fanctions, so we compare them when fault occurred with in usual.

  • PDF

A New Approach to Find Orthologous Proteins Using Sequence and Protein-Protein Interaction Similarity

  • Kim, Min-Kyung;Seol, Young-Joo;Park, Hyun-Seok;Jang, Seung-Hwan;Shin, Hang-Cheol;Cho, Kwang-Hwi
    • Genomics & Informatics
    • /
    • 제7권3호
    • /
    • pp.141-147
    • /
    • 2009
  • Developed proteome-scale ortholog and paralog prediction methods are mainly based on sequence similarity. However, it is known that even the closest BLAST hit often does not mean the closest neighbor. For this reason, we added conserved interaction information to find orthologs. We propose a genome-scale, automated ortholog prediction method, named OrthoInterBlast. The method is based on both sequence and interaction similarity. When we applied this method to fly and yeast, 17% of the ortholog candidates were different compared with the results of Inparanoid. By adding protein-protein interaction information, proteins that have low sequence similarity still can be selected as orthologs, which can not be easily detected by sequence homology alone.

A Proposal on a Multiple-Cycle Binary Sequence Generator with a ST-LFSR

  • Lee, Hoon-Jae;Park, Hee-Bong
    • 한국산업정보학회논문지
    • /
    • 제7권5호
    • /
    • pp.67-72
    • /
    • 2002
  • 출력 키수열의 사이클 수가 암호 분야에서 새로운 평가 요소로서 제안된 바 있으나 대부분의 이진 수열 발생기는 출력 사이클이 1개 뿐인 것으로 알려져 있다 본 논문에서는 다수 사이클을 갖는 발생기의 기본 함수로서 switching-tap LFSR과 이를 응용한 Rueppel 개선형 다수열 발생기를 제안하였다. 그리고 개선된 발생기에 대하여 주기, 선형 복잡도 및 출력 사이클 수에 대하여 안전성을 분석하였다.

  • PDF