• Title/Summary/Keyword: Preprocessing-based

Search Result 1,002, Processing Time 0.03 seconds

Design of Robust Face Recognition System Realized with the Aid of Automatic Pose Estimation-based Classification and Preprocessing Networks Structure

  • Kim, Eun-Hu;Kim, Bong-Youn;Oh, Sung-Kwun;Kim, Jin-Yul
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.6
    • /
    • pp.2388-2398
    • /
    • 2017
  • In this study, we propose a robust face recognition system to pose variations based on automatic pose estimation. Radial basis function neural network is applied as one of the functional components of the overall face recognition system. The proposed system consists of preprocessing and recognition modules to provide a solution to pose variation and high-dimensional pattern recognition problems. In the preprocessing part, principal component analysis (PCA) and 2-dimensional 2-directional PCA ($(2D)^2$ PCA) are applied. These functional modules are useful in reducing dimensionality of the feature space. The proposed RBFNNs architecture consists of three functional modules such as condition, conclusion and inference phase realized in terms of fuzzy "if-then" rules. In the condition phase of fuzzy rules, the input space is partitioned with the use of fuzzy clustering realized by the Fuzzy C-Means (FCM) algorithm. In conclusion phase of rules, the connections (weights) are realized through four types of polynomials such as constant, linear, quadratic and modified quadratic. The coefficients of the RBFNNs model are obtained by fuzzy inference method constituting the inference phase of fuzzy rules. The essential design parameters (such as the number of nodes, and fuzzification coefficient) of the networks are optimized with the aid of Particle Swarm Optimization (PSO). Experimental results completed on standard face database -Honda/UCSD, Cambridge Head pose, and IC&CI databases demonstrate the effectiveness and efficiency of face recognition system compared with other studies.

AutoFe-Sel: A Meta-learning based methodology for Recommending Feature Subset Selection Algorithms

  • Irfan Khan;Xianchao Zhang;Ramesh Kumar Ayyasam;Rahman Ali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.7
    • /
    • pp.1773-1793
    • /
    • 2023
  • Automated machine learning, often referred to as "AutoML," is the process of automating the time-consuming and iterative procedures that are associated with the building of machine learning models. There have been significant contributions in this area across a number of different stages of accomplishing a data-mining task, including model selection, hyper-parameter optimization, and preprocessing method selection. Among them, preprocessing method selection is a relatively new and fast growing research area. The current work is focused on the recommendation of preprocessing methods, i.e., feature subset selection (FSS) algorithms. One limitation in the existing studies regarding FSS algorithm recommendation is the use of a single learner for meta-modeling, which restricts its capabilities in the metamodeling. Moreover, the meta-modeling in the existing studies is typically based on a single group of data characterization measures (DCMs). Nonetheless, there are a number of complementary DCM groups, and their combination will allow them to leverage their diversity, resulting in improved meta-modeling. This study aims to address these limitations by proposing an architecture for preprocess method selection that uses ensemble learning for meta-modeling, namely AutoFE-Sel. To evaluate the proposed method, we performed an extensive experimental evaluation involving 8 FSS algorithms, 3 groups of DCMs, and 125 datasets. Results show that the proposed method achieves better performance compared to three baseline methods. The proposed architecture can also be easily extended to other preprocessing method selections, e.g., noise-filter selection and imbalance handling method selection.

Effect of Plasma Treatment Times on the Adhesion of Cu/Ni Thin Film to Polyimide (폴리이미드와 Cu/Ni층과의 계면결합력에 미치는 플라즈마 처리 시간 효과)

  • Woo, Tae-Gyu;Park, Il-Song;Jung, Kwang-Hee;Jeon, Woo-Yong;Seol, Kyeong-Won
    • Korean Journal of Metals and Materials
    • /
    • v.49 no.8
    • /
    • pp.657-663
    • /
    • 2011
  • This study represents the results of the peel strength and surface morphology according to the preprocessing times of polyimide (PI) in a Cu/Ni/PI structure flexible copper clad laminate production process based on the polyimide. Field emission scanning electron microscopy, X-ray diffraction, and X-ray photoelectron spectroscopy were used to analyze the surface morphology, crystal structure, and interface binding structure of sputtered Ni, Cu, and electrodeposited copper foil layers. The surface roughness of Ni, Cu deposition layers and the crystal structure of electrodeposited Cu layers were varied according to the preprocessing times. In the RF plasma times that were varied by 100-600 seconds in a preprocessing process, the preprocessing applied by about 300-400 seconds showed a homogeneous surface morphology in the metal layers and that also represented high peel strength for the polyimide. Considering the effect of peel strength on plastic deformation, preprocessing times can reasonably be at about 400 seconds.

Framework for Efficient Web Page Prediction using Deep Learning

  • Kim, Kyung-Chang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.12
    • /
    • pp.165-172
    • /
    • 2020
  • Recently, due to exponential growth of access information on the web, the importance of predicting a user's next web page use has been increasing. One of the methods that can be used for predicting user's next web page is deep learning. To predict next web page, web logs are analyzed by data preprocessing and then a user's next web page is predicted on the output of the analyzed web logs using a deep learning algorithm. In this paper, we propose a framework for web page prediction that includes methods for web log preprocessing followed by deep learning techniques for web prediction. To increase the speed of preprocessing of large web log, a Hadoop based MapReduce programming model is used. In addition, we present a web prediction system that uses an efficient deep learning technique on the output of web log preprocessing for training and prediction. Through experiment, we show the performance improvement of our proposed method over traditional methods. We also show the accuracy of our prediction.

SMD Detection and Classification Using YOLO Network Based on Robust Data Preprocessing and Augmentation Techniques

  • NDAYISHIMIYE, Fabrice;Lee, Joon Jae
    • Journal of Multimedia Information System
    • /
    • v.8 no.4
    • /
    • pp.211-220
    • /
    • 2021
  • The process of inspecting SMDs on the PCB boards improves the product quality, performance and reduces frequent issues in this field. However, undesirable scenarios such as assembly failure and device breakdown can occur sometime during the assembly process and result in costly losses and time-consuming. The detection of these components with a model based on deep learning may be effective to reduce some errors during the inspection in the manufacturing process. In this paper, YOLO models were used due to their high speed and good accuracy in classification and target detection. A SMD detection and classification method using YOLO networks based on robust data preprocessing and augmentation techniques to deal with various types of variation such as illumination and geometric changes is proposed. For 9 different components of data provided from a PCB manufacturer company, the experiment results show that YOLOv4 is better with fast detection and classification than YOLOv3.

A Study on Segmentation of Uterine Cervical Pap-Smears Images Using Neural Networks (신경 회로망을 이용한 자궁 경부 세포진 영상의 영역 분할에 관한 연구)

  • 김선아;김백섭
    • Journal of Biomedical Engineering Research
    • /
    • v.22 no.3
    • /
    • pp.231-239
    • /
    • 2001
  • This paper proposes a region segmenting method for the Pap-smear image. The proposed method uses a pixel classifier based on neural network, which consists of four stages : preprocessing, feature extraction, region segmentation and postprocessing. In the preprocessing stage, brightness value is normalized by histogram stretching. In the feature extraction stage, total 36 features are extracted from $3{\times}3$ or $5{\times}5$ window. In the region segmentation stage, each pixel which is associated with 36 features, is classified into 3 groups : nucleus, cytoplasm and background. The backpropagation network is used for classification. In the postprocessing stage, the pixel, which have been rejected by the above classifier, are re-classified by the relaxation algorithm. It has been shown experimentally that the proposed method finds the nucleus region accurately and it can find the cytoplasm region too.

  • PDF

RECONSTRUCT10N AND NAVIGATION OF CYLINDRICAL OBJECTS FROM MEDICAL IMAGES

  • Park, Yoo-Joo;Kim, Myoung-Hee;Min, Kyung-Ha
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2001.10a
    • /
    • pp.223-230
    • /
    • 2001
  • This paper proposes a new contour detection method and adaptive reconstruction scheme for the cylindrical organs, such as blood vessels or arteries. Furthermore, we present java-based navigation controller which has been built to examine the inside of cylindrical objects. Tn the preprocessing procedure, a few preprocessing image filters are applied in order to remove unwanted artifacts from the medical images and to estimate threshold values for the object of interest. We define a context-free grammar, which is proper fur properties of contours of cylindrical objects. In the next procedure, we extract contours using advanced radial gradient method and represent contours as context-free grammar derivation trees. We build polygons between two contours efficiently by traversing the derivations trees of the contours. We fly through the reconstructed virtual models using java-based navigation controller and VRML viewer.

  • PDF

Regularized Channel Inversion for Multiple-Antenna Users in Multiuser MIMO Downlink (다중 안테나 다중 사용자 하향 링크 환경에서 Regularized Channel Inversion 기법)

  • Lee, Heun-Chul;Lee, Kwang-Won;Lee, In-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3A
    • /
    • pp.260-268
    • /
    • 2010
  • Channel inversion is one of the simplest techniques for multiuser downlink systems with single-antenna users. In this paper, we extend the regularized channel inversion technique developed for the single-antenna user case to multiuser multiple-input multiple-output (MIMO) channels with multiple-antenna users. We first employ the multiuser preprocessing to project the multiuser signals near the null space of the unintended users based on the MMSE criterion, and then the single-user preprocessing is applied to the decomposed MIMO interference channels. In order to reduce the complexity, we focus on non-iterative solutions for the multiuser transmit beamforming and use a linear receiver based on an MMSE criterion. Simulation results show that the proposed scheme outperforms existing joint iterative algorithms in most multiuser configurations.

Recursive Nullspace Calculation for Multiuser MIMO Systems (다중 사용자 MIMO 시스템을 위한 순차적 영공간 계산)

  • Joung, Jin-Gon;Lee, Yong-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12A
    • /
    • pp.1238-1243
    • /
    • 2007
  • The computational complexity for the zero-forcing (ZF)-based multiuser (MU) multiple-input multiple-output(MIMO) preprocessing matrices can be immoderately large as the number of transmit antennas or users increases. In this paper, we show that the span of singular vector space of a matrix can be obtained from the singular vectors of the parted rows of that matrix with computational saving and propose a computationally efficient recursive-algorithm for achieving the ZF-based preprocessing matrices. Analysis about the complexities shows that a new recursive-algorithm can lighten the computational load.

P2P Group Search Algorithm based on Preprocessing Search (전처리 검색 기반의 P2P 그룹 검색 알고리즘)

  • Kim, Boon-Hee
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.5
    • /
    • pp.522-527
    • /
    • 2010
  • In the connected environment by network, clients shared resources as that requested the file that a server had, but P2P system is alternative because of the overload of servers. To improve the performance of this P2P system, we are studying about that. In this study, we can improve a usability for users using P2P search system, and suggest a group search algorithm based on a preprocessing search.