• International Journal of Industrial Entomology and Biomaterials
• /
• v.29 no.2
• /
• pp.169-178
• /
• 2014

In this study, we investigated genetic diversity of 22 microsporidian isolates infecting tropical tasar silkworm, Antheraea mylitta collected from various geographical forest locations in the state of Jharkhand, India, using polymerase chain reaction (PCR)-based marker assay: random amplified polymorphic DNA (RAPD). A type species, NIK-1s_mys was used as control for comparison. The shape of mature microsporidians was found to be oval to elongate, measuring 3.80 to $5.10{\mu}m$ in length and 2.56 to $3.30{\mu}m$ in width. Of the 20 RAPD primers screened, 16 primers generated reproducible profiles with 298 polymorphic fragments displaying high degree of polymorphism (97%). A total of 14 RAPD primers produced 45 unique putative genetic markers, which were used to differentiate the microsporidians. Calculation of genetic distance coefficients based on dice coefficient method and clustering with un-weighted pair group method using arithmetic average (UPGMA) analysis was conducted to unravel the genetic diversity of microsporidians infecting tasar silkworm. The similarity coefficients varied from 0.059 to 0.980. UPGMA analysis generated a dendrogram with four microsporidian groups, which appear to be different from each other as well as from NIK-1s_mys. Two-dimensional distribution based on Euclidean distance matrix also revealed considerable variability among different microsporidians identified from the tasar silkworms. Clustering of few microsporidian isolates was in accordance with the geographic origin. The results indicate that the RAPD profiles and specific/unique genetic markers can be used for differentiating as well as to identify different microsporidians with considerable accuracy.

• Journal of the Korea Concrete Institute
• /
• v.13 no.2
• /
• pp.146-152
• /
• 2001

The fractal geometry is a non-Euclidean geometry which discribes the naturally irregular or fragmented shaps, so that it can be applied to fracture behavior of materials to investigate the fracture process. Fractal curves have a characteristic that represents a self-similarity as an invariant based on the fractal dimension. This fractal geometry was applied to the crack growth of cementitious composites in order to correlate the fracture behavior to microstructures of cemposite composites. The purpose of this study was to find relationships between fractal dimensions and fracture energy. Fracture test was carried out in order to investigate the fracture behavior of plain and fiber reinforced cement composites. The load-CMOD curve and fracture energy of the beams were observed under the three point loading system. The crack profiles were obtained by the image processing system. Box counting method was used to determine the fractal dimension, D$_{f}$. It was known that the linear correlation exists between fractal dimension and fracture energy of the cement composites. The implications of the fractal nature for the crack growth behavior on the fracture energy, G$_{f}$ is appearent.ent.

• Journal of Biosystems Engineering
• /
• v.27 no.2
• /
• pp.151-160
• /
• 2002

Cow image processing technique would be useful not only for recognizing an individual but also for establishing the image database and analyzing the shape of cows. A cow (Holstein) has usually the unique speckle pattern. In this study, the individual recognition of cow was carried out using the speckle pattern and the content-based image retrieval technique. Sixty cow images of 16 heads were captured under outdoor illumination, which were complicated images due to shadow, obstacles and walking posture of cow. Sixteen images were selected as the reference image for each cow and 44 query images were used for evaluating the efficiency of individual recognition by matching to each reference image. Run-lengths and positions of runs across speckle area were calculated from 40 horizontal line profiles for ROI (region of interest) in a cow body image after 3 passes of 5$\times$5 median filtering. A similarity measure for recognizing cow individuals was calculated using Euclidean distance of normalized G-frame histogram (GH). normalized speckle run-length (BRL), normalized x and y positions (BRX, BRY) of speckle runs. This study evaluated the efficiency of individual recognition of cow using Recall(Success rate) and AVRR(Average rank of relevant images). Success rate of individual recognition was 100% when GH, BRL, BRX and BRY were used as image query indices. It was concluded that the histogram as global property and the information of speckle runs as local properties were good image features for individual recognition and the developed system of individual recognition was reliable.

• Journal of Information Technology and Architecture
• /
• v.9 no.1
• /
• pp.57-66
• /
• 2012

Recently, with a rapidly growing of the mobile content market, a variety of mobile-based applications are being launched. But mobile devices, compared to the average computer, take a lot of effort and time to get the final contents you want to use due to the restrictions such as screen size and input methods. To solve this inconvenience, a recommender system is required, which provides customized information that users prefer by filtering and forecasting the information.In this study, an tailored multi-information recommendation system utilizing a Personalized information recommendation system on smartphone is proposed. Filtering of information is to predict and recommend the information the individual would prefer to by using the user-based collaborative filtering. At this time, the degree of similarity used for the user-based collaborative filtering process is Euclidean distance method using the Pearson's correlation coefficient as weight value.As a real applying case to evaluate the performance of the recommender system, the scenarios showing the usefulness of recommendation service for the actual restaurant is shown. Through the comparison experiment the augmented reality based multi-recommendation services to the existing single recommendation service, the usefulness of the recommendation services in this study is verified.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.230-239
• /
• 2003

This paper presents face recognition algorithm using projection vector reflecting local feature for the area in contour lines. The outline shape of a face has many difficulties to distinguish people because human has similar face shape. For 3 dimensional(3D) face images include depth information, we can extract different face shapes from the nose tip using some depth values for a face image. In this thesis deals with 3D face image, because the extraction of contour lines from 2 dimensional face images is hard work. After finding nose tip, we extract two areas in the contour lilies from some depth values from 3D face image which is obtained by 3D laser scanner. And we propose a method of projection vector to localize the characteristics of image and reduce the number of index data in database. Euclidean distance is used to compare of similarity between two images. Proposed algorithm can be made recognition rate of 94.3% for face shapes using depth information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2259-2264
• /
• 2008

Significant genes are defined as genes in which the expression level characterizes a specific experimental condition. Such genes in which the expression levels differ significantly between different groups are highly informative relevant to the studied phenomenon. In this paper, first the system can detect informative genes by similarity scale combination method being proposed in this paper after normalizing data with methods that are the most widely used among several normalization methods proposed the while. And it compare and analyze a performance of each of normalization methods with multi-perceptron neural network layer. The Result classifying in Multi-Perceptron neural network classifier for selected 200 genes using combination of PC(Pearson correlation coefficient) and ED(Euclidean distance coefficient) after Lowess normalization represented the improved classification performance of 98.84%.

• Fashion & Textile Research Journal
• /
• v.23 no.5
• /
• pp.667-673
• /
• 2021

The purpose of this study was to obtain drape information and objective texture of fabrics easily and quickly by using a constructed fabric database. For the construction of the fabric database, 287 woven fabrics were examined by using the CLO fabric kit, KES-FB system, and drape test system. The k-means cluster analysis method was used to classify the fabrics into 7 grades. After correlation analysis of the fabric properties for each experiment, similar properties of the CLO fabric kit and KES-FB system were chosen, which were then designed to extract similar fabrics from the database. It was confirmed that inferring the drape information and objective hand feeling of fabrics was to some extent possible by extracting similar fabrics from the database. In this study, the primary hand and total hand value(THV) of KES-FB system, which was constructed by Kawabata and other experiments, were used to quantify the objective hand feeling, because they are the most widely used. However, these standards can be changed over time; in order to be applied within the clothing industry, these standards may have to be changed to some extent. Moreover, it is notable that although objective hand feeling cannot be expressed in the 3D virtual costume program, it can be easily derived from the constructed database. Additionally, it is expected that the existing 3D virtual costume program will express the costumes more realistically by improving these results.

• Journal of Korean Society for Quality Management
• /
• v.51 no.2
• /
• pp.315-327
• /
• 2023

Purpose: Recently, research has continued to predict the time of failure of the facility through measurement data obtained by attaching a sensor to the facility. However, depending on the facility, it may be difficult to attach a sensor. The purpose of this study is to propose a power generation maintenance plan system based on failure record data obtained from Continuous Ship Unloader, one of the facilities that is difficult to attach sensors. Methods: This study uses data collected from 2012 to 2022 from the 'CSU-1B' model among Continuous Ship Unloader operated by Korea Midland Power Co., LTD. By fitting fault record data to the Weibull distribution, appropriate maintenance cycles and ranges for each target facility subsystem are derived. In addition, maintenance group between subsystems is selected through Euclidean distance, a metric often used for time series data similarity. Through this, a system for establishing an maintenance plan for power generation facilities is proposed. Results: The results of this study are as follows. For the 17 subsystems of the Continuous Ship Unloader, proper maintenance cycles and ranges were determined, and a total of four maintenance groups were chosen. This resulted in the creation of an power generation maintenance plan system and the establishment of an maintenance plan. Conclusion: This study is a case study of power generation facilities. We proposed a maintenance plan system for Continuous Ship Unloader among power generation facilities.

• The KIPS Transactions:PartB
• /
• v.19B no.1
• /
• pp.1-8
• /
• 2012

Mosaic is to make a big image by gathering lots of small materials having various colors. With advance of digital imaging techniques, photomosaic techniques using photos are widely used. In this paper, we presents an automatic photomosaic algorithm based on adaptive tiling and block matching. The proposed algorithm is composed of two processes: photo database generation and photomosaic generation. Photo database is a set of photos (or tiles) used for mosaic, where a tile is divided into $4{\times}4$ regions and the average RGB value of each region is the feature of the tile. Photomosaic generation is composed of 4 steps: feature extraction, adaptive tiling, block matching, and intensity adjustment. In feature extraction, the feature of each block is calculated after the image is splitted into the preset size of blocks. In adaptive tiling, the blocks having similar similarities are merged. Then, the blocks are compared with tiles in photo database by comparing euclidean distance as a similarity measure in block matching. Finally, in intensity adjustment, the intensity of the matched tile is replaced as that of the block to increase the similarity between the tile and the block. Also, a tile redundancy minimization scheme of adjacent blocks is applied to enhance the quality of mosaic photos. In comparison with Andrea mosaic software, the proposed algorithm outperforms in quantitative and qualitative analysis.

• Journal of Digital Convergence
• /
• v.12 no.6
• /
• pp.277-287
• /
• 2014

In LBSNS(Location-based Social Network Service), users can share locations and communicate with others by using check-in data. The check-in data consists of POI name, category, coordinate and address of locations, nickname of users, evaluating grade of locations, related article/photo/video, and etc. If you analyze the check-in data from the location-based social network service in accordance with your situation, you can provide various customized services. Therefore, In this paper, we develop a location recommendation system based on LBSNS that can utilize the check-in data efficiently. This system analyzes the location category of the check-in data, determines the weighted value of it, and finds out the similarity between users by using the Pearson correlation coefficient. Also, it obtains the preference score of recommended locations by using the collaborated filtering algorithm and then, finds out the distance score by applying the Euclidean's algorithm to the recommended locations and the current users' locations. Finally, it recommends appropriate locations by applying the weighted value to the preference score and the distance score. In addition, this paper approved excellence of the proposed system throughout the experiment using real data.