The present invention deals with a method to search one item or a group of similar items within a number of items stored in a database, where each item is assigned with a representative graphical information, such as an image, sound, or text which identifies and characterizes the item itself. The method includes the following steps: a) organizing the database as a relational structure where all the representative information are grouped in a number of subsets according to a predetermined criterion of similarity, so that the information contained in each subset show differences in the informative content below a predetermined threshold value; b) associating to at least one of the subsets a probability value which depends on the subset content and/or from the results of previous search procedures and/or from the status of the ongoing search; c) randomly selecting one among the subsets according to the probability value assigned at the previous step, and simultaneously reproducing at least one part of the information contained in the same subset; d) if the searched item is not within the reproduced ones, repeating at least the previous step, until the user is able to find some interesting information.

Procedure for searching of data or a group of data in a database

BENINI, Sergio;LEONARDI, Riccardo
2009-01-01

Abstract

The present invention deals with a method to search one item or a group of similar items within a number of items stored in a database, where each item is assigned with a representative graphical information, such as an image, sound, or text which identifies and characterizes the item itself. The method includes the following steps: a) organizing the database as a relational structure where all the representative information are grouped in a number of subsets according to a predetermined criterion of similarity, so that the information contained in each subset show differences in the informative content below a predetermined threshold value; b) associating to at least one of the subsets a probability value which depends on the subset content and/or from the results of previous search procedures and/or from the status of the ongoing search; c) randomly selecting one among the subsets according to the probability value assigned at the previous step, and simultaneously reproducing at least one part of the information contained in the same subset; d) if the searched item is not within the reproduced ones, repeating at least the previous step, until the user is able to find some interesting information.
2009
Ateneo di appartenenza
Europeo
NO
PE7_7 Signal processing
PE6_9 Human computer interaction and interface, visualization and natural language processing
PE6_8 Computer graphics, computer vision, multi media, computer games
09425254.1
Università degli Studi di Brescia - Queen Mary, University of London
ELETTRONICO
Inglese
Internazionale
Search; Navigation; Multimedia Information Retrieval; Hierarchical Clustering; Random selection
Il pdf allegato non riporta i nomi degli autori afferenti alla Queen Mary University. l'Ufficio Brevetti Europeo ha preso nota della dimenticanza ed ha apportato la correzione solo a livello bibliografico, pertanto non verrà emesso un ulteriore documento. (21) Application number: 09425254.1 (22) Date of filing: 01.07.2009 (51) Int Cl.: G06F17/30(2006.01)
Altre Istituz. pubb. estere
6 Brevetti::6.1 Brevetto
partially_open
Janjusevic, T; Benini, Sergio; Izquierdo, E; Leonardi, Riccardo
info:eu-repo/semantics/patent
285
4
File in questo prodotto:
File Dimensione Formato  
PATENT_E0073187_publ_A1-short.pdf

accesso aperto

Descrizione: EPO publication
Tipologia: Full Text
Licenza: Creative commons
Dimensione 446.76 kB
Formato Adobe PDF
446.76 kB Adobe PDF Visualizza/Apri
Patent EP2270683A1 - Procedure for searching of data or a group of data in a database - Google Patents.pdf

solo utenti autorizzati

Licenza: Creative commons
Dimensione 752.26 kB
Formato Adobe PDF
752.26 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11379/26531
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact