• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.496-512
• /
• 2007

In this paper, we propose a novel JPEG-2000 compressed image retrieval system using feature vector extracted through partial entropy decoding. Main idea of the proposed method is to utilize the context information that is generated during entropy encoding/decoding. In the framework of JPEG-2000, the context of a current coefficient is determined depending on the pattern of the significance and/or the sign of its neighbors in three bit-plane coding passes and four coding modes. The contexts provide a model for estimating the probability of each symbol to be coded. And they can efficiently describe texture images which have different pattern because they represent the local property of images. In addition, our system can directly search the images in the JPEG-2000 compressed domain without full decompression. Therefore, our proposed scheme can accelerate the work of retrieving images. We create various distortion and similarity image databases using MIT VisTex texture images for simulation. we evaluate the proposed algorithm comparing with the previous ones. Through simulations, we demonstrate that our method achieves good performance in terms of the retrieval accuracy as well as the computational complexity.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.40-47
• /
• 2009

A motion adaptive video noise reduction scheme is proposed by cascading a temporal filter and a spatial filter. After a noise-robust motion detection is performed with a pre-spatial filter, the strength of the motion adaptive temporal filter is controlled by the amount of temporal movement. In order to fully utilize the temporal correlation of video signal, noisy input image is processed first by the temporal filter, therefore, image details of temporally stationary region are quite well preserved while undesired noises are suppressed. In contrast to the pre-spatial filter used for the robust motion detection, the cascaded post-spatial filter removes the remained noises by considering the strength of the temporal filter and the spatial self-similarity search results obtained from the pre-spatial filter.

• The KIPS Transactions:PartB
• /
• v.16B no.1
• /
• pp.71-78
• /
• 2009

For more effective index extraction and index weight determination, studies of extracting indices are carried out by using document content as well as structure. However, most of studies are concentrating in calculating the importance of context rather than that of XML tag. These conventional studies determine its importance from the aspect of common sense rather than verifying that through an objective experiment. This paper, for the automatic indexing by using the tag information of XML document that has taken its place as the standard for web document management, classifies major tags of constructing a paper according to its importance and calculates the term weight extracted from the tag of low weight. By using the weight obtained, this paper proposes a method of calculating the final weight while updating the term weight extracted from the tag of high weight. In order to determine more objective weight, this paper tests the tag that user considers as important and reflects it in calculating the weight by classifying its importance according to the result. Then by comparing with the search performance while using the index weight calculated by applying a method of determining existing tag importance, it verifies effectiveness of the index weight calculated by applying the method proposed in this paper.

• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.357-368
• /
• 2006

This paper discusses the way of processing time-series subsequence matching under time warping. Time warping enables finding sequences with similar patterns even when they are of different lengths. The prefix-querying method is the first index-based approach that performs time-series subsequence matching under time warping without false dismissals. This method employs the $L_{\infty}$ as a base distance function for allowing users to issue queries conveniently. In this paper, we extend the prefix-querying method for absorbing $L_1$, which is the most-widely used as a base distance function in time-series subsequence matching under time warping, instead of $L_{\infty}$. We also formally prove that the proposed method does not incur any false dismissals in the subsequence matching. To show the superiority of our method, we conduct performance evaluation via a variety of experiments. The results reveal that our method achieves significant performance improvement in orders of magnitude compared with previous methods.

• Genomics & Informatics
• /
• v.3 no.3
• /
• pp.86-93
• /
• 2005

Human brain EST data provide important clues for our understanding of the molecular biology associated with the function of the normal brain and the molecular pathophysiology with brain disorders. To systematically and efficiently study the function and disorders of the human brain, 45,773 human brain ESTs were collected from 27 human brain cDNA libraries, which were constructed from normal brains and brain disorders such as brain tumors, Parkinson's disease (PO) and epilepsy. An analysis of 45,773 human brain ESTs using our EST analysis pipeline resulted in 38,396 high-quality ESTs and 35,906 ESTs, which were coalesced into 8,246 unique gene clusters, showing a significant similarity to known genes in the human RefSeq, human mRNAs and UniGene database. In addition, among 8,246 gene clusters, 4,287 genes ($52\%$) were found to contain full-length cONA clones. To facilitate the extraction of useful information in collected these human brain ESTs, we developed a user-friendly interface system, the Korea Brain Unigene Database (KBUD). The KBUD web interface allows access to our human brain data through three major search modes, the BioCarta pathway, keywords and BLAST searches. Each result when viewed in KBUD offers comprehensive information concerning the analyzed human brain ESTs provided by our data as well as data linked to various other publiC databases. The user-friendly developed KBUD, the first world-wide web interface for human brain EST data with ESTs of human brain disorders as well as normal brains, will be a helpful system for developing a better understanding of the underlying mechanisms of the normal brain well as brain disorders. The KBUD system is freely accessible at http://kugi.kribb.re.kr/KU/cgi -bin/brain. pI.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.362-371
• /
• 2003

In this paper, we propose an optimal interest point extraction method to support shape-base image classification and indexing for image database by applying a dynamic threshold that reflects the characteristics of the shape contour. The threshold is determined dynamically by comparing the contour length ratio of the original shape and the approximated polygon while the algorithm is running. Because our algorithm considers the characteristics of the shape contour, it can minimize the number of interest points. For n points of the contour, the proposed algorithm has O(nlogn) computational cost on an average to extract the number of m optimal interest points. Experiments were performed on the 70 synthetic shapes of 7 different contour types and 1100 fish shapes. It shows the average optimization ratio up to 0.92 and has 14% improvement, compared to the fixed threshold method. The shape features extracted from our proposed method can be used for shape-based image classification, indexing, and similarity search via normalization.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.307-319
• /
• 2004

Recently, ebXML and Web Services are emerging as the XML-based electronic business frameworks. To provide a set of registry services which users or applications can store and search the business information, ebXML and Web Services use ebXML registry and UDDI registry, respectively. They use the different registries each other, but there are something that similiar to the structure and functions of both of registries. In this paper, we analyze the similarity of ebXML Registry Information Model(RIM) and UDDI data structure, and construct the mapping information. So, we design and implement the UDDI Service Middleware which translates the request of UDDI registry service into the request of ebXML registry service using the algorithm. Consequently, we could use the ebXML registry like ebXML registry as well as UDDI registry without any changes in the ebXML registry itself so that we can not need to have both of registries for e-business.

• Journal of Plant Biotechnology
• /
• v.37 no.4
• /
• pp.472-482
• /
• 2010

For the massive screening of the genes related to oxidative stress, a cDNA library was constructed from hot pepper (Capsicum annuum L. cv. Nockkwang) leaves treated with methyl viologen. From this library, 1,589 cDNA clones were sequenced from their 5' ends. The sequences were clustered into 1,252 unigenes comprised of 152 contigs and 1,100 singletons. Similarity search against NCBI protein database identified 1,005 ESTs (80.3%) as Known, 197 ESTs (15.7%) as Unknown, and 50 ESTs (3.99%) as No hit. In the ESTs, oxidative stress-related genes such as ascorbate peroxidase, catalase, and osmotin precursor were highly expressed. The cDNA microarray containing 1,252 unigenes was constructed and used to analyze their expression upon methyl viologen treatment. Analyses of the hybridization revealed that various stress-related genes such as peroxidase, tyrosine aminotransferase, and omega-6 fatty acid desaturase, were induced and some metabolism related genes such as aldolase and ketol-acid reductoisomerase, were repressed by methyl viologen treatment, respectively. The information from this study will be used for further study on the functional roles of oxidative stress-related genes and signaling network of oxidative stress in hot pepper.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.9
• /
• pp.889-897
• /
• 2010

Recently, a cutting-edge large-scale image database system has demanded these attributes: search with alarming speed, performs with high accuracy, archives efficiently and much more. An image identifier (descriptor) is for measuring the similarity of two images which plays an important role in this system. The extraction method of an image identifier can be roughly classified into two methods: a local and global method. In this paper, the proposed image identifier, LFH(Local Feature's Histogram), is obtained by a histogram of robust and distinctive local descriptors (features) constrained by a district sub-division of a local region. Furthermore, LFH has not only the properties of a local and global descriptor, but also can perform calculations at a magnificent clip to determine distance with pinpoint accuracy. Additionally, we suggested a way to extract LFH via GPU (OpenGL and GLSL). In this experiment, we have compared the LFH with SIFT (local method) and EHD (global method) via storage capacity, extraction and retrieval time along with accuracy.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.8
• /
• pp.534-546
• /
• 2009

Query by humming is an effective and intuitive querying mechanism when a user wants to find a song without knowing lyrics. The query by humming system takes a user-hummed melody as input, compares it with melodies in a music database, and returns top-k similar melodies to the input. In this paper, we propose a novel algebra for query by humming, and design and implement a real query by humming system called HummingBase by exploiting the algebra. By analyzing existing similarity search techniques, we derive 10 core operators for the algebra. By using the well-defined algebra, we can easily implement such a system in a extensible and modular way. With two case studies, we show that the proposed algebra can easily represent the query processing processes of existing query-by-humming systems.