• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.750-755
• /
• 1998

Due to the temporal spatial correlation of the image sequence, the motion vector of a block is highly related to the motion vectors of its adjacent blocks in the same image frame. If we can obtain useful and enough information from the adjacent motion vectors, the total number of search points used to find the motion vector of the block may be reduced significantly. Using that idea, an efficient fuzzy prediction search (FPS) algorithm for block motion estimation is proposed in this paper. Based on the fuzzy inference process, the FPS can determine the motion vectors of image blocks quickly and correctly.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2254-2263
• /
• 2000

This paper proposes an efficient predictive image-compression technique based on vector quantization of blocks of pels. In the proposed method edge contents of blocks control the selection of predictors and block shapes as well. The maximum number of bits assigned to quantizers has been in creased to 3bits/pel from 1/5bits/pel, the setting employed by forerunners in predictive vector quantization of images. This increase prevents the saturation in SNR observed in their results in high bit rates. The variable block shape is instrumental in eh reconstruction of edges. The adaptive procedure is controlled by means of he standard deviation ofp rediction errors generated by a default predictor; the standard deviation address a decision table which can be set up beforehand. eh proposed method is characterized by overall improvements in image quality over A-VQ-PE and A-DCT VQ, both of which are known for their efficient use of vector quantizers.

• Spatial Information Research
• /
• v.2 no.2
• /
• pp.197-205
• /
• 1994

In this paper, we present a vectorization algorithm for finding a vector image from a raster image of the land registered map which is used as the base map for various applications, and an automatic region creation algorithm for generating every re¬gion automatically from the vector image. We describe an ARM (automatic geographical entity recognition and modeling software) which carries out the recognition and process¬ing of geographical entities automatically using those algorithms.

• ETRI Journal
• /
• v.29 no.5
• /
• pp.700-702
• /
• 2007

We present a relevance feedback approach based on multi-class support vector machine (SVM) learning and cluster-merging which can significantly improve the retrieval performance in region-based image retrieval. Semantically relevant images may exhibit various visual characteristics and may be scattered in several classes in the feature space due to the semantic gap between low-level features and high-level semantics in the user's mind. To find the semantic classes through relevance feedback, the proposed method reduces the burden of completely re-clustering the classes at iterations and classifies multiple classes. Experimental results show that the proposed method is more effective and efficient than the two-class SVM and multi-class relevance feedback methods.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.11
• /
• pp.153-162
• /
• 1995

When vector quantization is used in low rate image coding (e.g., R<0.5), the primary problem is the tremendous computational complexity which is required to search the whole codebook to find the closest codevector to an input vector. Since the number of code vectors in a vector quantizer is given by an exponential function of the dimension. i.e., L=2$^{nR}$ where Rn. To alleviate this problem, a multiple shell structure of hypercube feature maps (MSSHFM) is proposed. A binary HFM of k-dimension is composed of nodes at hypercube vertices and a multiple shell architecture is constructed by surrounding the k-dimensional hfm with a (k+1)-dimensional HFM. Such a multiple shell construction of nodes inherently has a complete tree structure in it and an efficient partial search scheme can be applied with drastically reduced computational complexity, computer simulations of still image coding were conducted and the validity of the proposed method has been verified.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.327-328
• /
• 2007

A contour shape matching based pixel motion estimation is proposed. The pixel motion information is very useful to compensate the motion artifact generated at the specific gray level contours in the moving image for subfield gray-scale display devices. In this motion estimation method, the gray level boundary contours are extracted from the input image. Then using contour shape matching, the most similar contour in next frame is found, and the contour is divided into segment unit. The pixel motion vector is estimated from the displacement of the each segment in the contour by segment matching. From this method, more precise motion vector can be estimated and this method is more robust to image motion with rotation or from illumination variations.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.18 no.2
• /
• pp.1-12
• /
• 2000

This paper proposes a new algorithm classifing same hues in order toe estimate the spectral reflectance of object from 3 band color image information. To estimate the spectral reflectance of object, the conventional estimation methods are required of 5 or 9 band digital color values. The 5 or 9 band image acquisition systems are required of 5 or 3 times same work for color image acquisition process. To solve the above problems, we propose a new method that can be estimated spectra reflectance estimation of object. The proposed method is to classify same hues corresponding a color stimulus, by using hue angle and chroma vector of a color stimulus. The classified same hues are used as the population corresponding a color stimulus. The range of same hue is estimated by the cumulative proportional ration according to the number of basis function.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.6
• /
• pp.1011-1018
• /
• 2006

Due to rapid development of mobile communication terminals and various requests of their users, multimedia information including image information has been the basis of mobile communication contents. In order to use vectored image information efficiently, which is more favorable than bit-mapped image information when transmission delay time and costs are considered, efficient vector graphics supporting systems are needed. Therefore, vector graphics kernel systems have been proposed and standardization attempts have been made in order to increase interoperability. In this paper, a vector graphics kernel based on OpenVG is designed and implemented. OpenVG was proposed as a standard vector graphics kernel by Khronos Group recently. The implemented vector graphics kernel, named by alexVG, is developed on a PC emulator as well as on a development board equipped with an ARM processor. In addition, performance tests are made in order to verify its functions.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.4
• /
• pp.48-57
• /
• 1992

This paper addresses the estimation of the shift vector from aerial image sequences. The conventional feature-based and area-based matching methods are simulated for determining the suitable image registration scheme. Computer simulations show that the feature-based matching schemes based on the co-occurrence matrix, autoregressive model, and edge information do not give a reliable matching for aerial image sequences which do not have a suitable statistical model or significant features. In area-based matching methods we try various similarity functions for a matching measure and discuss the factors determining the matching accuracy. To reduce the estimation error of the shift vector we propose the reference window selection scheme. We also discuss the performance of the proposed algorithm based on the simulation results.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.793-806
• /
• 2002

Feature-based similarity retrieval become an important research issue in image database systems. The features of image data are useful to discrimination of images. In this paper, we propose the highspeed k-Nearest Neighbor search algorithm based on Self-Organizing Maps. Self-Organizing Maps (SOM) provides a mapping from high dimensional feature vectors onto a two-dimensional space. The mapping preserves the topology of the feature vectors. The map is called topological feature map. A topological feature map preserves the mutual relations (similarity) in feature spaces of input data. and clusters mutually similar feature vectors in a neighboring nodes. Each node of the topological feature map holds a node vector and similar images that is closest to each node vector. In topological feature map, there are empty nodes in which no image is classified. We experiment on the performance of our algorithm using color feature vectors extracted from images. Promising results have been obtained in experiments.