• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.283-288
• /
• 2011

This paper have proposed an object retrieval using the corners area variability based on correlogram. The proposed algorithm is processed as follows. First, the corner points of the object in an image are extracted and then the feature vectors are obtained. It are rearranged according to the number dimension and consist of sequence vectors. And the similarity based on the maximum of sequence vectors is measured. The proposed technique is invariant to the rotation or the transfer of the objects and more efficient in case that the objects present simple structure. In simulation that use Wang's database, the method presents that the recall property is improved by 0.03% and more than the standard corner patch histogram.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.269-281
• /
• 2001

This thesis deals with a novel font-dependent Hangul recognition algorithm invariant to position translation, scaling, and rotation using circular pattern vectors. The proposed algorithm removes noise from input letters using binary morphology and generates the circular pattern vectors. The generated circular pattern vectors represent spatial distributions on several concentric circles from the center of gravity in a given letter. Then the algorithm selects the letter minimizing the distance between the reference vectors and the generated circular pattern vectors. In order to estimate performances of the proposed algorithm, the completed Batang Hangul 2,350 letters were used as test images with scaling and rotational transformations. Experimental results show that the proposed algorithm are better than conventional algorithm using the ring projection in the recognition rates of Hangul letters with scaling and rotational transformation.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.137-142
• /
• 1990

A theory for the synthesis of a SDF including the filter modulation is suggested. In the filter synthesis, the iteration equation was used to iterate trial solution vectors. A computer simulation of the fSDF method using threshold binary images of the flight objects over a range of aspect angles was performed for POF and BPOF. The constructed fSDF filters are capable of obtaining the specified peak correlation response within a 1.7%-4.0% error range, after several iterations. However, the conventional pSDF/POFs, BPOFs are not. The results indicate POFs and BPOs can be made to perform well for distortion invariant optical pattern recognition using the fSDF method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.255-262
• /
• 1998

This paper presents a translation, rotation and scale invariant methodology for the recognition of closed planar shape images using the bispectrum of a contour sequence and the learning vector quantization(LVQ) neural classifier. The contour sequences obtained from the closed planar images represent the Euclidean distance between the centroid and all boundary pixels of the shape, and are related to the overall shape of the images. The higher order spectra based on third order cumulants is applied to tihs contour sample to extract fifteen bispectral feature vectors for each planar image. There feature vector, which are invariant to shape translation, rotation and scale transformation, can be used to represent two0dimensional planar images and are fed into a neural network classifier. The LVQ architecture is chosen as a neural classifier because the network is easy and fast to train, the structure is relatively simple. The experimental recognition processes with eight different hapes of aircraft images are presented to illustrate the high performance of this proposed method even the target images are significantly corrupted by noise.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.587-599
• /
• 1995

This paper proposes a method for pattern recognition using spectral analysis and a hybrid genetic-neural-fuzzy networks. The feature vectors using spectral analysis on contour sequences of 2-D images are extracted, and the vectors are not effected by translation, rotation and scale variance. A combined model using the advantages of conventional method is proposed, those are supervised learning BP, global searching genetic algorithm, and unsupervised learning fuzzy c-method. The proposed method is applied to 10 aircraft recognition to confirm the performance of the method. The experimental results show that the proposed method is better accuracy than conventional method using BP or fuzzy c-method, and learning speed is enhanced.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.1
• /
• pp.73-79
• /
• 1998

In this paper, a new traffic sign detection algorithm.. and a symbol recognition algorithm are proposed. For traffic sign detection, a dominant color transform is introduced, which serves as a tool of highlighting a dominant primary color, while discarding the other two primary colors. For symbol recognition, the curvilinear shape distribution on a circle centered on the centroid of symbol, called a circular pattern vector, is used as a spatial feature of symbol. The circular pattern vector is invariant to scaling, translation, and rotation. As simulation results, the effectiveness of traffic sign detection and recognition algorithms are confirmed, and it is shown that group of circular patter vectors based on concentric circles is more effective than circular pattern vector of a single circle for a given equivalent number of elements of vectors.

• Kyungpook Mathematical Journal
• /
• v.58 no.3
• /
• pp.489-494
• /
• 2018

The first purpose of this note is to generalize two nice theorems of H. J. Kim concerning hyperinvariant subspaces for certain classes of operators on Hilbert space, proved by him by using the technique of "extremal vectors". Our generalization (Theorem 1.2) is obtained as a consequence of a new theorem of the present authors, and doesn't utilize the technique of extremal vectors. The second purpose is to use this theorem to obtain the existence of hyperinvariant subspaces for a class of $2{\times}2$ operator matrices (Theorem 3.2).

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.520-522
• /
• 2014

Due to the availability of easy-to-use and powerful image editing tools, the authentication of digital images cannot be taken for granted and it gives rise to non-intrusive forgery detection problem because all imaging devices do not embed watermark. Forgery detection plays an important role in this case. In this paper, an effective framework for passive-blind method for copy-move image forgery detection is proposed, based on Gabor filter which is robust to illumination, rotation invariant, robust to scale. For the detection, the suspicious image is selected and Gabor wavelet is applied from whole scale space and whole direction space. We will extract the mean and the standard deviation as the texture features and feature vectors. Finally, a distance is calculated between two textures feature vectors to determine the forgery, and the decision will be made based on that result.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.124-135
• /
• 2021

Object detection is a fundamental yet challenging task in computer vision that plays an important role in object recognition, tracking, scene analysis and understanding. This paper aims to propose a multiproperty fusion algorithm for moving object detection. First, we build a scale-invariant feature transform (SIFT) vector field and analyze vectors in the SIFT vector field to divide vectors in the SIFT vector field into different classes. Second, the distance of each class is calculated by dispersion analysis. Next, the target and contour can be extracted, and then we segment the different images, reversal process and carry on morphological processing, the moving objects can be detected. The experimental results have good stability, accuracy and efficiency.

• Communications of the Korean Mathematical Society
• /
• v.23 no.3
• /
• pp.349-356
• /
• 2008

In this paper, we generalize the Catalan number to the (n, k)-th Catalan numbers and find a combinatorial description that the (n, k)-th Catalan numbers is equal to the number of partitions of n(k-1)+2 polygon by (k+1)-gon where all vertices of all (k+1)-gons lie on the vertices of n(k-1)+2 polygon.