检索结果-内蒙古大学图书馆

ACM Conference on Information and Knowledge Management (CIKM)

作者： Luo, Siqiang Hu, Jiafeng Cheng, Reynold Yan, Jing Kao, Ben Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781450349185

Spatial object search is prevalent in map services (e.g., Google Maps). To rent an apartment, for example, one will take into account its nearby facilities, such as supermarkets, hospitals, and subway stations. Traditional keyword search solutions, such as the nearby function in Google Maps, are insufficient in expressing the often complex attribute/spatial requirements of users. Those requirements, however, are essential to reflect the user search intention. In this paper, we propose the Spatial Exemplar query (SEQ), which allows the user to input a result example over an interface inside the map service. We then propose an effective similarity measure to evaluate the proximity between a candidate answer and the given example. We conduct a user study to validate the effectiveness of SEQ. Our result shows that more than 88% of users would like to have an example assisted search in map services. Moreover, SEQ gets a user satisfactory score of 4.3/5.0, which is more than 2 times higher than that of a baseline solution.

关键词： query by example exemplar query spatial query

来源：评论

学校读者我要写书评

暂无评论

Structured representations in a content based image retrieval context

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2013年第8期24卷 1252-1268页

作者： Raveaux, Romain Burie, Jean-Christophe Ogier, Jean-Marc Univ Tours LI Lab Tours France Univ La Rochelle Lab L3I La Rochelle France

Here, we propose an automatic system to annotate and retrieve images. We assume that regions in an image can be described using a vocabulary of blobs. Blobs are generated from image features using clustering. Features are locally extracted on regions to capture Color, Texture and Shape information. Regions are processed by an efficient segmentation algorithm. Images are structured into a region adjacency graph to consider spatial relationships between regions. This representation is used to perform a similarity search into an image set. Hence, the user can express his need by giving a query image, and thereafter receiving as a result all similar images. Our graph based approach is benchmarked to conventional Bag of Words methods. Results tend to reveal a good behavior in classification of our graph based solution on two publicly available databases. Experiments illustrate that a structural approach requires a smaller vocabulary size to reach its best performance. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Content image representation Graph-Based Representation Structural pattern recognition Graph matching Image features Bag of Words Image retrieval query by example

来源：评论

学校读者我要写书评

暂无评论

Efficient Learning-Free Keyword Spotting

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2019年第7期41卷 1587-1600页

作者： Retsinas, George Louloudis, Georgios Stamatopoulos, Nikolaos Gatos, Basilis Natl Ctr Sci Res Demokritos Inst Informat & Telecommun Computat Intelligence Lab GR-15310 Athens Greece Natl Tech Univ Athens Sch Elect & Comp Engn GR-15773 Athens Greece

In this article, a method for segmentation-based learning-free query by example (QbE) keyword spotting on handwritten documents is proposed. The method consists of three steps, namely preprocessing, feature extraction and matching, which address critical variations of text images (e.g., skew, translation, different writing styles). During the feature extraction step, a sequence of descriptors is generated using a combination of a zoning scheme and a novel appearance descriptor, referred as modified Projections of Oriented Gradients. The preprocessing step, which includes contrast normalization and main-zone detection, aims to overcome the shortcomings of the appearance descriptor. Moreover, an uneven zoning scheme is introduced by applying a denser zoning only on query images for a more detailed representation. This leads to a significant reduction in storage requirements of a document collection. The distance between the query and word sequences is efficiently computed by the proposed Selective Matching algorithm. This algorithm is further extended to handle an augmented set of images originating from a single query image. The efficiency of the proposed method is demonstrated by experimentation conducted on seven publicly available datasets. In these experiments, the proposed method significantly outperforms all state-of-the-art learning-free techniques.

关键词： Keyword spotting query by example learning-free gradient orientation descriptor sequence matching

来源：评论

学校读者我要写书评

暂无评论

Robust polyphonic music retrieval with N-grams

引用

JOURNAL OF INTELLIGENT INFORMATION SYSTEMS 2003年第1期21卷 53-70页

作者： Doraisamy, S Rüeger, S Univ London Imperial Coll Sci Technol & Med Dept Comp London SW7 2AZ England

In this paper we investigate the retrieval performance of monophonic and polyphonic queries made on a polyphonic music database. We extend the n-gram approach for full-music indexing of monophonic music data to polyphonic music using both rhythm and pitch information. We define an experimental framework for a comparative and fault-tolerance study of various n-gramming strategies and encoding levels. For monophonic queries, we focus in particular on query-by-humming systems, and for polyphonic queries on query-by-example. Error models addressed in several studies are surveyed for the fault-tolerance study. Our experiments show that different n-gramming strategies and encoding precision differ widely in their effectiveness. We present the results of our study on a collection of 6366 polyphonic MIDI-encoded music pieces.

关键词： polyphonic music retrieval n-grams query by humming query by example fault-tolerance

来源：评论

学校读者我要写书评

暂无评论

PicToSeek: Combining color and shape invariant features for image retrieval

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2000年第1期9卷 102-119页

作者： Gevers, T Smeulders, AWM Fac WINS ISIS Grp NL-1098 SJ Amsterdam Netherlands

We aim at combining color and shape invariants for indexing and retrieving images. To this end, color models are proposed independent of the object geometry, object pose, and illumination. From these color models, color invariant edges are derived from which shape invariant features are computed. Computational methods are described to combine the color and shape invariants into a unified high-dimensional invariant feature set for discriminatory object retrieval. Experiments hale been conducted on a database consisting of 500 images taken from multicolored man-made objects in real world scenes. From the theoretical and experimental results it is concluded that object retrieval based on composite color and shape invariant features provides excellent retrieval accuracy. Object retrieval based on color invariants provides very high retrieval accuracy whereas object retrieval based entirely on shape invariants yields poor discriminative power. Furthermore, the image retrieval scheme is highly robust to partial occlusion, object clutter and a change in the object's pose, Finally, the image retrieval scheme is integrated into the PicToSeek system on-line at http ://***/research/isis/PicToSeek/ for searching images on the World Wide Web.

关键词： color invariant edges color invariants combining color and shape information dichromatic reflection image retrieval object search query by example reflectance properties shape invariants

来源：评论

学校读者我要写书评

暂无评论

querying color images using user-specified wavelet features

引用

KNOWLEDGE AND INFORMATION SYSTEMS 2008年第1期15卷 109-129页

作者： Chiang, Te-Wei Tsai, Tienwei Chihlee Inst Technol Dept Accounting Informat Syst Taipei 220 Taiwan

In this paper, an image retrieval method based on wavelet features is proposed. Due to the superiority in multiresolution analysis and spatial-frequency localization, the discrete wavelet transform (DWT) is used to extract wavelet features (i.e., approximations, horizontal details, vertical details, and diagonal details) at each resolution level. During the feature-extraction process, each image is first transformed from the standard RGB color space to the YUV space for the purpose of efficiency and ease of extracting the features based on color tones;then each component (i.e., Y, U, and V) of the image is further transformed to the wavelet domain. In the image database establishing phase, the wavelet coefficients of each image are stored;in the image retrieving phase, the system compares the wavelet coefficients of the Y, U, and V components of the query image with those of the images in the database, based on the weight factors adjusted by users, and find out good matches. To benefit from the user-machine interaction, a friendly graphic user interface (GUI) for fuzzy cognition is developed, allowing users to easily adjust weights for each feature according to their preferences. In our experiment, 1000 test images are used to demonstrate the effectiveness of our system.

关键词： content-based image retrieval query by example discrete wavelet transform color space

来源：评论

学校读者我要写书评

暂无评论

querying knowledge graphs through positive and negative examples and feedback

引用

JOURNAL OF INTELLIGENT INFORMATION SYSTEMS 2024年第5期62卷 1165-1186页

作者： Akritidis, Akritas Tzitzikas, Yannis Fdn Res & Technol Hellas FORTH Inst Comp Sci N Plastira 100 Iraklion Greece Univ Crete Dept Comp Sci Iraklion Crete Greece

The formulation of structured queries over Knowledge Graphs is not an easy task. To alleviate this problem, we propose a novel interactive method for SPARQL query formulation, for enabling users (plain and advanced) to formulate gradually queries by providing examples and various kinds of positive and negative feedback, in a manner that does not pre-suppose knowledge of the query language or the contents of the Knowledge Graph. In comparison to other example-based query approaches, distinctive features of our approach is the support of negative examples, and the positive/negative feedback on the generated constraints. We detail the algorithmic aspect and we present an interactive user interface that implements the approach. The application of the model on real datasets from DBpedia (Movies, Actors) and other datasets (scientific papers), showcases the feasibility and the effectiveness of the approach. A task-based evaluation that included users that are not familiar with SPARQL, provided positive evidence that the interaction is easy-to-grasp and enabled most users to formulate the desired queries.

关键词： query by example Knowledge graphs

来源：评论

学校读者我要写书评

暂无评论

Null Values in SQL

引用

SIGMOD RECORD 2008年第3期37卷 23-25页

作者： Grant, John Towson Univ Dept Math Towson MD 21252 USA Univ Maryland Dept Comp Sci College Pk MD 20742 USA

In various writings over the past 20 years, such as [3], Date has pointed out that SQL produces incorrect answers to some queries where a null value is included in a table. In a recent article in the ACM SIGMOD Record, [8], Rubinson states that "Date misinterprets the meaning of his example query" and "SQL returns the correct answer to the query posed". The purpose of this article is to show that, contrary to Rubinson's claim, Date's critique of query evaluation in the presence of null values in SQL is completely justified.

关键词： query analysis Critique Null value SQL query by example

来源：评论

学校读者我要写书评

暂无评论

High-level feature aggregation for fine-grained architectural floor plan retrieval

引用

IET COMPUTER VISION 2018年第5期12卷 702-709页

作者： Sharma, Divya Chattopadhyay, Chiranjoy Indian Inst Technol Jodhpur Dept Comp Sci & Engn Jodhpur Rajasthan India

Due to the massive growth of real estate industry, there is an increase in the number of online platforms designed for finding homes/furnished properties. Instead of descriptive words, query by example is always a preferred method for retrieval. Floor plans are the basic 2D representation giving an idea about the building structure at a particular level. The authors propose a framework for the retrieval of similar architectural floor plans under the query by example paradigm. They propose a novel algorithm to extract high-level semantic features from an architectural floor plan. Fine-grained retrieval using weighted sum of the features is proposed, where a feature can be given more preference over others, during retrieval. Experiments were performed on publicly available dataset containing 510 floor plans and compared with existing state-of-the-art techniques. Their proposed method outperforms others both in qualitative and quantitative terms.

关键词： architecture feature extraction floors image retrieval construction industry image representation fine-grained architectural floor plan retrieval estate industry online platforms homes furnished properties high-level semantic features fine-grained retrieval 2D representation architectural floor plans high-level feature aggregation query by example weighted sum

来源：评论

学校读者我要写书评

暂无评论

Matching and retrieval of distorted and occluded shapes using dynamic programming

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2002年第11期24卷 1501-1516页

作者： Petrakis, EGM Diplaros, A Milios, E Tech Univ Crete Dept Elect & Comp Engn GR-73100 Khania Crete Greece Univ Amsterdam Fac Sci Informat Inst NL-1098 SJ Amsterdam Netherlands Dalhousie Univ Fac Comp Sci Halifax NS B3H 1W5 Canada

We propose an approach for matching distorted and possibly occluded shapes using Dynamic Programming (DP). We distinguish among various cases of matching such as cases where the shapes are scaled with respect to each other and cases where an open shape matches the whole or only a part of another open or closed shape. Our algorithm treats noise and shape distortions by allowing matching of merged sequences of consecutive small segments in a shape with larger segments of another shape, while being invariant to translation, scale, orientation, and starting point selection. We illustrate the effectiveness of our algorithm in retrieval of shapes on two data sets of two-dimensional open and closed shapes of marine life species. We demonstrate the superiority of our approach over traditional approaches to shape matching and retrieval based on Fourier descriptors and moments. We also compare our method with SQUID, a well-known method which is available on the Internet. Our evaluation is based on human relevance judgments following a well-established methodology from the information retrieval field.

关键词： image database shape retrieval query by example dynamic programming relevance judgments

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：