• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.2
• /
• pp.45-55
• /
• 1994

In this paper, a block based image approximation technique using the Self Affine System(SAS) from the fractal theory is suggested. Each block of an image is divided into 4 tiles and 4 affine mapping coefficients are found for each tile. To find the affine mapping cefficients that minimize the error between the affine transformed image block and the reconstructed image block, the matrix euation is solved by setting each partial differential coefficients to aero. And to ensure the convergence of coding block. 4 uniformly partitioned affine transformation is applied. Variable block size technique is employed in order to applynatural image reconstruction property of fractal image coding. Large blocks are used for encoding smooth backgrounds to yield high compression efficiency and texture and edge blocks are divided into smaller blocks to preserve the block detail. Affine mapping coefficinets are found for each block having 16$\times$16, 8$\times$8 or 4$\times$4 size. Each block is classified as shade, texture or edge. Average gray level is transmitted for shade bolcks, and coefficients are found for texture and edge blocks. Coefficients are quantized and only 16 bytes per block are transmitted. Using the proposed algorithm, the computational load increases linearly in proportion to image size. PSNR of 31.58dB is obtained as the result using 512$\times$512, 8 bits per pixel Lena image.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.1
• /
• pp.41-48
• /
• 1999

This paper presents a production method to GRM coefficients which is consists of 3n polarities to n variables over GF(3). General production method is searching for transformation matrix for a single variable and then kronecker products for n times. This paper presents a production method of GRM coefficients using DD(Decision Diagrma). Change of coefficients to a single variable are apply to DD and extended to n variables.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3594-3607
• /
• 2017

The traditional feature extraction methods such as principal component analysis (PCA) cannot obtain the local structure of the samples, and locally linear embedding (LLE) cannot obtain the global structure of the samples. However, a common drawback of existing PCA and LLE algorithm is that they cannot deal well with the sparse problem of the samples. Therefore, by integrating the globality of PCA and the locality of LLE with a sparse constraint, we developed an improved and unsupervised difference algorithm called Sparse Difference Embedding (SDE), for dimensionality reduction of high-dimensional data in small sample size problems. Significantly differing from the existing PCA and LLE algorithms, SDE seeks to find a set of perfect projections that can not only impact the locality of intraclass and maximize the globality of interclass, but can also simultaneously use the Lasso regression to obtain a sparse transformation matrix. This characteristic makes SDE more intuitive and more powerful than PCA and LLE. At last, the proposed algorithm was estimated through experiments using the Yale and AR face image databases and the USPS handwriting digital databases. The experimental results show that SDE outperforms PCA LLE and UDP attributed to its sparse discriminating characteristics, which also indicates that the SDE is an effective method for face recognition.

• Journal of Computing Science and Engineering
• /
• v.4 no.3
• /
• pp.207-224
• /
• 2010

This paper presents a compression scheme for mesh geometry, which is suitable for mobile graphics. The main focus is to enable real-time decoding of compressed vertex positions while providing reasonable compression ratios. Our scheme is based on local quantization of vertex positions with mesh partitioning. To prevent visual seams along the partitioning boundaries, we constrain the locally quantized cells of all mesh partitions to have the same size and aligned local axes. We propose a mesh partitioning algorithm to minimize the size of locally quantized cells, which relates to the distortion of a restored mesh. Vertex coordinates are stored in main memory and transmitted to graphics hardware for rendering in the quantized form, saving memory space and system bus bandwidth. Decoding operation is combined with model geometry transformation, and the only overhead to restore vertex positions is one matrix multiplication for each mesh partition. In our experiments, a 32-bit floating point vertex coordinate is quantized into an 8-bit integer, which is the smallest data size supported in a mobile graphics library. With this setting, the distortions of the restored meshes are comparable to 11-bit global quantization of vertex coordinates. We also apply the proposed approach to compression of vertex attributes, such as vertex normals and texture coordinates, and show that gains similar to vertex geometry can be obtained through local quantization with mesh partitioning.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.2
• /
• pp.129-136
• /
• 2009

Generally, curved surfaces of ship hull are deformed by flame bending (line heating), multi-press forming, and die-less forming method. The forming methods generate the required in-plane/bending strain or displacement on the flat plate to make the curved surface. Multi-press forming imposes the forced displacements on the flat plate by controlling the position of each pressing points based upon the shape difference between the unfolded flat plate and the curved object shape. The flat plate has been obtained from the unfolding system that is independent of the ship CAD. Apparently, the curved surface and the unfolded-flat surface are expressed by different coordinate systems. Therefore, one of the issues is to find a registration of the unfolded surface and the curved shape for the purpose of minimum amount of forming works by comparing the two surfaces. This paper presents an efficient algorithm to get an optimized registration of two different surfaces in the multi-press forming of ship hull plate forming. The algorithm is based upon the ICP (Iterative Closest Point) algorithm. The algorithm consists of two iterative procedures including a transformation matrix and the closest points to minimize the distance between the unfolded surface and curved surfaces. Thereby the algorithm allows the minimized forming works in ship-hull forming.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.6
• /
• pp.1509-1517
• /
• 1993

The purpose of this study is to develop a program for the automatic derivation of the symbolic equations necessary for the kinematic and dynamic analyses of the spatial mechanism. For this purpose, a symbolic manipulation package called MCSYMA is used. Every symbolic equation is formulated using relative joint coordinate to obtain the numerically efficient system equations. These equations are produced in FORTRAN statements and linked to a FORTRAN program for numerical analysis. Several examples are taken for comparison with the commercial package called DADS which is using Cartesian coordinate approach. Also, this symbolic formulation approach is compared with a conventional numerical approach for an example. The results show that this symbolic approach with relative joint coordinate system is most efficient in computational time among three and is recommended for the derivation of macro elements frequently used.

• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1458-1463
• /
• 2003

This paper presents an improved identification algorithm of active magnetic bearing rotor systems considering sensor and actuator dynamics. An AMB rotor system has both real and complex poles so that it is very hard to identify them together. In previous research, a linear transformation through a fictitious proportional feedback was used in order to shift the real poles close to the imaginary axis. However, the identification result highly depends on the fictitious feedback gain, and it is not easy to identify the additional dynamics including sensor and actuators at the same time. First, this paper discusses the necessity and a selection criterion of the fictitious feedback gain. An appropriate feedback gain minimizes dominant SVD(Singular Value Decomposition) error through maximizing rank deficiency. Second, more improvement in the identification is achieved through separating the common additional dynamics in all elements of frequency response matrix. The feasibility of the proposed identification algorithm is proved with two theoretical AMB rotor models. Finally, the proposed scheme is compared with previous identification methods using experimental data, and a great improvement in model quality and large amount of time saving can be achieved with the proposed method.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.445-452
• /
• 2002

In this paper, we suggest the design of 128bit block cipher which is provable security based on mathematics theory. We have derived the 16$\times$16 matrix(i.e.,linear transformation) which is numerous active S-box, and we proved for DC and LC which prove method about security of SPN structure cipher algorithm. Also, the minimum number of active S-box, the maximum differential probabilities and the maximum linear probabilities in round function of 128bit block cipher algorithm which has an effect to DC and LC are derived.

• Journal of Information Processing Systems
• /
• v.12 no.4
• /
• pp.765-778
• /
• 2016

In watermarking schemes, the discrete wavelet transform (DWT) is broadly used because its frequency component separation is very useful. Moreover, LU decomposition has little influence on the visual quality of the watermark. Hence, in this paper, a novel blind watermark algorithm is presented based on LU transform and DWT for the copyright protection of digital images. In this algorithm, the color host image is first performed with DWT. Then, the horizontal and vertical diagonal high frequency components are extracted from the wavelet domain, and the sub-images are divided into $4{\times}4$ non-overlapping image blocks. Next, each sub-block is performed with LU decomposition. Finally, the color image watermark is transformed by Arnold permutation, and then it is inserted into the upper triangular matrix. The experimental results imply that this algorithm has good features of invisibility and it is robust against different attacks to a certain degree, such as contrast adjustment, JPEG compression, salt and pepper noise, cropping, and Gaussian noise.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.1
• /
• pp.45-55
• /
• 1998

In this paper, a robust path tracker and depth controller of Autonomous Underwater Vehicle based on sliding mode control is presented. We have also designed augmented equivalent control inputs by analyzing the sliding mode with the reaching mode. This can enhance the reaching rate, and improve chattering problems, that is, noise caused by the control plane actuator of the vehicle, which is one of the problems that occur when sliding mode control is used. Also to resolve the steady state error generated in the path tracker under current effect, a modified sliding plane is constructed. Also a redesigned sliding plane and control input using transformation matrix is proposed to do easy design of MIMO depth controller. For state variables that cannot be measured directly, reduced order sliding mode control is used to design an observer. The performance of designed path tracker and depth controller is investigated by computer simulation. The results show that the proposed control system has robust performance to parameter variation, modelling error and disturbance.