• Title/Summary/Keyword: search similarity

Search Result 535, Processing Time 0.028 seconds

Medical Image Retrieval with Relevance Feedback via Pairwise Constraint Propagation

  • Wu, Menglin;Chen, Qiang;Sun, Quansen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.1
    • /
    • pp.249-268
    • /
    • 2014
  • Relevance feedback is an effective tool to bridge the gap between superficial image contents and medically-relevant sense in content-based medical image retrieval. In this paper, we propose an interactive medical image search framework based on pairwise constraint propagation. The basic idea is to obtain pairwise constraints from user feedback and propagate them to the entire image set to reconstruct the similarity matrix, and then rank medical images on this new manifold. In contrast to most of the algorithms that only concern manifold structure, the proposed method integrates pairwise constraint information in a feedback procedure and resolves the small sample size and the asymmetrical training typically in relevance feedback. We also introduce a long-term feedback strategy for our retrieval tasks. Experiments on two medical image datasets indicate the proposed approach can significantly improve the performance of medical image retrieval. The experiments also indicate that the proposed approach outperforms previous relevance feedback models.

A Position-Based Block Similarity Computing Method for Similar Transcript Model Search (유사 전사체 모델 탐색을 위한 위치 기반 블록 간의 유사도 비교 기법)

  • Kim, Sora;Park, TaeWon;Hwang, HyeRyeon;Cho, Hwan-Gue
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.1326-1329
    • /
    • 2012
  • 전사체(transcript)는 유전자로부터 전사된 DNA 시퀀스 코드를 말한다. 전사체(transcript)의 발현된 형태에 따라 생성되는 단백질의 형태 역시 달라지므로 전사체 모델의 형태는 중요한 의미를 가지며 특정 위치의 전사체가 정상과 다르게 모델이 변할 경우 심각한 경우에는 유전자 질병에 노출될 수 있다. 현재 실험체에 대한 전사체 모형은 SpliceGrapher, Cufflinks와 같은 상용화된 도구들을 사용하여 얻을 수 있다. 하지만 이런 도구 간의 결과 값 및 어노테이션 정보와 결과 값 간의 유사도 비교를 위한 방법론은 현재 알려진 바 없다. 대신 전사체 비교를 위해 모형 간의 차이를 눈으로 하나씩 비교하거나 전사체 위치를 이용한 산수 값을 이용한다. 본 논문에서는 전사체 모형 간의 유사도를 비교하기 위한 방법론을 제시하고 Homo sapiens grch37 어노테이션 파일과 SRR387514 실험 데이터 간의 유사도를 제시한 방법론을 이용하여 측정한 결과 값을 분석하였다.

De-novo Hybrid Protein Design for Biodegradation of Organophosphate Pesticides

  • Awasthi, Garima;Yadav, Ruchi;Srivastava, Prachi
    • Microbiology and Biotechnology Letters
    • /
    • v.47 no.2
    • /
    • pp.278-288
    • /
    • 2019
  • In the present investigation, we attempted to design a protocol to develop a hybrid protein with better bioremediation capacity. Using in silico approaches, a Hybrid Open Reading Frame (Hybrid ORF) is developed targeting the genes of microorganisms known for degradation of organophosphates. Out of 21 genes identified through BLAST search, 8 structurally similar genes (opdA, opd, opaA, pte RO, pdeA, parC, mpd and phnE) involved in biodegradation were screened. Gene conservational analysis categorizes these organophosphates degrading 8 genes into 4 super families i.e., Metallo-dependent hydrolases, Lactamase B, MPP and TM_PBP2 superfamily. Hybrid protein structure was modeled using multi-template homology modeling (3S07_A; 99%, 1P9E_A; 98%, 2ZO9_B; 33%, 2DXL_A; 33%) by $Schr{\ddot{o}}dinger$ software suit version 10.4.018. Structural verification of protein models was done using Ramachandran plot, it was showing 96.0% residue in the favored region, which was verified using RAMPAGE. The phosphotriesterase protein was showing the highest structural similarity with hybrid protein having raw score 984. The 5 binding sites of hybrid protein were identified through binding site prediction. The docking study shows that hybrid protein potentially interacts with 10 different organophosphates. The study results indicate that the hybrid protein designed has the capability of degrading a wide range of organophosphate compounds.

A New Putative Chitinase from Reticulitermes speratus KMT001

  • Ham, Youngseok;Park, Han-Saem;Kim, Yeong-Suk;Kim, Tae-Jong
    • Journal of the Korean Wood Science and Technology
    • /
    • v.47 no.3
    • /
    • pp.371-380
    • /
    • 2019
  • Termites are pests that cause serious economic and cultural damage by digesting wood cellulose. Termites are arthropods and have an epidermis surrounded by a chitin layer. To maintain a healthy epidermis, termites have chitinase (${\beta}$-1,4-poly-N-acetyl glucosamidinase, EC 3.2.1.14), an enzyme that hydrolyzes the ${\beta}$-1,4 bond of chitin. In this study, the amino acid sequence of the gene, which is presumed to be termite chitinolytic enzyme (NCBI accession no. KC477099), was obtained from a transcriptomic analysis of Reticulitermes speratus KMT001 in Bukhan Mountain, Korea. An NCBI protein BLAST search confirmed that the protein is a glycoside hydrolase family 18 (GH18). The highest homology value found was 47%, with a chitinase from Araneus ventricosus. Phylogenetic analysis indicated that the KC477099 protein has the same origins as those of arthropods but has a very low similarity with other arthropod chitinases, resulting in separation at an early stage of evolution. The KC477099 protein contains two conserved motifs, which encode the general enzymatic characteristics of the GH18 group. The amino acid sequences $Asp^{156}-Trp^{157}-Glu^{158}$, which play an important role in the enzymatic activity of the GH18 group, were also present. This study suggests that the termite KC477099 protein is a new type of chitinase, which is evolutionarily distant from other insect chitinases.

Research on Business Job Specification through Employment Information Analysis (채용정보 분석을 통한 비즈니스 직무 스펙 연구)

  • Lee, Jong Hwa;Lee, Hyun Kyu
    • The Journal of Information Systems
    • /
    • v.31 no.1
    • /
    • pp.271-287
    • /
    • 2022
  • Purpose This research aims to study the changes in recruitment needed for the growth and survival of companies in the rapidly changing industry. In particular, we built a real company's worklist accounting for the rapidly advancing data-driven digital transformation, and presented the capabilities and conditions required for work. Design/methodology/approach we selected 37 jobs based on NCS to develop the employment search requirements by analyzing the business characteristics and work capabilities of the industry and company. The business specification indicators were converted into a matrix through the TF-IDF process, and the NMF algorithm is used to extract the features of each document. Also, the cosine distance measurement method is utilized to determine the similarity of the job specification conditions. Findings Companies tended to prefer "IT competency," which is a specification related to computer use and certification, and "experience competency," which is a specification for experience and internship. In addition, 'foreign language competency' was additionally preferred depending on the job. This analysis and development of job requirements would not only help companies to find the talents but also be useful for the jobseekers to easily decide the priority of their specification activities.

Font Recommendation Service Based on Emotion Keyword Attribute Value Estimation (감정 기반 키워드 속성값 산출에 따른 글꼴 추천 서비스)

  • Ji, Youngseo;Lim, SoonBum
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.8
    • /
    • pp.999-1006
    • /
    • 2022
  • The use of appropriate fonts is not only an aesthetic point of view, but also a factor influencing the reinforcement of meaning. However, it is a difficult process and wastes a lot of time for general users to choose a font that suits their needs and emotions. Therefore, in this study, keywords and fonts to be used in the experiment were selected for emotion-based font recommendation, and keyword values for each font were calculated through an experiment to check the correlation between keywords and fonts. Using the experimental results, a prototype of a keyword-based font recommendation system was designed and the possibility of the system was tested. As a result of the usability evaluation of the font recommendation system prototype, it received a positive evaluation compared to the existing font search system, but the number of fonts was limited and users had difficulties in the process of associating keywords suitable for their desired situation. Therefore, we plan to expand the number of fonts and conduct follow-up research to automatically recommend fonts suitable for the user's situation without selecting keywords.

Mitochondrial DNA-based investigation of dead rorqual (Cetacea: Balaenopteridae) from the west coast of India

  • Shantanu Kundu;Manokaran Kamalakannan;Dhriti Banerjee;Flandrianto Sih Palimirmo;Arif Wibowo;Hyun-Woo Kim
    • Fisheries and Aquatic Sciences
    • /
    • v.27 no.1
    • /
    • pp.48-55
    • /
    • 2024
  • The study assessed the utility of mitochondrial DNA for identifying a deceased rorqual discovered off the western coast of India. Both the COI and Cytb genes exhibited remarkable 99-100% similarity with the GenBank sequence of Balaenoptera musculus through a global BLAST search, confirming their affiliation with this species. Inter-species genetic distances for COI and Cytb genes ranged from 6.75% to 9.80% and 7.37% to 10.96% respectively, compared with other Balaenopteridae species. The Bayesian phylogenies constructed based on both COI and Cytb genes demonstrated clear and separate clustering for all Balaenopteridae species, further reaffirming their distinctiveness, while concurrently revealing a cohesive clustering pattern of the generated sequences within the B. musculus clade. Beyond species confirmation, this study provides valuable insights into the presence of live and deceased B. musculus individuals within Indian marine ecosystems. This information holds significant potential for guiding conservation efforts aimed at safeguarding Important Marine Mammal Areas (IMMAs) in India over the long term.

Incorporating Deep Median Networks for Arabic Document Retrieval Using Word Embeddings-Based Query Expansion

  • Yasir Hadi Farhan;Mohanaad Shakir;Mustafa Abd Tareq;Boumedyen Shannaq
    • Journal of Information Science Theory and Practice
    • /
    • v.12 no.3
    • /
    • pp.36-48
    • /
    • 2024
  • The information retrieval (IR) process often encounters a challenge known as query-document vocabulary mismatch, where user queries do not align with document content, impacting search effectiveness. Automatic query expansion (AQE) techniques aim to mitigate this issue by augmenting user queries with related terms or synonyms. Word embedding, particularly Word2Vec, has gained prominence for AQE due to its ability to represent words as real-number vectors. However, AQE methods typically expand individual query terms, potentially leading to query drift if not carefully selected. To address this, researchers propose utilizing median vectors derived from deep median networks to capture query similarity comprehensively. Integrating median vectors into candidate term generation and combining them with the BM25 probabilistic model and two IR strategies (EQE1 and V2Q) yields promising results, outperforming baseline methods in experimental settings.

A Study on the Guided Search Method for Transcoding MPEG2 P frame to H.263 P frame in a Compressed Domain (압축상태에서 MPEG2 P 프레임을 H.263 P 프레임으로 변환하기 위한 가이드 탐색 방법 연구)

  • Um, Sung-Min;Kang, Eui-Seon;Lim, Young-Wan;Hwang, Jae-Gak
    • The KIPS Transactions:PartB
    • /
    • v.9B no.6
    • /
    • pp.745-752
    • /
    • 2002
  • The purpose of the paper is to enable a format transcoding between a heterogeneous compression format in a real time, and to enhance the compression ratio using characteristics of the compressed frame. In this paper, for the heterogeneous format transcoding, we tried to transcode from MPEG2 having a lower compression ratio to H.263 having a higher compression ratio. After analyzing MPEG 2 bit stream and H.263 bit stream of the same original video, we found that the number of intra coded macro blocks in MPEG 2 data is much higher than the number of the intra coded macro blocks in H.263 data. In the process of P frame generation, a intra coded macro block is generated when a motion estimation value representing the similarity between the previous frame and current frame does not meet a threshold. Especially the intra coded macro block has a great impact on the compression ratio. Hence the paper, we tried to minimize the number of intra coded macro blocks in H.263 data stream which is transcoded from MPEG 2 in a compressed domain. For the purpose, we propose a guided search method for transcoding the INTRA coded block into INTER coded block using the information about motion vectors surrounding the intra macro block in order to minimize the complexity of the motion estimation process. The experimental results show that the transcoding of MPEG 2 into H.263 can be done in a real time successfully.

Combined Image Retrieval System using Clustering and Condensation Method (클러스터링과 차원축약 기법을 통합한 영상 검색 시스템)

  • Lee Se-Han;Cho Jungwon;Choi Byung-Uk
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.1 s.307
    • /
    • pp.53-66
    • /
    • 2006
  • This paper proposes the combined image retrieval system that gives the same relevance as exhaustive search method while its performance can be considerably improved. This system is combined with two different retrieval methods and each gives the same results that full exhaustive search method does. Both of them are two-stage method. One uses condensation of feature vectors, and the other uses binary-tree clustering. These two methods extract the candidate images that always include correct answers at the first stage, and then filter out the incorrect images at the second stage. Inasmuch as these methods use equal algorithm, they can get the same result as full exhaustive search. The first method condenses the dimension of feature vectors, and it uses these condensed feature vectors to compute similarity of query and images in database. It can be found that there is an optimal condensation ratio which minimizes the overall retrieval time. The optimal ratio is applied to first stage of this method. Binary-tree clustering method, searching with recursive 2-means clustering, classifies each cluster dynamically with the same radius. For preserving relevance, its range of query has to be compensated at first stage. After candidate clusters were selected, final results are retrieved by computing similarities again at second stage. The proposed method is combined with above two methods. Because they are not dependent on each other, combined retrieval system can make a remarkable progress in performance.