The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper we present a new incremental algorithm for building neighborhood graphs between data. It is inspired from the self-assembly behavior observed in real ants where ants progressively become attached to an existing support and then successively to other attached ants. Each artificial ant represents one data. The way ants move and build a graph depends on the similarity between the data....
In this paper we describe an intelligent and adaptive TV-shopping application that has been designed to recommend mobile phones to perspective buyers. The application is called iTVMobi and its adaptivity is achieved through a user model. The user model monitors users' behaviour and adapts the interaction to them depending on their inferred interests. The underlying reasoning is based on grouping users...
Attraction and commercial success of web sites depend heavily on the additional values visitors may find. Here, individual, automatically obtained and maintained user profiles are the key for user satisfaction. This contribution shows for the example of a cooking information site how user profiles might be obtained using category information provided by cooking recipes. It is shown that metrical distance...
Association rule mining is the task of finding interesting relationships hidden in large transaction databases. Despite the significant progress made in this field, one of the fundamental challenges that remain unresolved is the rule evaluation problem. Most notably, it is difficult to discriminate rules that are known to the domain experts from those that are unexpected. In this paper, we propose...
This paper presents a new algorithm for binarization of historical document images. It is adjusted to deal with the particular case of documents which are written in both sides of the paper. The digitization of these documents in general brings to the digital image this back-to-front interference. In order to deal with it, a thresholding algorithm is proposed based on color quantization by genetic...
In the present work we evaluate a detector of negative emotional states (DNES) that serves the purpose of enhancing a spoken dialogue system, which operates in smart-home environment. The DNES component is based on Gaussian mixture models (GMMs) and a set of commonly used speech features. In comprehensive performance evaluation we utilized a well-known acted speech database and real-world speech recordings...
This paper introduces the subnet generation problem (SGP) which is a new type of network routing problem that is found, for example, in some peer-to-peer applications. We explore two algorithms to solve the SGP by exploiting its special structure. The first algorithm, the tree search algorithm (TS), is an adaptation of an existing algorithm. TS decomposes the SGP into a master problem solved by a...
This paper develops the idea that variable ordering heuristics can be classified on the basis of a small number of distinguishable actions, and that while specific heuristics may be classified differently depending on the problem type, the basic actions that determine their classification are the same. Previous work demonstrated two basic categories of heuristics, and that problems in an apparently...
Most of the local search methods for the satisfiability problem deal with a complete and inconsistent truth assignment of the problem variables, and try to repair it by switching the truth value of some variables until reaching a model. We propose a new local search algorithm which works on partial truth assignments, but always consistent, instead of complete and inconsistent ones. This method attempts...
When handling 2D packing problems, numerous incomplete and complete algorithms maintain a so-called bottom-left (BL) property: every rectangle placed in a container is propped up bottom and left. While it is easy to make a rectangle BL when it is is added in a container, it is more expensive to maintain all the placed pieces BL when a rectangle is removed. This prevents researchers from designing...
In this work, we present comparative evaluation of the practical value of some recently proposed speech parameterizations on the speech recognition task. Specifically, in a common experimental setup we evaluate recent discrete wavelet-packet transform (DWPT)-based speech features against traditional techniques, such as the Mel-frequency cepstral coefficients (MFCC) and perceptual linear predictive...
Eyes are a critical part of facial expressions. Because of the appearance diversity of eyes due to motion, it is difficult to synthesize eye with a particular facial expression. Traditional methods have failed to adequately catch motion-related appearance changes. In order to generate a photorealistic expression eye, we propose a two-step method. Firstly, we propose an eye curve model to represent...
An important factor for discriminating between Web pages is their genre (e.g., blogs, personal homepages, e-shops, online newspapers, etc). Web page genre identification has a great potential in information retrieval since users of search engines can combine genre-based and traditional topic-based queries to improve the quality of the results. So far, various features have been proposed to quantify...
The WindowDiff evaluation measure (Pevzner and Hearst, 2002) is becoming the standard criterion for evaluating text segmentation methods. Nevertheless, this metric is really not fair with regard to the characteristics of the methods and the results that it provides on different kinds of corpus are difficult to compare. Therefore, we first attempt to improve this measure according to the risks taken...
The document-length normalization problem has been widely studied in the field of information retrieval. The cosine normalization (Baeza-Yates and Ribeiro-Neto, 1999), the maximum if normalization (Allan et al., 1997) and the byte length normalization (Robertson et al., 1992) are the most commonly used normalization techniques. In (Singhal et al., 1996), authors studied the retrieval probability of...
Semantic annotation and querying is currently applied on a number of versatile disciplines, providing the added-value of such an approach and, consequently the need for more elaborate - either case-specific or generic - tools. In this context, we have developed Eikonomia: an integrated semantically-aware tool for the description and retrieval of Byzantine artwork Information. Following the needs of...
This paper presents a novel head detection algorithm based on contour analysis on depth images. A sequence of depth-valued images is used as the system input using a 3D time-of-flight depth sensor. The background and foreground layers of the image are segmented using a straightforward depth thresholding technique. Moving regions are further processed in each frame, and contour analysis is performed...
A novel affine invariant region detector based on the 4th differential invariant (DI4) is proposed in this paper. The detector combines scale-space theory with an autocorrelation matrix. Since it is proved that DI4 is a scale- space selection function, feature points and their characteristic scales are first detected by the local maxima of the normalized DI4 over scale-space. Then, the auto-correlation...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.