• The Journal of Korean Association of Computer Education
• /
• v.9 no.5
• /
• pp.77-84
• /
• 2006

In this paper, we propose an adaptive image watermarking algorithm in DWT domain by using HVS(human Visual system) and SOM(Self-Organizing Map) among neural networks. HVS can be described in terms of two properties of HVS: brightness and texture sensitivity. The SOM is used to obtain the local characteristics of image, Therefore, the suitable strength and length of embedded watermark is determined by using HVS and SOM. The experimental results show that proposed method provides a suitable strength and length of watermark and has good perceptual invisibility and robustness for various attacks.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.8
• /
• pp.492-497
• /
• 2005

In this paper, we suggest that the new volume of robust audio watermarking method protects form the MP3 compression attack, mostly used in audio field. Watermarks were inserted at the coefficients repeatedly from low frequencies to high frequencies after DCT transform in commonly used Cox's spread spectrum method. However, our method could be investigated losing frequency when MP3 attacks and make order by small amount of losing frequency and then insert watermarks rightly through statistical analysis. In the result about various sound clips, the suggested method have better performances than Cox's method by preserving watermarks and reducing distortions of the original sounds.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.1
• /
• pp.63-69
• /
• 2020

In this paper, we propose an indoor positioning technique using the landmark based on relative Access Point (AP) signal strengths. The absolute values of AP signals are used to conventional indoor positioning technologies, but they may be different because of the difference of the measuring device, the measuring environment, and the timing of the measurements. However, we found the fact that the flow of the AP's RSSI in certain places shows almost constant patterns. Based on theses characteristics, we identify the relative strength between the APs and store the certain places as landmarks where they show certain patterns. Once the deployment of the landmark map is complete, system calculate position of user using the IMU sensor of smartphone and calibrate it with stored landmarks. Our system shows 75.2% improvement over technology that used only sensors, and 39.6% improvement over technology that used landmarks that were selected with absolute values.

• Journal of Broadcast Engineering
• /
• v.8 no.3
• /
• pp.268-277
• /
• 2003

In this paper, we propose a new video watermarking method exploiting the human visual system (HVS) to find effective locations. in the video frames which make the watermark robust and imperceptible simultaneously. In particular, we propose a new HVS-optimized weighting map for hiding the watermark by considering HVS in three different aspects : frequency, spatial, and motion masking effects. The global masking map is modeled by combining the frequency masking, the spatial masking, and the motion masking. In this paper, we use a watermark which is generated by the bitwise exclusive-OR operation between a logo image and a random sequence. The amount of watermarks is weighted by a control parameter. Furthermore, we embed the watermark in the uncompressed video sequence for the general watermarking method available to various coding schemes. Simulation results show that the watermark is imperceptible and the proposed method is good for watermark capacity. It is also demonstrated that the proposed method is robust against various attacks, such as MPEG coding, MPEG re-encoding, and frame attacks.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.51-60
• /
• 2003

The watermarking is the technique that embeds or extracts the certain data without the change of the original data for the copyright protection of the multimedia contents. Watermark-embedded contents must not be distinguished by human's eye and must be robust to the various image processing and the intentional distortions. In this paper, we propose a new watermarking technique applied in the wavelet domain which has both the spatial and frequency information of a image. For both the robustness and the invisibility, the positions for embedding the watermark is selected with the multi-threshold. We search the similarity between highly correlated coefficients in the each subband and decide the mark space after verifying the significance in the specified subband. The similarity is represented by the coefficient difference between the subbands and its distribution is used in the watermark embedding and extracting. The embedded watermark can be extracted without the original image using the relationship of the subbands. By these properties the proposed watermarking algorithm has the invisibility and the robustness to the attacks such as JPEG compression and the general image processing.

• 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.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.6
• /
• pp.83-92
• /
• 2005

This paper presents a watermarking approach that the 1-level Discrete Wavelet Transform(DWT) coefficients of a $64{\ast}64$ binary logo image as watermarks are inserted in LL band and other specific frequency bands of the host image using Multi-Resolution Analysis(MRA) Wavelet transform for copyright protection of image data. The DWT coefficients of the binary logo image are inserted in blocks of LL band and specific bands of the host image that the 3-level DWT has been performed in the same orientation. We investigate Significant Coefficients(SCs) in each block of the frequency areas in order to prevent the quality deterioration of the host image and the watermark is inserted by SCs. When the host image is distorted by difference of the distortion degree in each frequency, we set the thresholds of SCs on each frequency and completely insert the watermark in each frequency of the host image. In order to be invisibility of the watermark, the Human Visual System(HVS) is applied to the watermark. We prove the proper embedding method by experiment. Thereby, we rapidly detect the watermark using this watermarking method and because the small size watermarks are inserted by HVS and SCs, the results confirm the superiority of the proposed method on invisibility and robustness.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.925-930
• /
• 2002

This paper discusses techniques for embedding data into 3D polygonal models of geometry. Much researches of Watermarking had been gone as element technology of DRM (digital rights management). But, few research had gone to 3D polygonal model. Most research is limited at text document, 2D image, animation, music etc. RP system is suitable a few production in various goods species, and it is used much in industry to possible reason that produce prototype and find error or incongruent factor at early stage on design in product development childhood. This paper is research about method that insert watermark in STL ( stereolithography) file that have 3D shape model. Proposed algorithm inserts watermark in normal vector region and facet's interior region of 3D shape data. For this reason, 3D shape does not produce some flexure and fulfill invisibility of watermark. Experiment results that insert and extract watermark in normal netter region and facet's Interior region of 3D shape data by proposed algorithm do not influence entirely in 3D shape and show that insertion and extraction of watermark are possible.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.1
• /
• pp.486-492
• /
• 2011

In this paper we analyzed performance of Andriod's Davik virtual machine(VM) using standard benchmark and compared the result with the embedded Java virtual machine. We used a well known benchmark suit named SPECJVM for the measurement. For the fair comparison, Sun Java embedded JVM is ported and the same benchmark is ported on it. The Odriod smartphone hardware platform is used as the target hardware. We have added a Just-In-Time compiler to Dalvik, which is not supported in the recent Android release, and measured performance improvement. The experiment result show that Dalvik achieved 15% and Dalvik with JIT shows 63% of the Sun's JVM performance.

• Journal of Korea Multimedia Society
• /
• v.14 no.4
• /
• pp.567-576
• /
• 2011

In current Web 2.0 environment, one of the most core technology is social bookmarking which users put tags and bookmarks to their interesting Web pages. The main purpose of social bookmarking is an effective information service by use of retrieval, grouping and share based on user's bookmark information and tagging result of their interesting Web pages. But, current social bookmarking system uses the number of bookmarks and tag information separately in information retrieval, where the number of bookmarks stand for user's degree of interest on Web contents, information retrieval, and classification serve the purpose of tag information. Because of above reason, social bookmarking system does not utilize effectively the bookmark information and tagging result. This paper proposes a Web contents ranking algorithm combining bookmarks and tag information, based on preceding research on associative tag extraction by tag clustering. Moreover, we conduct a performance evaluation comparing with existing retrieval methodology for efficiency analysis of our proposed algorithm. As the result, social bookmarking system utilizing bookmark with tag, key point of our research, deduces a effective retrieval results compare with existing systems.