• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.7
• /
• pp.1341-1347
• /
• 2007

The displacement field (Optical flow) has been calculated by bottom-up approaches based on local processing. In contrast with them, in this paper, a top-down approach based on expanding in turn from the lowest order mode the whole motion in an image pair of sequential images is proposed. The intensity of medical images usually represents a quantity which is conserved during the motion. Hence sequential images are ideally related by a coordinate transformation. The displacement field can be determined from the generalized moments of the two images. The equations which transform arbitrary generalized moments from a source image to a target image are expressed as a function of the displacement field. The appareent displacement field is then computed iteratively by a projection method which utilizes the functional derivatives of the linearized moment equations. This method is demonstrated using a pair of sequential heart images. For comparative evaluation, we applied Horn and Schunck's method, a standard multigrid method, and our proposed algorithm to sequential image.

• Journal of Convergence for Information Technology
• /
• v.11 no.10
• /
• pp.20-26
• /
• 2021

In this paper, we studied the rotation angle estimation methods required for image alignment in an image recognition environment. In particular, a rotation angle estimation method applicable to a low specification embedded-based environment was proposed and compared with the existing method using complex moment. The proposed method estimates the rotation angle through similarity mathcing of the 1D projection profile along the radial axis after converting an image into polar coordinates. In addition, it is also possible to select a method of using vector sum of the projection profile, which more simplifies the calculation. Through experiments conducted on binary pattern images and gray-scale images, it was shown that the estimation error of the proposed method is not significantly different from that of complex moment-based method and requires less computation and system resources. For future expansion, a study on how to match the rotation center in gray-scale images will be needed.

• The Journal of the Korea Contents Association
• /
• v.17 no.3
• /
• pp.42-52
• /
• 2017

Panorama image is a single image obtained by combining images taken at several viewpoints through matching of corresponding points. Existing panoramic image generation methods that find the corresponding points are extracting local invariant feature points in each image to create descriptors and using descriptor matching algorithm. In the case of video sequence, frames may be a lot, so therefore it may costs significant amount of time to generate a panoramic image by the existing method and it may has done unnecessary calculations. In this paper, we propose a method to quickly create a single panoramic image from a video sequence. By assuming that there is no significant changes between frames of the video such as in locally, we use the FAST algorithm that has good repeatability and high-speed calculation to extract feature points and the Lucas-Kanade algorithm as each feature point to track for find the corresponding points in surrounding neighborhood instead of existing descriptor matching algorithms. When homographies are calculated for all images, homography is changed around the center image of video sequence to warp images and obtain a planar panoramic image. Finally, the spherical panoramic image is obtained by performing inverse transformation of the spherical coordinate system. The proposed method was confirmed through the experiments generating panorama image efficiently and more faster than the existing methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.5
• /
• pp.183-191
• /
• 2010

Unique and invariant biometric characteristics have been used for secure user authentication. Storing original biometric data is not acceptable due to privacy and security concerns of biometric technology. In order to enhance the security of the biometric data, the cancelable biometrics was introduced. Using revocable and non-invertible transformation, the cancelable biometrics can provide a way of more secure biometric authentication. In this paper, we present a new cancelable bits extraction method for the facial data. For the feature extraction, the Subpattern-based Principle Component Analysis (PCA) is adopted. The Subpattern-based PCA divides a whole image into a set of partitioned subpatterns and extracts principle components from each subpattern area. The feature extracted by using Subpattern-based PCA is discretized with a helper data based method. The elements of the obtained bits are evaluated and ordered according to a measure based on the fisher criterion. Finally, the most discriminative bits are chosen as the biometric bits string and used for authentication of each identity. Even if the generated bits string is compromised, new bits string can be generated simply by changing the helper data. Because, the helper data utilizes partial information of the feature, the proposed method does not reveal privacy sensitive biometric information of the user. For a security evaluation of the proposed method, a scenario in which the helper is compromised by an adversary is also considered.

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

We propose a framework for grouping photographic advertising images that employs a hierarchical indexing scheme based on efficient feature combinations. The study provides one specific application of effective tools for monitoring photographic advertising information through online and offline channels. Specifically, it develops a preprocessor for advertising image information tracking. We consider both global features that contain general information on the overall image and local features that are based on local image characteristics. The developed local features are invariant under image rotation and scale, the addition of noise, and change in illumination. Thus, they successfully achieve reliable matching between different views of a scene across affine transformations and exhibit high accuracy in the search for matched pairs of identical images. The method works with global features in advance to organize coarse clusters that consist of several image groups among the image data and then executes fine matching with local features within each cluster to construct elaborate clusters that are separated by identical image groups. In order to decrease the computational time, we apply a conventional clustering method to group images together that are similar in their global characteristics in order to overcome the drawback of excessive time for fine matching time by using local features between identical images.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.97-107
• /
• 2009

In image-based gait recognition systems, physical factors, such as the camera angle and the lens distortion, and environmental factors such as illumination determines the performance of recognition. In this paper we present a robust gait recognition method by compensating various types of image distortions. The proposed method is compared with existing gait recognition algorithm with consideration of both physical and environmental distortion factors in the input image. More specifically, we first present an efficient compensation algorithm of image distortion by using the projective transform, and test the feasibility of the proposed algorithm by comparing the recognition performances with and without the compensation process. Proposed method gives universal gait data which is invariant to both distance and environment. Gained data improved gait recognition rate about 41.5% in indoor image and about 55.5% in outdoor image. Proposed method can be used effectively in database(DB) construction, searching and tracking of specific objects.

• Korean Journal of Food Science and Technology
• /
• v.24 no.2
• /
• pp.165-170
• /
• 1992

The creep behavior of gels made with $30{\sim}45%$ gelatinized rice starch was measured over a wide range of temperature. Compressive creep curves of rice starch gels conformed to a six element mechanical model consisting of one Hookean, two Voigt and one Newtonian component. The creep compliance of gels decreased with increasing starch concentrations. Among viscoelastic constants of the mechanical model, elastic modulus was mainly influenced by the change of starch concentrations. The concentration-invariant compliance curve was obtained by reduction to 38% using reduction parameter $a_{c}$. The creep compliance curves of 45% starch gels increased with temperature, which indicated that rice starch gels became softer and less rigid with increasing temperature. When the compliance at $20^{\circ}C$ was set as a reference curve, creep compliance data for 45% gels at various temperature could be superimposed as a continuous smooth curve. The apparent activation energies of 45% rice starch gels calculated by the modified WLF equation were not intrinsic, but decreased as temperature increased.

• Communications of Mathematical Education
• /
• v.37 no.4
• /
• pp.569-590
• /
• 2023

The purpose of this case study is to compare and analyze the covariational reasoning levels of two middle school students revealed in the process of solving and generalizing algebra word problems. A class was conducted with two middle school students who had not learned quadratic equations in school mathematics. During the retrospective analysis after the class was over, a noticeable difference between the two students was revealed in solving algebra word problems, including situations where speed changes. Accordingly, this study compared and analyzed the level of covariational reasoning revealed in the process of solving or generalizing algebra word problems including situations where speed is constant or changing, based on the theoretical framework proposed by Thompson & Carlson(2017). As a result, this study confirmed that students' covariational reasoning levels may be different even if the problem-solving methods and results of algebra word problems are similar, and the similarity of problem-solving revealed in the process of solving and generalizing algebra word problems was analyzed from a covariation perspective. This study suggests that in the teaching and learning algebra word problems, rather than focusing on finding solutions by quickly converting problem situations into equations, activities of finding changing quantities and representing the relationships between them in various ways.