• 제목/요약/키워드: High-capacity data

검색결과 1,316건 처리시간 0.03초

비밀데이터의 패턴정보에 기반한 새로운 정보은닉 기법 (A New Information Data Hiding Scheme based on Pattern Information of Secret Data)

  • 김기종;신상호;유기영
    • 한국멀티미디어학회논문지
    • /
    • 제15권4호
    • /
    • pp.526-539
    • /
    • 2012
  • 현재까지 연구된 대부분의 정보은닉 기법관련 알고리듬들은 커버영상(cover image)의 변경 또는 조작을 통해 비밀데이터를 삽입(embedding)하여 스테고영상(stego image)을 생성하고, 생성된 스테고영상으로부터 비밀데이터를 추출(extraction)하였다. 이러한 알고리듬은 PSNR의 수치가 높고, 비밀데이터의 수용량(capacity)이 많을수록 좋은 것으로 간주한다. 본 논문에서는 비밀데이터의 패턴(pattern)을 분석하여 숨기는 비밀데이터의 양이 많고, PSNR의 값이 우수한 효율적인 정보은닉 알고리듬을 제안한다. 제안하는 정보은닉 알고리듬은 비밀데이터를 분석하여 비밀데이터 내의 빈도수가 높은 값들을 찾고, 이들의 좌표 값과 인덱스(index)정보를 이용해 커버영상에 삽입한다. 이를 통해 커버영상과 스테고영상 간의 차이는 줄이면서 기존의 제안되었던 알고리듬에 비해 높은 수용량을 보여줌을 실험을 통해 비교한다. 실험결과에서는 5 종류의 비밀 데이터와 8 가지 이하의 패턴을 이용해 커버영상에 삽입하여 생성된 스테고영상과의 차이를 측정한 PSNR과 숨겨진 비밀데이터의 양의 결과를 통해 기존에 제안되었던 알고리듬들 비해 제안하는 정보은닉 알고리듬이 우수함을 보여준다.

고속다기통 및 회전식 압축기의 체적효율 (A STUDY ON THE VOLUMETRIC EFFICIENCY OF HIGH SPEED MULTI-CYLINDER AND ROTARY COMPRESSOR)

  • 오후규;조권옥
    • 한국수산과학회지
    • /
    • 제12권1호
    • /
    • pp.13-18
    • /
    • 1979
  • Volumetric efficiency is a determining factor for tile measurement of compessor capacity, but it is practically hard to take an accurate measurement of capacity characteritics so that most of users trust the data of makers catalogue. We often realized the discrepancy in their data with actual capacity. This study was attemped to establish the basic data of capacity characteristics of compressor by measuring volumetric efficiency of high speed multi-cylinder compressor and rotary compressor. The volumetric efficiency was calculated based on the quantity of the flow of ammonia vapor and pressure difference in suction state of orifice plate and compressor. The volumetric efficiency of high speed multi-cylinder compressor was $37-61\%$ and that of rotary compressor was $57-82\%$ when compression ratio was in the range of 4-12. The discrepancy in volumetric efficiency at an equal evaporating temperature between the makers catalogue and the measured data was $5.5\%$.

  • PDF

Prediction of ultimate load capacity of concrete-filled steel tube columns using multivariate adaptive regression splines (MARS)

  • Avci-Karatas, Cigdem
    • Steel and Composite Structures
    • /
    • 제33권4호
    • /
    • pp.583-594
    • /
    • 2019
  • In the areas highly exposed to earthquakes, concrete-filled steel tube columns (CFSTCs) are known to provide superior structural aspects such as (i) high strength for good seismic performance (ii) high ductility (iii) enhanced energy absorption (iv) confining pressure to concrete, (v) high section modulus, etc. Numerous studies were reported on behavior of CFSTCs under axial compression loadings. This paper presents an analytical model to predict ultimate load capacity of CFSTCs with circular sections under axial load by using multivariate adaptive regression splines (MARS). MARS is a nonlinear and non-parametric regression methodology. After careful study of literature, 150 comprehensive experimental data presented in the previous studies were examined to prepare a data set and the dependent variables such as geometrical and mechanical properties of circular CFST system have been identified. Basically, MARS model establishes a relation between predictors and dependent variables. Separate regression lines can be formed through the concept of divide and conquers strategy. About 70% of the consolidated data has been used for development of model and the rest of the data has been used for validation of the model. Proper care has been taken such that the input data consists of all ranges of variables. From the studies, it is noted that the predicted ultimate axial load capacity of CFSTCs is found to match with the corresponding experimental observations of literature.

A Study on the Usages of DDS Middleware for Efficient Data Transmission and Reception

  • Jeong, Yeongwook
    • 한국컴퓨터정보학회논문지
    • /
    • 제23권11호
    • /
    • pp.59-66
    • /
    • 2018
  • Data Distribution Service(DDS) provides the communications service programmers need to distribute time-critical data between embedded and/or enterprise devices or nodes. In this paper, I propose efficient methods for transmitting and receiving messages of various characteristics in real-time using DDS middleware. For high-frequency characteristic data, I describe several DDS packet types and various default and extended DDS QoS policies. In particular, the batching method is probably the best solution when considering several performance aspects. For large-capacity characteristic data. I will show a method using extended DDS QoS policies, a segmentation and reassembly method, and transmitting and receiving a large-capacity data with low priority method considering network conditions. Finally, I simulate and compare the result of performance for each methods. This results will help determine efficient methods for transmitting and receiving messages of various characteristics using DDS middleware.

High-Capacity and Robust Watermarking Scheme for Small-Scale Vector Data

  • Tong, Deyu;Zhu, Changqing;Ren, Na;Shi, Wenzhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권12호
    • /
    • pp.6190-6213
    • /
    • 2019
  • For small-scale vector data, restrictions on watermark scheme capacity and robustness limit the use of copyright protection. A watermarking scheme based on robust geometric features and capacity maximization strategy that simultaneously improves capacity and robustness is presented in this paper. The distance ratio and angle of adjacent vertices are chosen as the watermark domain due to their resistance to vertex and geometric attacks. Regarding watermark embedding and extraction, a capacity-improved strategy based on quantization index modulation, which divides more intervals to carry sufficient watermark bits, is proposed. By considering the error tolerance of the vector map and the numerical accuracy, the optimization of the capacity-improved strategy is studied to maximize the embedded watermark bits for each vertex. The experimental results demonstrated that the map distortion caused by watermarks is small and much lower than the map tolerance. Additionally, the proposed scheme can embed a copyright image of 1024 bits into vector data of 150 vertices, which reaches capacity at approximately 14 bits/vertex, and shows prominent robustness against vertex and geometric attacks for small-scale vector data.

실험적 용량산정 방법 비교 연구 (Comparing Empirical Methods of Highway Capacity Estimation)

  • 문재필;조원범
    • 한국도로학회논문집
    • /
    • 제16권1호
    • /
    • pp.57-62
    • /
    • 2014
  • PURPOSES : Capacity is a main factor of determining the number of lane in highway design or the level of service in road on operation. Previous studies showed that breakdown may occur before capacity is reached, and then it was concluded that capacity is a stochastic value rather than a deterministic one. In general, estimating capacity is based on average over maximum traffic volume observed for capacity state. This method includes the empirical distribution method(EDM) and would underestimate capacity. This study estimated existing empirical methods of estimating stochastic highway capacity. Among the studied methods are the product limit method(PLM) and the selected method(SM). METHODS : Speed and volume data were collected at three freeway bottleneck sites in Cheonan-Nonsan and West Sea Freeway. The data were grouped into a free-flow state or capacity state with speeds observed in the bottlenecks and the upstream. The data were applied to the empirical methods. RESULTS : The results show that the PLM and SM estimated capacity higher than EDM. The reason is that while the EDM is based on capacity observations only, the PLM and SM are based on free-flow high volumes and capacity observations. CONCLUSIONS : The PLM and SM using both free-flow and capacity observations would be improved to enhance the reliability of the capacity estimation.

픽셀값 모듈러 연산을 이용한 자료은닉 기법 (Data Hiding Using Pixel-Value Modular Operation)

  • 변진용;김평한;이준호;정기현;유기영
    • 한국멀티미디어학회논문지
    • /
    • 제18권4호
    • /
    • pp.483-491
    • /
    • 2015
  • Data hiding is one of protective methods that can authenticate the completeness of digital information and protect intelligent property rights and copyright through secret communications. In this paper, we propose a data hiding method using pixel-value modular operation that has a high capacity while maintaining a good visual quality. The proposed method can embed secret data on the every pixel of a cover image by modular operation. The experiment results demonstrate that the proposed method has a high capacity and good visual quality where the embedding capacity is 91,138 bytes, the PSNR is 47.94dB, and the Q index is 0.968.

Subclustering을 이용한 홀로그래픽 디지털 정보저장 시스템의 이진 데이터 에러 보정기 구현 (Design Error Corrector of Binary Data in Holographic Digital Data Storage System Using Subclustering)

  • 김상훈;김장현;양현석;박영필
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
    • /
    • pp.617-619
    • /
    • 2004
  • Data storage related with writing and retrieving requires high storage capacity, fast transfer rate and less access time in. Today any data storage system can not satisfy these conditions, but holographic data storage system can perform faster data transfer rate because it is a page oriented memory system using volume hologram in writing and retrieving data. System architecture without mechanical actuating part is possible, so fast data transfer rate and high storage capacity about $1Tb/cm^3$ can be realized. In this paper, to correct errors of binary data stored in holographic digital data storage system, find cluster centers using subtractive clustering and reduce intensities of pixels around centers, so the intensify profile of data rare will be uniform and the better data storage system can be realized.

  • PDF

서브클러스터링을 이용한 홀로그래픽 정보저장 시스템의 비트 에러 보정 기법 (Bit Error Reduction for Holographic Data Storage System Using Subclustering)

  • 김상훈;양현석;박영필
    • 정보저장시스템학회논문집
    • /
    • 제6권1호
    • /
    • pp.31-36
    • /
    • 2010
  • Data storage related with writing and retrieving requires high storage capacity, fast transfer rate and less access time. Today any data storage system cannot satisfy these conditions, however holographic data storage system can perform faster data transfer rate because it is a page oriented memory system using volume hologram in writing and retrieving data. System can be constructed without mechanical actuating part so fast data transfer rate and high storage capacity about 1Tb/cm3 can be realized. In this research, to correct errors of binary data stored in holographic data storage system, a new method for reduction errors is suggested. First, find cluster centers using subtractive clustering algorithm then reduce intensities of pixels around cluster centers. By using this error reduction method following results are obtained ; the effect of Inter Pixel Interference noise in the holographic data storage system is decreased and the intensity profile of data page becomes uniform therefore the better data storage system can be constructed.

Design and Comparison of Error Correctors Using Clustering in Holographic Data Storage System

  • Kim, Sang-Hoon;Kim, Jang-Hyun;Yang, Hyun-Seok;Park, Young-Pil
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.1076-1079
    • /
    • 2005
  • Data storage related with writing and retrieving requires high storage capacity, fast transfer rate and less access time in. Today any data storage system can not satisfy these conditions, but holographic data storage system can perform faster data transfer rate because it is a page oriented memory system using volume hologram in writing and retrieving data. System architecture without mechanical actuating part is possible, so fast data transfer rate and high storage capacity about 1Tb/cm3 can be realized. In this paper, to correct errors of binary data stored in holographic digital data storage system, find cluster centers using clustering algorithm and reduce intensities of pixels around centers. We archive the procedure by two algorithms of C-mean and subtractive clustering, and compare the results of the two algorithms. By using proper clustering algorithm, the intensity profile of data page will be uniform and the better data storage system can be realized.

  • PDF