600 results about "Mapping algorithm" patented technology

A method of functional brain mapping of a subject is disclosed. The method is effected by (a) illuminating an exposed cortex of a brain or portion thereof of the subject with incident light; (b) acquiring a reflectance spectrum of each picture element of at least a portion of the exposed cortex of the subject; (c) stimulating the brain of the subject; (d) during or after step (c) acquiring at least one additional reflectance spectrum of each picture element of at least the portion of the exposed cortex of the subject; and (e) generating an image highlighting differences among spectra of the exposed cortex acquired in steps (b) and (d), so as to highlight functional brain regions. Algorithms for calculating oxygen saturation and blood volume maps which can be used to practice the method are also disclosed. Systems for practicing the method are also disclosed.

Systems and methods are disclosed that perform automated semantic tagging. Automated semantic tagging produces semantically linked tags for a given text content. Embodiments provide ontology mapping algorithms and concept weighting algorithms that create accurate semantic tags that can be used to improve enterprise content management, and search for better knowledge management and collaboration.

An apparatus, system, and method are disclosed for bad block remapping. A bad block identifier module identifies one or more data blocks on a solid-state storage element as bad blocks. A log update module writes at least a location of each bad block identified by the bad block identifier module into each of two or more redundant bad block logs. A bad block mapping module accesses at least one bad block log during a start-up operation to create in memory a bad block map. The bad block map includes a mapping between the bad block locations in the bad block log and a corresponding location of a replacement block for each bad block location. Data is stored in each replacement block instead of the corresponding bad block. The bad block mapping module creates the bad block map using one of a replacement block location and a bad block mapping algorithm.

In embodiments, a virtual advertising platform may use a three-dimensional mapping algorithm to insert a virtual image within a digital video stream. The virtual advertising platform may apply a three-dimensional mapping algorithm to the virtual digital image, wherein the three-dimensional mapping algorithm causes the virtual digital image to be recomposited within a plurality of frames within a received two-dimensional digital data feed in place of a spatial region within the two-dimensional data feed. The mapping algorithm may enable application of analogous geometric changes to the virtual digital image that are present in the spatial region within the plurality of video frames within the two-dimensional digital video data feed, and may send the recomposited digital data feed for display to a user, wherein the recomposited digital data feed is a virtualized digital data feed that includes the virtual digital image in place of the spatial region.

The invention belongs to the application technical field of AR intelligent glasses, and discloses a local image recognition method and a system based on the AR intelligent glasses. The method comprises steps calibrating the consistency of an intelligent glasses imaging screen, a front camera picture of the intelligent glasses and a visual field picture of a real environment around the intelligentglasses; recognizing the human eye image and calculating the eye motion vector to obtain the eye motion coordinates; identifying whether the focal point of the extended line of human binocular visionis an imaging screen or a real three-dimensional space; obtaining the mapping relationship of human eyes in the real world around them; according to the embedded mapping algorithm, the coordinates ofthe human eye fixation point on the glasses imaging screen and the front camera image being obtained respectively. The invention obtains the eye image information of the human eye through the eye movement instrument, synchronously calibrates the eye image and the scene camera, obtains the fixation point area of the human eye in the real scene, and performs image recognition only on the fixation point area during processing, thereby greatly reducing the image processing pressure of the GPU and improving the image processing efficiency.

The invention discloses a face mage super-resolution method which fuses global features and local detail information. The invention can synthesize a high-resolution face image according to a low-resolution face image based on a sample image. Firstly, a local maintaining mapping algorithm and a radial basic function return algorithm are combined together to get a global high-resolution face image; then a neighborhood reconstruction method is adopted to synthesize a high-resolution face residual image block and consequently form a high-resolution face residual image by combination; finally, the high-resolution face residual image is overlapped to the high-resolution face image to obtain a final super-resolution effect. The technology provided by the invention can synthesize the clearer high-resolution face image, improve the recognition of the face image and have important application significances on video monitoring, face recognition and other aspects.

A method for processing high dynamic range (HDR) images by selecting preferred tone mapping operators and gamut mapping algorithms based on scene classification. Scenes are classified into indoor scenes, outdoor scenes, and scenes with people, and tone mapping operators and gamut mapping algorithms are selected on that basis. Prior to scene classification, the multiple images taken at various exposure values are fused into a low dynamic range (LDR) image using an exposure fusing algorithm, and scene classification is performed using the fused LDR image. Then, the HDR image generated from the multiple images are tone mapped into a LDR image using the selected tone mapping operator and then gamut mapped to the color space of the output device such as printer.

Monitoring events triggered by a computer network. Each event being provided with attribute values allocated to a given set of attributes, and providing an event display, determining a primary attribute and a corresponding display label of the events selected from the given set of attributes presented with attribute values on a cross plot, providing a pattern algorithm to detect whether an arrived event is part of a given pattern, providing a mapping algorithm to map attribute values on the cross plot, allocating a second display label to the events indicating the attributes uncovered as part of the given pattern, plotting events arriving and including an attribute value allocated to a primary attribute into the cross plot, and plotting events arriving within the time period and detected by the pattern algorithm as part of the given pattern into the cross plot with the second display label indicating the given pattern.

The invention discloses a method for reducing a peak-to-mean ratio in OFDM (Orthogonal Frequency Division Multiplexing). The method comprises the following steps: dividing an OFDM mark needing to be transmitted into two sub-blocks according to two half sections including a front half section and a rear half section or an odd number position mark and an even number position mark; calculating a mark vector by selecting a mapping algorithm and selecting a signal with the minimum peak-to-mean ratio to transmit; reducing the peak-to-mean ratio of the OFDM mark by utilizing different rotary factors; and carrying out traversal to obtain a weighting scheme for enabling an PAPR (Peak To Average Power Ratio) to be minimum and searching the two sub-blocks of a sequence with the best PAPR performance to combine and transmit. According to the method disclosed by the invention, a previous OFDM mark flow is used for carrying out segment processing, and then an SLM (Source Library Maintenance) algorithm and a PTS (Partial Transmit Sequence) algorithm are used by segments to obtain good PAPR reduction performances of the SLM algorithm and the PTS algorithm; the performances of the PTS and SLM algorithms are subjected to simulation comparison and a PTS is better than SLM on the aspect of an error code performance; the effect of lowering a PAPR effect is slightly worse than the SLM. According to the method disclosed by the invention, a technology for reducing the peak-to-mean ratio in the OFDM has better PAPR inhibition effects and better same-level computation complexity compared with the SLM algorithm and the PTS algorithm.

An example apparatus for providing an audible signal representative of an environment comprises a sensor system, and an audio system providing an audible signal to a person. The audible signal has one or more audible signal variables from which the person can determine, for example, the location and relative velocity of one or more objects within the environment. The apparatus include an electronic circuit for converting environmental data into audible signal variables, for example using a mapping algorithm.

An apparatus for controlling the movements of an avatar in a virtual environment includes a user input means, such as a gamepad with a plurality of joystick-controlled and button-controlled outputs, a tracker, and optional sliding foot pedals; a processor for running virtual environment (VE) software that includes an avatar moving through the VE; and a control mapping algorithm. The algorithm maps the gamepad, tracker, and optional sliding foot pedal outputs to the avatar's course, heading, displacement, and view, with the joysticks mapped to provide open loop directional control over the course and heading of the avatar, the tracker providing open loop control over the view, and the optional sliding foot pedals providing open loop control over displacement. The operator-controlled movement of the avatar in the virtual environment is displayed to the operator on a computer desktop display or a head mounted display.

The invention provides a partial key escrow (PKE) method and system based on a public key cryptographic algorithm SM2, and belongs to the field of information security. N (N is not less than 1) different PKE systems form one key escrow network. An SM2 private key of a user is divided into N+1 partial keys by utilizing key partition storage and multiparty combined calculation modes; the user and the N different PKE systems perform scatter storage; and the user and the N different PKE systems are combined to complete a correlation calculation when the private key needs to be used. At user key generation and use stages, the PKE system generates user partial private keys by utilizing a labeling mapping algorithm, but does not practically save the user partial private keys; therefore, the construction scale of the system can be largely reduced, investment costs of the system are reduced, and operation efficiency and service level of the system are improved.

A method for generating a personalized 3D model using a plurality of 2D images and a generic 3D model is provided. The method includes the following steps: extracting a plurality of feature points from the plurality of 2D images; extracting a plurality of landmark points from the generic 3D model; mapping the plurality of features extracted from the plurality of 2D images to the plurality of landmark points extracted from the generic 3D model so as to generate relationship parameters for a mapping algorithm; morphing the generic 3D model into a personalized 3D model with the plurality of landmark points, the relationship parameters and the mapping algorithm; iteratively refining the personalized 3D model with the plurality of feature points extracted from the plurality of 2D images; and when a convergent condition is met, the step of iteratively refining the personalized 3D model is complete and the personalized 3D model is saved to the 3D model database.

Multiple TCE entries at the same indices in multiple, same size TCE tables are mapped to facilitate data communication between a self-virtualizing IO resource and a logical partition. First and second TCE tables used by an adjunct partition that interfaces a self-virtualizing IO resource with a logical partition may be identically sized, so that whenever a DMA operation between the self-virtualizing IO resource and the logical partition is desired the same TCE entries in the first and second TCE tables may be used to perform a redirected DMA operation, and without the need to perform hashing or other mapping algorithms to map to the respective TCE entries in the respective TCE tables.

A global image adjustment, such as dynamic range adjustment is established based on image characteristics. The image adjustment is based more heavily on pixel values in image areas identified as being important by one or more saliency mapping algorithms. In one application to dynamic range adjustment, a saliency map is applied to create a weighed histogram and a transformation is determined from the weighted histogram. Artifacts typical of local adjustment schemes may be avoided.

The present invention relates to an arrangement adapted to be provided in a server node (50) in a communication system, handling a large number of clients, comprising a number of interface boards (201, 202, 203) handling one or more protocols for communication with different nodes and a number of processing means (101, . . . ,106) adapted to serve a plurality of clients which may use a number of different types of identities when addressing the server node (500). It comprises load distribution control means adapted to handle clients using at least two different categories of addressing identities separately, and to distribute the clients to processing means (101, . . . ,106), and being adapted to provide a number of load index values (LI1LI36), exceeding the number of processing means, and load index mapping means mapping between load index values and processing means in a load index mapping table (30, 301, 302, 303, 3011-3016). It is further adapted to distribute mapping tables or to substantially each interface board (201,202,203) and each processing means (101, . . . ,106), and first mapping means comprising mapping algorithm (211,212,213) handling clients or subscribers using a first category of identity comprising a for the server node normal identity e.g. generated externally, said mapping algorithm being adapted to establish a load index value (LI1) for an incoming message using said firs.t category of identity, and second mapping means (221,222,223) comprising a second mapping algorithm for mapping second category or internally generated identities to respective load index values such that a client will be handled by the processing means (101, . . . ,106) mapped to the corresponding, established load index value.

An improvement to sigmoidal gaussian cusp knee (SGCK) gamut mapping algorithm useful for gamut boundary descriptors (GBDS) that are defined with multiple shells rather than a single hull. The gamut mapping algorithm involves a lightness-rescaling step and a chroma compression step, in which points on each of the shells of the source GBD are mapped to corresponding points on the respective shells of the destination GBD. In situations where there is a mismatch between the number of shells in the source GBD and the destination GBD, such as a case where one of the GBDs is defined by a singly-shelled GBD whereas the other is defined by a two-shelled GBD, an induced hue slice may be constructed so as to simulate the missing shell. In addition, an induced hue slice may be constructed in a situation where lightness rescaling results in a mapping that is too steep between source and destination.

Monitoring events triggered by a computer network. Each event being provided with attribute values allocated to a given set of attributes, and providing an event display, determining a primary attribute and a corresponding display label of the events selected from the given set of attributes presented with attribute values on a cross plot, providing a pattern algorithm to detect whether an arrived event is part of a given pattern, providing a mapping algorithm to map attribute values on the cross plot, allocating a second display label to the events indicating the attributes uncovered as part of the given pattern, plotting events arriving and including an attribute value allocated to a primary attribute into the cross plot, and plotting events arriving within the time period and detected by the pattern algorithm as part of the given pattern into the cross plot with the second display label indicating the given pattern.

The invention belongs to the technical field of image and video processing, and particularly discloses a high dynamic range image compression method based on a mixed tone mapping algorithm. According to the high dynamic range image compression method, the problem about image distorsion when a high dynamic image displays on general display equipment is mainly solved. The high dynamic range image compression method comprises the following steps: firstly, using global linear compression based on image types to save the integral effect of the image; secondly, further enhancing the naturalness of the image by using an adaptive avoiding and value burning technology; finally, improving the visibility of image detailed information by using a local tone mapping algorithm based on a dual-side filter. According to the high dynamic range image compression method disclosed by the invention, a natural distinct low dynamic image result can be obtained; the high dynamic range image compression method can be widely applied to relevant fields of image and video processing.

A programmable multifunction electronic camera uses a commercial pixel digital energy sensor to generate detector element signal digital data normally generated by expensive, custom designed, detector element energy sensors. The camera performs this function by retrieving pixel signal digital data and pixel location data from the pixel energy sensor, retrieving detector element energy sensor masks containing information regarding the size, shape, and location of detector elements included in the detector element energy sensors, mapping the pixels included in the pixel energy sensor to the energy sensor masks to identify pixels that can be combined to create “virtual detector elements” having the same size, shape, and configuration as the detector elements in the detector element energy sensors, and combining the pixel signal digital data associated with the mapped pixels to generate the detector digital data. The camera can be programmed with a number of different energy sensor masks and mapping algorithms.

The present invention provides a technique for translating facial animation values to head mesh positions for rendering facial features of an animated avatar. In the method, an animation vector of dimension Na is provided. Na is the number of facial animation values in the animation vector. A mapping algorithm F is applied to the animation vector to generate a target mix vector of dimension M. M is the number of targets associated with the head mesh positions. The head mesh positions are deformed based on the target mix vector.

The spatial frequency analysis contained in the compressed image is used not only for decompression of images but also for the selection of an appropriate gamut mapping algorithm. Computation resources are then saved because no specific spatial frequency analysis is required for the selection of an appropriate gamut mapping algorithm.

Systems and methodologies for lossless visible watermarking of images are provided herein. The provided systems and methodologies can utilize a Pixel Value Mapping Algorithm (PVMA), wherein a watermark can be embedded into an image by transforming respective intensities of areas of the image corresponding to the watermark using a bijective mapping function. Additionally and / or alternatively, a Pixel Position Shift Algorithm (PPSA) can be used to embed a watermark into an image by shifting the position of pixels in the image corresponding to the watermark over a specified shift distance. Further, provided systems and methodologies can facilitate enhanced watermarking security by embedding a visible watermark into an image based on a secret key.

The invention relates to a character relationship graph construction method based on integration of an ontology and multiple neural networks. The method comprises the following steps: crawling data related to a character in a certain domain in the Internet; establishing a domain character ontology; extracting data from a structured data table which contains multiple types of entities and has repeated entities to construct a standardized entity table; matching the two class names of the character ontology model with the two entity table names through a semantic mapping algorithm, automaticallyobtaining all entity relationships, and storing the entity relationships in a Neo4j database in a graph structure; for the text data in the structured table, carrying out character entity recognitionand relationship extraction by using a sliding window, entity position characteristics and a bidirectional gating recurrent neural network; and updating the current graph structure of the newly addedrelationship to form a domain character relationship knowledge graph. The character relationship advanced features can be extracted from the original relational data and the text data, manual design is not needed, the recognition effect is improved, and the efficiency of constructing the character relationship graph by the complex webpage text is improved.

The invention relates to a key management method used for a wireless sensor network, in particular relates to a key management method adopting the combined key technology, and belongs to the field of wireless sensor network safety technology. The key management method comprises the three steps as follows: system building, key generation and key updating, wherein the step of key generation comprises three processes of system parameter building, key factor and mapping algorithm generation, and shared key building. Compared with the prior art, the key management method has certain degrees of improvements on safety, storage and energy conservation, solves the problem that the sensor mode storage space is limited, ensures that any adjacent nodes can share a key, makes up for a deficiency that the sensor network is not provided with an authentication center, and saves the storage space.

Multiple translation control entries (TCEs) at the same indices in multiple, same size TCE tables are mapped to facilitate data communication between a self-virtualizing input / output (IO) resource and a logical partition. First and second TCE tables used by an adjunct partition that interfaces a self-virtualizing IO resource with a logical partition may be identically sized, so that whenever a direct memory access (DMA) operation between the self-virtualizing IO resource and the logical partition is desired the same TCE entries in the first and second TCE tables may be used to perform a redirected DMA operation, and without the need to perform hashing or other mapping algorithms to map to the respective TCE entries in the respective TCE tables.

An anti-phase noise amplitude phase combined keying modulation and demodulation method belongs to the technical field of modulation and demodulation, the method is characterized in that, a circular constellation diagram construction method and a circular constellation diagram selection method are firstly utilized for designing a constellation diagram structure with good symbol error performance; secondly, a bit mapping algorithm which is proposed by the invention is utilized for solving the difficulty of carrying out the Gray-code mapping of other constellation diagrams except the quadrature amplitude modulation (QAM), thereby ensuring the bit error performance of the proposal; the demodulation proposal with high reliability and low complexity is further matched for use, the actual bit error performance is not only far better than the QAM which uses the Gray codes under the phase noise, but also has no obvious loss compared with the Gray-code QAM when in only consideration of Gaussian white noise; finally, the design method which is proposed by the invention is simple and easy to operate, thereby being easily expanding to any order, facilitating the application in a communication system with serious phase noise of global digital broadcasting and the like and possibly reducing the costs and the complexity of a receiver at the same time of ensuring the symbol error performance of the system.

The invention discloses a wireless induction interactive system based on infrared light motion capture, which comprises a coordinate mapping method from a three-dimensional space point to a screen based on the infrared light motion capture. In the system, a position and a motion track of an infrared light-spot are captured by using an infrared camera and positioned at a corresponding position on a screen through a mapping algorithm, a control component on the screen is controlled and a novel three-dimensional space wireless induction interactive system is realized. The system expands a traditional simple control mode based on a remote controller and realizes the interactive control similar to a mouse for screen images in the three-dimensional space. Based on the interactive system, a screen menu can be controlled by gestures and postures and handwriting input can be realized after a handwriting recognition module is added. The system is very suitable for use in a digital home, and can expand the function of the traditional remote controller, realize television menu control and home control in the three-dimensional space and provide the application of media walls, interactive games, electronic whiteboard and the like.

Distributing packets from an input link to multiple output links involves categorizing each incoming packet, selecting a mapping algorithm based on the packet category, and using the selected mapping algorithm for each packet to determine an output link for the respective packet. If packets are from a category that requires the order of the packets to be maintained, then the selected mapping algorithm causes packets from the same set of packets to be distributed to the same output link. If packets are from a category that does not require the order of the packets to be maintained, then the selected mapping algorithm can cause packets to be distributed more evenly among the multiple output links. Hashing can be used to distribute in-order packets from the same set to the same output link. Load balancing and round-robin distribution can be used to distribute out-of-order packets more evenly across the output links.

A new method and framework for scheduling receive-side processing of data streams received from a remote requesting client by a multiprocessor system computer is disclosed. The method receives data packets from the remote requesting client via a network and, for each data packet, applies a mapping algorithm to portions of the received data packet yielding a mapping value. The method further applies the map value to a processor selection policy to identify a processor in the multiprocessor system as a selected processor to perform receive-side processing of the data packet. The method queues the received data packet for processing by the selected processor and invokes a procedure call to initiate processing of the data packet.