310results about How to "Increase the amount of calculation" patented technology

An example game system includes a home-console type game device and a terminal device. The terminal device includes a touch panel and an inertia sensor, and wirelessly transmits to the game device operation data including touch panel data and inertia sensor data. The game device receives the operation data from the terminal device, and performs game processes based on the operation data. Moreover, the game device generates first game images and second game images based on the game processes. The first game images are compressed, and the compressed image data is wirelessly transmitted to the terminal device. The second game image is output to, and displayed on, an external display device which is separate from the terminal device. The terminal device receives the compressed image data from the game device, expands the received compressed image data, and displays the first game images on a display section.

A method of prestack reverse-time migration of seismic data that yields significant gains in computer storage and memory bandwidth efficiency is disclosed. The values only of the source wave incident on the boundaries of a simulation domain are saved, rather than all of the values of the wavefield throughout the entire simulation domain. This data allows an accurate and robust approximation of the forward propagated source wave for all finite-difference approximation orders of the acoustic wave equation. The method reduces the amount of data storage required by an order of magnitude and overcomes the present challenge of requiring special large memory hardware while allowing for the implementation of 3D prestack reverse-time migration on off-the-shelf platforms.

The invention discloses a two-dimensional laser radar point cloud data processing method. Environmental data is collected through laser radar scanning, point cloud data pre-processing is performed, apolar coordinate system with laser radar being a coordinate point is converted into a rectangular coordinate system that is used for posture calibration of a robot, environmental information is effectively detected and recognized through region segmentation, feature extraction, point cloud segmentation, two-dimensional laser radar and a camera fusion detection algorithm, and three-dimensional coordinate fusion is conducted through a vent needle model of the camera and the laser radar, so that the robot calibrates the posture according to a deviation. The invention also discloses a dynamic robot posture calibration method, wherein a camera is adopted as an auxiliary detection sensor and obtains the real-time posture state of the robot together with laser radar, the adjustment amount of a calibration system is obtained by comparing the real-time posture state with a desired posture state, calibration is continuously carried out until the deviation between the robot posture detected by the laser radar and the desired posture is less than a certain threshold value, and thus a whole closed-loop posture calibration process is completed.

Provided is a method of removing noise from digital moving picture data reducing the number of frames used in a temporal filtering operation and able to detect motion between frames easily. The method comprises a method of spatial filtering, a method of temporal filtering, and a method of performing the spatial filtering and the temporal filtering sequentially. The spatial filtering method applies a spatial filtering in a YCbCr color space, preserving a contour/edge in the image in the spatial domain, and generating a weight that is adaptive to the noise for discriminating the contour/edge in the temporal filtering operation. The temporal filtering method applies temporal filtering based on motion detection and scene change detection, compensating for global motion, the motion detection considering the brightness difference and color difference of the pixels compared between frames in the temporal filtering operation, and a weight that is adaptive to the noise for detecting the motion in the temporal filtering operation. The spatial filtering method is preferably performed first, and the temporal filtering method is performed with the result of the spatial filtering.

Disclosed is a system, method, and program for selecting an input/output (I/O) command in a queue of I/O commands. Each I/O command operates within a range of addressable locations on a storage medium. Each addressable location is defined according to a sector number and track number. The program makes use of a plurality of buckets, wherein each bucket represents a range of consecutive sector numbers. Each queued I/O command is associated with a bucket such that a sector number of an addressable location in which an I/O command operates is within the range of sectors comprising the associated bucket. A reference position is determined. A selection routine is then executed to select an I/O command. The selection routine selects a bucket including at least one I/O command and selects an I/O command within the selected bucket. The routine then determines whether the selected I/O command meets a selection criteria. The routine indicates the selected I/O command as the I/O command to process. Another iteration of the selection routine is performed after determining that the selected I/O command does not meet the selection criteria.

An extension to current multiple memory bank video processing architecture is presented. A more powerful memory controller is incorporated, allowing computation of multiple memory addresses at both the input and the output data paths making possible new combinations of reads and writes at the input and output ports. Matrix transposition computations required by the algorithms used in image and video processing are implemented in MAC modules and memory banks. The technique described here can be applied to other parallel processors including future VLIW DSP processors.

The present invention relates to an image processing apparatus and method configured to be able to suppress increases in computation due to interpolation processing.

For pixels of fractional pixel precision corresponding to sampling positions at a position b and a position d, pixel values corresponding to sampling positions at the position b and the position d are obtained by performing a sum-of-products operation using a first filter. For fractional pixel precision corresponding to sampling positions at a position c, pixel values corresponding to sampling positions at the position c are obtained by performing a sum-of-products operation using a second filter and an intermediate value B or an intermediate value D generated using a second filter with fewer taps than the first filter. The present invention may be applied to image coding apparatus that code in the H.264/AVC format, for example.

An apparatus and method for mapping CELP parameters between a source codec and a destination codec. The apparatus includes an LSP mapping module, an adaptive codebook mapping module coupled to the LSP mapping module, and a fixed codebook mapping module coupled to the LSP mapping module and the adaptive codebook mapping module. The LSP mapping module includes an LP overflow module and an LSP parameter modification module. The adaptive codebook mapping module includes a first pitch gain codebook. The fixed codebook mapping module includes a first target processing module, a pulse search module, a fixed codebook gain estimation module, a pulse position searching module.

The present invention utilizes determining the similarity between two adjacent frames to accelerate the computation of disparity maps of a stereo video. In a first stage, color similarity of pixels between the two adjacent frames is estimated. In a second stage, a plurality of feature points is selected from a previous frame, then the corresponding positions is located in a next frame for the feature points, and an average displacement of the feature points between the previous and the next frames is estimated. If the two adjacent frames are determined to be similar, the disparity map of the next frame can be obtained according to the disparity map of the previous frame. In such a manner, the computation of disparity maps of the stereo video can be accelerated.

The invention discloses an efficient three-dimensional space-time adaptive clutter suppression method for airborne digital array radar, and belongs to the field of suppression of clutters of airborne radar. In the method, a cascading mode is adopted for the airborne non-front lateral planar array radar working in a medium and high pulse repetition frequency (PRF) system, and the method includes designing a robust adaptive digital beam former (ADBF) in a pitching dimension of airspace to suppress short-range clusters at first; and designing a two-dimensional dimension-reduction space-time adaptive processor (STAP) in a direction-pulse field to further suppress long-range clutters. By the aid of the efficient three-dimensional space-time adaptive clutter suppression method, the clutters at various fuzzy distances of the airborne non-front lateral planar array radar can be effectively filtered, the convergence speed is fast, computational complexity is low, and the method is suitable forengineering application.

The invention discloses an airborne radar clutter self-adaption restraining method based on main-lobe clutter registering. The STAP clutter restraining method based on efficient and self-adaption main-lobe clutter registering is researched according to the airborne non-side-looking array radar clutter distance space-variant characteristic. In order to reduce the operand, firstly, the main-lobe clutter Doppler frequency is accurately estimated according to a cascading method, then the space angular frequency of the main-lobe clutter is estimated through a sparse reconstruction technology, two-dimensional registering is carried out on main-lobe clutters of different distance units, and finally the clutter restraining is carried out through a dimensionality reduction STAP algorithm. A simulation experiment result shows that after the main-lobe clutter registering, the dimensionality reduction STAP improvement factor is improved by about 18 dB on the main-lobe clutter area, and the detection performance on slow moving targets is improved significantly. The method is small in operand and easy to implement.

The invention relates to a depth bidirectional feature pyramid enhancement network for small-scale target detection, comprising: determining a backbone network of a network encoding end; determining adepth bidirectional feature pyramid enhancement network of a small-scale target detection end. Design Bottom-Up characteristic pyramid; Design Top-Down pyramid; Target Detection Subnetwork: Using strategies in detection of the two stages in faster-rcnn, wherein the two stages include candidate frame extraction and target classification respectively. In the RPN stage, regression of a target frameand prediction of whether the probability the target's are performed by use of the convolution of the convolution kernel of 3*3 on an output characteristic graph of each scale of the top-down characteristic pyramid. the screened candidate target frame and the output characteristic graph of the top-down characteristic pyramid of the corresponding scale are subjected to ROI-pooling, and finally twofull connection layers are used to adjust the frame and classify the specific categories of the target; Object Detection Results are output.

The embodiment of the invention provides an application program operation method and device. The method comprises the following steps: when speech data are received by an auxiliary program, identifying text information corresponding to the speech data; looking up an application program name and a function name matched with the text information; starting an application program corresponding to the application program name; triggering a control corresponding to the function name in the application program. According to the embodiment of the invention, the speech operation of the application program is realized, a manual operation is omitted, operation simplicity is greatly improved, an operation threshold of the application program is lowered, and the application program operation method is especially suitable for crowds with vision disorder, input disorder and the like.

An image registrations includes determining a first binary descriptor of a first key point in a first image, determining a second binary descriptor of a second key point in a second image, determining a weighted Hamming distance between the first binary descriptor and the second binary descriptor, and registering the first key point with the second key point when the weighted Hamming distance is below a noise threshold. At least one element in the first or the second binary descriptor is a result of a comparison of a difference between intensities of at least two pixels of the first or the second image with a threshold. At least two weights of the weighted Hamming distance for comparing at least two elements of the first or the second binary descriptors are different.

The invention discloses a method for protecting international mobile subscriber identity (IMSI) in mobile communication, which comprises the following steps that: on the basis of the original identity identifier and authentication protocol of the mobile communication, users encrypt IMSI by using a home location register (HLR) public key and send the IMSI to a visitor location register (VLR); the VLR sends the encrypted IMSI to the HLR, the HLR decrypts the IMSI to generate an authentication vector; the HLR sends the encrypted IMSI and the corresponding authentication vector to the VLR; and the VLR performs the authentication on the users according to the encrypted IMSI and the corresponding authentication vector. In addition, the IMSI is also protected by combining the use of a public keycertificate. Therefore, attackers cannot determine the identities of the users through passive interception or active inveiglement and cannot capture privacy such as tracks of the users and the like,and simultaneously, the determination of the VLR on HLR in which the users are positioned is not influenced, so the also known as (AKA) protocol can be performed smoothly.

Decoding signals represented by a trellis of block length N divided into windows of length L includes a step of decoding a forward recursion from a point P1 that is before the beginning of a window up to the beginning of the window and decoding a backward recursion from a point P2 that is after the end of a window back to the end of the window to define known states at the beginning and end of the window. A next step includes decoding the window using backward recursion from the known state at the end of the window back to the beginning of the window to define a set of backward recursion state metrics. A next step includes decoding using forward recursion starting from a known state at the beginning of the window and moving forward to the end of the window to define a set of forward recursion state metrics. A next step includes calculating a soft output at each stage of the window using the forward and backward recursion state metrics, and branch metrics at each stage, and outputting the soft output for that stage.