• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.1
• /
• pp.19-27
• /
• 2001

The conventional fractal image compression based on wavelet transform has the disadvantage that the encoding takes many time, since it finds the optimum domain for all the range blocks. In this paper, we propose the fractal image compression based on wavelet transform using the SAS(Self Affine System) techniques. It consists of the range and domain blocks in the wavelet transform, and the range blocks select the domain which is located the relatively same position. In the encoding process, the proposed methods introduce SAS techniques that the searching process of the domains blocks is not required. Therefore, it can perform a fast encoding by reducing the computational complexity. And, the image quality is improved using the different scale factors for each level and the sub-tree in the decoding. As a result, the image quality and the compression ratio are adjustable by the scale factors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.8
• /
• pp.1423-1443
• /
• 2011

Background compensation plays an important role in detecting and isolating object motion in visual tracking. Here, we propose a Genetic Hough Transform, which combines the Hough Transform and Genetic Algorithm, as a method for eliminating background motion. Our method can handle cases in which the background may contain only a few, if any, feature points. These points can be used to estimate the motion between two successive frames. In addition to dealing with featureless backgrounds, our method can successfully handle motion blur. Experimental comparisons of the results obtained using the proposed method with other methods show that the proposed approach yields a satisfactory estimate of background motion.

• Proceedings of the KSME Conference
• /
• 2005.11a
• /
• pp.201.2-201.2
• /
• 2005

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.28 no.3
• /
• pp.353-359
• /
• 2010

In this paper, we propose the automatic image-to-image registration of high resolution satellite images using local properties of tie points to improve the registration accuracy. A spatial distance between interest points of reference and sensed images extracted by Scale Invariant Feature Transform(SIFT) is additionally used to extract tie points. Coefficients of affine transform between images are extracted by invariant descriptor based matching, and interest points of sensed image are transformed to the reference coordinate system using these coefficients. The spatial distance between interest points of sensed image which have been transformed to the reference coordinates and interest points of reference image is calculated for secondary matching. The piecewise linear function is applied to the matched tie points for automatic registration of high resolution images. The proposed method can extract spatially well-distributed tie points compared with SIFT based method.

• Journal of Broadcast Engineering
• /
• v.22 no.2
• /
• pp.240-252
• /
• 2017

Multi-view video codec based on the High Efficiency Video Coding (MV-HEVC) has high encoding complexity because it exploits an additional reference picture for disparity compensation prediction (DCP) when the picture of dependent view is encoded. In this paper, we propose an efficient method to reduce the complexity of disparity motion vector search for the MV-HEVC. The proposed method includes the initial search point decision method using affine transform and the adaptive search range decision method. The simulation results show that the proposed method reduces the complexity of disparity motion vector search up to 90.78% with negligible coding efficiency degradation. Also the results show that the proposed method outperforms other conventional techniques reducing complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3782-3796
• /
• 2020

A three-dimensional (3D) reconstruction is an important research area in computer vision. The ability to detect and match features across multiple views of a scene is a critical initial step. The tracking matrix W obtained from a 3D reconstruction can be applied to structure from motion (SFM) algorithms for 3D modeling. We often fail to generate an acceptable number of features when processing face or medical images because such images typically contain large homogeneous regions with minimal variation in intensity. In this study, we seek to locate sufficient matching points not only in general images but also in face and medical images, where it is difficult to determine the feature points. The algorithm is implemented on an adaptive threshold value, a scale invariant feature transform (SIFT), affine SIFT, speeded up robust features (SURF), and affine SURF. By applying the algorithm to face and general images and studying the geometric errors, we can achieve quasi-dense matching points that satisfy well-functioning geometric constraints. We also demonstrate a 3D reconstruction with a respectable performance by applying a column space fitting algorithm, which is an SFM algorithm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.3
• /
• pp.127-136
• /
• 2003

In this paper, we propose a robust object tracking algorithm based on model and edge, using deformed template and Level-Set theory. The proposed algorithm can track objects in case of background variation, object flexibility and occlusions. First we design a new potential difference energy function(PDEF) composed of two terms including inter-region distance and edge values. This function is utilized to estimate and refine the object shape. The first step is to approximately estimate the shape and location of template object based on the assumption that the object changes its shape according to the affine transform. The second step is a refinement of the object shape to fit into the real object accurately, by using the potential energy map and the modified Level-Set speed function. The experimental results show that the proposed algorithm can track non-rigid objects under various environments, such as largely flexible objects, objects with large variation in the backgrounds, and occluded objects.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.9
• /
• pp.375-380
• /
• 2014

Under controlled environment, such as fixed viewpoints or consistent illumination, the performance of face recognition is usually high enough to be acceptable nowadays. Face recognition is, however, a still challenging task in real world. SIFT(Scale Invariant Feature Transformation) algorithm is scale and rotation invariant, which is powerful only in the case of small viewpoint changes. However, it often fails when viewpoint of faces changes in wide range. In this paper, we use Affine SIFT (Scale Invariant Feature Transformation; ASIFT) to detect affine invariant local descriptors for face recognition under wide viewpoint changes. The ASIFT is an extension of SIFT algorithm to solve this weakness. In our scheme, ASIFT is applied only to gallery face, while SIFT algorithm is applied to probe face. ASIFT generates a series of different viewpoints using affine transformation. Therefore, the ASIFT allows viewpoint differences between gallery face and probe face. Experiment results showed our framework achieved higher recognition accuracy than the original SIFT algorithm on FERET database.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.137-143
• /
• 2013

The high resolution satellite images are used in many fields such as weather observation, remote sensing, military facilities monitoring, cultural properties protection etc. Although satellite images are obtained in same satellite imaging system, the satellite images are degraded depending on the condition of hardware(optical device, satellite operation altitude, image sensor, etc.). Due to the fact that changing the hardware of satellite imaging system is impossible for resolution enhancement of these degraded satellite after launching a satellite, therefore the method of resolution enhancement with satellite images is necessary. In this paper the resolution is enhances by using a Super Resolution(SR) algorithm. The SR algorithm is an algorithm to enhance the resolution of an image by uniting many low resolution images, so an output image has higher resolution than using other interpolation methods. But It is difficult to obtain many images of the same area. Therefore, to solve this problem, we applied SR after by applying the affine and projection transform. As a results, we found that the images applied SR after affine and projection transform have higher resolution than the images only applied SR.

• Maxillofacial Plastic and Reconstructive Surgery
• /
• v.33 no.3
• /
• pp.233-240
• /
• 2011

Purpose: To apply a computer assisted navigation system to orthognathic surgery, a simple and efficient measuring algorithm calculation based on affine transformation was designed. A method of improving accuracy and reducing errors in orthognathic surgery by use of an optical tracking camera was studied. Methods: A total of 5 points on one surgical splint were measured and tracked by the Polaris $Vicra^{(R)}$ (Northern Digital Inc Co., Ontario, Canada) optical tracking system in two cases. The first case was to apply the transformation matrix at pre- and postoperative situations, and the second case was to apply an affine transformation only after the postoperative situation. In each situation, the predictive measuring value was changed to the final measuring value via an affine transformation algorithm and the expected coordinates calculated from the model were compared with those of the patient in the operation room. Results: The mean measuring error was $1.027{\pm}0.587$ using the affine transformation at pre- and postoperative situations and the average value after the postoperative situation was $0.928{\pm}0.549$. The farther a coordinate region was from the reference coordinates which constitutes the transform matrixes, the bigger the measuring error was found which was calculated from an affine transformation algorithm. Conclusion: Most difference errors were brought from mainly measuring process and lack of reproducibility, the affine transformation algorithm formula from postoperative measuring values by using of optic tracking system between those of model surgery and those of patient surgery can be selected as minimizing the difference error. To reduce coordinate calculation errors, minimum transformation matrices must be used and reference points which determine an affine transformation must be close to the area where coordinates are measured and calculated, as well as the reference points need to be scattered.