• Proceedings of the KIEE Conference
• /
• 2004.07d
• /
• pp.2447-2449
• /
• 2004

This paper presents the predicted polar mapping that is to improve the efficiency of an unexpected moving obstacle detecting system. When the movement of the robot per a step becomes a bit large then static objects or background are detected as moving objects. Thus, the velocity of the robot becomes so slow. Therefore, to enlarge the movement of the robot, we propose the predicted polar mapping that predicts the polar mapped image after robot moves to be admissible. In order to verify experimentally our proposed procedure, we make several comparative tests in the corridor.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.7
• /
• pp.414-420
• /
• 2004

Among the desirable properties of a piecewise linear parameterization, guaranteeing a one-to-one mapping (i.e., no triangle flips in the parameter plane) is often sought. A one-to-one mapping is accomplished by non-negative coefficients in the affine transformation. In the Floater's method, the coefficients were computed after the 3D mesh was flattened by geodesic polar-mapping. But using this geodesic polar map introduces unnecessary local distortion. In this paper, a simple variant of the original shape-preserving mapping technique by Floater is introduced. A new simple method for calculating barycentric coordinates by using straightest geodesics is proposed. With this method, the non-negative coefficients are computed directly on the mesh, reducing the shape distortion introduced by the previously-used polar mapping. The parameterization is then found by solving a sparse linear system, and it provides a simple and visually-smooth piecewise linear mapping, without foldovers.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.1-10
• /
• 2002

This paper presents the new template based human face recognition methods to improve the recognition performance against scale and in-plane rotation variations of face images. To enhance the recognition performance, the templates are generated by linear or nonlinear operation on multiple images including different scales and rotations of faces. As the invariant features to allow for scale and rotation variations of face images, we adopt the affine transformation, the log-polar mapping, and the log-polar image based FFT. The proposed recognition methods are evaluated in terms of the recognition rate and the processing time. Experimental results show that the proposed template based methods lead to higher recognition rate than the single image based one. The affine transformation based face recognition method shows marginally higher recognition rate than those of the log-polar mapping based method and the log-polar image based FFT, while, in the aspect of processing time, the log-polar mapping based method is the fastest one.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.8
• /
• pp.88-100
• /
• 1999

Detecting human face and facial landmarks automatically in an image is as essential step to a fully automatic face recognition system. In this paper, we present a new approach to detect automatically face and its eyes of input image with scale and rotation variations of faces by using an intensity based template matching with a single log-polar face template. In a template-based matching it is necessary to normalize the scale changes and rotations of an input image to a template ones. The log-polar mapping which simulates space-variant human visual system converts scale changes and rotations of input image into constant horizontal and cyclic vertical shifts in the output plane. Intelligent use of this property allows us to shift of the candidate log-polar faces mapped at various fixation points of an input image to be matched to a template over the log-polar plane. Thus, the proposed method eliminates the need of adapting multitemplate and multiresolution schemes, which inevitably give rise to intensive computation involved to cope with scale and rotation variations of faces. Through this scale and rotation involved to cope with scale and method can lead to detecting face and its eyes simultaneously. Experimental results on a database of 795 images show over 98% detection rate.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.663-674
• /
• 2003

Bump mapping is a technique that represents the detailed parts of the object surface, such as a perturberance of the skin of a peanut, using the geometry mapping without complex modeling. However, the hardware implementation for bump mapping is considerable, because a large amount of per pixel computation, including the normal vector shading, is required. In this paper, we propose a new bump mapping algorithm using the polar coordinate system and its hardware architecture. Compared with other existing architectures, our approach performs bump mapping effectively by using a new vector rotation method for transformation into the reference space and minimizing illumination calculation. Consequently, our proposed architecture reduces a large amount of computation and hardware requirements.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.675-678
• /
• 2000

This paper presents a parametric line equation on the log-polar mapped plane to detect the straight lines in an original image. The log-polar edge image used in Hough transform is constructed by combining the edge images of both fovea and periphery. The foveal edge image detected by a Sobel mask on the Cartesian plane is transformed to the log-polar plane by forward mapping but the edge detection of the peripheral region is obtained by directly applying the newly developed mask to the log-polar plane. This paper also proposes a analytic method then determining a border between the fovea and the periphery regions.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.9
• /
• pp.1-8
• /
• 2010

A digital phase wrapping modulation (DPM) open-loop polar transmitter can be efficiently applied to a wideband orthogonal frequency division multiplexing (OFDM) communication system by converting in-phase and quadrature signals to envelope and phase signals and then employing the signal mapping process. This mapping process is very similar to quantization in a general communication system, and when taking into account the error that appears during mapping process, one can replace the coordinates rotation digital computer (CORDIC) algorithm in the coordinate conversion part with the Taylor series approximation method. In this paper, we investigate the application of the Taylor series approximation to the cartesian to polar coordinate conversion part of a DPM polar transmitter for wideband OFDM systems. The conventional approach relies on the CORDIC algorithm. To achieve efficient application, we perform computer simulation to measure mean square error (MSE) of the both approaches and find the minimum approximation order for the Taylor series approximation compatible to allowable error of the CORDIC algorithm in terms of hardware design. Furthermore, comparing the processing speeds of the both approaches in the implementation with FPGA reveals that the Taylor series approximation with lower order improves the processing speed in the coordinate conversion part.

• International Journal of Precision Engineering and Manufacturing
• /
• v.9 no.4
• /
• pp.45-50
• /
• 2008

The Fourier-Mellin transform is the theoretical basis for the translation, rotation, and scale invariance of an image. However, its implementation requires a log-polar map of the original image, which requires logarithmic sampling of a radial variable in that image. This means that the mapping process is accompanied by considerable loss of data. To solve this problem, we propose a dual log-polar map that uses both a forward image map and a reverse image map simultaneously. Data loss due to the forward map sub-sampling can be offset by the reverse map. This is the first step in creating an invertible log-polar map. Experimental results have demonstrated the effectiveness of the proposed scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.255-258
• /
• 2003

Recently, Digital Watermarking is used to authenticate data and to determine whether the data are distorted or not in medical images which is digitalized. The Fourier Mellin method using the Fourier Transform and the Log-Polar coordinate transform gets an invariant feature for RST distortion in images. But there are several problems in the real materialization. Interpolation of the image value should be considered according to the pixel position and so a watermark loss, original image distortion, numerical approximation is happened. Therefore there should be solved to realization of the Fourier Mellin method. Using the Look up table, there reduce the data loss caused by the conversion between Rectangular and Polar coordinate. After diagnose, medical images are transformed the Polar coordinate and taken the Discrete Fourier transform in the center of ROI region. Maintaining the symmetry in Fourier magnitude coefficient, the gaussian distributed random vectors and binary images are embedded in medical images.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.15-18
• /
• 2000

In this study, we improve the performance of a speech recognition system of visual information depending on lip movements. This paper focuses on the robustness of the word recognition system with the rotation, transition and scaling of the lip images. The different methods of lipreading have been used to estimate the stability of recognition performance. Especially, we work out the special system of the log-polar mapping, which is called Mellin transform with quasi RTS-invariant and related approaches to machine vision. The results of word recognition are reported with HMM (Hidden Markov Model) recognition system.