• Journal of Korea Multimedia Society
• /
• v.15 no.9
• /
• pp.1102-1111
• /
• 2012

In this paper, we propose a robust watermarking method against geometric attack even though the watermarked image is partially damaged. This method consists of standard image normalization which transforms any image into a predefined standard image and embedding watermark in DCT domain of standard normalized image using spread spectrum technique. The proposed standard image normalization method has an improvement over existing image normalization method, so it is robust to partial damage and geometric attack. The watermark embedding method using spread spectrum technique also has a robustness to image losses such as blurring, sharpening and compressions. In addition, the proposed watermarking method does not need an original image to detect watermark, so it is useful to public watermarking applications. Several experimental results show that the proposed watermarking method is robust to partial damage and various attacks including geometric deformation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.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.

• The Journal of the Korea Contents Association
• /
• v.4 no.3
• /
• pp.107-113
• /
• 2004

This paper improved the performance of the face recognition system using the PCA/LDA hybrid method based on the facial geometric feature and the Wavelet transform. Because the previous PCA/LDA methods have measured the similarity according to the formal dispersion, they could not reflect facial boundaries exactly In order to recover this defect, this paper proposed the method using the distance between eyes and mouth. If the difference of the measured distances on the query and the training images is over the given threshold, then the method reorders the candidate images according to energy feature vectors of eyes, a nose, and a chin. To evaluate the performance of the proposed method the computer simulations have been performed with four hundred facial images in the ORL database. The results showed that our method improves about 4％ recognition rate over the previous PCA/LDA method.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.36 no.1
• /
• pp.67-74
• /
• 2023

A meshless technique using the geometric conservation least-squares method (GC-LSM) was devised to discretize the governing equation of linear elasticity. Although the finite-element method is widely used for structural analysis, a meshless method was developed because of its advantages in a moving grid system. This work is the preliminary phase for developing a fully meshless-based fluid-structure interaction solver. In this study, Cauchy's momentum equation was discretized in strong form using GC-LSM for the structural domain, and the Newmark beta method was used for time integration. The solver was validated in 1D, 2D, and 3D benchmarking problems. Static and dynamic results were obtained. The results are more accurate than those of analytic solutions.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.24 no.9
• /
• pp.1139-1147
• /
• 2000

This paper describes that the size of inactive zone can be directly applied to design multiblade fan/scroll system. From the experimental studies using a five hole pitot tube and smoke test, it is found that the size of inactive zone has linear relations with the mean velocity of impeller inlet and cut-off angle gives a great influences to the fan efficiency. For the practical design, a function related with geometric parameters(i.e. inner radius, cord length, cut-off clearance and cut-off angle) of fan/scroll system is suggested. By using these formulas, the size and distribution of inactive zone can be predicted without the measurements through the full domain, it can be possible to use them to know the efficiency improvement for new model designed.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.7 s.262
• /
• pp.739-746
• /
• 2007

Recently, models in STL files are widely used in reverse engineering processes, CAD systems and analysis systems. However the models have poor geometric quality and include only triangles, so the models are not suitable for the finite element analysis. This paper presents a general method that generates finite element mesh from STL file models. Given triangular meshes, the method estimates triangles and makes clusters which consist of triangles. The clusters are merged by some geometric indices. After merging clusters, the method applies plane meshing algorithm, based on domain decomposition method, to each cluster and then the result plane mesh is projected into the original triangular set. Because the algorithm uses general methods to generate plane mesh, we can obtain both tri and quad meshes unlike previous researches. Some mechanical part models are used to show the validity of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.10
• /
• pp.3591-3606
• /
• 2014

In this paper, a robust watermarking scheme is proposed that uses the scale-invariant feature transform (SIFT) algorithm in the discrete wavelet transform (DWT) domain. First, the SIFT feature areas are extracted from the original image. Then, one level DWT is applied on the selected SIFT feature areas. The watermark is embedded by modifying the fractional portion of the horizontal or vertical, high-frequency DWT coefficients. In the watermark extracting phase, the embedded watermark can be directly extracted from the watermarked image without requiring the original cover image. The experimental results showed that the proposed scheme obtains the robustness to both signal processing and geometric attacks. Also, the proposed scheme is superior to some previous schemes in terms of watermark robustness and the visual quality of the watermarked image.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.543-557
• /
• 2017

In this paper, we investigate the notion of q-pseudoconvexity to discuss and describe some geometric characterizations of q-pseudoconvex domains ${\Omega}{\subset}{\mathbb{C}}^n$. In particular, we establish that ${\Omega}$ is q-pseudoconvex, if and only if, for every boundary point, the Levi form of the boundary is semipositive on the intersection of the holomorphic tangent space to the boundary with any (n-q+1)-dimensional subspace $E{\subset}{\mathbb{C}}^n$. Furthermore, we prove that the Kiselman's minimum principal holds true for all q-pseudoconvex domains in ${\mathbb{C}}^p{\times}{\mathbb{C}}^n$ such that each slice is a convex tube in ${\mathbb{C}}^n$.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2003.07a
• /
• pp.551-554
• /
• 2003

A novel geometric solution for uniform bend transition in a pi cell has proposed. In order to obtain the uniform bend transition, we applied hybrid domain structure to the edge of a LC cell by using ion-beam alignment method. As a result, we confirmed that the uniform bend transition has arisen from the edge to the center. From the proposed structure, we expect that the reliable and uniform bend transition can be achieved in the pi cell.

• Journal of applied mathematics & informatics
• /
• v.38 no.3_4
• /
• pp.311-334
• /
• 2020

The solution of the elliptic partial differential equation has interface singularity at the points which are either the intersections of interfaces or the intersections of interfaces with the boundary of the domain. The singularities that arises in the elliptic interface problems are very complex. In this article we propose an exponentially accurate nonconforming spectral element method for these problems based on [7, 18]. A geometric mesh is used in the neighbourhood of the singularities and the auxiliary map of the form z = ln ξ is introduced to remove the singularities. The method is essentially a least-squares method and the solution can be obtained by solving the normal equations using the preconditioned conjugate gradient method (PCGM) without computing the mass and stiffness matrices. Numerical examples are presented to show the exponential accuracy of the method.