• Journal of Computing Science and Engineering
• /
• 제11권4호
• /
• pp.121-129
• /
• 2017

Feature selection has been widely established as an efficient technique for microarray data analysis. Feature selection aims to search for the most important feature/gene subset of a given dataset according to its relevance to the current target. Unsupervised feature selection is considered to be challenging due to the lack of label information. In this paper, we propose a novel method for unsupervised feature selection, which incorporates embedded learning and $l_{2,1}-norm$ sparse regression into a framework to select genes in microarray data analysis. Local tangent space alignment is applied during embedded learning to preserve the local data structure. The $l_{2,1}-norm$ sparse regression acts as a constraint to aid in learning the gene weights correlatively, by which the proposed method optimizes for selecting the informative genes which better capture the interesting natural classes of samples. We provide an effective algorithm to solve the optimization problem in our method. Finally, to validate the efficacy of the proposed method, we evaluate the proposed method on real microarray gene expression datasets. The experimental results demonstrate that the proposed method obtains quite promising performance.

• 전기학회논문지
• /
• 제59권5호
• /
• pp.990-995
• /
• 2010

Harris corner detector is commonly used to detect feature points for recognizing 2-D or 3-D objects. However, the feature points calculated from both of query and target objects need to be same positions to guarantee accurate recognitions. In order to check the positions of calculated feature points, we generate a Huffman tree which is based on adjacent feature values as inputs. However, the structures of two Huffman trees will be same as long as both of a query and targets have same feature values no matter how different their positions are. In this paper, we sort feature values and calculate the Euclidean distances of coordinates between two adjacent feature values. The Huffman Tree is generated with these Euclidean distances. As a result, the information of point locations can be included in the generated Huffman tree. This is the main strategy for accurate recognitions. We call this system as the HRM(Hybrid Retrieval Machine). This system works very well even when artificial random noises are added to original data. HRM can be used to recognize biological data such as proteins, and it will curtail the costs which are required to biological experiments.

• Nuclear Engineering and Technology
• /
• 제53권12호
• /
• pp.3944-3951
• /
• 2021

Several reasons such as no free lunch theorem indicate that there is not a universal Feature selection (FS) technique that outperforms other ones. Moreover, some approaches such as using synthetic dataset, in presence of large number of FS techniques, are very tedious and time consuming task. In this study to tackle the issue of dependency of estimation accuracy on the selected FS technique, a methodology based on the heterogeneous ensemble is proposed. The performance of the major learning algorithms of neural network (i.e. the FFNN-BR, the FFNN-LM) in combination with the diverse FS techniques (i.e. the NCA, the F-test, the Kendall's tau, the Pearson, the Spearman, and the Relief) and different combination techniques of the heterogeneous ensemble (i.e. the Min, the Median, the Arithmetic mean, and the Geometric mean) are considered. The target parameters/transients of Bushehr nuclear power plant (BNPP) are examined as the case study. The results show that the Min combination technique gives the more accurate estimation. Therefore, if the number of FS techniques is m and the number of learning algorithms is n, by the heterogeneous ensemble, the search space for acceptable estimation of the target parameters may be reduced from n × m to n × 1. The proposed methodology gives a simple and practical approach for more reliable and more accurate estimation of the target parameters compared to the methods such as the use of synthetic dataset or trial and error methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권6호
• /
• pp.1964-1981
• /
• 2014

An improved Mean-Shift (MS) tracker called joint CB-LBWH, which uses a combined weighted-histogram scheme of CBWH (Corrected Background-Weighted Histogram) and LBWH (likelihood-based Background-Weighted Histogram), is presented. Joint CB-LBWH is based on the notion that target representation employs both feature saliency and confidence to form a compound weighted histogram criterion. As the more prominent and confident features mean more significant for tracking the target, the tuned histogram by joint CB-LBWH can reduce the interference of background in target localization effectively. Comparative experimental results show that the proposed joint CB-LBWH scheme can significantly improve the efficiency and robustness of MS tracker when heavy occlusions and complex scenes exist.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권5호
• /
• pp.2590-2606
• /
• 2017

Generally, research of classical image classification algorithms assume that training data and testing data are derived from the same domain with the same distribution. Unfortunately, in practical applications, this assumption is rarely met. Aiming at the problem, a domain adaption image classification approach based on multi-sparse representation is proposed in this paper. The existences of intermediate domains are hypothesized between the source and target domains. And each intermediate subspace is modeled through online dictionary learning with target data updating. On the one hand, the reconstruction error of the target data is guaranteed, on the other, the transition from the source domain to the target domain is as smooth as possible. An augmented feature representation produced by invariant sparse codes across the source, intermediate and target domain dictionaries is employed for across domain recognition. Experimental results verify the effectiveness of the proposed algorithm.

• 한국정보통신학회논문지
• /
• 제16권10호
• /
• pp.2137-2142
• /
• 2012

수중환경 하에서 표적을 탐지하고 식별하는 문제는 군사적인 목적은 물론 비군사적 목적으로도 많은 연구가 수행되어 왔다. 수중환경에서의 수중음향 신호가 시간 공간적으로 특성이 변화하며 천해 다중경로 환경을 반영하는 복잡한 특성을 보이는 점으로 인해 능동 표적인식 기술은 매우 어려운 기술로 여겨져 왔다. 또한 실제 데이터 수집의 어려움이 따르게 된다. 본 논문에서는 수중환경 하에서 능동 표적신호를 합성, 특징추출 및 표적식별을 수행할 수 있는 시뮬레이터를 구현하였다. 표적신호의 합성에는 하이라이트 모델과 3차원 모델을 사용하였으며, 표적신호의 식별을 위해서는 다중각도에 기반한 은닉 마코프모델을 사용하였다.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2005년도 BIOINFO 2005
• /
• pp.23-28
• /
• 2005

The high-dimensionality and insufficiency of gene expression profiles and proteomic profiles makes feature selection become a critical step in efficiently building accurate models for cancer problems based on such data sets. In this paper, we use a method, called Discrete Function Learning algorithm, to find discriminatory feature vectors based on information theory. The target feature vectors contain all or most information (in terms of entropy) of the class attribute. Two data sets are selected to validate our approach, one leukemia subtype gene expression data set and one ovarian cancer proteomic data set. The experimental results show that the our method generalizes well when applied to these insufficient and high-dimensional data sets. Furthermore, the obtained classifiers are highly understandable and accurate.

• 제어로봇시스템학회논문지
• /
• 제8권4호
• /
• pp.327-332
• /
• 2002

The main problems of computational complexity in object tracking are definition of objects, segmentations and identifications in non-structured environments with erratic movements and collisions of objects. The object's information as a region that corresponds to objects without discriminating among objects are considered. This paper describes the algorithm that, automatically and efficiently, recognizes and keeps tracks of interest-regions selected by users in video or camera image sequences. The block-based feature matching method is used for the region tracking. This matching process considers only dominant feature points such as corners and curved-edges without requiring a pre-defined model of objects. Experimental results show that the proposed method provides above 96% precision for correct region matching and real-time process even when the objects undergo scaling and 3-dimen-sional movements In successive image sequences.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1550-1552
• /
• 2005

In this paper, we have designed a Fingerprint Recognition System based on the Embedded LINUX. The fingerprint is captured using the AS-S2 semiconductor sensor. To extract a feature vector we transform the image of the fingerprint into a column vector. The image is row-wise filtered with the low-pass filter of the Haar wavelet. The feature vectors of the different fingerprints are compared by computing with the probabilistic neural network the distance between the target feature vector and the stored feature vectors in advance. The system implemented consists of a server PC based on the LINUX and a client based on the Embedded LINUX. The client is a Tynux box-x board using a PXA-255 CPU. The algorithm is simple and fast in computing and comparing the fingerprints.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.204-206
• /
• 2005

In this paper, we have designed a Fingerprint Recognition System based on the Embedded LINUX. The fingerprint is captured using the AS-S2 semiconductor sensor. To extract a feature vector we transform the image of t10he fingerprint into a column vector. The image is row-wise filtered with the low-pass filter of the Haar wavelet. The feature vectors of the different fingerprints are compared by computing with the probabilistic neural network the distance between the target feature vector and the stored feature vectors in advance. The system implemented consists of a server PC based on the LINUX and a client based on the Embedded LINUX. The client is a Tynux box-x board using a PXA-255 CPU. The algorithm is simple and fast in computing and comparing the fingerprints.