In this paper, Gaussian smoothing (GS), non-local means (NLM), and Quaternion Wavelet Transform (QWT) have been described in detail. Furthermore, a Brillouin optical time domain analysis (BOTDA) experimental system was built to verify the denoising algorithms. The principal analyses show that QWT algorithm is more efficient image method. results indicate GS can obtain highest signal-to-noise ra...

Twitter offers a phenomenal platform for the social sharing of information. We describe new resources that have been created in the context of the Text Retrieval Conference (TREC) to support the academic study of Twitter as a real-time information source. We formalize an information seeking task—real-time search—and offer a methodology for measuring system effectiveness. At the TREC 2011 Microb...

This paper introduces a novel framework for the accurate retrieval of relational concepts from huge texts. Prior to retrieval, all sentences are annotated with predicate argument structures and ontological identifiers by applying a deep parser and a term recognizer. During the run time, user requests are converted into queries of region algebra on these annotations. Structural matching with pre...

A major problem in information retrieval is the difficulty to define the information needs of user and on the other hand, when user offers your query there is a vast amount of information to retrieval. Different methods , therefore, have been suggested for query expansion which concerned with reconfiguring of query by increasing efficiency and improving the criterion accuracy in the information...

one of the challenging issues in managing the existing large digital image libraries and databases is content based image retrieval (cbir). the accuracy of image retrieval methods in cbir is subject to effective extraction of image features such as color, texture, and shape. in this paper, we propose a new image retrieval method using contourlet transform coefficients to index texture of the im...

We did gram-based indexing and the retrieval with NTCIR-4 WEB task. The time required to make indices are 34.7 hours. The size of indices is 30.2Gbyte. The median of retrieval time par word is 26msec. The ranking algorithm of retrieval results is based on a traditional probabilistic model. We report on the result of gram-based indexing and the retrieval, and propose a scoring method based on li...