Patents by Inventor Youenn Fablet

Youenn Fablet has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 8914718
    Abstract: The present invention concerns a method and device for coding a structured document comprising events to be coded having values. A particular, non-exclusive, application of the present invention is the coding of the XML document as a file of the EXI type. The method comprises the following steps: running through the document in order to process events; forming channels of values containing values of events according to at least one criterion; coding the channels of values thus formed by coding the event values of each of these channels of values by means of at least one coding dictionary; method wherein the formation device comprises, for each event to be coded and run through having a value, the association of this value to be coded with one of said channels by reference, in said channel, to an entry in the coding dictionary.
    Type: Grant
    Filed: May 4, 2010
    Date of Patent: December 16, 2014
    Assignee: Canon Kabushiki Kaisha
    Inventors: Franck Denoual, Youenn Fablet
  • Publication number: 20140355627
    Abstract: Methods and devices for encoding or decoding messages, each message including a list of information items. The encoding method comprises determining a first list of indexes associated with information items that are already indexed in a local indexing table and a second list of literal values of other information items not yet indexed in said indexing table; encoding the indexes of the first list; binary compressing at least a serialized binary representation of the literal values of the second list; and concatenating the first list and the second list together to obtain an encoded bitstream of the information items. When the messages are sent over a plurality of connections, a global table is shared between the connections to store the indexed items of information; and a local indexing table for each connection associates indexes with references to an entry of the shared global table.
    Type: Application
    Filed: November 5, 2012
    Publication date: December 4, 2014
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Romain Bellessort, Youenn Fablet, Hervé Ruellan
  • Patent number: 8850309
    Abstract: An object of the invention is in particular methods and devices for analyzing, processing and evaluating expressions of the XPath type on data of the XML type with which coding or decoding tables are associated. After generating a list comprising a set of targets from the XPath-type expression, one target is linked to the coding/decoding table (115). When one part of the set of data is accessed, a reference to an item is identified in the table using the part of data. It makes it possible to access a target linked to the table in order to reconstruct the item (145) and evaluate the expression (150). According to a particular embodiment, a parameter representing the discriminating character of the targets is determined and linked to the table to enable the discriminating character of the targets to be taken into account during the evaluation of the XPath expression on the XML-type data.
    Type: Grant
    Filed: March 27, 2009
    Date of Patent: September 30, 2014
    Assignee: Canon Kabushiki Kaisha
    Inventors: Youenn Fablet, Franck Denoual
  • Patent number: 8819232
    Abstract: The present invention relates to a method and a system for managing access to a resource, copies of which are hosted in apparatuses of one or more networks. The method comprises obtaining a list comprising a plurality of references pointing to the plurality of copies of the resource; for each of said references, determining at least one accessibility rating representing the accessibility of the corresponding copy for the given user device, and, based on the at least one accessibility rating, deciding between keeping the corresponding reference in the list or deleting it therefrom, to obtain an updated list; and selecting a reference from the updated list for the given user device to access the resource.
    Type: Grant
    Filed: January 17, 2012
    Date of Patent: August 26, 2014
    Assignee: Canon Kabushiki Kaisha
    Inventors: Romain Bellessort, Youenn Fablet, Herve Ruellan
  • Patent number: 8751678
    Abstract: The present invention concerns a method of generating a syndication web feed (10) composed of entries (12) corresponding to content elements, and an associated system. The method comprises the steps consisting of: determining (E110, E221, E300) at least one activity parameter (A) representing a frequency of obtaining content elements to be published; calculating (E620, E770) at least one similarity value (SI) between a content element (IT) to be published in the web stream (10) and at least one entry (E) in said web stream; selecting (E130, E640) an entry (EP) in said web stream according to the at least one calculated similarity value (SI) and the at least one determined activity parameter (A); adding (E140) said content element to be published (IT) to said selected entry.
    Type: Grant
    Filed: November 5, 2010
    Date of Patent: June 10, 2014
    Assignee: Canon Kabushiki Kaisha
    Inventors: Romain Bellessort, Youenn Fablet, Hervé Ruellan
  • Patent number: 8706884
    Abstract: The present invention relates to an augmented data structure representing the availability of resources in a communication device, such as an augmented Bloom filter. A method of generating and using the augmented data structure comprises: providing first and additional groups of resources available in the same communication device; providing one or more hash functions for each of the first and additional groups, and calculating one or more hash values for each resource using the one or more corresponding hash functions; mapping each obtained hash value onto one entry of a data structure, wherein the hash values obtained from a resource of the first group are mapped onto a first subpart of the data structure only, such as a conventional Bloom array, and the hash values obtained from a resource of an additional group are mapped onto a portion of the data structure including the first subpart and an additional subpart.
    Type: Grant
    Filed: June 19, 2012
    Date of Patent: April 22, 2014
    Assignee: Canon Kabushiki Kaisha
    Inventors: Herve Ruellan, Romain Bellessort, Youenn Fablet
  • Patent number: 8698657
    Abstract: The present invention relates to data compression using compression dictionary. A compression method according to the invention comprises obtaining an initial compression dictionary and a separate secondary dictionary SD; determining at least one subpart of the secondary dictionary that correlates with a block of data DB to compress; updating the initial compression dictionary by inserting the determined at least one subpart therein, to obtain an updated compression dictionary used for compressing the block of data; and compressing the block of data using one or more references to entries of the obtained updated compression dictionary.
    Type: Grant
    Filed: September 10, 2012
    Date of Patent: April 15, 2014
    Assignee: Canon Kabushiki Kaisha
    Inventors: Youenn Fablet, Romain Bellessort, Hervé Ruellan
  • Publication number: 20140075453
    Abstract: The invention relates to a method for controlling communication between web applications in a web runtime environment such as a web browser. The method comprises the step of: executing code of a service provider application by the web runtime environment thereby providing a data object; obtaining a list of one or more service requester applications, each service requester application being adapted to generate a service request and implementing an interface for receiving a data object in response to the generated service request; enabling the selection, among the obtained list, of one or more requester applications adapted to receive data objects of the same type as the provided data object; and communicating the provided data object to the selected one or more requester applications via their corresponding interface. The invention also relates to a computer program and a processing device adapted to execute the method.
    Type: Application
    Filed: September 6, 2013
    Publication date: March 13, 2014
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Romain BELLESSORT, Youenn FABLET, Herve RUELLAN
  • Publication number: 20140070966
    Abstract: The present invention relates to data compression using compression dictionary. A compression method according to the invention comprises obtaining an initial compression dictionary and a separate secondary dictionary SD; determining at least one subpart of the secondary dictionary that correlates with a block of data DB to compress; updating the initial compression dictionary by inserting the determined at least one subpart therein, to obtain an updated compression dictionary used for compressing the block of data; and compressing the block of data using one or more references to entries of the obtained updated compression dictionary.
    Type: Application
    Filed: September 10, 2012
    Publication date: March 13, 2014
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Youenn Fablet, Romain Bellessort, Hervé Ruellan
  • Patent number: 8627200
    Abstract: The method of encoding hierarchized data organized in a plurality of events comprises: a step of obtaining an information set of at least one event to be encoded, and a step of recovering a grammar according to the information set, said grammar making it possible to describe at least said information set, a step of determining whether at least a part, defined by a predetermined criterion, of said information set of at least one event to be encoded can be predicted unequivocally from said grammar, if the result of the determination step is positive, a step of encoding so-called “conformity” information representing this positive result, and a step of encoding the information of each said event to be encoded not included in said information set.
    Type: Grant
    Filed: July 22, 2008
    Date of Patent: January 7, 2014
    Assignee: Canon Kabushiki Kaisha
    Inventors: Romain Bellessort, Youenn Fablet
  • Publication number: 20130339526
    Abstract: The present invention relates to an augmented data structure representing the availability of resources in a communication device, such as an augmented Bloom filter. A method of generating and using the augmented data structure comprises: providing first and additional groups of resources available in the same communication device; providing one or more hash functions for each of the first and additional groups, and calculating one or more hash values for each resource using the one or more corresponding hash functions; mapping each obtained hash value onto one entry of a data structure, wherein the hash values obtained from a resource of the first group are mapped onto a first subpart of the data structure only, such as a conventional Bloom array, and the hash values obtained from a resource of an additional group are mapped onto a portion of the data structure including the first subpart and an additional subpart.
    Type: Application
    Filed: June 19, 2012
    Publication date: December 19, 2013
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Herve RUELLAN, Romain BELLESSORT, Youenn FABLET
  • Publication number: 20130339472
    Abstract: The present invention relates to the notification of a server device with the availability of resources in cache memories of a client device and to the serving of digital resources in such a client-server communication system. The notifying method comprises: obtaining a first list of resources available in the cache memories of the client device; filtering the first list according to filtering criteria relating to a resource parameter, to obtain a filtered list of fewer resources available in the client device or splitting the first list according to splitting criteria relating to a resource parameter, to obtain a plurality of sub-lists of resources available in the client device; and notifying the server device with data structures representing the filtered list or sub-lists of resources.
    Type: Application
    Filed: June 19, 2012
    Publication date: December 19, 2013
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Herve RUELLAN, Youenn FABLET, Romain BELLESSORT
  • Patent number: 8601368
    Abstract: A method of processing a document having hierarchized data organized into items includes a prior step of generating at least one coding table and a step of coding the document. The coding table, which includes coding information organized into coding structures, each associated with an item, is generated based on the prior coding of other documents of hierarchized data. Coding the document includes extracting an item to code, determining within the coding table a coding structure associated with the item, and coding the extracted item on the basis of the determined coding structure.
    Type: Grant
    Filed: January 13, 2009
    Date of Patent: December 3, 2013
    Assignee: Canon Kabushiki Kaisha
    Inventor: Youenn Fablet
  • Publication number: 20130246583
    Abstract: The present invention relates to transmitting a digital resource in a client-server communication system. A disclosed method comprises at a main server device: receiving a request for a main resource from a client device; determining at least one missing secondary resource, wherein the at least one missing secondary resource is at least one resource associated with said requested main resource and missing at the main server device; and requesting a secondary server device to push the at least one missing secondary resource to the client device. Thanks to the push initiated by the main server device, the secondary resources required by the main resource become available at the client device before the latter discovers that they are required to exploit or display the main resource.
    Type: Application
    Filed: March 11, 2013
    Publication date: September 19, 2013
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: ROMAIN BELLESSORT, YOUENN FABLET, Hervé RUELLAN
  • Publication number: 20130039419
    Abstract: The present invention concerns a processing method for accessing a spatio-temporal part of a compressed video sequence, as well as an associated device. The method comprises the following steps: obtaining a request for access to the part by identifying a temporal section defined between initial and final times of the initial and final spatial regions—different from the initial region of the sequence at the initial and final times; decomposing the access request into a plurality of elementary requests for access to a video fragment, each elementary request identifying a fixed spatial region to extract in a temporal sub-interval of the temporal section; and exploiting at least one elementary request to access video fragments constituting the part to access.
    Type: Application
    Filed: April 8, 2011
    Publication date: February 14, 2013
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Franck Denoual, Youenn Fablet
  • Patent number: 8364621
    Abstract: The method of coding a structured document comprises: a step (705) of determining whether a succession of correct predictions exists for items of a set of items of the document and if the result of said determining step is positive, a step (710) of coding the number of successive correct predictions. In embodiments, this method further comprises, if a set of items of the document possesses associated values, a step of coding said values associated with said set of items of the document.
    Type: Grant
    Filed: May 15, 2009
    Date of Patent: January 29, 2013
    Assignee: Canon Kabushiki Kaisha
    Inventors: Youenn Fablet, Romain Bellessort
  • Publication number: 20120330984
    Abstract: The present invention concerns a method for processing a structured document to render, such as XML or HTML files. The method comprises the steps of: parsing the structured document into parsed tokens TK of structured data; constructing a first tree structure DTree storing the structured data of parsed tokens; constructing a render tree structure RTree storing the document content to render, said render tree structure being synchronized with the first tree structure; rendering the structured document based on the render tree structure RTree; wherein constructing the first tree structure DTree comprises deciding, for each parsed token TK, whether or not the parsed token is to be stored in said first tree structure, and storing the structured data of the parsed token therein only in case of positive decision. Partial first (DOM) tree DTree is therefore stored in memory, reducing memory use and processing time before rendering the structured document.
    Type: Application
    Filed: June 13, 2012
    Publication date: December 27, 2012
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: YOUENN FABLET, ROMAIN BELLESSORT, HERVÉ RUELLAN
  • Publication number: 20120185596
    Abstract: The present invention relates to a method and a system for managing access to a resource, copies of which are hosted in apparatuses of one or more networks. The method comprises obtaining a list comprising a plurality of references pointing to the plurality of copies of the resource; for each of said references, determining at least one accessibility rating representing the accessibility of the corresponding copy for the given user device, and, based on the at least one accessibility rating, deciding between keeping the corresponding reference in the list or deleting it therefrom, to obtain an updated list; and selecting a reference from the updated list for the given user device to access the resource.
    Type: Application
    Filed: January 17, 2012
    Publication date: July 19, 2012
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: ROMAIN BELLESSORT, YOUENN FABLET, HERVE RUELLAN
  • Publication number: 20120150828
    Abstract: A method for decoding encoded structured data from a bit-stream comprising a plurality of encoded data units having the steps of, obtaining unit information comprising positions of the encoded data units within the bit-stream, retrieving the encoded data units from the bit-stream based on the unit information, creating decoding tasks for decoding the retrieved encoded data units, assigning the created decoding tasks to cores of a multi-core decoder, based on estimated decoding costs of the encoded data units, running the tasks on their assigned cores to decode the encoded data units in parallel is disclosed. It is applied to the decoding of XML documents in the EXI format.
    Type: Application
    Filed: December 9, 2010
    Publication date: June 14, 2012
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Youenn Fablet, Hervé Ruellan, Romain Bellesort
  • Publication number: 20110305278
    Abstract: The invention concerns a method and a device for accessing a spatio-temporal part of a video sequence of images compressed using a coding format implementing a prediction. The method comprises the steps of: defining a target spatial region corresponding to said spatio-temporal part to access; obtaining compressed data corresponding to a selection spatial region in at least one image of the video sequence, said selection spatial region including said target spatial region; obtaining at least one item of updating information for updating the selection spatial region that is provided for selecting compressed data in a following image of the video sequence, said updating information depending on the decoding of the compressed data corresponding to said target spatial region.
    Type: Application
    Filed: April 26, 2011
    Publication date: December 15, 2011
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Youenn Fablet, Franck Denoual