• Title/Summary/Keyword: 기준 블록

Search Result 519, Processing Time 0.027 seconds

Robust Blind Watermarking using DCT Texture Block Coefficient (DCT 질감 블록 계수를 이용한 강인한 블라인드 워터마킹)

  • Shin, Yong-Dal;Park, Kyung-Nam
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.13 no.4
    • /
    • pp.108-114
    • /
    • 2008
  • In this paper, we proposed robust blind watermarking algorithm using texture block coefficient based on discrete cosine transform(DCT). The proposed method embedded all of watermark signals into DC component of $8\times8$ block DCT in order to robust various external attack The texture block coefficient was composed absolute value of DCT coefficients. Experiment showed that the proposed method better than conventional methods in the invisibility and various attack such as dithering, cropping, and scaling.

  • PDF

Simulation-driven Performance Estimation of Software Function Blocks for System Level Design (시스템 레벨 설계를 위한 소프트웨어 기능 블록의 시뮬레이션 기반 성능 예측 방법)

  • 권성남;오현옥;하순회
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10c
    • /
    • pp.385-387
    • /
    • 2002
  • 이 논문에서 우리는 각 기능 블록의 성능 분석 방법을 제안하고 어떻게 하드웨어와 소프트웨어의 합성을 위한 기능 블록의 성능을 기록한 데이터베이스를 구축하는지를 설명하겠다. 기능 블록의 성능을 예측하는 것은 초기 설계 단계에서 주어진 제약을 만족시키기 위해 어떤 기능 블록이 개선되어야 할지 결정하는 기준을 제시하기 때문에 내장형 시스템의 합성에 있어서 중요하다. 예측하는 도구로 측정에 시간이 많이 걸리지만 정확한 명령어 수준 시뮬레이터(ISS : instruction set simulator)를 사용하였다. 데이터베이스를 구축하는데 있어선 각 기능 블록을 요소(factor)라 부르는 다른 상태를 두어서 차별화 하였다. 제안한 예측 방법은 개발중인 통합설계 환경에 구현되었으며 H.263 인코더에 적용하여 0.03% 이내의 오차를 얻었다.

  • PDF

Study on the Priority of Blockchain Adoption to Railway System through AHP Method (AHP를 이용한 블록체인 철도분야 적용 우선도에 대한 연구)

  • Han, Sumin;Won, Jongwun;Chang, Tai-Woo;Lee, Seok
    • The Journal of Society for e-Business Studies
    • /
    • v.25 no.4
    • /
    • pp.111-124
    • /
    • 2020
  • Blockchain was proposed in 2007 and began to be applied to actual services soon afterward. The railway system covers railroad construction and railway services. Because of the public characteristics of the railway system, it is expected that significant advantages can be obtained through the introduction of blockchain. Many benefits can be gained by applying the blockchain to them, but it is impossible to apply the blockchain to every part immediately due to the limitations of time and resources. Therefore, it is necessary to derive services or functions to which the blockchain will be applied and to select the part of them first. Since there are various evaluation criteria to derive the priority of blockchain adoption, systematic consideration is required. In this study, AHP was applied to calculate weights for evaluation criteria and systematical evaluation. Through the results of this study, it is expected that it is possible to build a roadmap for a next-generation railway system.

A study on the Fast Block Mode Decision Algorithm for Inter Block (Inter 블록을 위한 고속 블록 모드 결정 알고리즘에 관한 연구)

  • 김용욱;허도근
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.6
    • /
    • pp.1121-1125
    • /
    • 2004
  • This paper is studied the fast block mode decision algorithm for H.264/AVC. The fast block mode decision algorithm is consist of block range decision and merge algorithm. The block range decision algorithm classifies the block over 8$\times$8 size or below for 16$\times$16 macroblock to decide the size and type of sub blocks. The block over 8$\times$8 size is divided into the blocks of 16$\times$8, 8$\times$16 and 16$\times$16 size using merging algorithm which is considered MVD(motion vector difference) of 8$\times$8 block. The sub block range decision reduces encoding arithmetic amount by 48.25% on the average more than the case not using block range decision.

Accuracy Analysis of Aerial Triangulation using UltraCamX which is Airborne Digital Camera (항공디지털카메라 UltraCamX의 사진기준점 정확도 분석)

  • Lee, Jae-One;Na, Jong-Gi;Jung, Chang-Sik;Bae, Kyoung-Ho
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.27 no.2
    • /
    • pp.177-186
    • /
    • 2009
  • Nowadays, as going to information society based knowledge, the informations are acquired, processed, serviced based digital environment. In surveying field, the trend have been changed from the analog foundation to the digital foundation. Also, aerial photogrammetry is being changed from analog aerial photogrammetry to digital aerial photogrammetry. In this paper, the analysis of accuracy is performed for the comparison of traditional aerial photogrammetry with digital aerial photogrammetry usign UltracamX in AT and Block Adjustment. As the results, Bundle adjustment in digital aerial photogrammetry with GPS/INS have more advantages than traditional independent adjustment in analog aerial photogrammetry. Digital aerial photogrammetry contributes the higher accuracy in AT and block adjustment more than analog aerial photogrammetry.

Estimating Motion Information Using Multiple Features (다중 특징을 이용한 동작정보 측정)

  • Jang Seok-Woo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.2 s.34
    • /
    • pp.1-10
    • /
    • 2005
  • In this Paper, we propose a new block matching a1gorithm that extracts motion vectors from consecutive range data. The proposed method defines a matching metric that integrates intensity, hue, and range. Our algorithm begins matching with a small matching template. If the matching degree is not good enough, we slightly expand the size of a matching template and then repeat the matching process until our matching criterion is satisfied or the predetermined maximum size has been reached. As the iteration proceeds, we adaptively adjust weights of the matching metric by considering the importance of each feature. In the experiments, we show that our block matching approach can work as a promising solution by comparing the proposed method with previously known method in terms of performance.

  • PDF

Fast Variable-size Block Matching Algorithm for Motion Estimation Based on Bit-pattern (비트패턴을 기반으로 한 고속의 적응적 가변 블록 움직임 예측 알고리즘)

  • 신동식;안재형
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.4
    • /
    • pp.372-379
    • /
    • 2000
  • In this paper, we propose a fast variable-size block matching algorithm for motion estimation based on bit-pattern. Motion estimation in the proposed algorithm is performed after the representation of image sequence is transformed 8bit pixel values into 1bit ones depending on the mean value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating an unnecessary searching of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides better performance-0.5dB PSNR improvement-than full search block matching algorithm with a fixed block size.

  • PDF

A Study on the Flow Resistance Characteristics with Bank Revetment Materials (호안 재료에 따른 흐름저항 특성 연구)

  • Yoo, Gyu-Seok;Kim, Yun-Hwan;Kim, Chul
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2011.05a
    • /
    • pp.328-333
    • /
    • 2011
  • 최근 하천사업에는 자연친화적인 설계기법이 도입되고 있으며 호안공법도 과거 제방보호 기능만을 가진 단순한 호안에서 식생을 활용한 다양한 종류의 호안공법이 개발되어서 각종 하천공사에 도입되고 있다. 그러나 호안공법을 도입할 때 공법에 따른 선택기준이나 구체적인 설계기준이 현재 사용되고 있는 지침에 제시 되어있지 않은 실정이다. 이에 본 연구에서는 호안 재료의 적합성에 대한 객관적이고 정량적인 판단기준인 수리학적 특성인자를 파악해보고자 수리모형실험을 수행하였다. 실험은 길이 15m, 폭 0.8m, 높이 0.8m의 수로를 이용하였다. 사용한 호안재료는 흙, 실제모형의 1/50의 축척으로 제작한 호안블록모형과 실제 식생으로서 잔디를 이용하였다. 수로의 상류구간에 대리석을 이용하여 6m의 안정화구간을 만들었고, 실험은 동일한 수위에 유량을 변화시키면서 유속을 계측하였다. 계측 내용을 분석한 결과 식생과 무식생을 비교했을 때 하상에서 식생높이(약 9cm) 범위에서 식생이 최대 97% 유속저감효과를 나타났으며, 식생과 블록을 비교한 결과도 하상에서 식생높이(약 9cm) 범위에서 식생이 최대 97% 유속저감효과를 나타낸 것을 확인할 수 있었다. 이는 호안재료가 식생일 때 유속저감효과가 크게 나타남을 알 수 있었고 향후 다양한 식생형태에 대한 실험이 필요할 것으로 보이며, 본 연구가 호안공법에 도입되는 다양한 식생의 수리적인 특성인자를 규명하는데 도움이 될 것으로 판단된다.

  • PDF

Fast Block Matching Algorithm Using The Distribution of Mean Absolute Difference at The Search Region Overlapped with Neighbor Blocks and Subsampling (이웃 블록과 중첩된 탐색영역에서의 MAD 분포 및 부표본화를 이용한 고속 블록 정합)

  • 이법기;정원식;이경환;최정현;김경규;김덕규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.8B
    • /
    • pp.1506-1517
    • /
    • 1999
  • In this paper, we propose two fast block matching algorithm using the distribution of mean absolute difference (MAD) at the search region overlapped with neighbor blocks and pixel subsapmling. The proposed methods use the lower and upper bound of MAD at the overlapped search region which is calculated from the MAD of neighbor block at that search position and MAD between the current block and neighbor block. In the first algorithm, we can reduce the computational complexity by executing the block matching operation at the only necessary search points. That points are selected using the lower bound of MAD. In the second algorithm, we use the statictical distribution of actual MAD which exists between the lower bound and upper bound of MAD. By using the statistical distribution of actual MAD, we can significantly reduce the computational complexity for motion estimation. after striking space key 2 times.

  • PDF

Texture Coding in MPEG-4 Using Modified Boundary Block Merging Technique (변형된 경제 블록 병합 기법을 이용한 MPEG-4의 텍스처 부호화)

  • 김두석;고형화
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4B
    • /
    • pp.725-733
    • /
    • 2000
  • In this paper, we propose a modified boundary block merging technique for the texture coding of MPEG-4. We propose an ORP(Optimized Region Partitioning) method that partition the VOP-based reference position to minimize the number of coding blocks. The merging possibility is improved by adding +90。and -90。 Rotation merging. We propose a MRM(Multiple Rotation Merging) method which applies the rotation merging in the order of 180。, +90。and -90。. If a pair of boundary blocks has low correlation, existing BBM's padding technique is not efficient. Our padding after merging method gives better result even if it has low correlation. The proposed method showed 5 ~8(%) coding bit reduction at the same PSNR values compared to BBM method.

  • PDF