• 한국멀티미디어학회논문지
• /
• 제24권12호
• /
• pp.1614-1623
• /
• 2021

In this paper, the purpose is evaluation of the effect of using fractal feature in machine learning based pancreatic tumor classification. We used the data that Pancreas CT series 469 case including 1995 slice of benign and 1772 slice of malignant. Feature selection is implemented from 109 feature to 7 feature by Lasso regularization. In Fractal feature, fractal dimension is obtained by box-counting method, and hurst coefficient is calculated range data of pixel value in ROI. As a result, there were significant differences in both benign and malignancies tumor. Additionally, we compared the classification performance between model without fractal feature and model with fractal feature by using support vector machine. The train model with fractal feature showed statistically significant performance in comparison with train model without fractal feature.

• Fisheries and Aquatic Sciences
• /
• 제4권1호
• /
• pp.1-9
• /
• 2001

This paper describes a procedure extracting feature vector of a target cell more precisely in the case of identifying specified cell. The classification of object type is based on feature vector such as area, complexity, centroid, rotation angle, effective diameter, perimeter, width and height of the object So, the feature vector plays very important role in classifying objects. Because the feature vectors is affected by noises and holes, it is necessary to remove noises contaminated in original image to get feature vector extraction exactly. In this paper, we propose the following method to do to get feature vector extraction exactly. First, by Otsu's optimal threshold selection method and morphological filters such as cleaning, filling and opening filters, we separate objects from background an get rid of isolated particles. After the labeling step by 4-adjacent neighborhood, the labeled image is filtered by the area filter. From this area-filtered image, feature vector such as area, complexity, centroid, rotation angle, effective diameter, the perimeter based on chain code and the width and height based on rotation matrix are extracted. To prove the effectiveness, the proposed method is applied for yeast Zygosaccharomyces rouxn. It is also shown that the experimental results from the proposed method is more efficient in measuring feature vectors than from only Otsu's optimal threshold detection method.

• 한국인터넷방송통신학회논문지
• /
• 제13권6호
• /
• pp.63-69
• /
• 2013

특징 기반 영상 인식 방법은 객체의 특징을 이용하므로 템플릿 정합에 비해 고속으로 수행될 수 있다. 불변 특징 기반의 파노라마 생성은 영상 인식의 한 응용으로서, 두 영상 간의 특징점 정합에 많은 처리 시간이 필요하다. 본 논문에서는 특징 강도 정보를 이용하여 특징점 정합 속도를 향상시키는 방법을 제안한다. SURF 알고리즘으로 특징점들을 추출한 후, 특징 강도 정보를 계산하여 강한 특징점들을 선택하여 특징 정합에 사용한다. 특징 강도가 강한 특징점들은 그렇지 않은 특징점들 보다 더 의미 있다고 볼 수 있다. 실험에서 $320{\times}240$ 크기의 칼라 영상에 대해 제안한 방법은 특징 강도 정보를 사용하지 않았을 때보다 40% 이상 처리 속도의 향상을 보였다.

• 한국측량학회지
• /
• 제30권6_2호
• /
• pp.665-672
• /
• 2012

Amid rapidly increasing imagery inputs and their volume in a remote sensing imagery database, Content-Based Image Retrieval (CBIR) is an effective tool to search for an image feature or image content of interest a user wants to retrieve. It seeks to capture salient features from a 'query' image, and then to locate other instances of image region having similar features elsewhere in the image database. For a CBIR approach that uses texture as a primary feature primitive, designing a texture descriptor to better represent image contents is a key to improve CBIR results. For this purpose, an extended feature vector combining the Gabor filter and co-occurrence histogram method is suggested and evaluated for quantitywise and qualitywise retrieval performance criterion. For the better CBIR performance, assessing similarity between high dimensional feature vectors is also a challenging issue. Therefore a number of distance metrics (i.e. L1 and L2 norm) is tried to measure closeness between two feature vectors, and its impact on retrieval result is analyzed. In this paper, experimental results are presented with several CBIR samples. The current results show that 1) the overall retrieval quantity and quality is improved by combining two types of feature vectors, 2) some feature is better retrieved by a specific feature vector, and 3) retrieval result quality (i.e. ranking of retrieved image tiles) is sensitive to an adopted similarity metric when the extended feature vector is employed.

• 대한기계학회논문집
• /
• 제17권10호
• /
• pp.2446-2456
• /
• 1993

By virtue of progress of computer science, CAD/CAM technology has been developed greatly in each area. But the problems in the integration of CAD/CAM are not yet solved completely. The reason is that the exchange of data between CAD and CAM is difficult because the domains of design and manufacturing are different in nature. To solve this problem, a feature based modeller is developed in this study, which makes it possible to communicate between design and manufacturing through features. The modeller has feature, the concept of semi-bounded plane is introduced, and implemented as a B-rep sheet model using half-edge data structure. The features are then created on a part by local modification of the boundary on a part based on feature template information. This approach generalizes the modelling of features in a geometry model.

• Journal of information and communication convergence engineering
• /
• 제1권4호
• /
• pp.209-212
• /
• 2003

In this paper, we proposed new speech feature parameter through parts-based feature extraction of speech spectrum using Non-Negative Matrix Factorization (NMF). NMF can effectively reduce dimension for multi-dimensional data through matrix factorization under the non-negativity constraints, and dimensionally reduced data should be presented parts-based features of input data. For speech feature extraction, we applied Mel-scaled filter bank outputs to inputs of NMF, than used outputs of NMF for inputs of speech recognizer. From recognition experiment result, we could confirm that proposed feature parameter is superior in recognition performance than mel frequency cepstral coefficient (MFCC) that is used generally.

• 대한전자공학회논문지
• /
• 제27권1호
• /
• pp.151-163
• /
• 1990

In this paper, rule-based stereo algorithm is explored to obtain three dimensional information of an object. In the preprocessing of the stereo matching, feature points of stereo images must be less sensitive to noise and well linked. For this purpose, a new feature points detection algorithm is developed. For performing the stereo matching which is most important process of the stereo algorithm, the feature representation of feature points is first described. The feature representation is then used for a rule-based stereo algorithm to determine the correspondence between the input stereo images. Finally, the three dimensional information of the object is determined from the correspondence of the feature points of right and left images.

• Journal of Information Technology Applications and Management
• /
• 제13권1호
• /
• pp.77-94
• /
• 2006

Case-based Reasoning (CBR) is widely used in business and industry prediction. It is suitable to solve complex and unstructured business problems. Recently, the prediction accuracy of CBR has been enhanced by not only various machine learning algorithms such as genetic algorithms, relative weighting of Artificial Neural Network (ANN) input variable but also data mining technique such as feature selection, feature weighting, feature transformation, and instance selection As a result, CBR is even more widely used today in business area. In this study, we investigated the usefulness of the CBR method in forecasting success in implementing ERP systems. We used a CBR method based on the feature weighting technique to compare the performance of three different models : MDA (Multiple Discriminant Analysis), GECBR (GEneral CBR), FWCBR (CBR with Feature Weighting supported by Analytic Hierarchy Process). The study suggests that the FWCBR approach is a promising method for forecasting of successful ERP implementation in Small and Medium sized Enterprises.

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

Feature selection is one of the most challenging problems of pattern recognition and data mining. In this paper, a feature selection algorithm based on an improved version of binary differential evolution is proposed. The method simultaneously optimizes two feature selection criteria, namely, set approximation accuracy of rough set theory and relational algebra based derived score, in order to select the most relevant feature subset from an entire feature set. Superiority of the proposed method over other state-of-the-art methods is confirmed by experimental results, which is conducted over seven publicly available benchmark datasets of different characteristics such as a low number of objects with a high number of features, and a high number of objects with a low number of features.

• 대한음성학회지:말소리
• /
• 제67호
• /
• pp.167-180
• /
• 2008

This paper describes a novel spectral envelope conversion method based on Gaussian mixture model (GMM). The core of this paper is rearranging source feature vectors in input space to the transformed feature vectors in feature space for the better modeling of GMM of source and target features. The quality of statistical modeling is dependent on the distribution and the dimension of data. The proposed method transforms both of the distribution and dimension of data and gives us the chance to model the same data with different configuration. Because the converted feature vectors should be on the input space, only source feature vectors are rearranged in the feature space and target feature vectors remain unchanged for the joint pdf of source and target features using KPCA. The experimental result shows that the proposed method outperforms the conventional GMM-based conversion method in various training environment.