• Title/Summary/Keyword: Data Matrix

Search Result 2,896, Processing Time 0.033 seconds

Study on Enhancements to Ultrasonic Data Imaging Using Full Matrix Capture Technique (Full Matrix Capture 기법을 통한 초음파신호 영상화 향상 연구)

  • Lee, Tae-Hun;Yoon, Byung-Sik;Lee, Jeong-Seok
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.35 no.5
    • /
    • pp.299-306
    • /
    • 2015
  • A conventional phased array system can control an ultrasonic beam electronically by adjusting the excitation time delay of individual elements in a multi-element probe and produce an ultrasonic image. In Contrast, full matrix capture (FMC) is a data acquisition process that allows receiving ultrasonic signals from one single shot of the phased array transducer element through all the other elements and captures the complete dataset from every possible transmit-receive combination. This FMC data can be used to create the ultrasonic image in post processing. It is possible to produce not only images equivalent to conventional phased array image but also total focusing method (TFM) images with improved resolution and sharpness, which is virtually focused at any point in a region of interest. In this paper, the system that can perform FMC by using a conventional phased array instrument is developed, and a study was conducted on the imaging algorithms to reconstruct sector B-scan and TFM images from FMC dataset.

Development of an Informetric Analysis System KnowledgeMatrix (계량정보분석시스템 KnowledgeMatrix 개발)

  • Lee, Bangrae;Yeo, Woon Dong;Lee, June Young;Lee, Chang-Hoan;Kwon, Oh-Jin;Moon, Yeong-ho
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2007.11a
    • /
    • pp.167-171
    • /
    • 2007
  • Application areas of Knowledge Discovery in Database (KDD) have been expanded into many R&D management processes including technology trends analysis, forecasting and evaluation etc. Established research field such as informetrics (or scientometrics) has recently fully utilized techniques or methods of KDD. Various systems have been developed to support works of analyzing large-scale R&D related databases such as patent DB or bibliographic DB by a few researchers or institutions. But extant systems have some problems for korean users to use. Their prices is not cheap, korean language process not available, and user's demands not reflected. To solve these problems, Korea Institute of Science and Technology Information (KISTI) developed stand-alone type information analysis system named as KnowledgeMatrix. KnowledgeMatrix system offer various functions to analyze retrieved data set from databases. Knowledge Matrix main operation unit is composed of user-defined lists and matrix generation, cluster analysis, visualization, data pre-processing. KnowledgeMatrix show better performances and offer more various functions than extant systems.

  • PDF

Compressing Method of NetCDF Files Based on Sparse Matrix (희소행렬 기반 NetCDF 파일의 압축 방법)

  • Choi, Gyuyeun;Heo, Daeyoung;Hwang, Suntae
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.11
    • /
    • pp.610-614
    • /
    • 2014
  • Like many types of scientific data, results from simulations of volcanic ash diffusion are of a clustered sparse matrix in the netCDF format. Since these data sets are large in size, they generate high storage and transmission costs. In this paper, we suggest a new method that reduces the size of the data of volcanic ash diffusion simulations by converting the multi-dimensional index to a single dimension and keeping only the starting point and length of the consecutive zeros. This method presents performance that is almost as good as that of ZIP format compression, but does not destroy the netCDF structure. The suggested method is expected to allow for storage space to be efficiently used by reducing both the data size and the network transmission time.

Development of Prediction Model for Churn Agents -Comparing Prediction Accuracy Between Pattern Model and Matrix Model- (대리점 이탈예측모델 개발 - 동적모델(Pattern Model)과 정적모델(Matrix Model)의 예측적중률 비교 -)

  • An, Bong-Rak;Lee, Sae-Bom;Roh, In-Sung;Suh, Yung-Ho
    • Journal of Korean Society for Quality Management
    • /
    • v.42 no.2
    • /
    • pp.221-234
    • /
    • 2014
  • Purpose: The Purpose of this study is to develop a model for predicting agent churn group in the cosmetics industry. We develope two models, pattern model and matrix model, which are compared regarding the prediction accuracy of churn agents. Finally, we try to conclude if there is statistically significant difference between two models by empirical study. Methods: We develop two models using the part of RFM(Recency, Frequency, Monetary) method which is one of customer segmentation method in traditional CRM study. In order to ensure which model can predict churn agents more precisely between two models, we used CRM data of cosmetics company A in China. Results: Pattern model and matrix model have been developed. we find out that there is statistically significant differences between two models regarding the prediction accuracy. Conclusion: Pattern model and matrix model predict churn agents. Although pattern model employed the trend of monetary mount for six months, matrix model that used the amount of sales per month and the duration of the employment is better than pattern model in prediction accuracy.

An Analysis of Privacy and Accuracy for Privacy-Preserving Techniques by Matrix-based Randomization (행렬 기반 랜덤화를 적용한 프라이버시 보호 기술의 안전성 및 정확성 분석)

  • Kang, Ju-Sung;An, A-Ron;Hong, Do-Won
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.4
    • /
    • pp.53-68
    • /
    • 2008
  • We study on the practical privacy-preserving techniques by matrix-based randomization approach. We clearly examine the relationship between the two parameters associated with the measure of privacy breach and the condition number of matrix in order to achieve the optimal transition matrix. We propose a simple formula for efficiently calculating the inverse of transition matrix which are needed in the re-construction process of random substitution algorithm, and deduce some useful connections among standard error and another parameters by obtaining condition numbers according to norms of matrix and the expectation and variance of the transformed data. Moreover we give some experimental results about our theoretical expressions by implementing random substitution algorithm.

Supervised Learning-Based Collaborative Filtering Using Market Basket Data for the Cold-Start Problem

  • Hwang, Wook-Yeon;Jun, Chi-Hyuck
    • Industrial Engineering and Management Systems
    • /
    • v.13 no.4
    • /
    • pp.421-431
    • /
    • 2014
  • The market basket data in the form of a binary user-item matrix or a binary item-user matrix can be modelled as a binary classification problem. The binary logistic regression approach tackles the binary classification problem, where principal components are predictor variables. If users or items are sparse in the training data, the binary classification problem can be considered as a cold-start problem. The binary logistic regression approach may not function appropriately if the principal components are inefficient for the cold-start problem. Assuming that the market basket data can also be considered as a special regression problem whose response is either 0 or 1, we propose three supervised learning approaches: random forest regression, random forest classification, and elastic net to tackle the cold-start problem, comparing the performance in a variety of experimental settings. The experimental results show that the proposed supervised learning approaches outperform the conventional approaches.

Detecting Active Brain Regions by a Constrained Alternating Least Squares Nonnegative Matrix Factorization Algorithm from Single Subject's fMRI Data (단일 대상의 fMRI 데이터에서 제약적 교차 최소 제곱 비음수 행렬 분해 알고리즘에 의한 활성화 뇌 영역 검출)

  • Ding, Xiaoyu;Lee, Jong-Hwan;Lee, Seong-Whan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06c
    • /
    • pp.393-396
    • /
    • 2011
  • In this paper, we propose a constrained alternating least squares nonnegative matrix factorization algorithm (cALSNMF) to detect active brain regions from single subject's task-related fMRI data. In cALSNMF, we define a new cost function which considers the uncorrelation and noisy problems of fMRI data by adding decorrelation and smoothing constraints in original Euclidean distance cost function. We also generate a novel training procedure by modifying the update rules and combining with optimal brain surgeon (OBS) algorithm. The experimental results on visuomotor task fMRI data show that our cALSNMF fits fMRI data better than original ALSNMF in detecting task-related brain activation from single subject's fMRI data.

Accuracy of Iterative Refinement of Eigenvalue Problems

  • Gluchowska-Jastrzebska, Jolanta;Smoktunowicz, Alicja
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.4 no.1
    • /
    • pp.79-92
    • /
    • 2000
  • We investigate numerical properties of Newton's algorithm for improving an eigenpair of a real matrix A using only fixed precision arithmetic. We show that under natural assumptions it produces an eigenpair of a componentwise small relative perturbation of the data matrix A.

  • PDF

A Study on Vision Sensor-based Measurement of Die Location for Its Remodeling (금형 개조 용접시 시각 센서를 이용한 대상물 위치 파악에 관한 연구)

  • Kim, Jitae;Na, Suck-Joo
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.17 no.10
    • /
    • pp.141-146
    • /
    • 2000
  • We introduce the algorithms of 3-D position estimation using a laser sensor for automatic die remodeling. First, a vision sensor based on the optical triangulation was used to collect the range data of die surface. Second, line vector equations were constructed by the measured range data, and an analytic algorithm was proposed for recognizing the die location with these vector equations. This algorithm could make the transformation matrix without any specific corresponding points. To ascertain this algorithm, folded SUS plate was measured by the laser vision sensor attached to a 3-axis cartesian manipulator and the transformation matrix was calculated.

  • PDF

Improved Minimum Variance Matched field Processing Technique for Underwater Acoustic Source Localization (수중 음원 위치 추정을 위한 개선된 최소 분산 정합장 처리 기법)

  • 양인식;김준환;김기만
    • The Journal of the Acoustical Society of Korea
    • /
    • v.19 no.2
    • /
    • pp.68-72
    • /
    • 2000
  • Matched field processing technique is performed by considering complex underwater environments. Specially, the performance of minimum variance processor is greatly degraded by eigenvalue problem. In this paper, we propose the minimum variance matched field processor using shaping matrix. This shaping matrix makes that the input covariance matrix is invertible and enhances the desired acoustic source component. It was proved effectively range/depth localization of the proposed method with simulated data and vertical array data collected by NATO SACLANT Center north of the island of Elba off the Italian west coast.

  • PDF