• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.35D no.3
• /
• pp.63-69
• /
• 1998

In this paper, a new input method is proposed to improve shift-invariant property of a photorefractive correlator andwe implemented real-time optical pattern recognition system using it. In the conventional photorefractive correlator, it is vrey difficult to satisfy the Bragg condition in the pattern recognition process. So, correlation peak is decreased heavily for the shift of input image. If a liquid crystal television(LCTV) without an anlyzer is used as input device, we can get the correlation result regardless of shift of input image because beam path is not changed during storage of holographic filter and correlation process. Also recording time of a holographic matched filter in photorefractive crystal is reduced and the correlation peak is increased because incident beam on the LCTV is transmitted completely. Therefore total optical efficiency is improved. We compared and analyzed the correlation results of proposed photorefractive correlator by computer simulation and optical experiment. We used a BaTiO$_{3}$ single crystal which has high diffraction efficiency in optical experiment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.6
• /
• pp.280-298
• /
• 2008

For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf’s center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.

• Journal of Broadcast Engineering
• /
• v.21 no.4
• /
• pp.562-568
• /
• 2016

In this paper, we focus on recognition of speed-limit signs among a few types of traffic signs because speed-limit sign is closely related to safe driving of drivers. Although histogram of oriented gradient (HOG) and local binary patterns (LBP) are representative features for object recognition, these features have a weakness with respect to rotation, in that it does not consider the rotation of the target object when generating patterns. Therefore, this paper propose the fast rotation-invariant binary patterns (FRIBP) algorithm to generate a binary pattern that is robust against rotation. The proposed FRIBP algorithm deletes an unused layer of the histogram, and eliminates the shift and comparison operations in order to quickly extract the desired feature. The proposed FRIBP algorithm is successfully applied to German Traffic Sign Recognition Benchmark (GTSRB) datasets, and the results show that the recognition capabilities of the proposed method are similar to those of other methods. Moreover, its recognition speed is considerably enhanced than related works as approximately 0.47second for 12,630 test data.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.191-201
• /
• 2005

In this paper, we propose a method to calculate camera motion parameter, which is based on efficient invariant features irrelevant to the camera veiwpoint. As feature information in previous research is variant to camera viewpoint. information content is increased, therefore, extraction of accurate features is difficult. LM(Levenberg-Marquardt) method for camera extrinsic parameter converges on the goat value exactly, but it has also drawback to take long time because of minimization process by small step size. Therefore, in this paper, we propose the extracting method of invariant features to camera viewpoint and two-stage calculation method of camera motion parameter which enhances accuracy and convergent degree by using camera motion parameter by 2D homography to the initial value of LM method. The proposed method are composed of features extraction stage, matching stage and calculation stage of motion parameter. In the experiments, we compare and analyse the proposed method with existing methods by using various indoor images to demonstrate the superiority of the proposed algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.3
• /
• pp.209-219
• /
• 2019

Satellite imagery occurs geometric and radiometric errors due to external environmental factors at the acquired time, which in turn causes false-alarm in change detection. These errors should be eliminated by geometric and radiometric corrections. In this study, we propose a methodology that automatically and simultaneously performs geometric and radiometric corrections by using the SURF (Speeded-Up Robust Feature) algorithm and the mask filter. The MPs (Matching Points), which show invariant properties between multi-temporal imagery, extracted through the SURF algorithm are used for automatic geometric correction. Using the properties of the extracted MPs, PIFs (Pseudo Invariant Features) used for relative radiometric correction are selected. Subsequently, secondary PIFs are extracted by generated mask filters around the selected PIFs. After performing automatic using the extracted MPs, we could confirm that geometric and radiometric errors are eliminated as the result of performing the relative radiometric correction using PIFs in geo-rectified images.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.187-197
• /
• 2005

In this paper, we propose a method to estimate camera motion parameter based on invariant point features, Typically, feature information of image has drawbacks, it is variable to camera viewpoint, and therefore information quantity increases after time, The LM(Levenberg-Marquardt) method using nonlinear minimum square evaluation for camera extrinsic parameter estimation also has a weak point, which has different iteration number for approaching the minimal point according to the initial values and convergence time increases if the process run into a local minimum, In order to complement these shortfalls, we, first proposed constructing feature models using invariant vector of geometry, Secondly, we proposed a two-stage calculation method to improve accuracy and convergence by using 2D homography and LM method, In the experiment, we compared and analyzed the proposed method with existing method to demonstrate the superiority of the proposed algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.51-58
• /
• 2008

In this paper, we propose a place modeling based on the distribution of scale-invariant features, and a place recognition method that recognizes places by comparing the place model in a database with the extracted features from input data. The proposed method is based on the assumption that every place can be represented by unique feature distributions that are distinguishable from others. The proposed method uses global information of each place where one place is represented by one distribution model. Therefore, the main contribution of the proposed method is that the time cost corresponding to the increase of the number of places grows linearly without increasing exponentially. For the performance evaluation of the proposed method, the different number of frames and the different number of features are used, respectively. Empirical results illustrate that our approach achieves better performance in space and time cost comparing to other approaches. We expect that the Proposed method is applicable to many ubiquitous systems such as robot navigation, vision system for blind people, wearable computing, and so on.

• Journal of applied mathematics & informatics
• /
• v.2 no.2
• /
• pp.21-46
• /
• 1995

Congestion and memory occupancy in computer system may be reduced further if new jobs are admitted only when the num-ber of jobs queued at CPU is below CPU run queue cutoff (RQ). In this paper we prove that response time of a job is invariant with respect to RQ if jobs do not communicate each other. We also demonstrate this invariance property numerically using marix-geometric methods and present an approximate method for the delay due to context switch-ing under time slicing. The approximation suggests that time slicing with constant overhead yields a throughput similar to an FCFS system without overhead.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.980-983
• /
• 1996

A new version of the discrete-time optimal FIR (finite impulse response) filter utilizing only the measurements of finite sliding estimation window is suggested for linear time-invariant state-space models. This filter is called the BLUFIR (best linear unbiased finite impulse response) filter since it provides the BLUE (best linear unbiased estimate) of the state obtained from the measurements of the estimation window. It is shown that the BLUFIR filter has the deadbeat property when there are no noises in the estimation window.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.399-401
• /
• 1989

Utilizing an interconnected set of neuron-like elements, the present study is to provide a method of parameter estimation for a second order linear time invariant system of self-tuning controller. The result from the proposed method is evaluated by comparing with those obtained by the recursive least square (RLS) identification algorithm and extended recursive least square (ERLS) algorithm, and it shows that, although the smoothness of system performance is still to be improved, the effectiveness of shorter computing time is demonstrated which may be of considerable value to real time computing.