• 제목/요약/키워드: strong embedding

검색결과 25건 처리시간 0.023초

A Two-Layer Steganography for Mosaic Images

  • Horng, Ji-Hwei;Chang, Chin-Chen;Sun, Kun-Sheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제15권9호
    • /
    • pp.3298-3321
    • /
    • 2021
  • A lot of data hiding schemes have been proposed to embed secret data in the plain cover images or compressed images of various formats, including JPEG, AMBTC, VQ, etc. In this paper, we propose a production process of mosaic images based on three regular images of coffee beans. A primary image is first mimicked by the process to produce a mosaic cover image. A two-layer steganography is applied to hide secret data in the mosaic image. Based on the low visual quality of the mosaic cover image, its PSNR value can be improved about 1.5 dB after embedding 3 bpp. This is achieved by leveraging the newly proposed polarized search mask and the concepts of strong embedding and weak embedding. Applying steganography to the mosaic cover images is a completely new idea and it is promising.

매선료법(埋線療法)에 대한 문헌적(文獻的) 고찰(考察) (A Literary Study on Embedding Therapy)

  • 이광호;이동희;권기록;박희수;박영엽
    • 대한약침학회지
    • /
    • 제6권3호
    • /
    • pp.15-21
    • /
    • 2003
  • Background : This study focuses on the new acupuncture method of embedding method which inserts a substance on the acupuncture points for continuous stimulation. Clinical applications and cautions were examined through literary investigations. Results : Based on the literary consideration of embedding method, the following results were obtained : 1. Embedding method is a combination of traditional and embedding technique to provide longer duration of stimulation on the acupuncture points. 2. To administer the embedding method, one needs to utilize a embedding thread besides acupuncture apparatus. Sheep gut is commonly used in China and the surgical thread is the choice in Korea. 3. Embedding method may vary from the patient to patient, depending on the nature and location of the illness. Piercing, embedding, and tying are some of the possibilities. 4. Embedding method may have different arrangement of threads based on the choice of usage. 5. Embedding method is effective for various chronic illnesses such as aches, functional diseases, and the diseases of internal organs. 6. When using the embedding methods, cautions against infection and side effects due to strong stimulation are mandatory.

ON ORBIFOLD EMBEDDINGS

  • Cho, Cheol-Hyun;Hong, Hansol;Shin, Hyung-Seok
    • 대한수학회지
    • /
    • 제50권6호
    • /
    • pp.1369-1400
    • /
    • 2013
  • The concept of "orbifold embedding" is introduced. This is more general than sub-orbifolds. Some properties of orbifold embeddings are studied, and in the case of translation groupoids, orbifold embedding is shown to be equivalent to a strong equivariant immersion.

Learning Deep Representation by Increasing ConvNets Depth for Few Shot Learning

  • Fabian, H.S. Tan;Kang, Dae-Ki
    • International journal of advanced smart convergence
    • /
    • 제8권4호
    • /
    • pp.75-81
    • /
    • 2019
  • Though recent advancement of deep learning methods have provided satisfactory results from large data domain, somehow yield poor performance on few-shot classification tasks. In order to train a model with strong performance, i.e. deep convolutional neural network, it depends heavily on huge dataset and the labeled classes of the dataset can be extremely humongous. The cost of human annotation and scarcity of the data among the classes have drastically limited the capability of current image classification model. On the contrary, humans are excellent in terms of learning or recognizing new unseen classes with merely small set of labeled examples. Few-shot learning aims to train a classification model with limited labeled samples to recognize new classes that have neverseen during training process. In this paper, we increase the backbone depth of the embedding network in orderto learn the variation between the intra-class. By increasing the network depth of the embedding module, we are able to achieve competitive performance due to the minimized intra-class variation.

쿼드트리 알고리즘과 최저주파수대역을 이용한 워터마킹 기법 (A Watermarking Scheme of Lowest Frequency Band Based on the Quad-Tree Algorithm)

  • 정병수;추형석;신성욱;안종구
    • 전기학회논문지
    • /
    • 제56권11호
    • /
    • pp.2027-2032
    • /
    • 2007
  • In this paper, digital watermarking method using quad-tree algorithm and the lowest frequency band is proposed. The proposed algorithm searches the coefficient of the watermark by using quad-tree algorithm and inserts the watermark by the Cox's algorithm. The simulation of the proposed algorithm is implemented about the effect of various weight factors in Cox's algorithm, that of embedding watermark in each subband coefficient (HH, LH, HL), and that of embedding in the lowest frequency band (LL). As a simulation result, the bigger weight factors in Cox's algorithm show strong to noise. The watermarking performance of simultaneously embedding in HH, LH, and HL band is better than that of different cases. In addition, insertion the watermark to the LL band about $30{\sim}60%$ of all watermarks improves the watermarking performance in comparison with the case of not using the LL band.

파이프 골조온실의 민말뚝 기초와 주름말뚝 기초의 인발저항력에 대한 실험적 연구 (A Study on the Uplift Capacity of Plane and Corrugated Pile Foundations for Pipe Frame Greenhouse)

  • 조재홍;윤용철;윤충섭;서원명
    • 한국농공학회:학술대회논문집
    • /
    • 한국농공학회 1998년도 학술발표회 발표논문집
    • /
    • pp.255-261
    • /
    • 1998
  • The recent greenhouses are extremely light-weight structures and easily damaged by the strong winds due to the lack of uplift capacity of pile foundations. The uplift capacity of pile foundations are subject to the shape of the pile surface, diameter, weight, and embedded depths. etc. So, it is very important to figure out the most appropriate conditions on shape of the pile surface and it's embedding depths. to improve wind proof capability of pipe greenhouses. In this study, plane and corrugated pile surfaces were examined on their uplift capacity with 30 to 50 cm of embedding depths. The diameters of tested piles were 10 cm, 15 cm, and 20 cm, respectively. Compaction ratio of the tested soil was 80%. Each test run was repeated three times for the respective treatment. Obtained results are as follows; In all cases, as the diameter and the embedding depth were increased, the ultimate uplift capacity of the pile was also increased. And it was clear that the ultimate uplift capacity of corrugated pile was approximately two times as big as that of plain piles under same conditions.

  • PDF

compact 축열 버너 개발 연구 (A Study on the Compact Regenerative Burner Development)

  • 동상근;이은경;양제복
    • 한국연소학회:학술대회논문집
    • /
    • 한국연소학회 2004년도 제28회 KOSCO SYMPOSIUM 논문집
    • /
    • pp.248-255
    • /
    • 2004
  • For the compactness of regenerative combustion, self regenerative combustion and embedding regenerator inside furnace are proposed. The Self Regenerative burner system was developed to enhance thermal efficiency and Low Nox emission. In the twin regenerative system, two burner heads are generally used for preheating and exhausting combustion mode. But self regenerative burner system use only single nozzle body for regenerative combustion. Also two kind of regenerator, internal and external type, were designed to operate conveniently in both large and small furnace. According to test result, the self regenerative combustion system gives strong internal exhaust gas recirculation that reduce NOx emission significantly. NOx was measured as 50ppm(5% O2, 1290C furnace temperature). Also it is found that the fuel saving rate due to the self regenerative burner system reach to 30-40%. Thus it can be concluded that self regenerative mild combustion system appears to provide a reasonable regenerative burner for compactness and high performance as compared with conventional twin regenerative burner system. Also in the RT Application , compact twin regenerative burner was developed with the help of embedding regenerator inside furnace.

  • PDF

BEYOND THE CACTUS RANK OF TENSORS

  • Ballico, Edoardo
    • 대한수학회보
    • /
    • 제55권5호
    • /
    • pp.1587-1598
    • /
    • 2018
  • We study additive decompositions (and generalized additive decompositions with a zero-dimensional scheme instead of a finite sum of rank 1 tensors), which are not of minimal degree (for sums of rank 1 tensors with more terms than the rank of the tensor, for a zero-dimensional scheme a degree higher than the cactus rank of the tensor). We prove their existence for all degrees higher than the rank of the tensor and, with strong assumptions, higher than the cactus rank of the tensor. Examples show that additional assumptions are needed to get the minimally spanning scheme of degree cactus +1.

Lightweight End-to-End Blockchain for IoT Applications

  • Lee, Seungcheol;Lee, Jaehyun;Hong, Sengphil;Kim, Jae-Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권8호
    • /
    • pp.3224-3242
    • /
    • 2020
  • Internet of Things (IoT) networks composed of a large number of sensors and actuators generate a huge volume of data and control commands, which should be enforced by strong data reliability. The end-to-end data reliability of IoT networks is an essential industrial enabler. Blockchain technology can provide strong data reliability and integrity within IoT networks. We designed a lightweight end-to-end blockchain network that applies to common IoT applications. Its enhanced modular architecture and lightweight consensus mechanism guarantee its practical applicability for general IoT applications. In addition, the proposed blockchain network is highly software compatible because it adopts the Hyperledger development environment. Directly embedding the proposed blockchain middleware platform in small computing devices proves its practicability.

Discriminative and Non-User Specific Binary Biometric Representation via Linearly-Separable SubCode Encoding-based Discretization

  • Lim, Meng-Hui;Teoh, Andrew Beng Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권2호
    • /
    • pp.374-388
    • /
    • 2011
  • Biometric discretization is a process of transforming continuous biometric features of an identity into a binary bit string. This paper mainly focuses on improving the global discretization method - a discretization method that does not base on information specific to each user in bitstring extraction, which appears to be important in applications that prioritize strong security provision and strong privacy protection. In particular, we demonstrate how the actual performance of a global discretization could further be improved by embedding a global discriminative feature selection method and a Linearly Separable Subcode-based encoding technique. In addition, we examine a number of discriminative feature selection measures that can reliably be used for such discretization. Lastly, encouraging empirical results vindicate the feasibility of our approach.