Image Search Research Papers - Academia.edu (original) (raw)

Content-Based Image Retrieval (CBIR) systems are required to effectively harness infor- mation from ubiquitous image collections. Despite intense research efforts by the multidis- ciplinary CBIR community since early 1990s, apparently... more

Content-Based Image Retrieval (CBIR) systems are required to effectively harness infor- mation from ubiquitous image collections. Despite intense research efforts by the multidis- ciplinary CBIR community since early 1990s, apparently there is a mismatch between these advances and the one that is truly required to bring success to CBIR in the commercial mar- ket place. In this paper we provide

The author investigates the lolicons in the digital age by looking at social, political, and psychological factors that might explain interest in the subculture. There is also consideration of legal restrictions and their effectiveness by... more

The author investigates the lolicons in the digital age by looking at social, political, and psychological factors that might explain interest in the subculture. There is also consideration of legal restrictions and their effectiveness by looking at economics and how frequently lolicons appear in social media. This investigation is important as the topic of pornography is controversial as a right of free speech, and the Supreme Court views are discussed.

1.1 Abstract We describe our work using linear discrimination of multi-channel electroencephalography for single-trial detection of neural signatures of visual r ecognition events. We demonstrate the approach as a methodology for relating... more

1.1 Abstract We describe our work using linear discrimination of multi-channel electroencephalography for single-trial detection of neural signatures of visual r ecognition events. We demonstrate the approach as a methodology for relating neural variability to response variability, de- scribing studies for response accuracy and response latency during visual target detection. We then show how the approach can be utilized to

The availability of various photo archives and photo sharing systems made similarity searching much more important because the photos are not usually conveniently tagged. So the photos (images) need to be searched by their content.... more

The availability of various photo archives and photo sharing systems made similarity searching much more important because the photos are not usually conveniently tagged. So the photos (images) need to be searched by their content. Moreover, it is important not only to compare images with a query holistically but also to locate images that contain the query as their part. The query can be a picture of a person, building, or an abstract object and the task is to retrieve images of the query object but from a different perspective or images capturing a global scene containing the query object. This retrieval is called the sub-image searching. In this paper, we propose an algorithm for retrieving database images by their similarity to and containment of a query. The novelty of it lies in application of a sequence alignment algorithm, which is commonly used in text retrieval. This forms an orthogonal solution to currently used approaches based on inverted files. The proposed algorithm is evaluated on a real-life data set containing photographs where images of logos are searched. It was compared to a state-of-the-art method and the improvement of 20% in average mean precision was obtained.

Two equal length strings s and s′, over alphabets Σs and Σs′, parameterize match if there exists a bijection π : Σs → Σs′ such that π (s) = s′, where π (s) is the renaming of each character of s via π. Parameterized... more

Two equal length strings s and s′, over alphabets Σs and Σs′, parameterize match if there exists a bijection π : Σs → Σs′ such that π (s) = s′, where π (s) is the renaming of each character of s via π. Parameterized matching is the problem of finding all parameterized matches of a pattern string p in a text t, and approximate parameterized matching is the problem of finding at each location a bijection π that maximizes the number of characters that are mapped from p to the appropriate |p|-length substring of t. Parameterized matching was introduced as a model for software duplication detection in software maintenance systems and also has applications in image processing and computational biology. For example, approximate parameterized matching models image searching with variable color maps in the presence of errors. We consider the problem for which an error threshold, k, is given, and the goal is to find all locations in t for which there exists a b...

Extending beyond the boundaries of science, art, and culture, content-based multimedia information retrieval provides new paradigms and methods for searching through the myriad variety of media all over the world. This survey reviews 100+... more

Extending beyond the boundaries of science, art, and culture, content-based multimedia information retrieval provides new paradigms and methods for searching through the myriad variety of media all over the world. This survey reviews 100+ recent articles on content-based multimedia information retrieval and discusses their role in current research directions which include browsing and search paradigms, user studies, affective computing, learning, semantic queries, new features and media types, high performance indexing, and evaluation techniques. Based on the current state of the art, we discuss the major challenges for the future.

This paper describes a study on the image searching behavior of end-users (journalists) and intermediaries (archivists) in a newspaper editorial office. Image queries by end-users and requests to intermediaries were analyzed, compared and... more

This paper describes a study on the image searching behavior of end-users (journalists) and intermediaries (archivists) in a newspaper editorial office. Image queries by end-users and requests to intermediaries were analyzed, compared and categorized according to typologies from literature. The process of image selection was modeled and selection criteria were studied based on interviews, observation and a survey. The results

The problem of selecting a best representative image from a group of similar images is an important problem as it can expedite the task of image search and image matching. We solve this problem by first measuring the similarity between... more

The problem of selecting a best representative image from a group of similar images is an important problem as it can expedite the task of image search and image matching. We solve this problem by first measuring the similarity between every pair of image in the set by a suitable similarity measure, and then transforming the problem to similarity space and finding the corresponding locations of the images in the similarity space. Finally, the image located closest to the center of the preoccupied similarity space is selected as the best representative image. The difficulty in such a problem arises in attempting to find the locations of N images in the similarity space, since this leads to a set of N(N–1) non-linear simultaneous algebraic equations with N^2 unknowns. We solve such a problem by forcing the solution to be in R^(N–1). We present a closed-form solution for the cases when N = 3, 4 and 5. We give examples of finding the best representative images for two sets as an application of the method.