• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.2
• /
• pp.358-363
• /
• 2009

Text region detection from the natural scene images used in a variety of applications, many research are needed in this field. Recent research methods is to detect the text region using various algorithm which it is combination of edge based and connected component based. Therefore, this paper proposes an text region detection using edge and regional minima/maxima transformation algorithm from natural scene images, and then detect the connected components of edge and regional minima/maxima, labeling edge and regional minima/maxima connected components. Analysis the labeled regions and then detect a text candidate regions, each of detected text candidates combined and create a single text candidate image, Final text region validated by comparing the similarity and adjacency of individual characters, and then as the final text regions are detected. As the results of experiments, proposed algorithm improved the correctness of text regions detection using combined edge and regional minima/maxima connected components detection methods.

• Journal of Sericultural and Entomological Science
• /
• v.42 no.1
• /
• pp.14-23
• /
• 2000

The mitochondrial genome of domesticated silkworm (Bombyx mori) was mapped with five restriction endonucleases (BamHI, EcoRI, HindIII, PstI and XbaI), the entire genome was cloned with HindIII and EcoRI. From the end sequencing results of 5$^1$and 3$^1$region for full genome set of eleven mitochondrial clones, the seven mitochondrial genes (NADH dehydrogenase 6, ATPase 6, ATPase 8, tRN $A^{Lys}$, tRN $A^{Asp}$, tRN $A^{Thr}$ and tRN $A^{Phe}$ of mori were identified on the basis of their nucleotide sequence homology. The nucleotide composition of NADH dehydrogenase 6 was heavily biased towards adenine and thymine, which accounted for 87.76%. On basis of the sequence similarity with published tRNA genes from six insect species, the tRN $A^{Lys}$, tRN $A^{Asp}$ and tRN $A^{Thr}$ were showed stable canonical clover-leaf tRNA structures with acceptible anticodons. However, both the DHU and T$\psi$C arms of tRN $A^{Phe}$ could not form any stable stem-loop structure. The two overlapping gene pairs (tRN $A^{Lys}$ -tRN $A^{ASP}$ and ATPase8-ATPase6) were found from our sequencing results. The genes are encoded on the same strad. ATPase8 and ATPase6 overlaps (ATGATAA) which are a single example of overlapping events between abutted protein-coding genes are common, and there is evidence that the two proteins are transcribed from a single bicistronic message by initiation at 5$^1$terminal start site for ATPase8 and at an internal start site for ATPase6. Ultimately, this result will provide assistance in designing oligo-nucleotides for PCR amplification, and sequencing the specific mitochondrial genes for phylogenetics of geographic races, genetically improved silkworm strains and wild silkworm (mandarina) which is estimated as ancestal of domesticated silkworm.sticated silkworm.

• Journal of the Korean Society for information Management
• /
• v.22 no.3 s.57
• /
• pp.261-287
• /
• 2005

The purpose of this paper is to explore the ways to improve the performance of SVM (Support Vector Machines) text classifier using inter-document similarities. SVMs are powerful machine learning systems, which are considered as the state-of-the-art technique for automatic document classification. In this paper text categorization via SVMs approach based on feature representation with document vectors is suggested. In this approach, document vectors instead of index terms are used as features, and vector similarities instead of term weights are used as feature values. Experiments show that SVM classifier with document vector features can improve the document classification performance. For the sake of run-time efficiency, two methods are developed: One is to select document vector features, and the other is to use category centroid vector features instead. Experiments on these two methods show that we can get improved performance with small vector feature set than the performance of conventional methods with index term features.

• Journal of KIISE
• /
• v.43 no.6
• /
• pp.686-691
• /
• 2016

In this paper, we introduced the adaptive spectral co-clustering, a spectral clustering for multiview data, especially data with more than three views. In the adaptive spectral co-clustering, the performance is improved by sharing information from diverse views. For the efficiency in information sharing, a co-training approach is adopted. In the co-training step, a set of parameters are estimated to make all views in data maximally independent, and then, information is shared with respect to estimated parameters. This co-training step increases the efficiency of information sharing comparing with ordinary feature concatenation and co-training methods that assume the independence among views. The adaptive spectral co-clustering was evaluated with synthetic dataset and multi lingual document dataset. The experimental results indicated the efficiency of the adaptive spectral co-clustering with the performances in every iterations and similarity matrix generated with information sharing.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.9
• /
• pp.835-840
• /
• 2008

This paper proposes an enhanced recommendation technique for personalized e-commerce portal analyzing various attitudes of customer. The attitudes are classifies into three types such as "purchasing product", "adding product to shopping cart", and "viewing the product information". We implicitly track customer attitude to estimate the rating of products for recommending products. We classified user groups which have similar preference for each item using implicit user behavior. The preference similarity is estimated using the Cross Correlation Coefficient. Our recommendation technique shows a high degree of accuracy as we use age and gender to group the customers with similar preference. In the experimental section, we show that our method can provide better performance than other traditional recommender system in terms of accuracy.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1189-1196
• /
• 2004

It is a major concern of e-shopping mall managers to satisfy a variety of customer's desire by recommending a proper product to the perspective purchaser. Customer information like customer's fondness, age, gender, etc. in shopping has not been used effectively for the customers or the suppliers. Conventionally, e-shopping mall managers have recommended specific items of products to their customers without considering thoroughly in a customer point of view. This study introduces the ways of a choosing and recommending of products using case-based reasoning and rule-based reasoning for customer themselves or others. A similarity measure between one member's idiosyncrasy and the other members' is developed based on the rule base and the case base. The case base is improved for the system intelligence by recognizing and learning the changes of customer's desire and shopping trend.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9C
• /
• pp.922-929
• /
• 2005

In this paper, we propose the MRS p:Ittern classification techniques by the fusion scheme based on the SpPCA and MLP. A conventional PCA teclulique for the dimension reduction has the problem that it can't find a optimal transformation matrix if the property of input data is nonlinear. To overcome this drawback we extract features by the SpPCA technique which use the local patterns rather than whole patterns. In a next classification step, individual classifier based on MLP calculates the similarity of each class for local features. Finally, MRS patterns is classified by the fusion scheme to effectively combine the individual information. As the simulation results to verify the effectiveness, the proposed method showed more improved classification results than conventional methods.

• Journal of Integrative Natural Science
• /
• v.3 no.3
• /
• pp.143-147
• /
• 2010

Since it is of great importance to know how a ligand binds to a receptor, there have been a lot of efforts to improve the quality of prediction of docking poses. Earlier efforts were focused on improving search algorithm and scoring function in a docking program resulting in a partial improvement with a lot of variations. Although these are basically very important and essential, more tangible improvements came from the reduction of search space. In a normal docking study, the approximate active site is assumed to be known. After defining active site, scoring functions and search algorithms are used to locate the expected binding pose within this search space. A good search algorithm will sample wisely toward the correct binding pose. By careful study of receptor structure, it was possible to prioritize sub-space in the active site using "receptor-based pharmacophores" or "hot spots". In a sense, these techniques reduce the search space from the beginning. Further improvements were made when the bound ligand structure is available, i.e., the searching could be directed by molecular similarity using ligand information. This could be very helpful to increase the accuracy of binding pose. In addition, if the biological activity data is available, docking program could be improved to the level of being useful in affinity prediction for a series of congeneric ligands. Since the number of co-crystal structures is increasing in protein databank, "Ligand-Guided Docking" to reduce the search space would be more important to improve the accuracy of docking pose prediction and the efficiency of virtual screening. Further improvements in this area would be useful to produce more reliable docking programs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5998-6016
• /
• 2017

In thin-film transistor liquid-crystal displays (TFT-LCDs), which are most commonly used in mobile devices, the backlight accounts for about 70% of the power consumption. Therefore, most low-power-related studies focus on realizing power savings through backlight dimming. Image compensation is performed to mitigate the visual distortion caused by the backlight dimming. Therefore, popular techniques include pixel compensation for brightness recovery and contrast enhancement, such as histogram equalization. However, existing pixel compensation techniques often have limitations with respect to blur owing to the pixel saturation phenomenon, or because contrast enhancement cannot adequately satisfy the human visual system (HVS). To overcome these, in this study, we propose a novel dimming technique to achieve both power saving and HVS-awareness by combining the pixel compensation and histogram specifications, which convert the original cumulative density function (CDF) by designing and using the desired CDF of an image. Because the process of obtaining the desired CDF is customized to consider image characteristics, histogram specification is found to achieve better HVS-awareness than histogram equalization. For the experiments, we employ the LIVE image database, and we use the structural similarity (SSIM) index to measure the degree of visual satisfaction. The experimental results show that the proposed technique achieves up to 15.9% increase in the SSIM index compared with existing dimming techniques that use pixel compensation and histogram equalization in the case of the same low-power ratio. Further, the results indicate that it achieves improved HVS-awareness and increased power saving concurrently compared with previous techniques.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2122-2140
• /
• 2020

Proper and precise embedding of commercial ads within Webpages requires Ad-hoc analysis and understanding of their content. By the successful implementation of this step, both publishers and advertisers gain mutual benefits through increasing their revenues on the one hand, and improving user experience on the other. In this research work, we propose a novel multi-level context-based ads serving approach through which ads will be served at generic publisher websites based on their contextual relevance. In the proposed approach, knowledge encoded in domain-specific and generic semantic repositories is exploited in order to analyze and segment Webpages into sets of contextually-relevant segments. Semantically-enhanced indexes are also constructed to index ads based on their textual descriptions provided by advertisers. A modified cosine similarity matching algorithm is employed to embed each ad from the Ads repository into one or more contextually-relevant segments. In order to validate our proposal, we have implemented a prototype of an ad serving system with two datasets that consist of (11429 ads and 93 documents) and (11000 documents and 15 ads), respectively. To demonstrate the effectiveness of the proposed techniques, we experimentally tested the proposed method and compared the produced results against five baseline metrics that can be used in the context of ad serving systems. In addition, we compared the results produced by our system with other state-of-the-art models. Findings demonstrate that the accuracy of conventional ad matching techniques has improved by exploiting the proposed semantically-enhanced context-based ad serving model.