• Title/Summary/Keyword: 블록 기반 방법

Search Result 1,132, Processing Time 0.025 seconds

A Hierarchical Image Mosaicing using Camera and Object Parameters for Efficient Video Database Construction (효율적인 비디오 데이터베이스 구축을 위해 카메라와 객체 파라미터를 이용한 계층형 영상 모자이크)

  • 신성윤;이양원
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.2
    • /
    • pp.167-175
    • /
    • 2002
  • Image Mosaicing creates a new image by composing video frames or still images that are related, and performed by arrangement, composition and redundancy analysis of images. This paper proposes a hierarchical image mosaicing system using camera and object parameters far efficient video database construction. A tree-based image mosiacing has implemented for high-speed computation time and for construction of static and dynamic image mosaic. Camera parameters are measured by using least sum of squared difference and affine model. Dynamic object detection algorithm has proposed for extracting dynamic objects. For object extraction, difference image, macro block, region splitting and 4-split detection methods are proposed and used. Also, a dynamic positioning method is used for presenting dynamic objects and a blurring method is used for creating flexible mosaic image.

  • PDF

Real-Time Virtual-View Image Synthesis Algorithm Using Kinect Camera (키넥트 카메라를 이용한 실시간 가상 시점 영상 생성 기법)

  • Lee, Gyu-Cheol;Yoo, Jisang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.5
    • /
    • pp.409-419
    • /
    • 2013
  • Kinect released by Microsoft in November 2010 is a motion sensing camera in xbox360 and gives depth and color images. However, Kinect camera also generates holes and noise around object boundaries in the obtained images because it uses infrared pattern. Also, boundary flickering phenomenon occurs. Therefore, we propose a real-time virtual-view video synthesis algorithm which results in a high-quality virtual view by solving these problems. In the proposed algorithm, holes around the boundary are filled by using the joint bilateral filter. Color image is converted into intensity image and then flickering pixels are searched by analyzing the variation of intensity and depth images. Finally, boundary flickering phenomenon can be reduced by converting values of flickering pixels into the maximum pixel value of a previous depth image and virtual views are generated by applying 3D warping technique. Holes existing on regions that are not part of occlusion region are also filled with a center pixel value of the highest reliability block after the final block reliability is calculated by using a block based gradient searching algorithm with block reliability. The experimental results show that the proposed algorithm generated the virtual view image in real-time.

Method to control the Sizes of the Nanopatterns Using Block Copolymer (블록 공중합체를 이용한 나노패턴의 크기제어방법)

  • Kang, Gil-Bum;Kim, Seong-Il;Han, Il-Ki
    • Journal of the Korean Vacuum Society
    • /
    • v.16 no.5
    • /
    • pp.366-370
    • /
    • 2007
  • Nano-scopic holes which are distributed densely and uniformly were fabricated on $SiO_2$ surface. Self-assembling resists were used to produce a layer of uniformly distributed parallel poly methyl methacrylate (PMMA) cylinders in a polystyrene (PS) matrix. The PMMA cylinders were degraded and removed by acetic acid rinsing. Subsequently, PS nanotemplates were fabricated. The patterned holes of PS template were approximately $8{\sim}30\;nm$ wide, 40 nm deep, and 60 nm apart. The porous PS template was used as a dry etching mask to transfer the pattern of PS template into the silicon oxide thin film during reactive ion etching (RIE) process. The sizes of the patterned holes on $SiO_2$ layer were $9{\sim}33\;nm$. After pattern transfer by RIE, uniformly distributed holes of which size were in the range of $6{\sim}22\;nm$ were fabricated on Si substrate. Sizes of the patterned holes were controllable by PMMA molecular weight.

Half-Pixel Accuracy Motion Estimation Algorithm in the Transform Domain for H.264 (H.264를 위한 주파수 영역에서의 반화소 정밀도 움직임 예측 알고리듬)

  • Kang, Min-Jung;Heo, Jae-Seong;Ryu, Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11C
    • /
    • pp.917-924
    • /
    • 2008
  • Motion estimation and compensation in the spatial domain check the searching area of specified size in the previous frame and search block to minimize the difference with current block. When we check the searching area, it consumes the most encoding times due to increasing the complexity. We can solve this fault by means of motion estimation using shifting matrix in the transform domain instead of the spatial domain. We derive so the existed shifting matrix to a new recursion equation that we decrease more computations. We modify simply vertical shifting matrix and horizontal shifting matrix in the transform domain for motion estimation of half-pixel accuracy. So, we solve increasing computation due to bilinear interpolation in the spatial domain. Simulation results prove that motion estimation by the proposed algorithm in DCT-based transform domain provides higher PSNR using fewer bits than results in the spatial domain.

3D Point Clouds Encryption Method and Analysis of Encryption Ratio in Holographic Reconstruction Image (3D 공간정보 암호화 기법과 홀로그래픽 복원영상의 암호화 효율 분석)

  • Choi, Hyun-Jun;Seo, Young-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.9
    • /
    • pp.1703-1710
    • /
    • 2017
  • This paper propose a 3D point clouds (depth) security technique for digital holographic display service. Image contents encryption is a method to provide only authorized right owners with the original image information by encrypting the entire image or a part of the image. The proposed method detected an edge from a depth and performed quad tree decomposition, and then performed encryption. And encrypts the most significant block among the divided blocks. The encryption effect was evaluated numerically and visually. The experimental results showed that encrypting only 0.43% of the entire data was enough to hide the constants of the original depth. By analyzing the encryption amount and the visual characteristics, we verified a relationship between the threshold for detecting an edge-map. As the threshold for detecting an edge increased, the encryption ratio decreased with respect to the encryption amount.

The Effects of Writing to Describe using Block-based Programming on Computational Thinking and Writing Skills (블록 기반 프로그래밍을 활용한 묘사적 글쓰기가 컴퓨팅사고력과 글쓰기 능력에 미치는 영향)

  • Seo, Hyunseok;Jeong, Youngsik
    • Journal of The Korean Association of Information Education
    • /
    • v.23 no.6
    • /
    • pp.665-674
    • /
    • 2019
  • To determine the educational effects of writing to describe using Entry, block-based programming language, we instructed first year students at the national university of education on these activities for four weeks and analyzed the changes in their writing perception and attitude, ability of descriptive writing, computational thinking and learner's competencies. As a result, writing to describe using Entry did not affect students' writing perception and attitude change. However, the experimented students who wrote to describe using Entry became acquainted with the way of writing to describe, and improved their ability to describe objects. In addition, the computational thinking and critical thinking improved. Based on these results, it is hopped to be used as a basic material for expanding the education of descriptive writing using programming languages.

Design of Cryptographic Processor for Rijndael Algorithm (Rijndael 암호 알고리즘을 구현한 암호 프로세서의 설계)

  • 전신우;정용진;권오준
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.11 no.6
    • /
    • pp.77-87
    • /
    • 2001
  • This paper describes a design of cryptographic processor that implements the Rijndael cipher algorithm, the Advanced Encryption Standard algorithm. It can execute both encryption and decryption, and supports only 128-bit block and 128-bit keys. As the processor is implemented only one round, it must iterate 11 times to perform an encryption/decryption. We implemented the ByteSub and InvByteSub transformation using the algorithm for minimizing the increase of area which is caused by different encryption and decryption. It could reduce the memory size by half than implementing, with only ROM. We estimate that the cryptographic processor consists of about 15,000 gates, 32K-bit ROM and 1408-bit RAM, and has a throughput of 1.28 Gbps at 110 MHz clock based on Samsung 0.5um CMOS standard cell library. To our knowledge, this offers more reduced memory size compared to previously reported implementations with the same performance.

Secure Steganography Using a Block Cipher (블록 암호를 이용한 안전한 심층 암호)

  • 유정재;김종현;박종혁;양우일;이상진
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.13 no.3
    • /
    • pp.1-15
    • /
    • 2003
  • ${Cachin}^{[1]}$ defined the security of steganography theoretically at first, then ${Katzenbeisser}^{[2]}$ and ${Hopper}^{[3]}$ also discussed it on the different aspects. Unfortunately, because many steganographic systems couldnt overcome the statistical gap between a stego-cover and a pure cover, the secure steganography hasn' been evaluated yet. By the effectivel steganalysis algorithm, statistical test which was suggested by Westfel $d^{[4]}$, the attacker Wendy could select the stego-covers out of suspicious covers. Our newly developed algorithm which minimizes the changes of a pure cover by using the block cipher withstands a statistical test and has a similar embedding capacity in comparison with a simple LSB substitution steganography.

Benchmarking Korean Block Ciphers on 32-Bit RISC-V Processor (32-bit RISC-V 프로세서에서 국산 블록 암호 성능 밴치마킹)

  • Kwak, YuJin;Kim, YoungBeom;Seo, Seog Chung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.31 no.3
    • /
    • pp.331-340
    • /
    • 2021
  • As the communication industry develops, the development of SoC (System on Chip) is increasing. Accordingly, the paradigm of technology design of industries and companies is changing. In the existing process, companies purchased micro-architecture, but now they purchase ISA (Instruction Set Architecture), and companies design the architecture themselves. RISC-V is an open instruction set based on a reduced instruction set computer. RISC-V is equipped with ISA, which can be expanded through modularization, and an expanded version of ISA is currently being developed through the support of global companies. In this paper, we present benchmarking frameworks ARIA, LEA, and PIPO of Korean block ciphers in RISC-V. We propose implementation methods and discuss performance by utilizing the basic instruction set and features of RISC-V.

A study on the application of blockchain technology to prevent duplicate supply and demand of similar welfare services (복지서비스 유사사업의 중복수급 방지를 위한 블록체인 기술 적용 연구)

  • Min, Youn A
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.6
    • /
    • pp.151-156
    • /
    • 2020
  • Various institutions provide various welfare-related services, and accordingly, the quantity and quality of welfare-related services are improved. Along with the improvement of welfare services, the rate of fraudulent and redundant supply and demand due to inappropriate applicants is also increasing. In particular, in the case of similarly promoted projects by various institutions, confirmation of duplicate applications may be insufficient due to system inconsistency between institutions and delays in qualification verification, which may result in duplicate supply and demand. In this paper, in order to prevent the redundant supply and demand related to welfare service similar projects in various institutions, the problem of data management and sharing between institutions was reviewed and a method of applying blockchain technology was proposed step by step. Through the proposal of this paper, transparent data management of recipients is possible, and through this, trust-based welfare benefit management will be possible.