Abstract: Disclosed are systems, methods, devices and computer-readable media for image fetching for timeline scrubbing of digital media. In some implementations, a method comprises: receiving at a first time prior to receiving a scrub command, a first set of scrub images associated with digital media, the first set of scrub images having a first set of positions on a timeline of the digital media; receiving a first scrub command; receiving at a second time after the first time, a second set of scrub images associated with the digital media, the second set of scrub images having a second set of positions on the timeline that fill time gaps in the first set of positions on the timeline; animating, a timeline overlay including the timeline, a playhead and a scrub image window; and selecting a scrub image from the first or second sets of scrub images for presentation in the scrub image window.

Abstract: Disclosed are systems, methods, devices and computer-readable mediums for image fetching for timeline scrubbing of digital media. In some implementations, a method comprises: receiving at a first time prior to receiving a scrub command, a first set of scrub images associated with digital media, the first set of scrub images having a first set of positions on a timeline of the digital media; receiving a first scrub command; receiving at a second time after the first time, a second set of scrub images associated with the digital media, the second set of scrub images having a second set of positions on the timeline that fill time gaps in the first set of positions on the timeline; animating, a timeline overlay including the timeline, a playhead and a scrub image window; and selecting a scrub image from the first or second sets of scrub images for presentation in the scrub image window.

Abstract: Disclosed are systems, methods, devices and computer-readable mediums for image fetching for timeline scrubbing of digital media. In some implementations, a method comprises: receiving at a first time prior to receiving a scrub command, a first set of scrub images associated with digital media, the first set of scrub images having a first set of positions on a timeline of the digital media; receiving a first scrub command; receiving at a second time after the first time, a second set of scrub images associated with the digital media, the second set of scrub images having a second set of positions on the timeline that fill time gaps in the first set of positions on the timeline; animating, a timeline overlay including the timeline, a playhead and a scrub image window; and selecting a scrub image from the first or second sets of scrub images for presentation in the scrub image window.

Abstract: Disclosed are systems, methods, devices and computer-readable mediums for image fetching for timeline scrubbing of digital media. In some implementations, a method comprises: receiving at a first time prior to receiving a scrub command, a first set of scrub images associated with digital media, the first set of scrub images having a first set of positions on a timeline of the digital media; receiving a first scrub command; receiving at a second time after the first time, a second set of scrub images associated with the digital media, the second set of scrub images having a second set of positions on the timeline that fill time gaps in the first set of positions on the timeline; animating, a timeline overlay including the timeline, a playhead and a scrub image window; and selecting a scrub image from the first or second sets of scrub images for presentation in the scrub image window.

Abstract: The present disclosure describes systems and techniques relating to generating three dimensional (3D) models from range sensor data. According to an aspect, frames of range scan data captured using one or more three dimensional (3D) sensors are obtained, where the frames correspond to different views of an object or scene; point clouds for the frames are registered with each other by maximizing coherence of projected occluding boundaries of the object or scene within the frames using an optimization algorithm with a cost function that computes pairwise or global contour correspondences; and the registered point clouds are provided for use in 3D modeling of the object or scene. Further, the cost function, which maximizing contour coherence, can be used with more than two point clouds for more than two frames at a time in a global optimization framework.

Abstract: A menu having menu items is arranged in an interface environment. A first abstraction is arranged proximate to the menu, the first abstraction being based on a highlighted menu item. A second abstraction is transitioned into the interface environment upon the occurrence of an event, the second abstraction being proximate to the menu.

Abstract: A menu having menu items is arranged in an interface environment. A first abstraction is arranged proximate to the menu, the first abstraction being based on a highlighted menu item. A second abstraction is transitioned into the interface environment upon the occurrence of an event, the second abstraction being proximate to the menu.

Abstract: The Integrated Services Digital Network ("ISDN") normally uses 64 Kbits/sec channels which are therefore unsuitable for data traffic at higher rate traffic. This can be overcome by assembling ISDN channels to form higher bit rate channels. However, when the bit-rate required changes frequently, the number of channels grouped together must be changed often. To solve this problem, data packets are received from local area networks by a computer and assembled into groups of ISDN channels which are combined to form high bit rate channels or U-channels. The computer assembles data into an ISDN frame using an appropriate number of slots in the frame for each U-channel. The frames are transmitted using conventional ISDN circuits. On reception, ISDN slots in frames are passed to packet assembly buffers, one for each U-channel, before being passed to users. When a new slot is to be added to a U-channel, synchronization signals are sent in the new slot and flags are used to establish when data is to be sent.

Abstract: Communication channels provided by the Integrated services Digital Network (ISDN) usually carry 64 Kbits/sec in each direction and are therefore unsuitable for data traffic at higher rates. This difficulty can be overcome by assembling ISDN channels to form channels having a higher bit rate. However problems arise, for example, in the transmission of data packets where the bit-rate required changes frequently and therefore the number of channels grouped together must be changed often. These problems are tackled as now described. Data from different data streams to be transmitted is read into respective buffers in a RAM. ISDN channels are grouped into channels known as slots and U-channels, respectively, and each U-channel transmits a respective data stream. Data from the buffers are assembled into frames, corresponding to an ISDN frame in a frame store by a microprocessor.