• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.73-79
• /
• 2010

Emotion intelligence computing is able to processing of human emotion through it's studying and adaptation. Also, Be able more efficient to interaction of human and computer. As sight and hearing, music & image is constitute of short time and continue for long. Cause to success marketing, understand-translate of humanity emotion. In this paper, Be design of check system that matched music and image by user emotion keyword(irritability, gloom, calmness, joy). Suggested system is definition by 4 stage situations. Then, Using music & image and emotion ontology to retrieval normalized music & image. Also, A sampling of image peculiarity information and similarity measurement is able to get wanted result. At the same time, Matched on one space through pared correspondence analysis and factor analysis for classify image emotion recognition information. Experimentation findings, Suggest system was show 82.4% matching rate about 4 stage emotion condition.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• Korean Journal of Remote Sensing
• /
• v.37 no.4
• /
• pp.777-788
• /
• 2021

Since aerosol has a relatively short duration and significant spatial variation, satellite observations become more important for the spatially and temporally continuous quantification of aerosol. However, optical remote sensing has the disadvantage that it cannot detect AOD (Aerosol Optical Depth) for the regions covered by clouds or the regions with extremely high concentrations. Such missing values can increase the data uncertainty in the analyses of the Earth's environment. This paper presents a spatial gap-filling framework using a univariate statistical method such as DCT-PLS (Discrete Cosine Transform-based Penalized Least Square Regression) and FMM (Fast Matching Method) inpainting. We conducted a feasibility test for the hourly AOD product from AHI (Advanced Himawari Imager) between January 1 and December 31, 2019, and compared the accuracy statistics of the two spatial gap-filling methods. When the null-pixel area is not very large (null-pixel ratio < 0.6), the validation statistics of DCT-PLS and FMM techniques showed high accuracy of CC=0.988 (MAE=0.020) and CC=0.980 (MAE=0.028), respectively. Together with the AI-based gap-filling method using extra explanatory variables, the DCT-PLS and FMM techniques can be tested for the low-resolution images from the AMI (Advanced Meteorological Imager) of GK2A (Geostationary Korea Multi-purpose Satellite 2A), GEMS (Geostationary Environment Monitoring Spectrometer) and GOCI2 (Geostationary Ocean Color Imager) of GK2B (Geostationary Korea Multi-purpose Satellite 2B) and the high-resolution images from the CAS500 (Compact Advanced Satellite) series soon.

• The Korean Journal of Applied Statistics
• /
• v.36 no.4
• /
• pp.323-335
• /
• 2023

In causal analysis of high dimensional data, it is important to reduce the dimension of covariates and transform them appropriately to control confounders that affect treatment and potential outcomes. The augmented inverse probability weighting (AIPW) method is mainly used for estimation of average treatment effect (ATE). AIPW estimator can be obtained by using estimated propensity score and outcome model. ATE estimator can be inconsistent or have large asymptotic variance when using estimated propensity score and outcome model obtained by parametric methods that includes all covariates, especially for high dimensional data. For this reason, an ATE estimation using an appropriate dimension reduction method and semiparametric model for high dimensional data is attracting attention. Semiparametric method or sparse sufficient dimensionality reduction method can be uesd for dimension reduction for the estimation of propensity score and outcome model. Recently, another method has been proposed that does not use propensity score and outcome regression. After reducing dimension of covariates, ATE estimation can be performed using matching. Among the studies on ATE estimation methods for high dimensional data, four recently proposed studies will be introduced, and how to interpret the estimated ATE will be discussed.

• Clinical Endoscopy
• /
• v.55 no.1
• /
• pp.77-85
• /
• 2022

Background/Aims: Endoscopic submucosal dissection (ESD) of gastric tumors in the mid-to-upper stomach is a technically challenging procedure. This study compared the therapeutic outcomes and adverse events of ESD of tumors in the mid-to-upper stomach performed under general anesthesia (GA) or monitored anesthesia care (MAC). Methods: Between 2012 and 2018, 674 patients underwent ESD for gastric tumors in the midbody, high body, fundus, or cardia (100 patients received GA; 574 received MAC). The outcomes of the propensity score (PS)-matched (1:1) patients receiving either GA or MAC were analyzed. Results: The PS matching identified 94 patients who received GA and 94 patients who received MAC. Both groups showed high rates of en bloc resection (GA, 95.7%; MAC, 97.9%; p=0.68) and complete resection (GA, 81.9%; MAC, 84.0%; p=0.14). There were no significant differences between the rates of adverse events (GA, 16.0%; MAC, 8.5%; p=0.18) in the anesthetic groups. Logistic regression analysis indicated that the method of anesthesia did not affect the rates of complete resection or adverse events. Conclusions: ESD of tumors in the mid-to-upper stomach at our high-volume center had good outcomes, regardless of the method of anesthesia. Our results demonstrate no differences between the efficacies and safety of ESD performed under MAC and GA.

• The Korean Journal of Applied Statistics
• /
• v.19 no.2
• /
• pp.291-303
• /
• 2006

Data mining is the work to extract information from existing data file. So, the one of best important thing in data mining process is the quality of data to be used. In this thesis, we propose the data fusion technique using decision rule for data enrichment that one phase to improve data quality in KDD process. Simulations were performed to compare the proposed data fusion technique with the existing techniques. As a result, our data fusion technique using decision rule is characterized with low MSE or misclassification rate in fusion variables.

• Journal of the Korean Society of School Health
• /
• v.23 no.1
• /
• pp.79-87
• /
• 2010

Purpose: The purpose of this study was to explore the relationship between depression, alexithymia, social support and somatic symptom in adolescents. Methods: The subjects were 1,519 adolescents in Seoul. Radloff's CES-D (The Center for Epidemiological Studies-Depression scale) for depression, Bagby, Parker and Taylor's TAS (Toronto Alexithymia Scale) for alexithymia, Park's social support and Derogatis's SCL-90 (Brief Symptom Inventory & Matching Clinical Rating Scale) were used. The data was analyzed using descriptive statistics, Pearson's correlation coefficients, t or F test, and stepwise multiple regression. Results: Depression and somatic symptom were lower but social support was higher when compared to mean score. The somatic symptom was significantly positive correlations to age, depression, alexithymia but no correlation to social support. Stepwise multiple regression analysis showed that 21.8% of the somatic symptom was significantly accounted for depression, alexithymia, social support, gender, economic status, living alone, and living with parent. Conclusion: These results suggest that depression, alexithymia, living alone can be potential risk factors for somatic symptom in the adolescents. Therefore, these findings will give useful information for developing a promotion program focused on social support in the adolescents.

• Korean Management Science Review
• /
• v.17 no.3
• /
• pp.19-30
• /
• 2000

Customization and personalization services are considered as a critical success factor to be a successful Internet store or web service provider. As a representative personalization technique, personalized recommendation techniques are studied and commercialized to suggest products or services to a customer of Internet storefronts based on demographics of the customer or based on an analysis of the past purchasing behavior of the customer. The underlining theories of recommendation techniques are statistics, data mining, artificial intelligence, and/or rule-based matching. In the rule-based approach for personalized recommendation, marketing rules for personalization are usually collected from marketing experts and are used to inference with customers data. however, it is difficult to extract marketing rules from marketing experts, and also difficult to validate and to maintain the constructed knowledge base. In this paper, we proposed a marketing rule extraction technique for personalized recommendation on Internet storefronts using market basket analysis technique, a well-known data mining technique. Using marketing basket analysis technique, marketing rules for cross sales are extracted, and are used to provide personalized advertisement selection when a customer visits in an Internet store. An experiment has been performed to evaluate the effectiveness of proposed approach comparing with preference scoring approach and random selection.

• Journal of the Optical Society of Korea
• /
• v.14 no.4
• /
• pp.376-382
• /
• 2010

We propose a novel method to precisely detect car license plates by locating main characters, which are printed with large font size. The regions of the main characters are directly detected without detecting the plate region boundaries, so that license regions can be detected more precisely than by other existing methods. To generate a binary image, multiple thresholds are applied, and segmented regions are selected from multiple binarized images by a criterion of size and compactness. We do not employ any character matching methods, so that many candidates for main character groups are detected; thus, we use a neural network to reject non-main character groups from the candidates. The relation of the character regions and the intensity statistics are used as the input to the neural network for classification. The detection performance has been investigated on real images captured under various illumination conditions for 1000 vehicles. 980 plates were correctly detected, and almost all non-detected plates were so stained that their characters could not be isolated for character recognition. In addition, the processing time is fast enough for a commercial automatic license plate recognition system. Therefore, the proposed method can be used for recognition systems with high performance and fast processing.

• The Korean Journal of Applied Statistics
• /
• v.17 no.3
• /
• pp.605-617
• /
• 2004

One of the best important thing in data mining process is the quality of data used. When we perform the mining on data with excellent quality, the potential value of data mining can be improved. In this paper, we propose the data fusion technique for data enrichment that one phase can improve data quality in KDD process. We attempted to add k-NN technique to the regression technique, to improve performance of fusion technique through reduction of the loss of information. Simulations were performed to compare the proposed data fusion technique with the regression technique. As a result, the newly proposed data fusion technique is characterized with low MSE in continuous fusion variables.