• Title/Summary/Keyword: key block

Search Result 695, Processing Time 0.033 seconds

Efficient Tracking of a Moving Object Using Representative Blocks Algorithm

  • Choi, Sung-Yug;Hur, Hwa-Ra;Lee, Jang-Myung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.678-681
    • /
    • 2004
  • In this paper, efficient tracking of a moving object using optimal representative blocks is implemented by a mobile robot with a pan-tilt camera. The key idea comes from the fact that when the image size of moving object is shrunk in an image frame according to the distance between the camera of mobile robot and the moving object, the tracking performance of a moving object can be improved by changing the size of representative blocks according to the object image size. Motion estimation using Edge Detection(ED) and Block-Matching Algorithm(BMA) is often used in the case of moving object tracking by vision sensors. However these methods often miss the real-time vision data since these schemes suffer from the heavy computational load. In this paper, the optimal representative block that can reduce a lot of data to be computed, is defined and optimized by changing the size of representative block according to the size of object in the image frame to improve the tracking performance. The proposed algorithm is verified experimentally by using a two degree-of-freedom active camera mounted on a mobile robot.

  • PDF

Chaotic Block Encryption Using a PLCM (PLCM을 이용한 카오스 블록 암호화)

  • Shin Jae-Ho;Lee Sung-Woo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.3 s.309
    • /
    • pp.10-19
    • /
    • 2006
  • In this paper, we propose 128-bit chaotic block encryption scheme using a PLCM(Piecewise Linear Chaotic Map) having a good dynamical property. The proposed scheme has a block size of 12n-bit and a key size of 125-bit. The encrypted code is generated from the output of PLCM. We show the proposed scheme is very secure against statistical attacks and have very good avalanche effect and randomness properties.

Neural Network Model-based Algorithm for Identifying Job Status in Block Assembly Shop for Shipbuilding (신경망 모델 기반 조선소 조립공장 작업상태 판별 알고리즘)

  • Hong, Seung-Taek;Choi, Jin-Young;Park, Sang-Chul
    • IE interfaces
    • /
    • v.24 no.3
    • /
    • pp.267-273
    • /
    • 2011
  • In the shipbuilding industry, since production processes are so complicated that the data collection for decision making cannot be fully automated, most of production planning and controls are based on the information provided only by field workers. Therefore, without sufficient information it is very difficult to manage the whole production process efficiently. Job status is one of the most important information used for evaluating the remaining processing time in production control, specifically, in block assembly shop. Currently, it is checked by a production manager manually and production planning is modified based on that information, which might cause a delay in production control, resulting in performance degradation. Motivated by these remarks, in this paper we propose an efficient algorithm for identifying job status in block assembly shop for shipbuilding. The algorithm is based on the multi-layer perceptron neural network model using two key factors for input parameters. We showed the superiority of the algorithm by using a numerical experiment, based on real data collected from block assembly shop.

Block-Centered Symmetric Motion Estimation for Side Information Generation in Distributed Video Coding (분산 비디오 부호화에서 보조정보 생성을 위한 블록중심 대칭형의 움직임 탐색 기법)

  • Lee, Chan-Hee;Kim, Jin-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.6
    • /
    • pp.35-42
    • /
    • 2010
  • Side information generation techniques play a great role in determining the overall performance of the DVC (Distributed Video Coding) coding system. Most conventional techniques for side information generation are mainly based on the block matching algorithm with symmetric motion estimation between the previously reconstructed key frames. But, these techniques tend to show mismatches between the motion vectors and the real placements of moving objects. So these techniques need to be modified so as to search well the real placements of moving objects. To overcome this problem, this paper proposes a block-centered symmetric motion estimation technique which uses the same coordinates with the given block. Through computer simulations, it is shown that the proposed algorithm outperforms the conventional schemes in the objective quality.

An Authenticated Encryption Scheme without Block Encryption Algorithms (블록 암호 알고리즘을 사용하지 않는 인증 암호화 방법)

  • Lee, Mun-Kyu;Kim, Dong-Kyue;Park, Kunsun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.5
    • /
    • pp.284-290
    • /
    • 2002
  • We propose a new authenticated encryption scheme that does not require any block encryption algorithm. Our scheme is based on the Horster-Michels-Petersen authenticated encryption scheme, and it uses a technique in the Bae~Deng signcryption scheme so that the sender's signature can be verified by an arbitrary third party. Since our scheme does not use any block encryption algorithm, we can reduce the code size in its implementation. The computation and communication costs of the proposed scheme are almost the same as those of the Bao-Deng scheme that uses a block encryption algorithm. Our scheme also satisfies all the security properties such as confidentiality, authenticity and nonrepudiation.

Block Cipher Circuit and Protocol for RFID in UHF Band (UHF 대역 RFID 시스템을 위한 블록 암호 회로와 프로토콜)

  • Lee, Sang-Jin;Park, Kyung-Chang;Kim, Han-Byeo-Ri;Kim, Seung-Youl;You, Young-Gap
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.11
    • /
    • pp.74-79
    • /
    • 2009
  • This paper proposes a hardware structure and associated finite state machine designs sharing key scheduling circuitry to enhance the performance of the block cypher algorithm, HIGHT. It also introduces an efficient protocol applicable to RFID systems comprising the HIGHT block cipher algorithm. The new HIGHT structure occupies an area size small enough to accommodate tag applications. The structure yields twice higher performance them conventional HIGHT algorithms. The proposed protocol overcomes the security vulnerability of RFID tags and thereby strengthens the security of personal information.

A VLSI DESIGN OF CD SIGNAL PROCESSOR for High-Speed CD-ROM

  • Kim, Jae-Won;Kim, Jae-Seok;Lee, Jaeshin
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1296-1299
    • /
    • 2002
  • We implemented a CD signal processor operated on a CAV 48-speed CD-ROM drive into a VLSI. The CD signal processor is a mixed mode monolithic IC including servo-processor, data recovery, data-processor, and I-bit DAC. For servo signal processing, we included a DSP core, while, for CAV mode playback, we adopted a PLL with a wide recovery range. Data processor (DP) was designed to meet the yellow book specification.[2]So, the DP block consists of EFM demodulator, C1/C2 ECC block, audio processor and a block transferring data to an ATAPI chip. A modified Euclid's algorithm was used as a key equation solver for the ECC block To achieve the high-speed decoding, the RS decoder is operated by a pipelined method. Audio playability is increased by playing a CD-DA disc at the speed of 12X or 16X. For this, subcode sync and data are processed in the same way as main data processing. The overall performance of IC is verified by measuring a transfer rate from the innermost area of disc to the outermost area. At 48-speed, the operating frequency is 210 ㎒, and this chip is fabricated by 0.35 um STD90 cell library of Samsung Electronics.

  • PDF

256 bit Symmetric SPN Block cipher XSB (256 비트 대칭 SPN 블록 암호 XSB)

  • Cho, Gyeong-Yeon
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.3
    • /
    • pp.9-17
    • /
    • 2012
  • In this paper, we propose a SPN 256 bit block cipher so called XSB(eXtended SPN Block cipher) which has a symmetric structure in encryption and decryption. The proposed XSB is composed of the even numbers of N rounds where the first half of them, 1 to N/2-1 round, applies a pre-function and the last half of them, N/2+1 to N round, employs a post-function. Each round consists of a round key addition layer, a substiution layer, a byte exchange layer and a diffusion layer. And a symmetry layer is located in between the pre-function layer and the post-function layer. The symmetric layer is composed with a multiple simple bit slice involution S-Boxes. The bit slice involution S-Box symmetric layer increases difficult to attack cipher by Square attack, Boomerang attack, Impossible differentials cryptanalysis etc.

SPCBC: A Secure Parallel Cipher Block Chaining Mode of Operation based on logistic Chaotic Map

  • El-Semary, Aly M.;Azim, Mohamed Mostafa A.;Diab, Hossam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.7
    • /
    • pp.3608-3628
    • /
    • 2017
  • Several block cipher modes of operation have been proposed in the literature to protect sensitive information. However, different security analysis models have been presented for attacking them. The analysis indicated that most of the current modes of operation are vulnerable to several attacks such as known plaintext and chosen plaintext/cipher-text attacks. Therefore, this paper proposes a secure block cipher mode of operation to thwart such attacks. In general, the proposed mode combines one-time chain keys with each plaintext before its encryption. The challenge of the proposed mode is the generation of the chain keys. The proposed mode employs the logistic map together with a nonce to dynamically generate a unique set of chain keys for every plaintext. Utilizing the logistic map assures the dynamic behavior while employing the nonce guarantees the uniqueness of the chain keys even if the same message is encrypted again. In this way, the proposed mode called SPCBC can resist the most powerful attacks including the known plaintext and chosen plaintext/cipher-text attacks. In addition, the SPCBC mode improves encryption time performance through supporting parallelized implementation. Finally, the security analysis and experimental results demonstrate that the proposed mode is robust compared to the current modes of operation.

A Selective Motion Estimation Algorithm with Variable Block Sizes (다양한 블록 크기 기반 선택적 움직임 추정 알고리즘)

  • 최웅일;전병우
    • Journal of Broadcast Engineering
    • /
    • v.7 no.4
    • /
    • pp.317-326
    • /
    • 2002
  • The adaptive coding schemes in H.264 standardization provide a significant ceding efficiency and some additional features like error resilience and network friendliness. The variable block size motion compensation using multiple reference frames is one of the key H.264 coding elements to provide main performance gain, but also the main culprit that increases the overall computational complexity. For this reason, this paper proposes a selective motion estimation algorithm based on variable block size for fast motion estimation in H.264. After we find the SAD(Sum of Absolute Difference) at initial points using diamond search, we decide whether to perform additional motion search in each block. Simulation results show that the proposed method is five times faster than the conventional full search in case of search range $\pm$32.