Patent application number | Description | Published |
20080250384 | SYSTEMS AND METHODS FOR CREATING INSPECTION RECIPES - Systems and methods for creating inspection recipes are provided. One computer-implemented method for creating an inspection recipe includes acquiring a first design and one or more characteristics of output of an inspection system for a wafer on which the first design is printed using a manufacturing process. The method also includes creating an inspection recipe for a second design using the first design and the one or more characteristics of the output acquired for the wafer on which the first design is printed. The first and second designs are different. The inspection recipe will be used for inspecting wafers after the second design is printed on the wafers using the manufacturing process. | 10-09-2008 |
20090037134 | SEMICONDUCTOR DEVICE PROPERTY EXTRACTION, GENERATION, VISUALIZATION, AND MONITORING METHODS - Various methods, carrier media, and systems for monitoring a characteristic of a specimen are provided. One computer-implemented method for monitoring a characteristic of a specimen includes determining a property of individual pixels on the specimen using output generated by inspecting the specimen with an inspection system. The method also includes determining a characteristic of individual regions on the specimen using the properties of the individual pixels in the individual regions. The method further includes monitoring the characteristic of the specimen based on the characteristics of the individual regions. | 02-05-2009 |
20090080759 | SYSTEMS AND METHODS FOR CREATING PERSISTENT DATA FOR A WAFER AND FOR USING PERSISTENT DATA FOR INSPECTION-RELATED FUNCTIONS - Various systems and methods for creating persistent data for a wafer and using persistent data for inspection-related functions are provided. One system includes a set of processor nodes coupled to a detector of an inspection system. Each of the processor nodes is configured to receive a portion of image data generated by the detector during scanning of a wafer. The system also includes an array of storage media separately coupled to each of the processor nodes. The processor nodes are configured to send all of the image data or a selected portion of the image data received by the processor nodes to the arrays of storage media such that all of the image data or the selected portion of the image data generated by the detector during the scanning of the wafer is stored in the arrays of the storage media. | 03-26-2009 |
20090287440 | SYSTEMS AND METHODS FOR DETECTING DEFECTS ON A WAFER AND GENERATING INSPECTION RESULTS FOR THE WAFER - Systems and methods for detecting defects on a wafer and generating inspection results for the wafer are provided. One method includes detecting defects on a wafer by comparing output generated by scanning of the wafer performed by an inspection system to one or more defect detection thresholds. The method also includes sampling outliers in the output by selecting the output having the highest values from bins defined based on one or more predetermined criteria. In addition, the method includes selecting a portion of the sampled outliers based on wafer-level analysis of the sampled outliers. The method further includes generating inspection results for the wafer by combining information about the selected portion of the sampled outliers with information about the defects detected using the one or more defect detection thresholds. | 11-19-2009 |
20100119144 | METHODS AND SYSTEMS FOR UTILIZING DESIGN DATA IN COMBINATION WITH INSPECTION DATA - Various methods and systems for utilizing design data in combination with inspection data are provided. One computer-implemented method for binning defects detected on a wafer includes comparing portions of design data proximate positions of the defects in design data space. The method also includes determining if the design data in the portions is at least similar based on results of the comparing step. In addition, the method includes binning the defects in groups such that the portions of the design data proximate the positions of the defects in each of the groups are at least similar. The method further includes storing results of the binning step in a storage medium. | 05-13-2010 |
20110286656 | METHODS AND SYSTEMS FOR UTILIZING DESIGN DATA IN COMBINATION WITH INSPECTION DATA - Various methods and systems for utilizing design data in combination with inspection data are provided. One computer-implemented method for binning defects detected on a wafer includes comparing portions of design data proximate positions of the defects in design data space. The method also includes determining if the design data in the portions is at least similar based on results of the comparing step. In addition, the method includes binning the defects in groups such that the portions of the design data proximate the positions of the defects in each of the groups are at least to similar. The method further includes storing results of the binning step in a storage medium. | 11-24-2011 |
20120116733 | Data Perturbation for Wafer Inspection or Metrology Setup - Various embodiments for determining parameters for wafer inspection and/or metrology are provided. | 05-10-2012 |
20140050389 | Automated Inspection Scenario Generation - Methods and systems for determining inspection scenarios without input from a user are presented. Inspection scenarios include at least one acquisition mode, defect detection parameter values, and classification parameter values. In one example, a number of defect events are determined by a hot inspection of a wafer surface. The defect events are classified and attributes associated with each defect event are identified. The defect events are labeled with this information. Based on the identified attributes and classification, inspection scenarios are determined. The inspection scenarios are solutions in a mathematical space formed by the identified attributes. In some examples, a plurality of inspection scenarios are determined and a desired inspection scenario is selected from the plurality based on the number of defects of interest and the number of nuisance events captured by the selected inspection scenario. | 02-20-2014 |
Patent application number | Description | Published |
20110299226 | Front Accessible Switchgear Assembly - A front accessible metal clad switchgear assembly comprising multiple compartments defined within an electrical enclosure is provided. The compartments interchangeably accommodate electrical components, for example, current transformers, a circuit breaker, a control power transformer, an epoxy encapsulated potential transformer, etc., and bus bars in predetermined positions for allowing front access to the electrical components and bus bars. The front accessible switchgear assembly further comprises a plenum chamber rearwardly positioned in the electrical enclosure and in communication with the compartments to provide an exit path for releasing pressure and gases. A mounting block assembly is positioned in one or more of the compartments for mounting, enclosing, and providing front access to the electrical components. The mounting block assembly is configured to reduce temperature rise in the compartments. Fuse sleeve assemblies operably connected to the control power transformer and the potential transformer allow high voltage primary connections in the electrical enclosure. | 12-08-2011 |
20110299228 | Multi-access Switchgear Assembly - A metal clad switchgear assembly comprising multiple compartments defined within an electrical enclosure is provided. The compartments interchangeably accommodate electrical components, for example, current transformers, a circuit breaker, a control power transformer, an epoxy encapsulated potential transformer, etc., electrical cables, and bus bars in predetermined positions for allowing front access and/or rear access to them. One or more compartments are configured for enabling the electrical cables to enter into and/or exit out from the electrical enclosure for allowing front and/or rear access to the electrical cables. A mounting block assembly is positioned in one or more of the compartments for mounting, enclosing, and providing front access to the electrical components. One or more infrared windows and inspection windows are positioned on a front side and/or a rear side of the switchgear assembly for scanning and providing a visual indication of the electrical components, the electrical cables, and the bus bars. | 12-08-2011 |
Patent application number | Description | Published |
20120029858 | DYNAMIC CARE AREAS - Various embodiments for determining dynamic care areas are provided. | 02-02-2012 |
20120243773 | Design-Based Inspection Using Repeating Structures - Systems and methods for design-based inspection using repeating structures are provided. | 09-27-2012 |
20140301630 | Adaptive Sampling for Semiconductor Inspection Recipe Creation, Defect Review, and Metrology - Methods and systems for adaptive sampling for semiconductor inspection recipe creation, defect review, and metrology are provided. The embodiments provide image processing and pattern recognition algorithms and an adaptive sampling method for extracting critical areas from SEM image patches for use in a wafer inspection system when design data for a semiconductor chip is not available. The embodiments also provide image processing and pattern recognition algorithms for efficiently discovering critical defects and significant deviations in the normal manufacturing process, using the output from a wafer inspection system and an adaptive sampling method to select wafer locations to be examined on a high resolution review or metrology tool. | 10-09-2014 |
20150062571 | Tuning Wafer Inspection Recipes Using Precise Defect Locations - Systems and methods for determining one or more parameters of a wafer inspection process are provided. One method includes aligning optical image(s) of an alignment target to their corresponding electron beam images generated by an electron beam defect review system. The method also includes determining different local coordinate transformations for different subsets of alignment targets based on results of the aligning. In addition, the method includes determining positions of defects in wafer inspection system coordinates based on coordinates of the defects determined by the electron beam defect review system and the different local coordinate transformations corresponding to different groups of the defects into which the defects have been separated. The method further includes determining one or more parameters for an inspection process for the wafer based on defect images acquired at the determined positions by a wafer inspection system. | 03-05-2015 |
Patent application number | Description | Published |
20100208270 | Low-cost, portable, rugged optical coherence tomography system - An interferometric system for metrology as well as imaging (e.g., optical coherence tomography or OCT) is described here. The system leverages advancements in telecommunication and device technologies. For example, the reference arm in the interferometric system can be a fiber-optically integrated Faraday rotating mirror. By way of example, but not limitation, typically, the light in the detection arm of the Michelson interferometer can be measured using a Volume phase holographic dispersion grating. By way of example, but not limitation, the dispersed light can be focused on a line-scan camera or multi-line 2-D camera. | 08-19-2010 |
20100245836 | Low-cost, compact, & automated diabetic retinopathy diagnostics & management device - A Diabetic Retinopathy Diagnostic system based on OCT which will map 3-D blood circulation including velocity information with micron-scale resolution in the retina is disclosed here. The system leverages the advancements in telecommunication and device technologies and employs novel Doppler algorithms. For example, the reference arm in the interferometric system can be a fiber-optically integrated Faraday rotating mirror. By way of example, but not limitation, typically, the light in the detection arm of the Michelson interferometer can be measured using a Volume phase holographic dispersion grating. By way of example, but not limitation, the dispersed light can be focused on a line-scan camera or multi-line 2-D camera. | 09-30-2010 |
Patent application number | Description | Published |
20090002782 | SYSTEM AND METHOD FOR CONVERTING OVER-RANGE COLORS - A method includes dividing an input range of color values of a first color space into a plurality of sub-ranges, wherein at least one of the sub-ranges comprises an over-range color value. The method also includes determining for each sub-range a level of accuracy in converting color values within each sub-range. The method further includes determining a processing step to be applied to input color values in each sub-range based on the determined level of accuracy. | 01-01-2009 |
20120237120 | SYSTEM AND METHOD FOR CONVERTING OVER-RANGE COLORS - A method includes dividing an input range of color values of a first color space into a plurality of sub-ranges, wherein at least one of the sub-ranges comprises an over-range color value. The method also includes determining for each sub-range a level of accuracy in converting color values within each sub-range. The method further includes determining a processing step to be applied to input color values in each sub-range based on the determined level of accuracy. | 09-20-2012 |
20140028696 | ICC color conversion using GPU - Apparatus and systems, as well as methods and articles, may operate to use a graphics processing unit (GPU) to perform color conversions using International Color Consortium (ICC) profiles. In some embodiments, code is generated for execution by the GPU. The conversion can be represented as a series of steps mapped to particular GPU processes such as 1D texture, 3D texture and matrix functions. | 01-30-2014 |
20140035944 | Rendering and Un-Rendering Using Profile Replacement - Methods, systems, and apparatus, including medium-encoded computer program products, can perform rendering and un-rendering using profile replacement. A computer implemented method includes obtaining source image data associated with a source input-referred color space, transforming the source image data to intermediate image data associated with an intermediate input-referred color profile, applying a rendering operation to the intermediate image data by associating the intermediate image data with an intermediate output-referred color profile, and transforming the intermediate image data to destination image data associated with a destination output-referred color space using the intermediate output-referred color profile. The method further includes making available for output the destination image data. | 02-06-2014 |
Patent application number | Description | Published |
20090001071 | Method and System for Cooling a Bake Plate in a Track Lithography Tool - A bake station includes a bake plate having a thickness defined by a distance between an upper surface and a lower surface of the bake plate. The bake plate is configured to heat a substrate positioned adjacent the upper surface of the bake plate. The bake station also includes a base plate having a first surface positioned below and opposing the lower surface of the bake plate and a side plate extending between the lower surface of the bake plate and the first surface of the base plate. The side plate, the lower surface of the bake plate, and the first surface of the base plate define a space. The bake station further includes a plurality of nozzles coupled to the base plate. Each of the plurality of nozzles has an inlet configured to receive an input flow of fluid and an exit port configured to expel an exit flow of fluid onto the lower surface of the bake plate. Additionally, the bake station includes an exhaust port in fluid communication with the space and configured to exhaust the exit flow of fluid from the space. | 01-01-2009 |
20120196242 | SUBSTRATE SUPPORT WITH HEATER AND RAPID TEMPERATURE CHANGE - Embodiments of substrate supports with a heater and an integrated chiller are provided herein. In some embodiments, a substrate support may include a first member to distribute heat to a substrate when present above a first surface of the first member, a heater disposed beneath the first member and having one or more heating zones to provide heat to the first member, a plurality of cooling channels disposed beneath the first member to remove heat provided by the heater, a plurality of substrate support pins disposed a first distance above the first surface of the first member, the plurality of substrate support pins to support a backside surface of a substrate when present on the substrate support, and an alignment guide extending from the first surface of the first member and about the plurality of substrate support pins. | 08-02-2012 |
20130037532 | SUBSTRATE SUPPORT WITH HEATER - Embodiments of substrate supports with a heater are provided herein. In some embodiments, a substrate support may include a first member to distribute heat to a substrate when present above a first surface of the first member; a heater coupled to the first member and having one or more heating zones to provide heat to the first member; a second member disposed beneath the first member; a tubular body disposed between the first and second members, wherein the tubular body forms a gap between the first and second members; and a plurality of substrate support pins disposed a first distance above the first surface of the first member, the plurality of substrate support pins to support a backside surface of a substrate when present on the substrate support. | 02-14-2013 |
20130087309 | SUBSTRATE SUPPORT WITH TEMPERATURE CONTROL - Embodiments of substrate supports with temperature control are provided herein. In some embodiments, a substrate support includes a first member to distribute heat to a substrate when present above a first surface of the first member; a heater coupled to the first member and having one or more heating zones to provide heat to the first member; a second member disposed beneath the first member in a spaced apart relation to the first member to at least partially define a gap between the first member and the second member, the second member fixed relative to the first member; and a plate movably disposed in the gap such that a distance between the plate and the first and second members can be selectively controlled. In some embodiments, the position of plate in the gap controls the rate of heat transfer from the first member to the plate. | 04-11-2013 |
20130256966 | SUBSTRATE SUPPORT WITH FEEDTHROUGH STRUCTURE - Apparatus for providing electrical currents and substrate supports utilizing the same are provided. In some embodiments, a feedthrough structure may include a body having a wall defining one or more openings disposed through the body from a first end to a second end; one or more first conductors and one or more second conductors each disposed in the wall from the first end to the second end; and a plurality of conductive mesh disposed in the wall, at least one conductive mesh surrounding a first region of the wall including the one or more first conductors and at least one conductive mesh surrounding a second region of the wall including the one or more second conductors, wherein the plurality of conductive mesh substantially electrically insulates the first and second regions from respective first and second external electromagnetic fields respectively disposed outside the first and second regions. | 10-03-2013 |
20140197151 | SUBSTRATE SUPPORT WITH SWITCHABLE MULTIZONE HEATER - Embodiments of substrate supports with a heater are provided herein. In some embodiments, a substrate support may include a first member to distribute heat to a substrate when present above a first planar surface of the first member, a second member disposed beneath the first member, the second member including a plurality of resistive heating elements, wherein the plurality of resistive heating elements provide local temperature compensation to the first member to heat the substrate when present, a third member disposed beneath the second member, the third member including one or more base heating zones to provide a base temperature profile to the first member, and a fourth member disposed beneath the third member, the fourth member including a first set of electrical conductors coupled to each of the resistive heating elements. | 07-17-2014 |
Patent application number | Description | Published |
20090019312 | System and Method for Providing an Instrumentation Service Using Dye Injection and Filtering in a SIP Application Server Environment - An instrumentation service is described that uses dye injection and filtering in a Session Initiation Protocol (SIP) application server environment. The instrumentation service can provide a flexible mechanism for selectively adding diagnostic code to the SIP application server and the various applications running on it. It can allow flexible selection of locations in the server and application code, at which instrumentation code can be added. The process of adding diagnostic code can be deferred to the time of running the server at the deployment site. The instrumentation service further allows flexible selection of diagnostic actions, which can be executed at selected locations. In various embodiments, the execution of diagnostic code can be dynamically enabled or disabled while the server is running. Also, the behavior of diagnostic code executed at such locations can be dynamically changed while the server is running. | 01-15-2009 |
20100080241 | SYSTEM AND METHOD FOR PROVIDING TIMER AFFINITY THROUGH ENGINE POLLING WITHIN A SESSION-BASED SERVER DEPLOYMENT - The session-based server deployment can be comprised of an engine tier that is designed for high throughput processing of communications and a state tier that maintains state information for access by the engine tier. The engine tier can include a plurality of engine nodes that process incoming messages. The state nodes can contain call state, including various timers. When processing a call, an engine can set various timers in the state tier. The engine can then periodically poll the state tier for any timers that have expired. Upon expiration of a timer, the timer can be assigned to the corresponding engine node which handled previous communications for the call. This affinity between the timer and its respective engine can provide numerous benefits, such as reduced latency and more localized data access. | 04-01-2010 |
20100106842 | SYSTEM AND METHOD FOR PROVIDING TIMER AFFINITY THROUGH NOTIFICATIONS WITHIN A SESSION-BASED SERVER DEPLOYMENT - The session-based server deployment can be comprised of an engine tier that is designed for high throughput processing of communications and a state tier that maintains state information for access by the engine tier. The engine tier can include a plurality of engine nodes that process incoming messages. The state nodes can contain call state, including various timers. When processing a call, an engine can set various timers in the state tier. Upon expiration of a timer, the state node can transmit a notification assigning the timer to the corresponding engine node which handled previous communications for the call. This affinity between the timer and its respective engine can provide numerous benefits, such as reduced latency and more localized data access. | 04-29-2010 |
Patent application number | Description | Published |
20110283266 | Software Performance Profiling in a Multi-Tenant Environment - A method for software performance analysis and debugging in a multi-tenant database network system is provided. In at least one embodiment, sampling is achieved using configuration files of each server cluster. Knowledge of the host names of each server in the cluster enables a profiler to target a single server for each sample, thereby facilitating a round-robin sample across a clustered server environment such that a CPU's load and processing cost associated to sampling is fairly and uniformly distributed across all servers in the cluster. As a result, in at least one embodiment of the analysis and debugging tool each sample is a complete stack trace dump of each thread running on the application server at that moment in time. | 11-17-2011 |
20120144374 | Capturing Replayable Information at Software Defect Locations in a Multi-Tenant Environment - A method for software debugging in a multi-tenant database network system is provided. When an exception occurs the stack frames in temporary working memory are dumped into long term memory for later analysis. A stack trace is performed from which performance information may be derived, which may aid in discovering the cause of the exception. | 06-07-2012 |
20130036406 | CONTEXTUAL EXCEPTION MANAGEMENT IN MULTI-TENANT SYSTEMS - Methods and systems are provided for managing exceptions in a multi-tenant system providing instances of a virtual application over a network to multiple tenants. One exemplary method involves obtaining, from an instance of the virtual application, context information associated with an anomalous condition identified by the virtual application and automatically creating an exception record maintaining an association between the anomalous condition and the context information. | 02-07-2013 |
20130036407 | CONTEXTUAL EXCEPTION MANAGEMENT IN MULTI-TENANT SYSTEMS - Methods and systems are provided for assigning exceptions in a multi-tenant system providing instances of a virtual application over a network to multiple tenants. One exemplary method of assigning an exception record corresponding to an anomalous condition identified by an instance of the virtual application involves obtaining context information associated with the anomalous condition from the instance of the virtual application and automatically assigning the exception record to a development entity based at least in part on the context information. | 02-07-2013 |
Patent application number | Description | Published |
20120078825 | SEARCH RESULT RANKING USING MACHINE LEARNING - Various embodiments include systems and methods for search result ranking using machine learning. A goal model can be created using machine learning. Responsive to a search query, a plurality of data factors can be inputted into the goal model to create a model output. Search results can be presented to a user based on the model output. | 03-29-2012 |
20120197758 | COMPUTATION OF USER REPUTATION BASED ON TRANSACTION GRAPH - A method and a system generate a reputation value for a user in a network-based community. A processor-implemented transaction data collector module collects transaction data of users of a network-based community. A processor-implemented transaction graph generator module generates a transaction graph based on the collected transaction data. The transaction graph has a transaction relationship between two users, and a weight corresponding to the transaction relationship. The weight is representative of a mutually reinforcing relationship between two users. A processor-implemented reputation generator module generates a reputation value for a user from the transaction graph. | 08-02-2012 |
20120259844 | METHODS AND SYSTEMS FOR ASSESSING EXCESSIVE ACCESSORY LISTINGS IN SEARCH RESULTS - A system and method for assessing excessive accessory listings in search results includes a processor-implemented textual mining module that parses a data field of a document and generates at least one token from the data field. A processor-implemented scoring module calculates a score for the at least one token, with the at least one token score representing a likelihood that the at least one token belongs to one of two binary classifications. The processor-implemented scoring module also calculates a score for the document based on the at least one token score, with the document score representing a probability of the document being in one of the two binary classifications. A processor-implemented decision tree module inputs the document score and document attribute values into a decision tree and generates an output representing a refined score based on the document score and at least one of the document attribute values. | 10-11-2012 |
20150058331 | SEARCH RESULT RANKING USING MACHINE LEARNING - Various embodiments include systems and methods for search result ranking using machine learning. A goal model can be created using machine learning. Responsive to a search query, a plurality of data factors can be inputted into the goal model to create a model output. Search results can be presented to a user based on the model output. | 02-26-2015 |
Patent application number | Description | Published |
20080229911 | WAVEFORM FETCH UNIT FOR PROCESSING AUDIO FILES - This disclosure describes techniques that make use of a waveform fetch unit that operates to retrieve waveform samples on behalf of each of a plurality of hardware processing elements that operate simultaneously to service various audio synthesis parameters generated from one or more audio files, such as musical instrument digital interface (MIDI) files. In one example, a method comprises receiving a request for a waveform sample from an audio processing element, and servicing the request by calculating a waveform sample number for the requested waveform sample based on a phase increment contained in the request and an audio synthesis parameter control word associated with the requested waveform sample, retrieving the waveform sample from a local cache using the waveform sample number, and sending the retrieved waveform sample to the requesting audio processing element. | 09-25-2008 |
20080229912 | SHARED BUFFER MANAGEMENT FOR PROCESSING AUDIO FILES - This disclosure describes techniques that make use of a summing buffer that receives waveform samples from audio processing elements, and sums and stores the waveform sums for a given frame. In one example, a method comprises summing a waveform sample received from an audio processing element to produce a waveform sum associated with a first audio frame, storing the waveform sum in a memory, wherein the memory is logically partitioned into a plurality of memory blocks, and locking memory blocks containing the waveform sum associated with the first audio frame, transferring contents of locked memory blocks to an external processor, unlocking a memory block after contents of the memory block have been transferred to the external processor, and storing a waveform sum associated with a second audio frame within the unlocked memory block concurrently with transferring contents of remaining locked memory blocks associated with the first audio frame. | 09-25-2008 |
20080235494 | MUSICAL INSTRUMENT DIGITAL INTERFACE HARDWARE INSTRUCTION SET - Generating a digital waveform for a Musical Instrument Digital Interface (MIDI) voice using a set of machine-code instructions that is specialized for the generation of digital waveforms for MIDI voices. For example, a processor may execute a software program that generates a digital waveform for a MIDI voice. The instructions of the software program may be machine code instructions from an instruction set that is specialized for the generation of digital waveforms for MIDI voices. | 09-25-2008 |
20080269926 | AUTOMATIC VOLUME AND DYNAMIC RANGE ADJUSTMENT FOR MOBILE AUDIO DEVICES - A mobile audio device (for example, a cellular telephone, personal digital audio player, or MP3 player) performs Audio Dynamic Range Control (ADRC) and Automatic Volume Control (AVC) to increase the volume of sound emitted from a speaker of the mobile audio device so that faint passages of the audio will be more audible. This amplification of faint passages occurs without overly amplifying other louder passages, and without substantial distortion due to clipping. Multi-Microphone Active Noise Cancellation (MMANC) functionality is, for example, used to remove background noise from audio information picked up on microphones of the mobile audio device. The noise-canceled audio may then be communicated from the device. The MMANC functionality generates a noise reference signal as an intermediate signal. The intermediate signal is conditioned and then used as a reference by the AVC process. The gain applied during the AVC process is a function of the noise reference signal. | 10-30-2008 |
20090086982 | CROSSTALK CANCELLATION FOR CLOSELY SPACED SPEAKERS - A technique for canceling acoustic crosstalk is provided including a pre-processing filter and a crosstalk cancellation device. The pre-processing filter may be configured to obtain first and second channel signals and compensate or adjust the first and/or second channel signals for anticipated subsequent stage distortion by the crosstalk cancellation device. The crosstalk cancellation device maybe configured to receive the compensated first and second channel signals from the pre-processing filter. The crosstalk cancellation device then modifies the first channel signal to cancel anticipated acoustic crosstalk from the second channel signal, and modifies the second channel signal to cancel acoustic crosstalk from the first channel signal. The modified first channel signal is then transmitted over a first speaker and the modified second channel signal is transmitted over a second speaker. The first and second speakers may be closely spaced, yet provide a widened stereo image of the first and second channel signals. | 04-02-2009 |
20090136044 | METHODS AND APPARATUS FOR PROVIDING A DISTINCT PERCEPTUAL LOCATION FOR AN AUDIO SOURCE WITHIN AN AUDIO MIXTURE - In accordance with a method for providing a distinct perceptual location for an audio source within an audio mixture, a foreground signal may be processed to provide a foreground perceptual angle for the foreground signal. The foreground signal may also be processed to provide a desired attenuation level for the foreground signal. A background signal may be processed to provide a background perceptual angle for the background signal. The background signal may also be processed to provide a desired attenuation level for the background signal. The foreground signal and the background signal may be combined into an output audio source. | 05-28-2009 |
20090136063 | METHODS AND APPARATUS FOR PROVIDING AN INTERFACE TO A PROCESSING ENGINE THAT UTILIZES INTELLIGENT AUDIO MIXING TECHNIQUES - A method for providing an interface to a processing engine that utilizes intelligent audio mixing techniques may include receiving a request to change a perceptual location of an audio source within an audio mixture from a current perceptual location relative to a listener to a new perceptual location relative to the listener. The audio mixture may include at least two audio sources. The method may also include generating one or more control signals that are configured to cause the processing engine to change the perceptual location of the audio source from the current perceptual location to the new perceptual location via separate foreground processing and background processing. The method may also include providing the one or more control signals to the processing engine. | 05-28-2009 |
20090220110 | SYSTEM AND METHOD OF REDUCING POWER CONSUMPTION FOR AUDIO PLAYBACK - A system and method of improving the efficiency in the power consumption of an audio system. In essence, the technique is to adjust the power delivered from the power supply to the analog section, such as the power amplifier, in response to the volume level indicated by the volume control module and/or in response to the detected characteristic of the input audio signal. Thus, in this manner, the analog section is operated in a manner that is related to the level of the signal it is processing. Additionally, the system and method also relate to a technique of adjusting the dynamic ranges of the digital signal and the analog signal to improve the overall dynamic range of the system without needing to consume additional power. | 09-03-2009 |
Patent application number | Description | Published |
20110032413 | AUTO-FOCUSING TECHNIQUES BASED ON STATISTICAL BLUR ESTIMATION AND ASSOCIATED SYSTEMS AND METHODS - This is generally directed to auto-focusing techniques based on statistical blur estimation. An image can be captured at two or more candidate lens positions. The amount of blur of each image can then be determined, and the image containing the least amount of blur can be chosen as the “in-focus” image. In some embodiments, the amount of blur of an image can be determined by identifying how “Gaussian” an image is. Characteristics that are more Gaussian in nature can indicate that the image is more blurry. The Gaussianity of an image can be determined by estimating a generalized Gaussian shape parameter for that image. A smaller shape parameter can indicate the image is less Gaussian in nature. The shape parameter can be estimated in any suitable manner such as, for example, through a 2-d discrete wavelet transform, through a 1-d discrete wavelet transform, or through any other suitable manner. | 02-10-2011 |
20120188386 | SYSTEMS AND METHODS FOR LUMINANCE-BASED SCENE-CHANGE DETECTION FOR CONTINUOUS AUTOFOCUS - Imaging systems with image sensors and image processing circuitry are provided. The image processing circuitry may identify motion and perform autofocus (e.g., continuous autofocus) using images captured by an image sensor. Auto exposure metrics such as average luminance values and autofocus statistics such as sharpness scores may be calculated for each image. The auto exposure metrics may be used to calculate motion scores and identify directional motion between a series of captured images. The motion scores may be used with the sharpness scores to determine when to perform autofocus functions such as when to refocus a lens for a continuous autofocus application. For example, the motion scores may be monitored to identify motion that exceeds a given magnitude and duration. After identification of motion, motion scores and sharpness scores may be used to determine when a given scene has stabilized and when the lens should be refocused. | 07-26-2012 |
20130293738 | IMAGING SYSTEMS WITH PROGRAMMABLE FIXED RATE CODECS - An imaging system may be provided haying an image sensor and a fixed-rate codec for encoding image data from the image sensor into a fixed-rate bitstream. The image sensor may include an array of image pixels with a corresponding Bayer pattern array of color filter elements. The codec may include circuits for partitioning the image data into fixed-size blocks of image data and compressing the image data in each fixed-size block based on the image content in that block using, a logarithm-based quantization of selected transform coefficients. The available bits for each block. may be allocated to various components such as color components of the data based on the complexity of the image content in each component. The bitstream may include header information with pointers to coefficient locations within each block. The header information may be compressed prior to insertion into the bitstream. | 11-07-2013 |
Patent application number | Description | Published |
20120084161 | Displaying advertising content in a shell interface - This disclosure generally may disclose a web-based online network drive that may be utilized by many users. Furthermore, this disclosure may provide for an efficient, web-based file system, which may be available as a network drive on a local computer. | 04-05-2012 |
20120185531 | METHOD FOR STORING AND ACCESSING DATA USING A SHELL INTERFACE - This disclosure generally may disclose a web-based online network drive that may be utilized by many users. Furthermore, this disclosure may provide for an efficient, web-based file system, which may be available as a network drive on a local computer. | 07-19-2012 |
20120266078 | System and Method for Accessing and Displaying Remotely Backed Up Data by Deploying a Windows Desktop Style User Interface - A system and method for accessing and displaying remotely backup data by deploying Windows desktop style User Interface. Upon invoking the application program installed on a local computer, the remotely backed up data can be accessed from the application User Interface after establishing a connection with the remote backup server via a network. The application program running on the local computer displays remotely stored data through a User Interface identical to the desktop of the windows operating system running on the local computer from where backup was taken. More specifically, the data is stored under the same folder names and same folder hierarchy including the icon names and positions of the icons, taskbar and start button on the windows desktop of the local computer. The user is easily able to visually recognize the same file system from the remote backup sever as is available on the local computer. | 10-18-2012 |
20130283038 | Seamless Remote Storage of Uniformly Encrypted Data for Diverse Platforms and Devices - A way of providing seamless remote data storage and access with a universal encryption key is provided. Data may be able to be uploaded from and/or downloaded to a variety of user devices and/or types of user devices. During transfer of data, a secure communication channel may be established between a user device and a destination storage. Data may be compressed and/or encrypted before being passed to the destination storage. Such compression and/or encryption may be performed at the user device or an intermediate processing module. Likewise, when downloading data, the data may be decompressed and/or decrypted before being made available to a destination user device. Such decompression and/or decryption may be performed at the destination device or the intermediate processing module. In any case, the universal encryption key may be utilized by all user devices to generate uniformly encrypted data. | 10-24-2013 |
20130283060 | Seamless Remote Synchronization and Sharing of Uniformly Encrypted Data for Diverse Platforms and Devices - A way of sharing privately encrypted user data that is stored remotely from an owner of the user data is provided. A request to share the privately encrypted data with a set of authorized persons may be received. A private encryption key may be received, where the private encryption key is managed by the owner of the user data. The privately encrypted user data may be decrypted using the private encryption key, where the decrypted user data is share data. The share data may be encrypted using a default encryption key. The encrypted share data may be stored at the remote storage. The set of authorized persons may be provided access to the encrypted share data. | 10-24-2013 |
20140047349 | Application Neutral Visual Sharing - A comprehensive visual sharing application, method and/or technique that combines all elements of sharing in a visual and seamless manner for data that resides either on a personal computer or on remote storage servers. A user has the ability to share data where almost every activity related to sharing data is done through visual representations of data and contacts to enhance ease of sharing. The visual sharing process may occur across several different application platforms, such as web interfaces, desktop application, and social networks. | 02-13-2014 |
20140201848 | Method for Sharing Multiple Data Items Using a Single URL - A way of sharing a set of data where each data item is stored at a different file path. The data items may be files or folders that reside on different remote storage servers or within the same file system. One or more data items in the set of data do not share a common root folder. Data items in the set of data that share a common root folder are stored amongst other data items in the common root folder that do not belonging to the set of data items to be shared. A single URL or link is generated to provide immediate access to the set of data to recipients of the URL or link. | 07-17-2014 |
Patent application number | Description | Published |
20090079466 | Soft-reconfigurable massively parallel architecture and programming system - The present disclosure provides an architecture that enables massive parallel processing on an IC while alleviating control congestion, memory access congestion and wiring congestion, together with high flexibility where the processing units are soft-arranged to perform different tasks. In an embodiment, the present architecture includes a functional block with a GO component to start the functional block, and a DONE component to identifying the completion status. The GO and DONE components can be linked together, preferably by a linkage component, to chain the functional blocks. The linkage is preferably soft configurable. In another embodiment, the present architecture includes an integrated circuit comprises a plurality of functional blocks chained together for serial processing, parallel processing, or any combination thereof. | 03-26-2009 |
20090083460 | Re-configurable bus fabric for integrated circuits - The present invention relates to a flexible and reconfigurable bus fabric for microelectronic processing units, which can offer efficient memory data management, together with efficient data transfer and relieving data transfer congestion in an integrated circuit. In an embodiment, the present reconfigurable bus fabric comprises a multistate intersection between two data buses. Preferably, the multistate intersection comprises at least two states, a connecting state connecting the two data buses, and a disconnecting state disconnecting the two data buses. The multistate intersection provides a reconfigurable bus fabric, allowing different connection configuration for the data buses. This reconfigurable bus fabric offers soft-configurability and soft-reconfigurability, using software programming to arrange the circuits' interconnections. Other configurations are also disclosed in exemplary embodiments. | 03-26-2009 |
20090083461 | Soft-reconfigurable massively parallel architecture and programming system - The present disclosure provides a methodology for reducing congestion of a processing unit, preferably by configuring a plurality of functional blocks to run in parallel or in series without the influence or input from the processing unit. In an embodiment, the present method chains a plurality of functional blocks together by software so that one functional block starts after the completion of another functional block. The configuration of the chain can be series, parallel, and any combination thereof, arranged to meet the circuit's objective. The chaining can be configured and re-configured, preferably by software input. The chaining can also be performed at design time or at run time. The chaining can also be modified, preferably at design time, but can also be modified at run time. | 03-26-2009 |
20090083515 | Soft-reconfigurable massively parallel architecture and programming system - In an embodiment, the present invention discloses a flexible and reconfigurable architecture with efficient memory data management, together with efficient data transfer and relieving data transfer congestion in an integrated circuit. In an embodiment, the output of a first functional component is stored to an input memory of a next functional component. Thus when the first functional component completes its processing, its output is ready to be accessed as input to the next functional component. In an embodiment, the memory device further comprises a partition mechanism for simultaneously accepting output writing from the first functional component and accepting input reading from the second functional component. In another embodiment, the present integrated circuit comprises at least two functional components and at least two memory devices, together with a controller for switching the connections between the functional components and the memory devices. The controller can comprise a multiplexer or a switching matrix. | 03-26-2009 |
Patent application number | Description | Published |
20100082654 | Methods And Apparatus Using Range Queries For Multi-dimensional Data In A Database - Embodiments include methods, apparatus, and systems for using range queries in multidimensional data in a database. One embodiment is a method that defines a query box from a search for multidimensional data in a database. The method examines an intersection between a Z-interval and the query box by decomposing the Z-interval into hyper-boxes that are also Z-intervals in Z space. Items in the query box that match the search are discovered. | 04-01-2010 |
20110029569 | DDL AND DML SUPPORT FOR HYBRID COLUMNAR COMPRESSED TABLES - Techniques for storing and manipulating tabular data are provided. According to one embodiment, a user may control whether tabular data is stored in row-level or column-major format. Furthermore, the user may control the level of data compression to achieve an optimal balance between query performance and compression ratios. Tabular data from within the same table may be stored in both column-major and row-major format and compressed at different levels. In addition, tabular data can migrate between column-major format and row-major format in response to various events. For example, in response to a request to update or lock a row stored in column-major format, the row may be migrated and subsequently stored into row-major format. In one embodiment, table partitions are used to enhance data compression techniques. For example, compression tests are performed on a representative table partition, and a compression map is generated and applied to other table partitions. | 02-03-2011 |
20140074805 | STORING COMPRESSION UNITS IN RELATIONAL TABLES - A database server stores compressed units in data blocks of a database. A table (or data from a plurality of rows thereof) is first compressed into a “compression unit” using any of a wide variety of compression techniques. The compression unit is then stored in one or more data block rows across one or more data blocks. As a result, a single data block row may comprise compressed data for a plurality of table rows, as encoded within the compression unit. Storage of compression units in data blocks maintains compatibility with existing data block-based databases, thus allowing the use of compression units in preexisting databases without modification to the underlying format of the database. The compression units may, for example, co-exist with uncompressed tables. Various techniques allow a database server to optimize access to data in the compression unit, so that the compression is virtually transparent to the user. | 03-13-2014 |
20140195486 | DATA RECOVERY IN MULTI-LEADER DISTRIBUTED SYSTEMS - Disclosed are a method and system for recovering a distributed system from a failure of a data storage unit. The distributed system includes a plurality of computer systems, each having a read-write computer and a data storage unit. Data is replicated from a particular data storage unit to other data storage units using publish-subscribe model. A read-write computer receives the replicated data, processes the data for any conflicts and stores it in the data storage unit. If a data storage unit fails, another data storage unit that has latest data corresponding to the failed data storage unit is determined and the latest data is replicated to other data storage units. Accordingly, the distributed system continues to have the data of the failed data storage unit. The failed data storage unit may be reconstructed using data from one of the other data storage units in the distributed system. | 07-10-2014 |
20150032763 | QUERY AND EXADATA SUPPORT FOR HYBRID COLUMNAR COMPRESSED DATA - A method and apparatus is provided for optimizing queries received by a database system that relies on an intelligent data storage server to manage storage for the database system. Storing compression units in hybrid columnar format, the storage manager evaluates simple predicates and only returns data blocks containing rows that satisfy those predicates. The returned data blocks are not necessarily stored persistently on disk. That is, the storage manager is not limited to returning disc block images. The hybrid columnar format enables optimizations that provide better performance when processing typical database workloads including both fetching rows by identifier and performing table scans. | 01-29-2015 |
Patent application number | Description | Published |
20100278446 | STRUCTURE OF HIERARCHICAL COMPRESSED DATA STRUCTURE FOR TABULAR DATA - A highly flexible and extensible structure is provided for physically storing tabular data. The structure, is referred to as a compression unit, and may be used to physically store tabular data that logically resides in any type of table-like structure. According to one embodiment, compression units are recursive. Thus, a compression unit may have a “parent” compression unit to which it belongs, and may have one or more “child” compression units that belong to it. In one embodiment, compression units include metadata that indicates how the tabular data is stored within them. The metadata for a compression unit may indicate, for example, whether the data within the compression unit is stored in row-major or column major-format (or some combination thereof), the order of the columns within the compression unit (which may differ from the logical order of the columns dictated by the definition of their logical container), a compression technique for the compression unit, the child compression units (if any), etc. | 11-04-2010 |
20100281004 | STORING COMPRESSION UNITS IN RELATIONAL TABLES - A database server stores compressed units in data blocks of a database. A table (or data from a plurality of rows thereof) is first compressed into a “compression unit” using any of a wide variety of compression techniques. The compression unit is then stored in one or more data block rows across one or more data blocks. As a result, a single data block row may comprise compressed data for a plurality of table rows, as encoded within the compression unit. Storage of compression units in data blocks maintains compatibility with existing data block-based databases, thus allowing the use of compression units in preexisting databases without modification to the underlying format of the database. The compression units may, for example, co-exist with uncompressed tables. Various techniques allow a database server to optimize access to data in the compression unit, so that the compression is virtually transparent to the user. | 11-04-2010 |
20100281079 | COMPRESSION ANALYZER - Techniques are described herein for automatically selecting the compression techniques to be used on tabular data. A compression analyzer gives users high-level control over the selection process without requiring the user to know details about the specific compression techniques that are available to the compression analyzer. Users are able to specify, for a given set of data, a “balance point” along the spectrum between “maximum performance” and “maximum compression”. The point thus selected is used by the compression analyzer in a variety of ways. For example, in one embodiment, the compression analyzer uses the user-specified balance point to determine which of the available compression techniques qualify as “candidate techniques” for the given set of data. The compression analyzer selects the compression technique to use on a set of data by actually testing the candidate compression techniques against samples from the set of data. After testing the candidate compression techniques against the samples, the resulting compression ratios are compared. The compression technique to use on the set of data is then selected based, in part, on the compression ratios achieved during the compression tests performed on the sample data. | 11-04-2010 |
20120117038 | LAZY OPERATIONS ON HIERARCHICAL COMPRESSED DATA STRUCTURE FOR TABULAR DATA - A highly flexible and extensible structure is provided for physically storing tabular data. The structure, referred to as a compression unit, may be used to physically store tabular data that logically resides in any type of table-like structure. Techniques are employed to avoid changing tabular data within existing compression units. Deleting tabular data within compression units is avoided by merely tracking deletion requests, without actually deleting the data. Inserting new tabular data into existing compression units is avoided by storing the new data external to the compression units. If the number of deletions exceeds a threshold, and/or the number of new inserts exceeds a threshold, new compression units may be generated. When new compression units are generated, the previously-existing compression units may be discarded to reclaim storage, or retained to allow reconstruction of prior states of the tabular data. | 05-10-2012 |
20120143833 | STRUCTURE OF HIERARCHICAL COMPRESSED DATA STRUCTURE FOR TABULAR DATA - A highly flexible and extensible structure is provided for physically storing tabular data. The structure, referred to as a compression unit, may be used to store tabular data that logically resides in any type of table-like structure. According to one embodiment, compression units are recursive. Thus, a compression unit may have a “parent” compression unit to which it belongs, and may have one or more “child” compression units that belong to it. In one embodiment, compression units include metadata that indicates how the tabular data is stored within them. The metadata for a compression unit may indicate, for example, whether the data is stored in row-major or column major-format the order of the columns within the compression unit (which may differ from the logical order of the columns dictated by the definition of their logical container), a compression technique for the compression unit, the child compression units (if any), etc. | 06-07-2012 |
20130036101 | Compression Analyzer - Techniques are described herein for automatically selecting the compression techniques to be used on tabular data. A compression analyzer gives users high-level control over the selection process without requiring the user to know details about the specific compression techniques that are available to the compression analyzer. Users are able to specify, for a given set of data, a “balance point” along the spectrum between “maximum performance” and “maximum compression”. The point thus selected is used by the compression analyzer in a variety of ways. For example, in one embodiment, the compression analyzer uses the user-specified balance point to determine which of the available compression techniques qualify as “candidate techniques” for the given set of data. The compression analyzer selects the compression technique to use on a set of data by actually testing the candidate compression techniques against samples from the set of data. After testing the candidate compression techniques against the samples, the resulting compression ratios are compared. The compression technique to use on the set of data is then selected based, in part, on the compression ratios achieved during the compression tests performed on the sample data. | 02-07-2013 |
Patent application number | Description | Published |
20120010910 | SYSTEMS AND METHODS FOR OPTIMIZING THE SCHEDULING OF RESOURCES ON AN AIRPLANE - A system and method for enabling passengers to swap seats with other passengers, so that they may obtain seats that appear to be unavailable because they are occupied. Passengers use an interface to specify their desire and/or willingness to switch seats, and the conditions, if any, for switching. A processor runs an algorithm reassigning passenger seats based on the conditions inputted at the interface. Passengers are notified of their new seats, and may be charged or compensated for switching seats. | 01-12-2012 |
20120010911 | SYSTEMS AND METHODS FOR OPTIMIZING THE SCHEDULING OF RESOURCES ON AN AIRPLANE - A system and method for enabling passengers to swap seats with other passengers, so that they may obtain seats that appear to be unavailable because they are occupied. Passengers use interfaces to specify their desire and/or willingness to switch seats, including to get better seats, give up their seats for compensation, or sit together and/or sit with other passengers, and the conditions, if any, for switching. A processor runs an algorithm reassigning passenger seats based on the conditions inputted at the interface. Passengers are notified of their new seats, and may be charged or compensated for switching seats. | 01-12-2012 |
20120010912 | SYSTEMS AND METHODS FOR OPTIMIZING THE SCHEDULING OF RESOURCES ON AN AIRPLANE - A system and method for enabling passengers to swap seats with other passengers, so that they may obtain seats that appear to be unavailable because they are occupied. Passengers use interfaces to specify their desire and/or willingness to switch seats, including to get better seats, give up their seats for compensation, sit together and/or sit with other passengers, sit away from certain types of passengers, sit next to an empty seat, and the conditions, if any, for switching. A processor runs an algorithm reassigning passenger seats based on the conditions inputted at the interface. Passengers are notified of their new seats, and may be charged or compensated for switching seats. | 01-12-2012 |
20120010913 | SYSTEMS AND METHODS FOR MANAGING EMPTY SEAT INVENTORY ON AN AIRPLANE - A system and method for managing the inventory and distribution of empty seats to take into account the preferences of customers and the desirability of sitting next to an empty seat, and the desire of the owner of the venue to efficiently exploit empty seats. | 01-12-2012 |
20120203608 | SYSTEMS AND METHODS FOR PROVIDING LOYALTY AWARDS OF STOCK - A system and method of providing promotional rewards of stock in a company to customers who engage in a promotional activity, wherein the promotional reward is a fractional share of stock that is transferred to the customer. | 08-09-2012 |
20120203681 | SYSTEMS AND METHODS FOR PROVIDING GIFT CERTIFICATES OF STOCK - A system and method for gift certificates of securities, other financial instruments, commodities, or other assets are disclosed. In the case of stock, a purchaser enters gift certificate parameters including company name and denomination, as well as payment information. These parameters, together with the market price of the stock, determine the number of shares (which may be a non-integer number) that are being gifted. A provider generates an identifier, part or all of which may be incorporated into a physical or electronic gift certificate for delivery to a recipient who may claim the stock. A database maintains records of the gift certificates that have been purchased and claimed. | 08-09-2012 |
Patent application number | Description | Published |
20090253262 | ELECTROLESS PLATING SYSTEM - An electroless plating system includes a plating solution, and controlling reducing agents in the plating solution for deposition over outlier features smaller than about five hundred nanometers and isolated by about one thousand nanometers. | 10-08-2009 |
20090288593 | ELECTROLESS DEPOSITION SYSTEM - An electroless deposition system includes a deposition solution, and saturating the deposition solution with an oxygen concentration in a range from about two thousand parts per million to about twenty thousand parts per million. | 11-26-2009 |
20110135824 | Electroless Deposition System - An electroless deposition method includes providing a deposition solution, and saturating the deposition solution with an oxygen concentration in a range from about two thousand parts per million to about twenty thousand parts per million, and replenishing deionized water in the deposition solution. | 06-09-2011 |
20110214608 | Electroless Plating System - An electroless plating system includes a plating solution, and controlling reducing agents in the plating solution for deposition over outlier features smaller than about five hundred nanometers and isolated by about one thousand nanometers. | 09-08-2011 |
Patent application number | Description | Published |
20120023066 | INITIALIZATION PROTOCOL FOR A PEER-TO-PEER REPLICATION ENVIRONMENT - Techniques for initializing a connection in a peer-to-peer database replication environment. A message is received from an initiator node, indicating that the initiator node will begin replicating changes made to a particular data entity. One or more replicated changes relating to the database entity are received from the initiator node. If an updated instance of the data entity does not currently exist on a target node then one or more load operations are performed to create the updated instance. The stored replicated changes may then be processed against the updated instance of the database entity. | 01-26-2012 |
20120023369 | BATCHING TRANSACTIONS TO APPLY TO A DATABASE - Provided are a method, system and program for batching transactions to apply to a database. A transaction manager receives a plurality of transactions to apply to a database and adds the transactions to a work queue. One of a plurality of agents processes a batch of transactions from the work queue. Each agent executes a batch of transactions from the work queue against the database independent of the operations of other of the agents executing batches of transactions. The agent applies the transactions in the batch against the database and commits the transactions in the batch to the database in response to completing all of the transactions. | 01-26-2012 |
20120284227 | INITIALIZATION PROTOCOL FOR A PEER-TO-PEER REPLICATION ENVIRONMENT - Techniques for initializing a connection in a peer-to-peer database replication environment. A message is received from an initiator node, indicating that the initiator node will begin replicating changes made to a particular data entity. One or more replicated changes relating to the database entity are received from the initiator node. If an updated instance of the data entity does not currently exist on a target node then one or more load operations are performed to create the updated instance. The stored replicated changes may then be processed against the updated instance of the database entity. | 11-08-2012 |
20140108899 | DATA FILTERING BASED ON A CELL ENTRY - A data filtering system includes a display device and a data filtering engine coupled to the display device. The data filtering engine is configured to display a cell set containing data of a common data type on a display device with at least one cell containing a cell entry. The data filtering engine is further configured to display a filter icon within at least one cell of the cell set and apply a filter to the cell set in response to selection of the filter icon by a user. | 04-17-2014 |
Patent application number | Description | Published |
20130044193 | DYNAMIC SELECTION OF SURFACES IN REAL WORLD FOR PROJECTION OF INFORMATION THEREON - One or more devices capture a scene of real world, and process one or more image(s) which include distances to points on surfaces in the real world. The distances are used to automatically identify a set of surfaces in the real world. Then, the one or more devices check whether a surface in the set is suitable for display of an element of information to be projected into the scene. On finding that a surface is suitable, a transfer function is automatically identified, followed by automatic application of the transfer function to the element of the information. A transformed element, which results from automatically applying the transfer function, is stored in a frame buffer coupled to a projector, at a specific position in the frame buffer identified during the check for suitability. When no surface is suitable, user input is obtained, followed by projection of information as per user input. | 02-21-2013 |
20130044912 | USE OF ASSOCIATION OF AN OBJECT DETECTED IN AN IMAGE TO OBTAIN INFORMATION TO DISPLAY TO A USER - Camera(s) capture a scene, including an object that is portable. An image of the scene is processed to segment therefrom a portion corresponding to the object, which is then identified from among a set of predetermined real world objects. An identifier of the object is used, with a set of associations between object identifiers and user identifiers, to obtain a user identifier that identifies a user at least partially from among a set of users. Specifically, the user identifier may identify a group of users that includes the user (“weak identification”) or alternatively the user identifier may identify the user uniquely (“strong identification”) in the set. The user identifier is used either alone or in combination with user input to obtain and store in memory, information to be output to the user. At least a portion of the obtained information is thereafter output, e.g. displayed by projection into the scene. | 02-21-2013 |