• Title/Summary/Keyword: Embedding method

Search Result 701, Processing Time 0.03 seconds

Super Resolution by Learning Sparse-Neighbor Image Representation (Sparse-Neighbor 영상 표현 학습에 의한 초해상도)

  • Eum, Kyoung-Bae;Choi, Young-Hee;Lee, Jong-Chan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.12
    • /
    • pp.2946-2952
    • /
    • 2014
  • Among the Example based Super Resolution(SR) techniques, Neighbor embedding(NE) has been inspired by manifold learning method, particularly locally linear embedding. However, the poor generalization of NE decreases the performance of such algorithm. The sizes of local training sets are always too small to improve the performance of NE. We propose the Learning Sparse-Neighbor Image Representation baesd on SVR having an excellent generalization ability to solve this problem. Given a low resolution image, we first use bicubic interpolation to synthesize its high resolution version. We extract the patches from this synthesized image and determine whether each patch corresponds to regions with high or low spatial frequencies. After the weight of each patch is obtained by our method, we used to learn separate SVR models. Finally, we update the pixel values using the previously learned SVRs. Through experimental results, we quantitatively and qualitatively confirm the improved results of the proposed algorithm when comparing with conventional interpolation methods and NE.

Label Embedding for Improving Classification Accuracy UsingAutoEncoderwithSkip-Connections (다중 레이블 분류의 정확도 향상을 위한 스킵 연결 오토인코더 기반 레이블 임베딩 방법론)

  • Kim, Museong;Kim, Namgyu
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.3
    • /
    • pp.175-197
    • /
    • 2021
  • Recently, with the development of deep learning technology, research on unstructured data analysis is being actively conducted, and it is showing remarkable results in various fields such as classification, summary, and generation. Among various text analysis fields, text classification is the most widely used technology in academia and industry. Text classification includes binary class classification with one label among two classes, multi-class classification with one label among several classes, and multi-label classification with multiple labels among several classes. In particular, multi-label classification requires a different training method from binary class classification and multi-class classification because of the characteristic of having multiple labels. In addition, since the number of labels to be predicted increases as the number of labels and classes increases, there is a limitation in that performance improvement is difficult due to an increase in prediction difficulty. To overcome these limitations, (i) compressing the initially given high-dimensional label space into a low-dimensional latent label space, (ii) after performing training to predict the compressed label, (iii) restoring the predicted label to the high-dimensional original label space, research on label embedding is being actively conducted. Typical label embedding techniques include Principal Label Space Transformation (PLST), Multi-Label Classification via Boolean Matrix Decomposition (MLC-BMaD), and Bayesian Multi-Label Compressed Sensing (BML-CS). However, since these techniques consider only the linear relationship between labels or compress the labels by random transformation, it is difficult to understand the non-linear relationship between labels, so there is a limitation in that it is not possible to create a latent label space sufficiently containing the information of the original label. Recently, there have been increasing attempts to improve performance by applying deep learning technology to label embedding. Label embedding using an autoencoder, a deep learning model that is effective for data compression and restoration, is representative. However, the traditional autoencoder-based label embedding has a limitation in that a large amount of information loss occurs when compressing a high-dimensional label space having a myriad of classes into a low-dimensional latent label space. This can be found in the gradient loss problem that occurs in the backpropagation process of learning. To solve this problem, skip connection was devised, and by adding the input of the layer to the output to prevent gradient loss during backpropagation, efficient learning is possible even when the layer is deep. Skip connection is mainly used for image feature extraction in convolutional neural networks, but studies using skip connection in autoencoder or label embedding process are still lacking. Therefore, in this study, we propose an autoencoder-based label embedding methodology in which skip connections are added to each of the encoder and decoder to form a low-dimensional latent label space that reflects the information of the high-dimensional label space well. In addition, the proposed methodology was applied to actual paper keywords to derive the high-dimensional keyword label space and the low-dimensional latent label space. Using this, we conducted an experiment to predict the compressed keyword vector existing in the latent label space from the paper abstract and to evaluate the multi-label classification by restoring the predicted keyword vector back to the original label space. As a result, the accuracy, precision, recall, and F1 score used as performance indicators showed far superior performance in multi-label classification based on the proposed methodology compared to traditional multi-label classification methods. This can be seen that the low-dimensional latent label space derived through the proposed methodology well reflected the information of the high-dimensional label space, which ultimately led to the improvement of the performance of the multi-label classification itself. In addition, the utility of the proposed methodology was identified by comparing the performance of the proposed methodology according to the domain characteristics and the number of dimensions of the latent label space.

Digital Watermarking Based on Adaptive Threshold and Weighting Factor Decision Method (적응적 임계치와 가중치 결정 방법에 기반한 디지털 워터마킹)

  • Lim, Ho;Kim, Jin-Young
    • Proceedings of the IEEK Conference
    • /
    • 2000.06d
    • /
    • pp.123-126
    • /
    • 2000
  • In this paper, we propose new watermarking technique using weighting factor decision method in the watermark embedding step and adaptive threshold decision method in the watermark extracting step. In our method, we are determined weighting factor in simple by calculating distance between pixel coefficient and neighborhood pixel coefficients and threshold is adaptively determined by searching the minimized extract error value using histogram of difference value.

  • PDF

A New Steganographic Method with Minimum Distortion (최소 왜곡을 위한 새로운 스테가노그래피 방법)

  • Zhang, Rongyue;Md, Amiruzzaman;Kim, Hyoung-Joong
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2008.08a
    • /
    • pp.201-204
    • /
    • 2008
  • In this paper a new steganographic method is presented with minimum distortion. This paper focused on DCT rounding error and optimized that in a very easy way, resulting stego image has less distortion than other existing methods. The proposed method compared with F5 steganography algorithm, and the proposed method achieved better performance. This paper considered the DCT rounding error for lower distortion with possibly higher embedding capacity.

  • PDF

Audio Watermarking through Modification of Tonal Maskers

  • Lee, Hee-Suk;Lee, Woo-Sun
    • ETRI Journal
    • /
    • v.27 no.5
    • /
    • pp.608-616
    • /
    • 2005
  • Watermarking has become a technology of choice for a broad range of multimedia copyright protection applications. This paper proposes an audio watermarking scheme that uses the modified tonal masker as an embedding carrier for imperceptible and robust audio watermarking. The method of embedding is to select one of the tonal maskers using a secret key, and to then modify the frequency signals that consist of the tonal masker without changing the sound pressure level. The modified tonal masker can be found using the same secret key without the original sound, and the embedded information can be extracted. The results show that the frequency signals are stable enough to keep embedded watermarks against various common signal processing types, while at the same time the proposed scheme has a robust performance.

  • PDF

PCAIW A VELET BASED WATERMARKING OF MULTISPECTRAL IMAGE

  • RANGSANSERI Y.;PANYAVARAPORN J.;THITIMAJSHIMA P.
    • Proceedings of the KSRS Conference
    • /
    • 2005.10a
    • /
    • pp.138-141
    • /
    • 2005
  • In this paper, we propose a watermarking technique of multispectral images. In our method, the Principal Component Analysis (PCA) is preliminarily applied on the multispectral image. The most principal component image is used for embedding with a watermark, which is a pseudo-random number sequence generated with a secret key. The embedding process is performed in the wavelet domain. The resulting image is then reinserted into the principal component images, and the final multispectral image containing the watermark can be produced by the inverse PCA. Experimental results are provided to illustrate the performance of the algorithm against various kinds of attacks.

  • PDF

Protection of Watermark Signals and Preservation of Original Images by Turbo Encoding (터보 코드의 적용을 통한 워터마크 신호 보호 및 원 영상의 화질 보존)

  • 조동욱;배영래
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2001.11a
    • /
    • pp.869-872
    • /
    • 2001
  • This paper proposes on the implementation of efficient image transmission system by generation and protection of watermark signals. For this, the image structure understanding is performed for improving the image quality and the generation of watermark signals. Then, the histogram is constructed and the watermark signals are selected from this. At this stage, by embedding of the coefficients of curve fittness into the lower 4 its of the image data pixels, image quality degradation due to the embedding of watermark signals are prevented. Finally, turbo encoding is performed to solve the problem of watermark signal losses that may occur on channels when transmitting. Especially, a new interleaving method called semi-random interleaver is proposed.

  • PDF

Robust Image Watermarking using Quantization on the Lowest Wavelet Subband (웨이브렛 최저주파수 대역에서의 양자화를 이용한 강인한 영상 워터마킹)

  • 서용석;주상현;유원영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9C
    • /
    • pp.898-907
    • /
    • 2003
  • In this paper, we propose a new blind watermarking method that embeds a watermark on the lowest wavelet subband coefficients, while most watermarking techniques embed watermarks in the middle frequency range for robustness and fidelity. A new embedding algorithm for watermarking is proposed that embeds a bi-level watermark sequence into randomly selected wavelet coefficients on the lowest subband(LL) using a quantization in order to be robust. Experimental results prove our novel embedding strategy is invisible and good rate-distortion-robustness performance.

Embedding DC Digital Watermarking in the DCT (DCT의 DC 계수에 워터마크 삽입하는 디지털 워터마킹)

  • 신용달;권성근
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.6
    • /
    • pp.962-967
    • /
    • 2003
  • In this paper, we proposed DC term embedding digital watermarking in the DCT domain. We computed a 8${\times}$8 block DCT The watermark signal is composed of a random number sequence of length 1000, which obeys normal distribution with zero mean and unit variance N(0,1). We embedded watermark signal in DC term for small watermark signal, the other watermark signal embedded in the largest AC coefficients. Experiment show that the invisibility and robust of the proposed method better than those of the conventional methods.

  • PDF

패턴분류와 임베딩 차원을 이용한 단기부하예측

  • Choe, Jae-Gyun;Jo, In-Ho;Park, Jong-Geun;Kim, Gwang-Ho
    • Proceedings of the KIEE Conference
    • /
    • 1997.07c
    • /
    • pp.1144-1148
    • /
    • 1997
  • In this paper, a method for the daily maximum load forecasting which uses a chaotic time series in power system and artificial neural network. We find the characteristics of chaos in power load curve and then determine a optimal embedding dimension and delay time. For the load forecast of one day ahead daily maximum power, we use the time series load data obtained in previous year. By using of embedding dimension and delay time, we construct a strange attractor in pseudo phase plane and the artificial neural network model trained with the attractor mentioned above. The one day ahead forecast errors are about 1.4% for absolute percentage average error.

  • PDF