• Title/Summary/Keyword: Moving Sequence

Search Result 291, Processing Time 0.028 seconds

Technical Survey and Analysis of DSSS (직접대역확산방식 기술조사 및 분석)

  • Lim, You-Chol;Ma, Keun-Soo;Kim, Myung-Hwan;Lee, Jae-Deuk
    • Aerospace Engineering and Technology
    • /
    • v.10 no.1
    • /
    • pp.45-53
    • /
    • 2011
  • This paper is technical review about Direct Sequence Spread Spectrum(DSSS) to apply in launch vehicle system. First, we introduce communication protocol(carrier frequency, code length, process gain, data rate, chip rate etc) about several application system using DSSS. And then, we survey and summarize the effect of doppler shift to the DSSS. The doppler shift is important error factor for PN code tracking in the fast moving system like launch vehicle. So, spread spectrum code acquisition technique for a direct sequence system in the presence of doppler effect must be investigated.

Stereoscopic Video Conversion Based on Image Motion Classification and Key-Motion Detection from a Two-Dimensional Image Sequence (영상 운동 분류와 키 운동 검출에 기반한 2차원 동영상의 입체 변환)

  • Lee, Kwan-Wook;Kim, Je-Dong;Kim, Man-Bae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.1086-1092
    • /
    • 2009
  • Stereoscopic conversion has been an important and challenging issue for many 3-D video applications. Usually, there are two different stereoscopic conversion approaches, i.e., image motion-based conversion that uses motion information and object-based conversion that partitions an image into moving or static foreground object(s) and background and then converts the foreground in a stereoscopic object. As well, since the input sequence is MPEG-1/2 compressed video, motion data stored in compressed bitstream are often unreliable and thus the image motion-based conversion might fail. To solve this problem, we present the utilization of key-motion that has the better accuracy of estimated or extracted motion information. To deal with diverse motion types, a transform space produced from motion vectors and color differences is introduced. A key-motion is determined from the transform space and its associated stereoscopic image is generated. Experimental results validate effectiveness and robustness of the proposed method.

Coarse to Fine Optical Flow Detection (조세단계를 이용한 광류검출 알고리즘)

  • Lee Her Man;Seo Jeong Man
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.1 s.33
    • /
    • pp.223-229
    • /
    • 2005
  • In this paper a coarse-to-fine optical flow detection method is proposed. Provided that optical flow gives reliable approximation to two-dimensional image motion, it can be used to recover the three-dimensional motion, but usually to set the reliable optical flows are difficult. The proposed algorithm uses Horn's algorithm for detecting initial optical flow, then Thin Plate Spline is introduced to warp a image frame of the initial optical flow to the next image frame. The optical flow for the warped image frame is again used iteratively until the mean square error between two image sequence frames is lowered. The proposed method is experimented for the real moving picture image sequence. The proposed algorithm gives dense optical flow vectors.

  • PDF

Unified Approach to Path Planning Algorithm for SMT Inspection Machines Considering Inspection Delay Time (검사지연시간을 고려한 SMT 검사기의 통합적 경로 계획 알고리즘)

  • Lee, Chul-Hee;Park, Tae-Hyoung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.8
    • /
    • pp.788-793
    • /
    • 2015
  • This paper proposes a path planning algorithm to reduce the inspection time of AOI (Automatic Optical Inspection) machines for SMT (Surface Mount Technology) in-line system. Since the field-of-view of the camera attached at the machine is much less than the entire inspection region of board, the inspection region should be clustered to many groups. The image acquisition time depends on the number of groups, and camera moving time depends on the sequence of visiting the groups. The acquired image is processed while the camera moves to the next position, but it may be delayed if the group includes many components to be inspected. The inspection delay has influence on the overall job time of the machine. In this paper, we newly considers the inspection delay time for path planning of the inspection machine. The unified approach using genetic algorithm is applied to generates the groups and visiting sequence simultaneously. The chromosome, crossover operator, and mutation operator is proposed to develop the genetic algorithm. The experimental results are presented to verify the usefulness of the proposed method.

Variable Block Size Motion Estimation Techniques for The Motion Sequence Coding (움직임 영상 부호화를 위한 가변 블록 크기 움직임 추정 기법)

  • 김종원;이상욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.4
    • /
    • pp.104-115
    • /
    • 1993
  • The motion compensated coding (MCC) technique, which exploits the temporal redundancies in the moving images with the motion estimation technique,is one of the most popular techniques currently used. Recently, a variable block size(VBS) motion estimation scheme has been utilized to improve the performance of the motion compensted coding. This scheme allows large blocks to the used when smaller blocks provide little gain, saving rates for areas containing more complex motion. Hence, a new VBS motion estimation scheme with a hierarchical structure is proposed in this paper, in order to combine the motion vector coding technique efficiently. Topmost level motion vector, which is obtained by the gain/cost motion estimation technique with selective motion prediction method, is always transmitted. Thus, the hierarchical VBS motion estimation scheme can efficiently exploit the redundancies among neighboring motion vectors, providing an efficient motion vector encoding scheme. Also, a restricted search with respect to the topmost level motion vector enables more flexible and efficient motion estimation for the remaining lower level blocks. Computer simulations on the high resolution image sequence show that, the VBS motion estimation scheme provides a performance improvement of 0.6~0.7 dB, in terms of PSNR, compared to the fixed block size motion estimation scheme.

  • PDF

A Hand-off Technique Using Mobility Pattern in Mobile Internet (모바일 인터넷에서 이동성 패턴을 이용한 핸드오프 기법)

  • Kim, Hwang-Rae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.7 no.5
    • /
    • pp.919-925
    • /
    • 2006
  • Mobile IPv6 generates the loss of packets and out of sequencing when hand off, In this paper, We propose a improved hand off techniques using the mobility pattern of mobile nodes. As making group by presetting the moving range of mobile nodes, and putting buffer server in the group, the packet loss and out of packet sequence can be reduced. The proposed method prevents the out of packet sequence in If level which can be happened in the stable state, minimizes the packet re-send in TCP level. In the simulation, the proposed hand off techniques transmits packets efficiently by using the mobility pattern of mobile nodes.

  • PDF

Sequential Longest Section Color Winning Algorithm for Car Paint Sequencing Problem (자동차 페인트 순서 문제의 연속된 최장 구간 색 승리 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.1
    • /
    • pp.177-186
    • /
    • 2020
  • This paper deals with the car paint sequencing problem (CPSP) that the entrance sequence is to same colored group with maximum sequenced cars for the buffer arriving cars from the body shop. This problem classified by NP-complete problem because of the exact solution has not obtained within polynomial time. CPSP is aim to minimum pugging number that each pugging must be performs at color changing time in order to entirely cleaning the remaining previous color. To be obtain the minimum number of moving distance with window concept and minimum number of pugging, this paper sorts same color and arriving sequence. Then we basically decide the maximum length section color time to winner team using stage race method. For the case of the loser team with no more racing or yield to loser team and more longer stage in upcoming racing, the winner team give way to loser team. As a result, all cars(runners) are winner in any stage without fail. For n cars, the proposed algorithm has a advantage of simple and fast with O(nlogn) polynomial time complexity, this algorithm can be get the minimum number of moving distance and purging for all of experimental data.

Codebook-Based Foreground Extraction Algorithm with Continuous Learning of Background (연속적인 배경 모델 학습을 이용한 코드북 기반의 전경 추출 알고리즘)

  • Jung, Jae-Young
    • Journal of Digital Contents Society
    • /
    • v.15 no.4
    • /
    • pp.449-455
    • /
    • 2014
  • Detection of moving objects is a fundamental task in most of the computer vision applications, such as video surveillance, activity recognition and human motion analysis. This is a difficult task due to many challenges in realistic scenarios which include irregular motion in background, illumination changes, objects cast shadows, changes in scene geometry and noise, etc. In this paper, we propose an foreground extraction algorithm based on codebook, a database of information about background pixel obtained from input image sequence. Initially, we suppose a first frame as a background image and calculate difference between next input image and it to detect moving objects. The resulting difference image may contain noises as well as pure moving objects. Second, we investigate a codebook with color and brightness of a foreground pixel in the difference image. If it is matched, it is decided as a fault detected pixel and deleted from foreground. Finally, a background image is updated to process next input frame iteratively. Some pixels are estimated by input image if they are detected as background pixels. The others are duplicated from the previous background image. We apply out algorithm to PETS2009 data and compare the results with those of GMM and standard codebook algorithms.

[ Hα ] SPECTRAL PROPERTIES OF VELOCITY THREADS CONSTITUTING A QUIESCENT SOLAR FILAMENT

  • Chae, Jong-Chul;Park, Hyung-Min;Park, Young-Deuk
    • Journal of The Korean Astronomical Society
    • /
    • v.40 no.3
    • /
    • pp.67-82
    • /
    • 2007
  • The basic building block of solar filaments/prominences is thin threads of cool plasma. We have studied the spectral properties of velocity threads, clusters of thinner density threads moving together, by analyzing a sequence of $H{\alpha}$ images of a quiescent filament. The images were taken at Big Bear Solar Observatory with the Lyot filter being successively tuned to wavelengths of -0.6, -0.3, 0.0, +0.3, and +0.6 ${\AA}$ from the centerline. The spectra of contrast constructed from the image data at each spatial point were analyzed using cloud models with a single velocity component, or three velocity components. As a result, we have identified a couple of velocity threads that are characterized by a narrow Doppler width($\Delta\lambda_D=0.27{\AA}$), a moderate value of optical thickness at the $H{\alpha}$ absorption peak($\tau_0=0.3$), and a spatial width(FWHM) of about 1". It has also been inferred that there exist 4-6 velocity threads along the line of sight at each spatial resolution element inside the filament. In about half of the threads, matter moves fast with a line-of-sight speed of $15{\pm}3km\;s^{-1}$, but in the other half it is either at rest or slowly moving with a line-of-sight velocity of $0{\pm}3km\;s^{-1}$. It is found that a statistical balance approximately holds between the numbers of blue-shifted threads and red-shifted threads, and any imbalance between the two numbers is responsible for the non-zero line-of-sight velocity determined using a single-component model fit. Our results support the existence not only of high speed counter-streaming flows, but also of a significant amount of cool matter either being at rest or moving slowly inside the filament.

Improved changed region detection and motion estimation for object-oriented coding (객체기반 부호화에서의 개선된 움직임 영역 추출 및 추정 기법)

  • 정의윤;박영식;송근원;한규필;하영호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.9
    • /
    • pp.2043-2052
    • /
    • 1997
  • The object-oriented coding technique which is one of the coding methods in very low bit rate environment is suitable for videophone image sequence. The selection of source model affect image analysis. In this paper, an image analysis method for the object-oriented coding is presented. The process is composed of changed region detection andmotion estimateion. First, we use the standard deviation of frame difference as thrreshold to extract themoving area. If thesum of gray values in mask is greater than the threshold, the center pixel of the mask is regarded as moving region. After moving is detected in changed region by edge operator, observation point is determined from moving region. The motion is estimated by 6-parameter mapping method with determined observation point. The experimantal resutls show that the proposed method can significantly improve the image quality.

  • PDF