• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1843-1859
• /
• 2013

The continuous increase of the spatial resolution of remote sensing images brings great challenge to image analysis and processing. Traditional prior knowledge-based region detection and target recognition algorithms for processing high resolution remote sensing images generally employ a global searching solution, which results in prohibitive computational complexity. In this paper, a more efficient region of interest (ROI) detection algorithm based on visual attention and threshold segmentation (VA-TS) is proposed, wherein a visual attention mechanism is used to eliminate image segmentation and feature detection to the entire image. The input image is subsampled to decrease the amount of data and the discrete moment transform (DMT) feature is extracted to provide a finer description of the edges. The feature maps are combined with weights according to the amount of the "strong points" and the "salient points". A threshold segmentation strategy is employed to obtain more accurate region of interest shape information with the very low computational complexity. Experimental statistics have shown that the proposed algorithm is computational efficient and provide more visually accurate detection results. The calculation time is only about 0.7% of the traditional Itti's model.

• Journal of the Semiconductor & Display Technology
• /
• v.13 no.2
• /
• pp.23-28
• /
• 2014

For the reconstruction of three-dimensional (3D) shape of microscopic objects through shape from focus (SFF) methods, usually a single focus measure operator is employed. However, it is difficult to compute accurate depth map using a single focus measure due to different textures, light conditions and arbitrary object surfaces. Moreover, real images with diverse types of illuminations and contrasts lead to the erroneous depth map estimation through a single focus measure. In order to get better focus measurements and depth map, we have combined focus measure operators by using genetic algorithm. The resultant focus measure is obtained by weighted sum of the output of various focus measure operators. Optimal weights are obtained using genetic algorithm. Finally, depth map is obtained from the refined focus volume. The performance of the developed method is then evaluated by using both the synthetic and real world image sequences. The experimental results show that the proposed method is more effective in computing accurate depth maps as compared to the existing SFF methods.

• Journal of Ocean Engineering and Technology
• /
• v.29 no.3
• /
• pp.207-216
• /
• 2015

Amanifold is one of the essential subsea oil and gas production components to simplify the subsea production layout. It collects the production fluid from a couple of wellheads, transfers it to onshore or offshore storage platforms, and even accommodates water and gas injection flowlines. This paper presents the basic design procedure for a manifold frame structure with novel structural verification using in-house unity check codes. Loads and load cases for the design of an SIL 3 class-manifold are established from a survey of relevant industrial codes. The basic design of the manifold frame is developed based on simple load considerations such as the self weights of the manifold frame and pipeline system. In-house software with Eurocode 3 embedded, called INHA-SOLVER, makes it possible to carry out code checks on the yield and buckling unities. This paper finally proves that the new design of the manifold frame structure is effective to resist a permanent and environment load, and the in-house code is also adaptively combined with the commercial finite element code Nastran.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.22-27
• /
• 2007

Phosphorylation is one of the most important post translational modifications which regulate the activity of proteins. The problem of predicting phosphorylation sites is the first step of understanding various biological processes that initiate the actual function of proteins in each signaling pathway. Although many prediction methods using single or multiple features extracted from protein sequences have been proposed, systematic data integration approach has not been applied in order to improve the accuracy of predicting general phosphorylation sites. In this paper, we propose an optimal way of integrating multiple features in the framework of multiple kernel learning. We optimally combine seven kernels extracted from sequence, physico-chemical properties, pairwise alignment, and structural information. Using the data set of Phospho. ELM, the accuracy evaluated by 5-fold cross-validation reaches 85% for serine, 85% for threonine, and 81% for tyrosine. Our computational experiments show significant improvement in the performance of prediction relative to a single feature, or to the combined feature with equal weights. Moreover, our systematic integration method significantly improves the prediction preformance compared with the previous well-known methods.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.10
• /
• pp.185-198
• /
• 2021

With the development of Internet technology, because traditional recommendation algorithms cannot learn the in-depth characteristics of users or items, this paper proposed a recommendation algorithm based on the AMITI(attention mechanism and improved TF-IDF) to solve this problem. By introducing the two-layer attention mechanism into the CNN, the feature extraction ability of the CNN is improved, and different preference weights are assigned to item features, recommendations that are more in line with user preferences are achieved. When recommending items to target users, the scoring data and item type data are combined with TF-IDF to complete the grouping of the recommendation results. In this paper, the experimental results on the MovieLens-1M data set show that the AMITI algorithm improves the accuracy of recommendation to a certain extent and enhances the orderliness and selectivity of presentation methods.

• Journal of the Semiconductor & Display Technology
• /
• v.16 no.3
• /
• pp.87-92
• /
• 2017

Poly(urethane acrylate) siloxane oligomers with Interpenetrating polymer networked nanoparticles were prepared to synthesize hard coating solution by reaction with isophorone diisocyanate(IPDI) of 1, 2, 3, 4 phr. The structures and molecular weights of the synthesized solutions were characterized by IR spectroscopy and gel permeation chromatography, respectively. In the cross-cut test for the adhesion, all the solutions showed good adhesion of 5B regardless of the content of IPDI and film thickness. The addition of 1 phr IPDI resulted in the best pencil hardness. The IPDI combined siloxane hard coating solution showed more flexibility than the siloxane solution. These results will yield the improvement in the siloxane solution using for plastic display plate.

• International Journal of Knowledge Content Development & Technology
• /
• v.9 no.3
• /
• pp.23-41
• /
• 2019

This study combines the concept of degree centrality in complex network with the Term Frequency $^*$ Proportional Document Frequency ($TF^*PDF$) algorithm; the combined method, called PMCN (PDF-Modified similarity and Complex Network), constructs relationship networks among sentences for writing news summaries. The PMCN method is a multi-document summarization extension of the ideas of Bun and Ishizuka (2002), who first published the $TF^*PDF$ algorithm for detecting hot topics. In their $TF^*PDF$ algorithm, Bun and Ishizuka defined the publisher of a news item as its channel. If the PDF weight of a term is higher than the weights of other terms, then the term is hotter than the other terms. However, this study attempts to develop summaries for news items. Because the $TF^*PDF$ algorithm summarizes daily news, PMCN replaces the concept of "channel" with "the date of the news event", and uses the resulting chronicle ordering for a multi-document summarization algorithm, of which the F-measure scores were 0.042 and 0.051 higher than LexRank for the famous d30001t and d30003t tasks, respectively.

• International Journal of Computer Science & Network Security
• /
• v.22 no.6
• /
• pp.319-331
• /
• 2022

The latest global COVID-19 pandemic has made the use of facial masks an important aspect of our lives. People are advised to cover their faces in public spaces to discourage illness from spreading. Using these face masks posed a significant concern about the exactness of the face identification method used to search and unlock telephones at the school/office. Many companies have already built the requisite data in-house to incorporate such a scheme, using face recognition as an authentication. Unfortunately, veiled faces hinder the detection and acknowledgment of these facial identity schemes and seek to invalidate the internal data collection. Biometric systems that use the face as authentication cause problems with detection or recognition (face or persons). In this research, a novel model has been developed to detect and recognize faces and persons for authentication using scale invariant features (SIFT) for the whole segmented face with an efficient local binary texture features (DLBP) in region of eyes in the masked face. The Fuzzy C means is utilized to segment the image. These mixed features are trained significantly in a convolution neural network (CNN) model. The main advantage of this model is that can detect and recognizing faces by assigning weights to the selected features aimed to grant or provoke permissions with high accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3507-3522
• /
• 2022

Model pruning methods have attracted huge attention owing to the increasing demand of deploying models on low-resource devices recently. Most existing methods use the weight norm of filters to represent their importance, and discard the ones with small value directly to achieve the pruning target, which ignores the contribution of the small norm filters. This is not only results in filter contribution waste, but also gives comparable performance to training with the random initialized weights [1]. In this paper, we point out that the small norm filters can harm the performance of the pruned model greatly, if they are discarded directly. Therefore, we propose a novel filter contribution recycle (FCR) method for structured model pruning to resolve the fore-mentioned problem. FCR collects and reassembles contribution from the small norm filters to obtain a mixed contribution collector, and then assigns the reassembled contribution to other filters with higher probability to be preserved. To achieve the target FLOPs, FCR also adopts a weight decay strategy for the small norm filters. To explore the effectiveness of our approach, extensive experiments are conducted on ImageNet2012 and CIFAR-10 datasets, and superior results are reported when comparing with other methods under the same or even more FLOPs reduction. In addition, our method is flexible to be combined with other different pruning criterions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.3
• /
• pp.738-754
• /
• 2024

Side-channel analysis (SCA) is a cryptanalytic technique that exploits physical leakages, such as power consumption or electromagnetic emanations, from cryptographic devices to extract secret keys used in cryptographic algorithms. Recent studies have shown that training SCA models with semi-supervised learning can effectively overcome the problem of few labeled power traces. However, the process of training SCA models using semi-supervised learning generates many pseudo-labels. The performance of the SCA model can be reduced by some of these pseudo-labels. To solve this issue, we propose the HWFilter method to improve semi-supervised SCA. This method uses a Hamming Weight Pseudo-label Filter (HWPF) to filter the pseudo-labels generated by the semi-supervised SCA model, which enhances the model's performance. Furthermore, we introduce a normal distribution method for constructing the HWPF. In the normal distribution method, the Hamming weights (HWs) of power traces can be obtained from the normal distribution of power points. These HWs are filtered and combined into a HWPF. The HWFilter was tested using the ASCADv1 database and the AES_HD dataset. The experimental results demonstrate that the HWFilter method can significantly enhance the performance of semi-supervised SCA models. In the ASCADv1 database, the model with HWFilter requires only 33 power traces to recover the key. In the AES_HD dataset, the model with HWFilter outperforms the current best semi-supervised SCA model by 12%.