• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.3121-3142
• /
• 2017

We present a method for 3D shape reconstruction of inextensible deformable surfaces from a single image. The key of our approach is to represent the surface as a 3D triangulated mesh and formulate the reconstruction problem as a sequence of Linear Programming (LP) problems. The LP problem consists of data constraints which are 3D-to-2D keypoint correspondences and shape constraints which are designed to retain original lengths of mesh edges. We use a closed-form method to generate an initial structure, then refine this structure by solving the LP problem iteratively. Compared with previous methods, ours neither involves smoothness constraints nor temporal consistency, which enables us to recover shapes of surfaces with various deformations from a single image. The robustness and accuracy of our approach are evaluated quantitatively on synthetic data and qualitatively on real data.

• Journal of Information Technology Applications and Management
• /
• v.14 no.1
• /
• pp.137-144
• /
• 2007

In this paper, we propose a rotation resistant robust logo embedding watermarking technique. Geometric manipulations make the detection process very complex and difficult. Watermark embedding in the normalized image directly suffers from smoothing effect due to the interpolation during the image normalization. This can be avoided by estimating the transform parameters using image normalization angle and moments, instead of embedding in the normalized image. Conventional rotation resistant schemes that use full frame transform. In this paper we adopt DCT and calculate masking using a spatio-frequency localization of the $8{\times}8$ block DCT coefficients. Experimental results show that the proposed algorithm is robust against rotation process.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1243-1246
• /
• 1998

Three-dimensional(3-D) sound is a technique for generating or recreating sounds so they are perceived as emanating from locations in a three-dimensional space. Three dimensional sound has the potential of increasing the feeling of realism in music or movie soundtracks. Three-dimensional sound effects depend on psychoacoustic spectral and phase cues being presented in a reproduced signal. In this paper we propose an effective algorithm for the sound image expansion in television system using stereo image enhancement techniques. Compared to the other techniques of three-dimensional sound, the proposed algorithm use only two speakers to enhance the sound image expansion, while maintaining the original sound characteristics.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.5
• /
• pp.467-472
• /
• 2006

The author proposes algorithm which can use reduce processing time image restoration than original one by using modified Nagao filter, eliminating the part of modifying process of previous Nagao filter modified in disposing degraded image. The proposed image is as same as original Nagao filter image but the processing time is 10 times faster than original one.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.3
• /
• pp.96-108
• /
• 1996

In this paper, we propose an object-oriented coding method in low bit-rate channels using block-based motion vectors and residual image compensation. First, we use a 2-stage algorithm for estimating motion parameters. In the first stage, coarse motion parameters are estimated by fitting block-based motion vectors and in the second stage, the estimated motion parametes are refined by the gradient method using an image reconstructed by motion vectors detected in the first stage. Local error of a 6-parameter model is compensted by blockwise motion parameter correction using residual image. Finally, model failure (MF) region is reconstructed by a fractal mapping method. Computer simulation resutls show that the proposed method gives better performance than the conventional ones in terms of th epeak signal to noise ratio (PSNR) and compression ratio (CR).

• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.136-144
• /
• 2002

In this paper, a novel approach that makes use of both shape and color information to retrieve character images in terms of similarity distance from a large-capacity image database or from a streaming image database, in particular, character image logo or trademark. In order to combine both features of completely different characteristics bipartite matching has been employed in computing similarity distance, The proposed method turned out to bealso very effective in matching natural object or human-drawn images whose shape varies substantially.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.81-84
• /
• 2000

Fractal image compression can reduce the size of image data by contractive mapping of original image. The mapping is affine transformation to find the block(called range block) which is the most similar to the original image. Fractal is very efficient way to reduce the data size. However, it has high distortion rate and requires long encoding time. In this paper, we present the simulation result of fractal and VQ hybrid systems which use different clustering algorithms, normal and improved competitive learning SOFM. The simulation results showed that the VQ hybrid fractal using improved competitive learning SOFM has better distortion rate than the VQ hybrid fractal using normal SOFM.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.8
• /
• pp.1964-1981
• /
• 2012

In this paper a reversible data hiding scheme based on histogram shifting of host image blocks is presented. This method attempts to use full available capacity for data embedding by dividing the image into non-overlapping blocks. Applying histogram shifting to each block requires that extra information to be saved as overhead data for each block. This extra information (overhead or bookkeeping information) is used in order to extract payload and recover the block to its original state. A method to eliminate the need for this extra information is also introduced. This method uses maximum gap that exists between histogram bins for finding the value of pixels that was used for embedding in sender side. Experimental results show that the proposed method provides higher embedding capacity than the original reversible data hiding based on histogram shifting method and its improved versions in the current literature while it maintains the quality of marked image at an acceptable level.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.792-797
• /
• 2002

In the following paper two algorithms, suitable for the analysis of panchromatic data as provided by KOMPSAT-1 will be presented. One is a texture analysis which will be used to create a settlement mask based on the variations of gray values. The other is a fusion algorithm which allows the combination of high resolution panchromatic data with medium resolution multispectral data. The procedure developed for this purpose uses the spatial information present in the high resolution image to spatially enhance the low resolution image, while keeping the distortion of the multispectral information to a minimum. This makes it possible to use the fusion results for standard multispecatral classification routines. The procedures presented here can be automated to large extent, making them suitable for a standard processing routine of satellite data.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.709-712
• /
• 2005

Ground processing for geostationary weather satellite such as GOES, MTSAT includes the process called image navigation. Image navigation means the retrieval of satellite navigational parameters from images and requires landmark detection by matching satellite images against landmark chips. For an automated preprocessing, a matching must be performed automatically. However, if match results contain errors, the accuracy of image navigation deteriorates. To overcome this problem, we propose the use of a robust estimation technique, called Random Sample Consensus (RANSAC), to automatically detect mismatches. We tested GOES-9 satellite images with 30 landmark chips. Landmark chips were extracted from the world shoreline database. To them, matching was applied and mismatch results were detected automatically by RANSAC. Results showed that all mismatches were detected correctly by RANSAC with a threshold value of 2.5 pixels.