• Title/Summary/Keyword: Block sequence

Search Result 345, Processing Time 0.028 seconds

Sign Reversal Channel Switching Method for Space-Frequency Block Code in Orthogonal Frequency Division Multiplexing System (직교 주파수 분할 다중화 시스템의 공간 주파수 블록 코딩에서의 부호 반전 채널 스위칭 기법)

  • Jung, Hyeok-Koo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.25 no.5
    • /
    • pp.13-21
    • /
    • 2020
  • This paper proposes a sign reversal channel switching method in space-frequency block code for orthogonal frequency division multiplexing system. In case of sending source data on other antenna, it is necessary for the receiver to change combining method according to the channel variation. If one does not know the predefined channel switching sequence, it is not possible to decode the received data precisely. In transmit data symbols' exchanges for a channel switching, data symbols are exchanged according to a format of space-frequency block code. In this paper, we proposes a simple sign reversal method except exchanging data symbols between transmit antennas. It is shown that this method occurs another combining method for a simple encryption in the receiver.

A New Block-based Gradient Descent Search Algorithm for a Fast Block Matching (고속 블록 정합을 위한 새로운 블록 기반 경사 하강 탐색 알고리즘)

  • 곽성근
    • Journal of the Korea Computer Industry Society
    • /
    • v.4 no.10
    • /
    • pp.731-740
    • /
    • 2003
  • Since motion estimation remove the redundant data to employ the temporal correlations between adjacent frames in a video sequence, it plays an important role in digital video coding. And in the block matching algorithm, search patterns of different shapes or sizes and the distribution of motion vectors have a large impact on both the searching speed and the image quality. In this paper, we propose a new fast block matching algorithm using the small-cross search pattern and the block-based gradient descent search pattern. Our algorithm first finds the motion vectors that are close to the center of search window using the small-cross search pattern, and then quickly finds the other motion vectors that are not close to the center of search window using the block-based gradient descent search pattern. Through experiments, compared with the block-based gradient descent search algorithm(BBGDS), the proposed search algorithm improves as high as 26-40% in terms of average number of search point per motion vector estimation.

  • PDF

Block Boundary Detection Technique for Adaptive Blocking Artifacts Reduction (적응적 블록화 현상 제거를 위한 블록 경계 검출 기법)

  • Kim, Sung-Deuk;Lim, Kyoung-Won
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.2
    • /
    • pp.11-19
    • /
    • 2010
  • Most of deblocking filters assumes that the block boundaries are accurately known and the coding information like quantization parameters are available. In some applications such as commercial television, however, many external video inputs without known block boundary and coding information arc given. If a decompressed video sequence heavily degraded with blocking artifacts is given through the external video port, it is absolutely necessary to detect block boundaries and control the strength of deblocking filtering by analysing the given images. This paper presents an efficient method to find the block boundaries and estimate the strength of the blocking artifacts without the knowledge of coding information. In addition, the confidence of the estimated blocking artifact information is also evaluated to control the adaptive deblocking filter robustly. Experiment results show that the estimated block boundary locations and strength relative strength and confidence information are practically good enough to reduce the blocking artifacts without prior knowledge.

Adaptive Selection of Weighted Quantization Matrix for H.264 Intra Video Coding (H.264 인트라 부호화를 위한 적응적 가중치 양자화 행렬 선택방법)

  • Cho, Jae-Hyun;Cho, Suk-Hee;Jeong, Se-Yoon;Song, Byung-Cheol
    • Journal of Broadcast Engineering
    • /
    • v.15 no.5
    • /
    • pp.672-680
    • /
    • 2010
  • This paper presents an adaptive quantization matrix selection scheme for H.264 video encoding. Conventional H.264 coding standard applies the same quantization matrix to the entire video sequence without considering local characteristics in each frame. In this paper, we propose block adaptive selection of quantization matrix according to edge directivity of each block. Firstly, edge directivity of each block is determined using intra prediction modes of its spatially adjacent blocks. If the block is decided as a directional block, new weighted quantization matrix is applied to the block. Otherwise, conventional quantization matrix is used for quantization of the non-directional block. Since the proposed weighted quantization is designed based on statistical distribution of transform coefficients in accordance with intra prediction modes, we can achieve high coding efficiency. Experimental results show that the proposed scheme can improve coding efficiency by about 2% in terms of BD bit-rate.

Security Analysis of MAC Algorithm using Block Cipher (블록 암호 알고리즘을 애용한 MAC 분석)

  • Seo Chang-Ho;Yun Bo-Hyun;Maeng Sung-Reol
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.2 s.34
    • /
    • pp.39-47
    • /
    • 2005
  • This paper proposes and analyzes the MAC(Message Authentication Code) algorithm that is used for the transition integrity and the entity authentication of message. The MAC algorithm uses the DES algorithm which has 64-bit block and 56-bit key and we compare the security according to 64-bit and 32-bit length of MAC value. Moreover, we use the SEED algorithm which has 128-bit block and 128-bit key and compare the security according to 128-bit and 64-bit length of MAC value. We analyze the security the forgery attack according to length of message and length of MAC value. 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 get the reliable optical flows are difficult. The proposed algorithm uses Horn's algorithm (or 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

The Study of Implicit Motor Learning Using a Serial Reaction Time Task (연속 반응시간 과제를 이용한 내재적 운동학습의 특성 연구)

  • Park, Ji-Won;Hong, Chul-Pyo;Kim, Jong-Man;Ha, Hyun-Geun;Kim, Yun-Hee
    • Physical Therapy Korea
    • /
    • v.11 no.2
    • /
    • pp.1-8
    • /
    • 2004
  • Motor skill learning can be acquired implicitly without consciousness of what is being learned. The purpose of this study was to examine the characteristics of implicit motor learning in young and elderly people using a perceptual-motor task. Forty normal young and elderly subjects participated. A modified version of the Serial Reaction Time Task (SRTT) using six blocks of twelve perceptual motor sequences was administered. The paradigm consisted of the first random sequence block followed by the four patterned blocks and another random block. In each block, the go signal consisted of an asterisk displayed in the one of the four parallel arrayed boxes in the middle of the screen. Subjects were instructed to push the corresponding response buttons as quickly as possible. Young subjects demonstrated shorter reaction times during the consecutive patterned blocks reflecting appropriate learning accomplished. Elderly subjects were able to learn a perceptual-motor task with implicit knowledge, but the performance was lower than that of the young persons. These results indicated that implicit sequence learning is still preserved in elderly adults, but the rate of learning is slower.

  • PDF

Digital Watermarking using the Channel Coding Technique (채널 코딩 기법을 이용한 디지털 워터마킹)

  • Bae, Chang-Seok;Choi, Jae-Hoon;Seo, Dong-Wan;Choe, Yoon-Sik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.10
    • /
    • pp.3290-3299
    • /
    • 2000
  • Digital watermarking has similar concepts with channel coding thechnique for transferring data with minimizing error in noise environment, since it should be robust to various kinds of data manipulation for protecting copyrights of multimedia data. This paper proposes a digital watermarking technique which is robust to various kinds of data manipulation. Intellectual property rights information is encoded using a convolutional code, and block-interleaving technique is applied to prevent successive loss of encoded data. Encoded intelloctual property rithts informationis embedded using spread spectrum technique which is robust to cata manipulation. In order to reconstruct intellectual property rights information, watermark signalis detected by covariance between watermarked image and pseudo rando noise sequence which is used to einbed watermark. Embedded intellectual property rights information is obtaned by de-interleaving and cecoding previously detected wtermark signal. Experimental results show that block interleaving watermarking technique can detect embedded intellectial property right informationmore correctly against to attacks like Gaussian noise additon, filtering, and JPEG compression than general spread spectrum technique in the same PSNR.

  • PDF

A New Adaptive Window Size-based Three Step Search Scheme (적응형 윈도우 크기 기반 NTSS (New Three-Step Search Algorithm) 알고리즘)

  • Yu Jonghoon;Oh Seoung-Jun;Ahn Chang-bum;Park Ho-Chong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.1 s.307
    • /
    • pp.75-84
    • /
    • 2006
  • With considering center-biased characteristic, NTSS(New Three-Step Search Algorithm) can improve the performance of TSS(Three-Step Search Algorithm) which is one of the most popular fast block matching algorithms(BMA) to search a motion vector in a video sequence. Although NTSS has generally better Quality than TSS for a small motion sequence, it is hard to say that NTSS can provide better quality than TSS for a large motion sequence. It even deteriorates the quality to increase a search window size using NTSS. In order to address this drawback, this paper aims to develop a new adaptive window size-based three step search scheme, called AWTSS, which can improve quality at various window sizes in both the small and the large motion video sequences. In this scheme, the search window size is dynamically changed to improve coding efficiency according to the characteristic of motion vectors. AWTSS can improve the video quality more than 0.5dB in case of large motion with keeping the same quality in case of small motion.

Anomalous Event Detection in Traffic Video Based on Sequential Temporal Patterns of Spatial Interval Events

  • Ashok Kumar, P.M.;Vaidehi, V.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.1
    • /
    • pp.169-189
    • /
    • 2015
  • Detection of anomalous events from video streams is a challenging problem in many video surveillance applications. One such application that has received significant attention from the computer vision community is traffic video surveillance. In this paper, a Lossy Count based Sequential Temporal Pattern mining approach (LC-STP) is proposed for detecting spatio-temporal abnormal events (such as a traffic violation at junction) from sequences of video streams. The proposed approach relies mainly on spatial abstractions of each object, mining frequent temporal patterns in a sequence of video frames to form a regular temporal pattern. In order to detect each object in every frame, the input video is first pre-processed by applying Gaussian Mixture Models. After the detection of foreground objects, the tracking is carried out using block motion estimation by the three-step search method. The primitive events of the object are represented by assigning spatial and temporal symbols corresponding to their location and time information. These primitive events are analyzed to form a temporal pattern in a sequence of video frames, representing temporal relation between various object's primitive events. This is repeated for each window of sequences, and the support for temporal sequence is obtained based on LC-STP to discover regular patterns of normal events. Events deviating from these patterns are identified as anomalies. Unlike the traditional frequent item set mining methods, the proposed method generates maximal frequent patterns without candidate generation. Furthermore, experimental results show that the proposed method performs well and can detect video anomalies in real traffic video data.

Link Scheduling Method Based on CAZAC Sequence for Device-to-Device Communication (D2D 통신 시스템을 위한 CAZAC 시퀀스 기반 링크 스케줄링 기법)

  • Kang, Wipil;Hwang, Won-Jun;Choi, Hyung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.4
    • /
    • pp.325-336
    • /
    • 2013
  • FlashLinQ, one of the typical D2D communication systems developed by Qualcomm, considers a single-tone communication based distributed channel-aware link scheduling method to realize the link scheduling process with low control overheads. However, considering the frequency selective fading effect of practical multi-path channel, the single-tone based SIR estimation causes a critical scheduling error problem because the received single-tone signal has quite different channel gain at each sub-carrier location. In order to overcome this problem, we propose a novel link scheduling method based on CAZAC (Constant Amplitude Zero Auto-Correlation) sequence for D2D communication system. In the proposed method, each link has a unique offset value set for the generation of CAZAC sequences. CAZAC sequences with the cyclic offsets are transmitted using multiple sub-blocks in the entire bandwidth, and then each device can obtain nearly full-band SIR using a good cyclic cross-correlation property of CAZAC sequence.