Intel Corporation

Accenture Global Services Gmbh

Niraj Gupta

Kishore P Durg

Mostafa Hagog

Hong Jiang

Dror Reif

Samir Desai

Alon Gluska

Gordon Trujillo

Bryan Michael McCart

Parag Pande

Alex Zorba

James Woodier

Damien X Panketh

Srinivas Govindaiah

David Petricca

Nobby Rajan

James Allen Glore

Lisa Kay DeMik

Syed Sibgathulla

William Alfred Jindrich, Jr

Surendra Sheshagiri

Yi-Jen Chiu

Benny Eitan

Supratim Pal

Ramkumar Kothandaraman

Oren Agam

Amit Bahree

Karthik N

Mahesh B Chappalli

A connected classroom system provides for local and remote control and display of media streams. An instructor may, for instance, direct audio/video streams of the instructor to any number of displays and speakers located within a classroom. The system may send and receive control instructions to and from remote classrooms as well, through a network interface. The control instructions may configure any set of presentation devices in any classroom to reproduce any content originating from any source within any classroom. Accordingly, multiple classrooms located in disparate locations may participate in media exchanges arising from any source, including instructors and individual student seating locations within the classrooms.

Connected classroom

Systems and methods may provide feature matching in object-recognition applications. The systems and methods may determine various features of an object and determine what type of object to which the features correspond. The systems and methods may also detect objects within a database and extract vectors based on unique features of the objects. The extracted vectors may be stored in a memory such as a buffer. The extracted vectors may be used to match against a database of objects of interest or test vectors. Features within the objects may then be quickly and efficiently determined based on the best matches between the extracted vectors and the test vectors, thereby determining suitable best matches while avoiding the necessity to search the full database.

Efficient method and hardware implementation for nearest neighbor search

An intelligent information delivery system facilitates dynamic interaction with the user's environment, and in certain environments may provide or support digital governance. The intelligent delivery system may make use of a distributed beacon network to accurately determine the user's location within an environment, which may then be leveraged to deliver relevant content to the user. The intelligent delivery system may also facilitate complex interactions between a user of the system and the user's environment.

Location specific content delivery

Flood-fill techniques and architecture are disclosed. In accordance with one embodiment, the architecture comprises a hardware primitive with a software interface which collectively allow for both data-based and task-based parallelism in executing a flood-fill process. The hardware primitive is defined to do the flood-fill function and is scalable and may be implemented with a bitwise definition that can be tuned to meet power/performance targets, in some embodiments. In executing a flood-fill operation, and in accordance with an example embodiment, the software interface produces parallel threads and issues them to processing elements, such that each of the threads can run independently until done. Each processing element in turn accesses a flood-fill hardware primitive, each of which is configured to flood a seed inside an N&#xd7;M image block. In some cases, processing element commands to the flood-fill hardware primitive(s) can be queued and acted upon pursuant to an arbitration scheme.

Parallel flood-fill techniques and architecture

Methods and systems may synchronize workloads across local thread groups. The methods and systems may provide for receiving, at a graphics processor, a workload from a host processor and receiving, at a plurality of processing elements, a plurality of threads that from one or more local thread groups. Additionally, the processing of the workload may be synchronized across the one or more thread groups. In one example, the global barrier determines that all threads across the thread groups have been completed without polling.

Using a global barrier to synchronize across local thread groups in general purpose programming on GPU

Methods and systems may provide for receiving, at a graphics processor, a workload from a host processor and using a kernel on the graphics processor to issue a thread group for execution of the workload on the graphics processor. Additionally, one or more coherency messages may be initiated, by the graphics processor, in response to a thread-related condition of one or more caches on the graphics processor. In one example, the thread-related condition is associated with the execution of the workload on the graphics processor and indicates that the one or more caches on the graphics processor are not coherent with a system memory associated with the host processor.

Initiation of cache flushes and invalidations on graphics processors

The system has first, second, third, and fourth subsystems. Each subsystem has first and second multipliers coupled, respectively, to first and second adders. Each multiplier has two inputs. The first adder is coupled to a first output, a first accumulator, and a bit shifter. The bit shifter is coupled to a third adder. The third adder is coupled to a multiplexer. The multiplexer is coupled to a second output and a second accumulator. The second adder is coupled to the third adder and the multiplexer. The first outputs of the first and second subsystems are coupled directly to a fourth adder, the second outputs of the first and second subsystems are coupled directly to a fifth adder, the first outputs of the third and fourth subsystems are coupled directly to a sixth adder, and the second outputs of the third and fourth subsystems are coupled directly to a seventh adder.

Systems, methods, and computer program products for performing mathematical operations

Techniques related to integral image coding are described herein.

Integral image coding

Systems, apparatus, articles, and methods are described including operations to generate a weighted look-up-table based at least in part on individual pixel input values within an active block region and on a plurality of contrast compensation functions. A second level compensation may be performed for a center pixel block of the active region based at least in part on the weighted look-up-table.

Simplification of local contrast compensation by using weighted look-up table

Systems, apparatus and methods are described related to optimizing fixed point divide.

Optimizing fixed point divide

An apparatus may include a memory, a processor circuit, and a connected component labeling module. The connected component labeling module may be operative of the processor circuit to determine one or more connected components during reading of an image comprising a multiplicity of pixels from the memory, assign a label to a plurality of pixels of the multiplicity of pixels, generate one or more label connections for a respective one or more labels, each label connection linking a higher label to a lowest label for the same connected component, and write to the memory for each label of the one or more labels a lowest label as defined by the label connection for the each label after a label is assigned to each pixel.

Growing community of inventors

Bengaluru, India

Niraj Gupta