• Title/Summary/Keyword: domain decomposition/embedding

Search Result 11, Processing Time 0.021 seconds

Large-eddy simulation of channel flow using a spectral domain-decomposition grid-embedding technique (스펙트럴 영역분할 격자 삽입법을 이용한 채널유동의 큰 에디 모사)

  • Gang, Sang-Mo;Byeon, Do-Yeong;Baek, Seung-Uk
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.22 no.7
    • /
    • pp.1030-1040
    • /
    • 1998
  • One of the main unresolved issues in large-eddy simulation(LES) of wall-bounded turbulent flows is the requirement of high spatial resolution in the near-wall region, especially in the spanwise direction. Such high resolution required in the near-wall region is generally used throughout the computational domain, making simulations of high Reynolds number, complex-geometry flows prohibitive. A grid-embedding strategy using a nonconforming spectral domain-decomposition method is proposed to address this limitation. This method provides an efficient way of clustering grid points in the near-wall region with spectral accuracy. LES of transitional and turbulent channel flow has been performed to evaluate the proposed grid-embedding technique. The computational domain is divided into three subdomains to resolve the near-wall regions in the spanwise direction. Spectral patching collocation methods are used for the grid-embedding and appropriate conditions are suggested for the interface matching. Results of LES using the grid-embedding strategy are promising compared to LES of global spectral method and direct numerical simulation. Overall, the results show that the spectral domain-decomposition grid-embedding technique provides an efficient method for resolving the near-wall region in LES of complex flows of engineering interest, allowing significant savings in the computational CPU and memory.

BOUNDARY COLLOCATION FAST POISSON SOLVER ON IRREGULAR DOMAINS

  • Lee, Dae-Shik
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.1
    • /
    • pp.27-44
    • /
    • 2001
  • A fast Poisson solver on irregular domains, based on bound-ary methods, is presented. The harmonic polynomial approximation of the solution of the associated homogeneous problem provides a good practical boundary method which allows a trivial parallel processing for solution evaluation or straightfoward computations of the interface values for domain decomposition/embedding. AMS Mathematics Subject Classification : 65N35, 65N55, 65Y05.

A Study on Blind Watermarking Technique of Digital Image using 2-Dimensional Empirical Mode Decomposition in Wavelet Domain (웨이블릿 평면에서의 2D-EMD를 이용한 디지털 영상의 블라인드 워터마킹 기술에 관한 연구)

  • Lee, Young-Seock;Kim, Jong-Weon
    • Journal of Internet Computing and Services
    • /
    • v.11 no.2
    • /
    • pp.99-107
    • /
    • 2010
  • In this paper a blind watermarking algorithm for digital image is presented. The proposed method operates in wavelet domain. The watermark is decomposed into 2D-IMFs using BEMD which is the 2-dimensional extension of 1 dimensional empirical mode decomposition. The CDMA based on SS technique is applied to watermark embedding and detection process. In the watermark embedding process, each IMF of watermark is embedded into middle frequency subimages in wavelet domain, so subimages just include partial information about embedded watermark. By characteristics of BEMD, when the partial information of watermark is synthesized, the original watermark is reconstructed. The experimental results show that the proposed watermarking algorithm is imperceptible and moreover is robust against JPEG compression, common image processing distortions.

A Hybrid System of Joint Time-Frequency Filtering Methods and Neural Network Techniques for Foreign Exchange Rate Forecasting (환율예측을 위한 신호처리분석 및 인공신경망기법의 통합시스템 구축)

  • 신택수;한인구
    • Journal of Intelligence and Information Systems
    • /
    • v.5 no.1
    • /
    • pp.103-123
    • /
    • 1999
  • Input filtering as a preprocessing method is so much crucial to get good performance in time series forecasting. There are a few preprocessing methods (i.e. ARMA outputs as time domain filters, and Fourier transform or wavelet transform as time-frequency domain filters) for handling time series. Specially, the time-frequency domain filters describe the fractal structure of financial markets better than the time domain filters due to theoretically additional frequency information. Therefore, we, first of all, try to describe and analyze specially some issues on the effectiveness of different filtering methods from viewpoint of the performance of a neural network based forecasting. And then we discuss about neural network model architecture issues, for example, what type of neural network learning architecture is selected for our time series forecasting, and what input size should be applied to a model. In this study an input selection problem is limited to a size selection of the lagged input variables. To solve this problem, we simulate on analyzing and comparing a few neural networks having different model architecture and also use an embedding dimension measure as chaotic time series analysis or nonlinear dynamic analysis to reduce the dimensionality (i.e. the size of time delayed input variables) of the models. Throughout our study, experiments for integration methods of joint time-frequency analysis and neural network techniques are applied to a case study of daily Korean won / U. S dollar exchange returns and finally we suggest an integration framework for future research from our experimental results.

  • PDF

A Domain-independent Dual-image based Robust Reversible Watermarking

  • Guo, Xuejing;Fang, Yixiang;Wang, Junxiang;Zeng, Wenchao;Zhao, Yi;Zhang, Tianzhu;Shi, Yun-Qing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.12
    • /
    • pp.4024-4041
    • /
    • 2022
  • Robust reversible watermarking has attracted widespread attention in the field of information hiding in recent years. It should not only have robustness against attacks in transmission but also meet the reversibility of distortion-free transmission. According to our best knowledge, the most recent robust reversible watermarking methods adopt a single image as the carrier, which might lead to low efficiency in terms of carrier utilization. To address the issue, a novel dual-image robust reversible watermarking framework is proposed in this paper to effectively utilize the correlation between both carriers (namely dual images) and thus improve the efficiency of carrier utilization. In the dual-image robust reversible watermarking framework, a two-layer robust watermarking mechanism is designed to further improve the algorithm performances, i.e., embedding capacity and robustness. In addition, an optimization model is built to determine the parameters. Finally, the proposed framework is applied in different domains (namely domain-independent), i.e., Slantlet Transform and Singular Value Decomposition domain, and Zernike moments, respectively to demonstrate its effectiveness and generality. Experimental results demonstrate the superiority of the proposed dual-image robust reversible watermarking framework.

Holographic Forensic Mark based on DWT-SVD for Tracing of the Multilevel Distribution (다단계 유통 추적을 위한 DWT-SVD 기반의 홀로그래피 포렌식마크)

  • Li, De;Kim, Jong-Weon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.2C
    • /
    • pp.155-160
    • /
    • 2010
  • In this paper, we proposed a forensic mark algorithm which can embed the distributor's information at each distribution step to trace the illegal distribution path. For this purpose, the algorithm has to have the high capacity payload for embedding the copyright and user information at each step, and the embedded information at a step should not interfere with the information at other step. The proposed algorithm can trace the multilevel distribution because the forensic mark is generated by digital hologram and embedded in the DWT-SVD domain. For the high capacity embedding, the off-axis hologram is generated from the forensic mark and the hologram is embedded in the HL, LH, HH bands of the DWT to reduce the signal interference. The SVD which is applied the holographic signal enhanced the detection performance and the safety of the forensic mark algorithm. As the test results, this algorithm was able to embed 128bits information for the copyright and user information at each step. In this paper, we can embed total 384bits information for 3 steps and the algorithm is also robust to the JPEG compression.

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.

An invisible watermarking scheme using the SVD (특이치 분해를 이용한 비가시적 워터마크 기법)

  • 유주연;유지상;김동욱;김대경
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.11C
    • /
    • pp.1118-1122
    • /
    • 2003
  • In this paper, we propose a new invisible digital watermarking scheme based on wavelet transform using singular value decomposition. Embedding process is started by decomposing the lowest frequency band image with 3${\times}$3 block among which we define the watermark block chosen by a key set; entropy and condition number of the block. A watermark is embedded in the singular values of each watermark blocks. This provides a robust watermarking in lowest possible time-frequency domain. To detect the watermark, we are locally modeling an attack as 3${\times}$3 matrices on the watermark blocks. Combining with the SVD and the attack matrices, we estimate watermark set corresponding to the watermark blocks. In each watermark block, we determine an optimal watermark which is justified by the T-testing. A numerical experiment shows that the proposed watermarking scheme efficiently detects the watermarks from several JPEG attacks.

Molecular Dynamics and Micromechanics Study on Mechanical Behavior and Interfacial Properties of BNNT/Polymer Nanocomposites (분자동역학 전산모사와 미시역학 모델을 이용한 질화붕소 나노튜브/고분자 복합재의 역학적 물성 및 계면특성 예측)

  • Choi, Seoyeon;Yang, Seunghwa
    • Composites Research
    • /
    • v.30 no.4
    • /
    • pp.247-253
    • /
    • 2017
  • In this study, the mechanical behavior and interface properties of boron nitride nanotube-poly(methyl methacrylate) nanocomposites are predicted using the molecular dynamics simulations and the double inclusion model. After modeling nanocomposite unit cell embedding single-walled nanotube and polymer, the stiffness matrix is determined from uniaxial tension and shear tests. Through the orientation average of the transversely isotropic stiffness matrix, the effective isotropic elastic constants of randomly dispersed microstructure of nanocomposites. Compared with the double inclusion model solution with a perfect interfacial condition, it is found that the interface between boron nitride nanotube and polymer matrix is weak in nature. To characterize the interphase surrounding the nanotube, the two step domain decomposition method incorporating a linear spring model at the interface is adopted. As a result, various combinations of the interfacial compliance and the interphase elastic constants are successfully determined from an inverse analysis.

Digital Image Watermarking Scheme in the Singular Vector Domain (특이 벡터 영역에서 디지털 영상 워터마킹 방법)

  • Lee, Juck Sik
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.16 no.4
    • /
    • pp.122-128
    • /
    • 2015
  • As multimedia information is spread over cyber networks, problems such as protection of legal rights and original proof of an information owner raise recently. Various image transformations of DCT, DFT and DWT have been used to embed a watermark as a token of ownership. Recently, SVD being used in the field of numerical analysis is additionally applied to the watermarking methods. A watermarking method is proposed in this paper using Gabor cosine and sine transform as well as SVD for embedding and extraction of watermarks for digital images. After delivering attacks such as noise addition, space transformation, filtering and compression on watermarked images, watermark extraction algorithm is performed using the proposed GCST-SVD method. Normalized correlation values are calculated to measure the similarity between embedded watermark and extracted one as the index of watermark performance. Also visual inspection for the extracted watermark images has been done. Watermark images are inserted into the lowest vertical ac frequency band. From the experimental results, the proposed watermarking method using the singular vectors of SVD shows large correlation values of 0.9 or more and visual features of an embedded watermark for various attacks.