• Title/Summary/Keyword: Feature modeling

Search Result 639, Processing Time 0.027 seconds

Low Dimensional Modeling and Synthesis of Head-Related Transfer Function (HRTF) Using Nonlinear Feature Extraction Methods (비선형 특징추출 기법에 의한 머리전달함수(HRTF)의 저차원 모델링 및 합성)

  • Seo, Sang-Won;Kim, Gi-Hong;Kim, Hyeon-Seok;Kim, Hyeon-Bin;Lee, Ui-Taek
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.5
    • /
    • pp.1361-1369
    • /
    • 2000
  • For the implementation of 3D Sound Localization system, the binaural filtering by HRTFs is generally employed. But the HRTF filter is of high order and its coefficients for all directions have to be stored, which imposes a rather large memory requirement. To cope with this, research works have centered on obtaining low dimensional HRTF representations without significant loss of information and synthesizing the original HRTF efficiently, by means of feature extraction methods for multivariate dat including PCA. In these researches, conventional linear PCA was applied to the frequency domain HRTF data and using relatively small number of principal components the original HRTFs could be synthesized in approximation. In this paper we applied neural network based nonlinear PCA model (NLPCA) and the nonlinear PLS repression model (NLPLS) for this low dimensional HRTF modeling and analyze the results in comparison with the PCA. The NLPCA that performs projection of data onto the nonlinear surfaces showed the capability of more efficient HRTF feature extraction than linear PCA and the NLPLS regression model that incorporates the direction information in feature extraction yielded more stable results in synthesizing general HRTFs not included in the model training.

  • PDF

Secondary Teachers' Perspectives on Mathematical Modeling and Modeling Mathematics: Discovery, Appreciation, and Conflict

  • Ahmad M. Alhammouri;Joseph DiNapoli
    • Research in Mathematical Education
    • /
    • v.26 no.3
    • /
    • pp.203-233
    • /
    • 2023
  • Recent international reform movements call for attention on modeling in mathematics classrooms. However, definitions and enactment principles are unclear in policy documents. In this case study, we investigated United States high-school mathematics teachers' experiences in a professional development program focused on modeling and its enactment in schools. Our findings share teachers' experiences around their discovery of different conceptualizations, appreciations, and conflicts as they envisioned incorporating modeling into classrooms. These experiences show how professional development can be designed to engage teachers with forms of modeling, and that those experiences can inspire them to consider modeling as an imperative feature of a mathematics program.

Generative Process Planning through Feature Recognition (특징형상 인식을 통한 창성적 자동 공정계획 수립 - 복합특징형상 분류를 중심을 -)

  • 이현찬;이재현
    • Korean Journal of Computational Design and Engineering
    • /
    • v.3 no.4
    • /
    • pp.274-282
    • /
    • 1998
  • A feature is a local shape of a product directly related to the manufacturing process. The feature plays a role of the bridge connecting CAD and CAM. In the process planning for he CAM, information on manufacturing is required. To get the a manufacturing information from CAD dat, we need to recognize features. Once features are recognized, they are used as an input for the process planning. In this paper, we thoroughly investigate the composite features, which are generated by interacting simple features. The simple features in the composite feature usually have precedence relation in terms of process sequence. Based on the reason for the precedence relation, we classify the composite features for the process planning. In addition to the precedence relation, approach direction is used as an input for the process planning. In the process planning, the number of set-up orientations are minimized whole process sequence for the features are generated. We propose a process planning algorithm based on the topological sort and breadth-first search of graphs. The algorithn is verified using sample products.

  • PDF

Dynamic Facial Expression of Fuzzy Modeling Using Probability of Emotion (감정확률을 이용한 동적 얼굴표정의 퍼지 모델링)

  • Kang, Hyo-Seok;Baek, Jae-Ho;Kim, Eun-Tai;Park, Mignon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.1
    • /
    • pp.1-5
    • /
    • 2009
  • This paper suggests to apply mirror-reflected method based 2D emotion recognition database to 3D application. Also, it makes facial expression of fuzzy modeling using probability of emotion. Suggested facial expression function applies fuzzy theory to 3 basic movement for facial expressions. This method applies 3D application to feature vector for emotion recognition from 2D application using mirror-reflected multi-image. Thus, we can have model based on fuzzy nonlinear facial expression of a 2D model for a real model. We use average values about probability of 6 basic expressions such as happy, sad, disgust, angry, surprise and fear. Furthermore, dynimic facial expressions are made via fuzzy modelling. This paper compares and analyzes feature vectors of real model with 3D human-like avatar.

Extraction of Chord and Tempo from Polyphonic Music Using Sinusoidal Modeling

  • Kim, Do-Hyoung;Chung, Jae-Ho
    • The Journal of the Acoustical Society of Korea
    • /
    • v.22 no.4E
    • /
    • pp.141-149
    • /
    • 2003
  • As music of digital form has been widely used, many people have been interested in the automatic extraction of natural information of music itself, such as key of a music, chord progression, melody progression, tempo, etc. Although some studies have been tried, consistent and reliable results of musical information extraction had not been achieved. In this paper, we propose a method to extract chord and tempo information from general polyphonic music signals. Chord can be expressed by combination of some musical notes and those notes also consist of some frequency components individually. Thus, it is necessary to analyze the frequency components included in musical signal for the extraction of chord information. In this study, we utilize a sinusoidal modeling, which uses sinusoids corresponding to frequencies of musical tones, and show reliable chord extraction results of sinusoidal modeling. We could also find that the tempo of music, which is the one of remarkable feature of music signal, interactively supports the chord extraction idea, if used together. The proposed scheme of musical feature extraction is able to be used in many application fields, such as digital music services using queries of musical features, the operation of music database, and music players mounting chord displaying function, etc.

ECG Denoising by Modeling Wavelet Sub-Band Coefficients using Kernel Density Estimation

  • Ardhapurkar, Shubhada;Manthalkar, Ramchandra;Gajre, Suhas
    • Journal of Information Processing Systems
    • /
    • v.8 no.4
    • /
    • pp.669-684
    • /
    • 2012
  • Discrete wavelet transforms are extensively preferred in biomedical signal processing for denoising, feature extraction, and compression. This paper presents a new denoising method based on the modeling of discrete wavelet coefficients of ECG in selected sub-bands with Kernel density estimation. The modeling provides a statistical distribution of information and noise. A Gaussian kernel with bounded support is used for modeling sub-band coefficients and thresholds and is estimated by placing a sliding window on a normalized cumulative density function. We evaluated this approach on offline noisy ECG records from the Cardiovascular Research Centre of the University of Glasgow and on records from the MIT-BIH Arrythmia database. Results show that our proposed technique has a more reliable physical basis and provides improvement in the Signal-to-Noise Ratio (SNR) and Percentage RMS Difference (PRD). The morphological information of ECG signals is found to be unaffected after employing denoising. This is quantified by calculating the mean square error between the feature vectors of original and denoised signal. MSE values are less than 0.05 for most of the cases.

Effective Feature Selection Model for Network Data Modeling (네트워크 데이터 모델링을 위한 효과적인 성분 선택)

  • Kim, Ho-In;Cho, Jae-Ik;Lee, In-Yong;Moon, Jong-Sub
    • Journal of Broadcast Engineering
    • /
    • v.13 no.1
    • /
    • pp.92-98
    • /
    • 2008
  • Network data modeling is a essential research for the evaluation for intrusion detection systems performance, network modeling and methods for analyzing network data. In network data modeling, real data from the network must be analyzed and the modeled data must be efficiently composed to reflect a sufficient amount of the original data. In this parer the useful elements of real network data were quantified from packets captured from a huge network. Futhermore, a statistical analysis method was used to find the most effective element for efficiently classifying the modeled data.

A Feature-Oriented Requirement Tracing Method with Value Analysis (가치분석을 통한 휘처 기반의 요구사항 추적 기법)

  • Ahn, Sang-Im;Chong, Ki-Won
    • The Journal of Society for e-Business Studies
    • /
    • v.12 no.4
    • /
    • pp.1-15
    • /
    • 2007
  • Traceability links are logical links between individual requirements and other system elements such as architecture descriptions, source code, and test cases. These are useful for requirements change impact analysis, requirements conflict analysis, and requirements consistency checking. However, establishing and maintaining traceability links places a big burden since complex systems have especially yield an enormous number of various artifacts. We propose a feature-oriented requirements tracing method to manage requirements with cost benefit analysis, including value consideration and intermediate catalysis using features. Our approach offers two contributions to the study of requirements tracing: (1)We introduce feature modeling as intermediate catalysis to generate traceability links between user requirements and implementation artifacts. (2)We provide value consideration with cost and efforts to identify traceability links based on prioritized requirements, thus assigning a granularity level to each feature. In this paper, we especially present the results of a case study which is carried out in Apartment Ubiquitous Platform to integrate and connect home services in an apartment complex in details.

  • PDF

An Extended Generative Feature Learning Algorithm for Image Recognition

  • Wang, Bin;Li, Chuanjiang;Zhang, Qian;Huang, Jifeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.8
    • /
    • pp.3984-4005
    • /
    • 2017
  • Image recognition has become an increasingly important topic for its wide application. It is highly challenging when facing to large-scale database with large variance. The recognition systems rely on a key component, i.e. the low-level feature or the learned mid-level feature. The recognition performance can be potentially improved if the data distribution information is exploited using a more sophisticated way, which usually a function over hidden variable, model parameter and observed data. These methods are called generative score space. In this paper, we propose a discriminative extension for the existing generative score space methods, which exploits class label when deriving score functions for image recognition task. Specifically, we first extend the regular generative models to class conditional models over both observed variable and class label. Then, we derive the mid-level feature mapping from the extended models. At last, the derived feature mapping is embedded into a discriminative classifier for image recognition. The advantages of our proposed approach are two folds. First, the resulted methods take simple and intuitive forms which are weighted versions of existing methods, benefitting from the Bayesian inference of class label. Second, the probabilistic generative modeling allows us to exploit hidden information and is well adapt to data distribution. To validate the effectiveness of the proposed method, we cooperate our discriminative extension with three generative models for image recognition task. The experimental results validate the effectiveness of our proposed approach.

Single Image-Based 3D Face Modeling for 3D Printing (3D 프린팅을 위한 단일 영상 기반 3D 얼굴 모델링 연구)

  • Song, Eungyeol;Koh, Wan-Ki;Yu, Sunjin
    • Journal of the Korean Society of Radiology
    • /
    • v.10 no.8
    • /
    • pp.571-576
    • /
    • 2016
  • 3D printing has recently been used in various fields. Among various applications, 3D face data must be generated for 3D face printing. A laser scanner is used to acquire 3D face data, but there is a restriction that a person should not move during scanning. In this paper, we propose a 3D face modeling method based on a single image and a face transformation system to use the generated 3D face for virtual cosmetic surgery. We have defined facial feature points from the 3D face database for 3D face data generation. After extracting feature points from a single face image, 3D face of the input face image is generated corresponding to the 3D face feature points defined from the 3D face database. After 3D face modeling, 3D face modification part is applied for use such as virtual cosmetic surgery.