• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.2
• /
• pp.151-159
• /
• 2002

The method of accumulating a sequence of focused images is usually used for reconstruction of 3D object\\`s shape. To acquire a focused image, the conventional methods must calculate the focus measures of all pixels resulting in a long measurement time. This paper proposes a new method of reducing the computation time spent for deciding the focused pixels in the input image, which predicts the area in the image to calculate the focus measure based on a priori information on the object to be measured. The proposed algorithm estimates the area to consider in the next measurement based on the focused area in the present measurement. As the focus measure, Laplacian measure was used in this paper and the experiments have shown that the preposed algorithm may significantly reduce the calculation time. Although, as implied, this algorithm can be applied to only simple objects at this stage, advanced representation schemes will eliminate the restrictions on application domain.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.11
• /
• pp.1421-1426
• /
• 2001

Nowadays, as the quantity of multimedia information increases rapidly, an efficient management for multimedia has become more important. In this paper, to index and search multimedia contents efficiently, we designed the algorithm searching specific image and saving the extracted image using the semantic information extraction scheme based on contents and it is one of the schemes to indexing and searching of video data. After extracting the RGB information from input image, while all frames of video is inspected sequentially, the specific image is saved through referring to the position and distribution of contents from the collection scheme of RGB range. In case of using the proposed image extraction algorithm, because only saved video is searched instead of the whole the searching time can be reduced.

• Journal of information and communication convergence engineering
• /
• v.5 no.4
• /
• pp.339-345
• /
• 2007

Video transcoding is a technique used to convert a compressed input video stream with an arbitrary format, size, and bitrate into a different attribute video stream different attributes to provide a efficient video streaming service for the customers is dispersed in the heterogeneous networks. Specifically, frames deletion occur in a transcoding scheme that exploits the adjustment of frame rate, and at this time, the loss in temporal relation among frames due to frame deletion is compensated for the prediction of motion estimation by reusing motion vectors in the would-be deleted frames. But the processing time for transcoding don't have an improvement as much as our expectation because transcoding is done only within the transcoder. So in this paper, we propose a new transcoding algorithm based on prediction period to improve transcoding-related processing time. For this, we also modify the existing encoder so as to adjust dynamically frame rate based on the prediction period and deletion period of frames. To check how the proposed algorithm works nicely, we implement a video streaming system with the new transcoder and encoder to which it is applied. The result of the performance test shows that the streaming system with proposed algorithm improve 60% above in processing time and also PSNR have a good performance while the quality of pictures is preserved.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.2
• /
• pp.41-51
• /
• 2014

This paper describes a method to estimate the noise power using the minimum statistics approach, which was originally proposed for audio processing. The proposed minimum statistics-based method separates a noisy image into multiple frequency bands using the three-level discrete wavelet transform. By assuming that the output of the high-pass filter contains both signal detail and noise, the proposed algorithm extracts the region of pure noise from the high frequency band using an appropriate threshold. The region of pure noise, which is free from the signal detail part and the DC component, is well suited for minimum statistics condition, where the noise power can be extracted easily. The proposed algorithm reduces the computational load significantly through the use of a simple processing architecture without iteration with an estimation accuracy greater than 90% for strong noise at 0 to 40dB SNR of the input image. Furthermore, the well restored image can be obtained using the estimated noise power information in parametric image restoration algorithms, such as the classical parametric Wiener or ForWaRD image restoration filters. The experimental results show that the proposed algorithm can estimate the noise power accurately, and is particularly suitable for fast, low-cost image restoration or enhancement applications.

• Proceedings of the KIEE Conference
• /
• 2008.07a
• /
• pp.1959-1960
• /
• 2008

The Logic Built In Self Test (LBIST) technique is substantially applied in chip design in most many semiconductor company in despite of unavoidable overhead like an increase in dimension and time delay occurred as it used. Currently common LBIST software uses the MISR (Multiple Input Shift Register) However, it has many considerations like defining the X-value (Unknown Value), length and number of Scan Chain, Scan Chain and so on for analysis of result occurred in the process. So, to solve these problems, common LBIST software provides the solution method automated. Nevertheless, these problems haven't been solved automatically by Tri-state Bus in logic circuit yet. This paper studies the algorithm that it also suggest algorithm that reduce additional circuits and time delay as matching of pattern about 2-type circuits which are CUT(circuit Under Test) and additional circuits so that the designer can detect the wrong location in CUT: Circuit Under Test.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.6
• /
• pp.650-662
• /
• 1989

In this paper, a new algorithm for feature extraction and classification of recognizing Hanguel patterns is proposed. Inputed patterns classify into six basic formal patterns and divided into subregion of Hanguel phoneme and extract the crook feature from position information of the each subregion. Hanguel patterns are defined and are made of the indexed-sequence file using these crook features points. Hanguel patterns are recognized by retrievignt ehses two files such as feature indexed-sequence file and standard dictionary file. Thi paper show that the algorithm is very simple and easily construct the software system. Experimental result presents the output of feature extraction and grouping of input patterns. Proposed algorithm extract the crooked feature using distance transformation method within the rectangle of enclosure the characters. That uses the informationof relative position feature. It represents the 97% of recognition ratio.

• Journal of Internet Computing and Services
• /
• v.17 no.3
• /
• pp.19-24
• /
• 2016

The minimum error entropy (MEE) algorithm is known to be superior in impulsive noise environment. In this paper, the optimum solutions and properties of the MEE algorithm are studied in regard to the robustness against impulsive noise. From the analysis of the behavior of optimum weight and factors related with mitigation of influence from large errors, it is revealed that the magnitude controlled input entropy plays the main role of keeping optimum weight of MEE undisturbed from impulsive noise. In the simulation, the optimum weight of MEE is shown to be the same as that of MSE criterion.

• Journal of Sensor Science and Technology
• /
• v.25 no.6
• /
• pp.431-434
• /
• 2016

Currently, the radial basis function network (RBFN) and various other neural networks are employed to classify gases using chemical sensors arrays, and their performance is steadily improving. In particular, the identification performance of the RBFN algorithm is being improved by optimizing parameters such as the center, width, and weight, and improved algorithms such as the radial basis function network-stochastic gradient (RBFN-SG) and radial basis function network-normalized stochastic gradient (RBFN-NSG) have been announced. In this study, we optimized the number of centers, which is one of the parameters of the RBFN-NSG algorithm, and observed the change in the identification performance. For the experiment, repeated measurement data of 8 samples were used, and the elbow method was applied to determine the optimal number of centers for each sample of input data. The experiment was carried out in two cases(the only one center per sample and the optimal number of centers obtained by elbow method), and the experimental results were compared using the mean square error (MSE). From the results of the experiments, we observed that the case having an optimal number of centers, obtained using the elbow method, showed a better identification performance than that without any optimization.

• Journal of Multimedia Information System
• /
• v.9 no.1
• /
• pp.1-10
• /
• 2022

China is a big country in animal fur industry. The total production and consumption of fur are increasing year by year. However, the recognition of fur in the fur production process still mainly relies on the visual identification of skilled workers, and the stability and consistency of products cannot be guaranteed. In response to this problem, this paper proposes a feature fusion-based animal fur recognition network on the basis of typical convolutional neural network structure, relying on rapidly developing deep learning techniques. This network superimposes texture feature - the most prominent feature of fur image - into the channel dimension of input image. The output feature map of the first layer convolution is inverted to obtain the inverted feature map and concat it into the original output feature map, then Leaky ReLU is used for activation, which makes full use of the texture information of fur image and the inverted feature information. Experimental results show that the algorithm improves the recognition accuracy by 9.08% on Fur_Recognition dataset and 6.41% on CIFAR-10 dataset. The algorithm in this paper can change the current situation that fur recognition relies on manual visual method to classify, and can lay foundation for improving the efficiency of fur production technology.

• Journal of Information Processing Systems
• /
• v.20 no.4
• /
• pp.491-500
• /
• 2024

In hopes of resolving the issue of poor quality of information input for teaching spoken English online, the study creates an English teaching assistance model based on a recognition algorithm named dynamic time warping (DTW) and relies on automated voice recognition technology. In hopes of improving the algorithm's efficiency, the study modifies the speech signal's time-domain properties during the pre-processing stage and enhances the algorithm's performance in terms of computational effort and storage space. Finally, a simulation experiment is employed to evaluate the model application's efficacy. The study's revised DTW model, which achieves recognition rates of above 95% for all phonetic symbols and tops the list for cloudy consonant recognition with rates of 98.5%, 98.8%, and 98.7% throughout the three tests, respectively, is demonstrated by the study's findings. The enhanced model for DTW voice recognition also presents higher efficiency and requires less time for training and testing. The DTW model's KS value, which is the highest among the models analyzed in the KS value analysis, is 0.63. Among the comparative models, the model also presents the lowest curve position for both test functions. This shows that the upgraded DTW model features superior voice recognition capabilities, which could significantly improve online English education and lead to better teaching outcomes.