• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.2
• /
• pp.78-88
• /
• 2009

In many face recognition problems, the number of available images is limited compared to the dimension of the input space which is usually equal to the number of pixels. This problem is called as the 'small sample size' problem and regularization methods are typically used to solve this problem in feature extraction methods such as LDA. By using regularization methods, the modified within class matrix becomes nonsingu1ar and LDA can be performed in its original form. However, in the process of adding a scaled version of the identity matrix to the original within scatter matrix, the scale factor should be set heuristically and the performance of the recognition system depends on highly the value of the scalar factor. By using the proposed resampling method, we can generate a set of images similar to but slightly different from the original image. With the increased number of images, the small sample size problem is alleviated and the classification performance increases. Unlike regularization method, the resampling method does not suffer from the heuristic setting of the parameter producing better performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1698-1706
• /
• 1997

In this paper, we envisioned a multimedia object recognition system processing and combinig information from all available sources, such as 2-D, 3-D, color and sound data. Out of the overall system, we proposed 3-D information extraction and object recognition methods. Firstly, surfaces are classified by z-gradient from the range data, surface features are extracted using the intersection of normal vectors. Also feature relationship such as intersection angle and distance is established between the surfaces. Secondly, recognition is accomplished by matching process which is improtant step in the image understanding systems. Matching process is very improtant procedures because of more general and more efficient method is needed in the field of multimedia sytem. Therefore, we focused the proposal of matching process and in this article, first of all, we deal with the matching process of the 3-D object. Similarity measures are calculated.

• The Journal of the Korea Contents Association
• /
• v.17 no.5
• /
• pp.624-632
• /
• 2017

Automatic butterfly identification using images is one of the interesting research fields because it helps the related researchers studying species diversity and evolutionary and development process a lot in this field. The performance of the butterfly species identification system is dependent heavily on the quality of selected features. In this paper, we propose color intensity (CI) entropy by using the distribution of color intensities in a butterfly image. We show color intensity entropy can increase the recognition rate by 10% if it is used together with previously suggested branch length similarity entropy. In addition, the performance comparison with other features such as Eigenface, 2D Fourier transform, and 2D wavelet transform is conducted against several well known machine learning methods.

• International Journal of Computer Science & Network Security
• /
• v.21 no.8
• /
• pp.288-296
• /
• 2021

Automated face recognition in a runtime environment is gaining more and more important in the fields of surveillance and urban security. This is a difficult task keeping in mind the constantly volatile image landscape with varying features and attributes. For a system to be beneficial in industrial settings, it is pertinent that its efficiency isn't compromised when running on roads, intersections, and busy streets. However, recognition in such uncontrolled circumstances is a major problem in real-life applications. In this paper, the main problem of face recognition in which full face is not visible (Occlusion). This is a common occurrence as any person can change his features by wearing a scarf, sunglass or by merely growing a mustache or beard. Such types of discrepancies in facial appearance are frequently stumbled upon in an uncontrolled circumstance and possibly will be a reason to the security systems which are based upon face recognition. These types of variations are very common in a real-life environment. It has been analyzed that it has been studied less in literature but now researchers have a major focus on this type of variation. Existing state-of-the-art techniques suffer from several limitations. Most significant amongst them are low level of usability and poor response time in case of any calamity. In this paper, an improved face recognition system is developed to solve the problem of occlusion known as FRS-OCC. To build the FRS-OCC system, the color and texture features are used and then an incremental learning algorithm (Learn++) to select more informative features. Afterward, the trained stack-based autoencoder (SAE) deep learning algorithm is used to recognize a human face. Overall, the FRS-OCC system is used to introduce such algorithms which enhance the response time to guarantee a benchmark quality of service in any situation. To test and evaluate the performance of the proposed FRS-OCC system, the AR face dataset is utilized. On average, the FRS-OCC system is outperformed and achieved SE of 98.82%, SP of 98.49%, AC of 98.76% and AUC of 0.9995 compared to other state-of-the-art methods. The obtained results indicate that the FRS-OCC system can be used in any surveillance application.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.4
• /
• pp.43-49
• /
• 2019

The wired and wireless Internet is a useful window to easily acquire various types of media data. On the other hand, the public can easily get the media data including the object to which the personal information is exposed, which is a social problem. In this paper, we propose a method to robustly detect a target object that has exposed personal information using a learning algorithm and effectively block the detected target object area. In the proposed method, only the target object containing the personal information is detected using a neural network-based learning algorithm. Then, a grid-like mosaic is created and overlapped on the target object area detected in the previous step, thereby effectively blocking the object area containing the personal information. Experimental results show that the proposed algorithm robustly detects the object area in which personal information is exposed and effectively blocks the detected area through mosaic processing. The object blocking method presented in this paper is expected to be useful in many applications related to computer vision.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.969-976
• /
• 2019

A lightweight artificial intelligence hardware has made great strides in many application areas. In general, a lightweight artificial intelligence system consist of lightweight artificial intelligence engine and preprocessor including feature selection, generation, extraction, and normalization. In order to achieve optimal performance in broad range of applications, lightweight artificial intelligence system needs to choose a good preprocessing function and set their respective hyper-parameters. This paper proposes a unified framework for a lightweight artificial intelligence system and utilization method for finding models with optimal performance to use on a given dataset. The proposed unified framework can easily generate a model combined with preprocessing functions and lightweight artificial intelligence engine. In performance evaluation using handwritten image dataset and fall detection dataset measured with inertial sensor, the proposed unified framework showed building optimal artificial intelligence models with over 90% test accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.2991-3007
• /
• 2022

Two dimensional locality preserving projections (2D-LPP) is an improved algorithm of 2D image to solve the small sample size (SSS) problems which locality preserving projections (LPP) meets. It's able to find the low dimension manifold mapping that not only preserves local information but also detects manifold embedded in original data spaces. However, 2D-LPP is simple and elegant. So, inspired by the comparison experiments between two dimensional linear discriminant analysis (2D-LDA) and linear discriminant analysis (LDA) which indicated that matrix based methods don't always perform better even when training samples are limited, we surmise 2D-LPP may meet the same limitation as 2D-LDA and propose a novel matrix exponential method to enhance the performance of 2D-LPP. 2D-MELPP is equivalent to employing distance diffusion mapping to transform original images into a new space, and margins between labels are broadened, which is beneficial for solving classification problems. Nonetheless, the computational time complexity of 2D-MELPP is extremely high. In this paper, we replace some of matrix multiplications with multiple multiplications to save the memory cost and provide an efficient way for solving 2D-MELPP. We test it on public databases: random 3D data set, ORL, AR face database and Polyu Palmprint database and compare it with other 2D methods like 2D-LDA, 2D-LPP and 1D methods like LPP and exponential locality preserving projections (ELPP), finding it outperforms than others in recognition accuracy. We also compare different dimensions of projection vector and record the cost time on the ORL, AR face database and Polyu Palmprint database. The experiment results above proves that our advanced algorithm has a better performance on 3 independent public databases.

• The Journal of Korea Robotics Society
• /
• v.17 no.4
• /
• pp.463-476
• /
• 2022

In this paper, we propose a table tennis posture classification system using a cooperative robot to develop a table tennis robot that can be trained like a real game. The most ideal table tennis robot would be a robot with a high joint driving speed and a high degree of freedom. Therefore, in this paper, we intend to use a cooperative robot with sufficient degrees of freedom to develop a robot that can be trained like a real game. However, cooperative robots have the disadvantage of slow joint driving speed. These shortcomings are expected to be overcome through quick recognition. Therefore, in this paper, we try to quickly classify the opponent's posture to overcome the slow joint driving speed. To this end, learning about dynamic postures was conducted using image data as input, and finally, three classification models were created and comparative experiments and evaluations were performed on the designated dynamic postures. In conclusion, comparative experimental data demonstrate the highest classification accuracy and fastest classification speed in classification models using MLP (Multi-Layer Perceptron), and thus demonstrate the validity of the proposed algorithm.

• Journal of IKEEE
• /
• v.28 no.1
• /
• pp.65-71
• /
• 2024

This paper proposes a neural network that can reduce the number of parameters while reducing matching errors in occluded regions to increase the accuracy of depth maps in stereo matching. Stereo matching-based object recognition is utilized in many fields to more accurately recognize situations using images. When there are many objects in a complex image, an occluded area is generated due to overlap between objects and occlusion by background, thereby lowering the accuracy of the depth map. To solve this problem, existing research methods that create context information and combine it with the cost volume or RoIselect in the occluded area increase the complexity of neural networks, making it difficult to learn and expensive to implement. In this paper, we create a depthwise seperable neural network that enhances regional feature extraction before cost volume generation, reducing the number of parameters and proposing a neural network that is robust to occlusion errors. Compared to PSMNet, the proposed neural network reduced the number of parameters by 30%, improving 5.3% in color error and 3.6% in test loss.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.1
• /
• pp.96-110
• /
• 2017

Most of vehicle detection studies using the existing general lens or wide-angle lens have a blind spot in the rear detection situation, the image is vulnerable to noise and a variety of external environments. In this paper, we propose a method that is detection in harsh external environment with noise, blind spots, etc. First, using a fish-eye lens will help minimize blind spots compared to the wide-angle lens. When angle of the lens is growing because nonlinear radial distortion also increase, calibration was used after initializing and optimizing the distortion constant in order to ensure accuracy. In addition, the original image was analyzed along with calibration to remove fog and calibrate brightness and thereby enable detection even when visibility is obstructed due to light and dark adaptations from foggy situations or sudden changes in illumination. Fog removal generally takes a considerably significant amount of time to calculate. Thus in order to reduce the calculation time, remove the fog used the major fog removal algorithm Dark Channel Prior. While Gamma Correction was used to calibrate brightness, a brightness and contrast evaluation was conducted on the image in order to determine the Gamma Value needed for correction. The evaluation used only a part instead of the entirety of the image in order to reduce the time allotted to calculation. When the brightness and contrast values were calculated, those values were used to decided Gamma value and to correct the entire image. The brightness correction and fog removal were processed in parallel, and the images were registered as a single image to minimize the calculation time needed for all the processes. Then the feature extraction method HOG was used to detect the vehicle in the corrected image. As a result, it took 0.064 seconds per frame to detect the vehicle using image correction as proposed herein, which showed a 7.5% improvement in detection rate compared to the existing vehicle detection method.