Abstract: In an example, a method includes obtaining, by at least one processor, a first halftone screen tile having a first halftone pattern. In some examples, the method further comprises obtaining a second halftone screen tile having a second halftone pattern. The method may include determining a halftone screen having a predetermined spatial arrangement of the first and second halftone screen tiles wherein the relative placement of the first and second halftone screen tiles in the predetermined spatial arrangement provides a signature for the halftone screen which when applied to image data provides a printed output in which the signature is discernible.

Abstract: Determining occupants' interactions in a space by applying a computer vision algorithm to track an occupant in a set of images of a space to obtain locations in the space of the occupant over time, where a history log of the occupant includes the locations of the occupant in the space over time is created and history logs of a plurality of occupants are compared to extract interaction points between the plurality of occupants.

Abstract: An object is tracked in images of the space. A unique identification is assigned to the object and the uniquely identified object may then be located within the space based on the tracking of the object, without having to again uniquely identify the object.

Abstract: An object is tracked in images of the space. A unique identification is assigned to the object and the uniquely identified object may then be located within the space based on the tracking of the object, without having to again to uniquely identify the object.

Abstract: Determining occupants' interactions in a space by applying a computer vision algorithm to track an occupant in a set of images of a space to obtain locations in the space of the occupant over time, where a history log of the occupant includes the locations of the occupant in the space over time is created and history logs of a plurality of occupants are compared to extract interaction points between the plurality of occupants.

Abstract: A method and system are provided for analyzing occupancy in a space by automatically identifying a region of interest in the space based on image analysis and enabling different outputs based on detection of occupancy in the region of interest or outside it.

Abstract: Determining occupants' interactions in a space by applying a computer vision algorithm to track an occupant in a set of images of a space to obtain locations in the space of the occupant over time, where a history log of the occupant includes the locations of the occupant in the space over time is created and history logs of a plurality of occupants are compared to extract interaction points between the plurality of occupants.

Abstract: An object is tracked in images of the space. A unique identification is assigned to the object and the uniquely identified object may then be located within the space based on the tracking of the object, without having to again to uniquely identify the object.

Abstract: Determining occupants' interactions in a space by applying a computer vision algorithm to track an occupant in a set of images of a space to obtain locations in the space of the occupant over time, where a history log of the occupant includes the locations of the occupant in the space over time is created and history logs of a plurality of occupants are compared to extract interaction points between the plurality of occupants.

Abstract: Automatically managing space related resources by using a processor to detect an occupied work station in at least one image of a sequence of images of a space and outputting a signal based on the detection of the occupied work station.

Abstract: A method and system are provided for analyzing occupancy in a space by automatically identifying a region of interest in the space based on image analysis and enabling different outputs based on detection of occupancy in the region of interest or outside it.

Abstract: In a method and system for scheduling unicast and multicast data packets associated a weight value reflecting the urgency of each queue in a set of available input nodes to transmit its queued cells is computed. If the highest weight queue in each input node is unicast, a request containing the weight of the queue is sent to a single output node relating to the highest weight queue. Otherwise, a request containing the weight of the queue is sent to one or more output nodes relating to the multicast queue. A grant is sent to the highest weight input node sending a request for a specific output node. Input nodes relating to unicast queues are removed from consideration in successive iterations. Input nodes relating to multicast queues may compete in successive iterations but only from the same multicast queue.