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

• International Journal of Contents
• /
• v.9 no.2
• /
• pp.1-7
• /
• 2013

This paper proposes an efficient matching algorithm based on ASIFT (Affine Scale-Invariant Feature Transform) which is fully invariant to affine transformation. In our approach, we proposed a method of reducing similar measure matching cost and the number of outliers. First, we combined the Manhattan and Chessboard metrics replacing the Euclidean metric by a linear combination for measuring the similarity of keypoints. These two metrics are simple but really efficient. Using our method the computation time for matching step was saved and also the number of correct matches was increased. By applying an Optimized Random Sampling Algorithm (ORSA), we can remove most of the outlier matches to make the result meaningful. This method was experimented on various combinations of affine transform. The experimental result shows that our method is superior to SIFT and ASIFT.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.2
• /
• pp.55-65
• /
• 2011

In this paper, a novel method of marker detection robust against marker occlusion in augmented reality is proposed. the proposed method consists of four steps. In the first step, in order to effectively detect an occluded marker, we first utilize the Affine-SIFT (ASIFT, Affine-Scale Invariant Features Transform) for detecting matching points between an enrolled marker and an input images with an occluded marker. In the second step, we apply the Principal Component Analysis (PCA) for eliminating outlier of the matching points in the enrolled marker. And then matching points are projected to the first and second axis for longest value and the shortest value of an ellipse are determined by average distance between the projected points and a center of the points. In the third step, Convex-hull vertices including matching points are considered as polygon vertices for estimating a geometric affine transformation. In the final step, by estimating the geometric affine transformation of the points, a marker robust against a marker occlusion is detected. Experimental results have shown that the proposed method effectively detects occlude markers.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.12 no.2
• /
• pp.11-17
• /
• 1975

The paper examined the character structure as a basic study for the recognition of Korean characters. In view of concave structure, line structure and node relationship of character graph, the algebraic structure of the basic Korean characters is are analized. Also, the degree of complexities in their character structure is discussed and classififed. Futhermore, by describing the fact that some equivalence relations are existed between the 10 vowels of rotational transformation group by Affine transformation of one element into another, it could be pointed out that the geometrical properting in addition to the topological properties are very important for the recognition of Korean characters.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.171-174
• /
• 2000

This paper proposes a pipelined adaptive filter based on affine projection algorithm with order 2. This filter gives a better convergence performance than that of LMS or NLMS pipeline algorithm and has same latency with the pipeline algorithm based on equivalent transformation. Compared to the critical path of the pipeline NLMS implementation, only 2 additions are increased in that of the proposed implementation.

• Proceedings of the KSRS Conference
• /
• 1999.11a
• /
• pp.3-7
• /
• 1999

The images of the meteorological satellite NOAA contain geometrical distortions caused by its ambiguous position, its vibration, its sensor's movement, and so on. Geometric correction of satellite images is one of the most important parts in many remote sensing as the primary processing. Ground control points (GCP's) are necessary to check the accuracy of geometric correction and used for precise geometric correction. In this paper, a method for automatically selecting the residual error is presented. Calculating the effective angle and residual errors vector using the succeeded matching GCP's, precise geometric correction using an affine transformation is applied to systematically a corrected image. And the error is decreased by an affine transformation. The above enable the geometric correction of high quality.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.773-776
• /
• 1998

In this paper, we propose an efficient multi-view images coding algorithm which finds the optimal texture from the restricted number of multi-view images. The X-Y plane of the normalized object space is divided into triangular patches. The depth value of the node is determined by applying the block based disparity compensation method and then the texture of the each patch is extracted by applying the affine transformation patch is extracted by applying the affine transformation based disparity compensation method to the multi-view images. We restricted the number of images contributed to determining the texture comapred to traditional methods which use all the multi-view images in the texture extraction. Experimental results show that the SNR of images encoded by the proposed algorithm is better than that of imaes encoded by the traditional method by the amount about 0.2dB for the test sets of multi-view images called dragon, kid, city and santa. The recovered images from the encoded data by the proposed method show the better visual images than the recovered images from the encoded data by the traditional methods.

• Journal of the Korean Society of Visualization
• /
• v.17 no.3
• /
• pp.66-69
• /
• 2019

An image compensating algorithm with high-vibration movement is proposed, using optical flow and the Kalman Filter. The temporal motion vector field is calculated by Optical flow and suspicious vectors are removed or adjusted by the Gaussian interpolation method. The high-vibrated vector filled is stabilized by the Kalman filter. Lastly, compensated images are obtained by affine transformation. This proposed algorithm gives good compensated video images on high-vibration situations.

• Spatial Information Research
• /
• v.11 no.4
• /
• pp.481-491
• /
• 2003

This study aims at generating a continuous map by coordinates transformation between cadastral maps with different surveying origins. The continuous cadastral map is useful in various fields of GIS. For this purpose, an experimental study was conducted at Osan-Si, Kyonggi Province in cooperation with related institutions. In this study, three control point zone, large, medium, and small zone were to!;ted. For each control point, the currently used data were compared with the data at the surveyed time. About coordinate transformation method, we tested Helmert, Affine, and Polynomial methods which are the most representative among 2-dimensional coordinate transformations. These three transformation methods were evaluated according to variation of transformed parcel shape and agreement with neighboring areas. As the result of the evaluation, Affine transformation in large zone is the most appropriate coordinate transformation method fer Osan-Si.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.149-159
• /
• 2001

The conventional block-based motion prediction suffers, especially in low bit-rate video application, from shortcomings such as blocking artifacts of motion field and unstable motion estimation. To overcome the deficiency, this paper proposes one method of adopting a new motion compensation scheme based on the irregular triangular mesh structure while keeping the current block-based DCT coding structure of H.263 as much as possible. To represent the reconstructed previous frame using minimal number of control points, the proposed method designs content-adaptive irregular triangular meshes, and then, estimate the motion vector of each control point using the affine transformation-based matching. The predicted current frame is obtained by applying the affine transformation to each triangular mesh. Experiment with the several real video sequences shows improvement both in objective and subjective picture quality over the conventional block-based H.263 method.