• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.9-11
• /
• 2005

We propose a new content-based image retrieval using a block color co-occurrence matrix (BCCM) and pattern correlogram. In the proposed method, the color feature vectors are extracted by using BCCM that represents the probability of the co-occurrence of two mean colors within blocks. Also the pattern feature vectors are extracted by using pattern correlogram which is combined with spatial correlation of pattern. In the proposed pattern correlogram method. after block-divided image is classified into 48 patterns with respect to the change of the RGB color of the image, joint probability between the same pattern from the surrounding blocks existing at the fixed distance and the center pattern is calculated. Experimental results show that the proposed method can outperform the conventional methods as regards the precision and the size of the feature vector dimension.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.100-105
• /
• 1992

Texture is one of the important characteristics that has been used to identify objects or regions of interest in an image. Tire tread patterns can be considered as a kind of texture, and these are classified with a texture analysis method. In this sense, this paper proposes a new algorithm for the classification of tire tread pattern. For the classification, cooccurrence matrix for the binary image is used. The performances are tested by experimentally 8 different tire tread pattern and the robustness is examined by including some kinds on noise.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1253-1272
• /
• 2010

In this paper, we propose a new affine shape adaptation scheme for the affine invariant feature detector, in which the convergence stability is still an opening problem. This paper examines the relation between the integration scale matrix of next iteration and the current second moment matrix and finds that the convergence stability of the method can be improved by adjusting the relation between the two matrices instead of keeping them always proportional as proposed by previous methods. By estimating and updating the shape of the integration kernel and differentiation kernel in each iteration based on the anisotropy of the current second moment matrix, we propose a coarse-to-fine affine shape adaptation scheme which is able to adjust the pace of convergence and enable the process to converge smoothly. The feature matching experiments demonstrate that the proposed approach obtains an improvement in convergence ratio and repeatability compared with the current schemes with relatively fixed integration kernel.

• Journal of Korean Ophthalmic Optics Society
• /
• v.3 no.1
• /
• pp.201-207
• /
• 1998

It was theoretically calculated the image position and size using matrix to obtain the reflection pattern for eye's cornea and crystalline, and made system to measure the reflection pattern by three light sources and a reflex camera. Hyperopia and myopia were measured by reflect pattern using single light source at retina, and cornea and curvature of crystalline were measured by the reflection pattern using double light sources.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.940-947
• /
• 2015

This paper presents the region of interest pattern image extraction method on a display printed matrix pattern. Proposed method can not use conventional method such as laser, ultrasonic waves and touch sensor. It searches feature point and rotation angle using luminance and pattern reliable feature points of input image, and then it extracts region of interest. In order to extract region of interest, we simulate proposed method using pattern image written various angles on display panel. The proposed method makes progress using the OpenCV and the window program, and was designed using Verilog-HDL and was verified through the FPGA Board(xc6vlx760) of Xilinx.

• Current Optics and Photonics
• /
• v.5 no.6
• /
• pp.686-698
• /
• 2021

A camouflaged encryption scheme based on Hadamard matrix and ghost imaging is proposed. In the process of the encryption, an orthogonal matrix is used as the projection pattern of ghost imaging to improve the definition of the reconstructed images. The ciphertext of the secret image is constrained to the camouflaged image. The key of the camouflaged image is obtained by the method of sparse decomposition by principal component orthogonal basis and the constrained ciphertext. The information of the secret image is hidden into the information of the camouflaged image which can improve the security of the system. In the decryption process, the authorized user needs to extract the key of the secret image according to the obtained random sequences. The real encrypted information can be obtained. Otherwise, the obtained image is the camouflaged image. In order to verify the feasibility, security and robustness of the encryption system, binary images and gray-scale images are selected for simulation and experiment. The results show that the proposed encryption system simplifies the calculation process, and also improves the definition of the reconstructed images and the security of the encryption system.

• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.219-224
• /
• 2017

This paper is to introduce an application of face recognition algorithm in parallel. We have experiments of 25 images with different motions and simulated the image recognitions; grouping of the image vectors, image normalization, calculating average image vectors, etc. We also discuss an analysis of the related eigen-image vectors and a parallel algorithm. To develop the parallel algorithm, we propose a new type of initial matrices for eigenvalue problem. If A is a symmetric matrix, initial matrices for eigen value problem are investigated: the "optimal" one, which minimize ${\parallel}C-A{\parallel}_F$ and the "super optimal", which minimize ${\parallel}I-C^{-1}A{\parallel}_F$. In this paper, we present a general new approach to the design of an initial matrices to solving eigenvalue problem based on the new optimal investigating C with preserving the characteristic of the given matrix A. Fast all resulting can be inverted via fast transform algorithms with O(N log N) operations.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.144-146
• /
• 2006

The Data Matrix of two-dimensional bar codes is a new technology capable of holding relatively large amounts of data compared to the conventional one-dimensional bar code which is just a key that can access detailed information to the host computer database. A secret key is used to prevent a watermark from malicious attacks. We encoded copyright information into a Data Matrix bar code for encoding process and it was spread a pseudo random pattern using owner key. We embedded a randomized watermark into the image using watermark's embedding position, pattern generated with a secret key. The experimental results have shown that the proposed scheme has good quality and is very robust to various attacks, such as JPEG compression and noise. Also the performance of the proposed scheme is verified by comparing the copyright information with the information which is extracted from a bar code scantier.

• Journal of Information Display
• /
• v.12 no.2
• /
• pp.85-87
• /
• 2011

The contrast ratio is one of the most important performance parameters for display devices. The general method of measuring the contrast ratio is to determine the ratio of the full-screen white pattern to the full-screen black pattern, according to the Video Electronics Standards Association standard. Real TV images seldom have these images, however, and the conventional method does not reflect the true performance of the display in actual use. In this paper, a new contrast ratio measurement method that uses image patterns is proposed, to demonstrate that active matrix organic light-emitting diode TVs have a higher contrast than LED (LCD) TVs.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.5
• /
• pp.1041-1046
• /
• 2009

In this paper, we proposed a robust watermark scheme for image based on SVD(Singular Value Transform) and Triplet. First, the original image is decomposed by using 3-level DWT, and then used the singular values changed for embedding and extracting of the watermark sequence in LL3 band. Since the matrix of singular values is not easily altered with various signal processing noises, the embedded watermark sequence has the ability to withstand various signal processing noise attacks. Nevertheless, this method does not guarantee geometric transformation(such as rotation, cropping, etc.) because the geometric transformation changes the matrix size. In this case, the watermark sequence cannot be extracted. To compensate for the above weaknesses, a method which uses the triplet for embedding a barcode image watermark in the middle of frequency band is proposed. In order to generate the barcode image watermark, the pattern of the watermark sequence embedded in a LL3 band is used. According to this method, the watermark information can be extracted from attacked images.