366results about How to "Reduce matching time" patented technology

The invention provides a contour vector feature-based embedded real-time image matching method. The method uses the linear feature based on X and Y direction vectors, and has strong capability of resisting image distortion, noise, shading, illumination changes, polarity inversion and so on. An image pyramid search strategy is used, templates are quickly matched in a high-layer low-resolution image to be tested, and then, a target position is found out accurately by stepwise downward search, so that matching time is reduced greatly. According to the template image specific information, the best pyramid hierarchy number and the best rotation angle step size for the pyramid template matching of each layer are calculated automatically. An image pyramid highest-layer three-level screening matching strategy is provided, treatment is carried out according to the specific content of the image to be tested, and the first level of screening and the second level of screening are carried out; the non-target position is eliminated just by the addition and subtraction and the conditional statements, which is more efficient in the embedded system than using the multiplication and division; and the third level only processes fewer positions meeting the requirements of the above two levels, so that the matching speed is improved greatly. The overall method can realize the work of matching and locating the target at any angle and any coordinate.

The invention discloses a wafer defect detection method based on characteristic matching and relates to the image processing method technology field. The method comprises the following steps of collecting a wafer sample image, matching the wafer sample image with a chip template image and searching a single chip area to be detected in the wafer sample image; describing characteristic vectors of characteristic points of the chip template image and a chip image to be detected; matching the characteristic points of the chip template image and the chip image to be detected, rejecting a mismatching point, and according to a matched result, completing position adjusting and correction of the chip image to be detected; and carrying out binarization on the chip template image and the registered chip image to be detected so as to realize extraction of chip defect information. By using the method, small defects on a wafer can be effectively detected, detection efficiency is high and detection stability is good.

The invention discloses a multi-user supported searchable encryption system and method and accordingly the problem that specific encrypted files cannot be searched accurately in the prior art is mainly solved. The multi-user supported searchable encryption system comprises a credible authorization center TA, service providers and users; the credible authorization center TA is formed by a system initialization module, a secret key generation and management module and a user information management module; the service providers comprise a file server and a management server; the users comprise data providers and data receivers. The multi-user supported searchable encryption method comprises the steps of system initialization, secret key distribution, file encryption, business outsourcing, file retrieval, user decryption and user logout and adding. According to the multi-user supported searchable encryption system and method, the file retrieval time of the users is shortened due to the establishment of a key word index on files, the storage and computational overhead of the users is reduced due to the accurate file retrieval, the file retrieval is accurate, meanwhile the forward and backward security of the files is ensured, and meanwhile the multi-user simultaneous decryption is supported.

A high-frequency power device including: an oscillator; a high-frequency power supplier; a reflection coefficient calculator; a discharge signal output unit; and a frequency controller, wherein the frequency controller: instructs the oscillator to oscillate the oscillation signal at a first oscillation frequency for the period of time while a discharge signal is not in a state showing that the discharge has been commenced or in a state where the discharge is regarded as having been commenced; then instructs the oscillator to change the first oscillation frequency to a second oscillation frequency immediately after the discharge signal changes into the states; and then controls the oscillation frequency so that the absolute value is made small.

The invention discloses a power matching method applicable to a blade electric vehicle. The method comprises the steps as follows: firstly, the quantity of motors is determined according to a driving manner adopted by the vehicle type; then main parameters such as whole vehicle parameters, motor parameters and battery parameters are listed; initial power matching is performed according to the parameters in a list; and then the quantity of battery modules is determined according to an initial matching result, the transmission ratio of a transmission is determined later, and the power matching of the blade electric vehicle is completed. According to the power matching method, rapid and more accurate power matching can be performed aiming at blade electric vehicles with different vehicle type requirements and different power performance requirements, the matching time can be reduced, the matching expenses are saved, and the whole vehicle development period is shortened.

The invention provides an object and fractal-based binocular three-dimensional video compression and decompression method. In binocular three-dimensional video coding, a left channel is used as a basic layer, a right channel is used as an enhancement layer, and the left channel is encoded by an independent motion compensation prediction (MCP) mode. The object and fractal-based binocular three-dimensional video compression coding method comprises the following steps of: firstly, acquiring a video object partition plane, namely an Alpha plane by a video partition method, encoding the initial frame of a left eye through block discrete cosine transformation (DCT), and performing block motion estimation / compensation coding on a non-I frame of the left eye; secondly, determining the area attribute of an image block by utilizing the Alpha plane, and if the block is not within a video object area of the current code, not processing an external block, and if the block is within the video object area of the current code completely, searching the most similar matching block by a full-searching method in a previous frame of an internal block, namely a reference frame searching window of a left eye video; and finally, compressing coefficients of an iterated function system by a Huffman coding method, and if part of pixels of the block are within the video object area of the current code, and the other part of pixels are not within the video object area of the current code, processing a boundary block independently. The right channel is encoded by a MCP mode and a disparity compensation prediction (DCP) mode, the MCP is similar to the processing of the left eye, and the block with the minimum error is used as a prediction result. When the DCP coding mode is performed, the polarization and directionality in a three-dimensional parallel camera structure are utilized fully.

The invention relates to an image matching method, comprising the following steps: (1) collecting images to be matched by an image collector and extracting template images from an image processor; (2) reducing the images to be matched and template images by half in the directions of width and height; (3) repeating step (2) until the images to be matched and template images reach specified sizes and carrying out gray scale normalization cross correlation matching on the reduced images to obtain the optimal matching positions (x, y); (4) returning to the previous images which are reduced by half and carrying out further matching on 9 search positions within the range of ((2x-1)-(2x+1), (2y-1)-(2y+1)) to obtain new optimal matching positions (x, y); (5) repeating step (2) until returning to the primary image, namely the original image, and carry out final matching to obtain the optimal matching positions and matching values. The method features shorter matching time and smaller amount of calculation.

The invention relates to a video matching method, which comprises the following steps: selecting one frame calculated with an integral image depth map in a video image sequence as a reference frame; acquiring a varying area of a first image of a current frame relative to a first image of the reference frame, and a varying area of a second image of the current frame relative to a second image of the reference frame; and matching and calculating depth maps of the varying area of the first image and the varying area of the second image of the current frame. The invention also relates to a video matching device and a system. The invention utilizes video images, particularly correlation among video image sequences to select the frame matched with the integral image and calculated with the depth map as the reference frame, and newly performs corresponding image matching and depth map calculation only for the varying area of the current frame by detecting the varying area of the image of the current frame relative to the image of the reference frame, therefore, the invention shortens the matching time of the image of the current frame remarkably so as to improve the matching speed of the video and achieve the quick matching of the video.

The invention discloses a regular expression matching method based on a smart finite automaton (SFA), which comprises the steps of: selecting a proper regular expression rule set; and constructing the SFA; respectively carrying out character string matching on each read test set by an SFA matching method, and carrying out statistics on matching results. Experiment results indicate that: compared with an XFA (Xml Forms Architecture), the SFA has storage space overhead reduced by 44.1 percent, storage access frequency reduced by 69.1 percent and improved space-time efficiency of matching the regular expression. According to the invention, the problem of redundancy mobility edge existing in the XFA is solved, storage space can be effectively saved, and performances of the XFA are improved. Under the environment that the current network bandwidth and the traffic flow rapidly increase, the regular expression matching method provides an effective solution scheme for throughput requirements and storage space demands of line speed data packet processing during application.

The invention provides a tinnitus detecting method and a tinnitus therapeutic apparatus. The method includes the steps of conducting pure tone threshold detection of two ears, selecting the tested ear according to the result of the pure tone threshold detection, conducting tinnitus frequency matching of the tinnitus ear through a three-point forced choice method to obtain the tinnitus frequency, and conducting tinnitus loudness matching of the tinnitus ear with the tinnitus frequency as the datum to obtain a tinnitus perception threshold. By means of a sound stimulation strategy, the tinnitus therapeutic apparatus comprises a computer readable medium, a detection control unit, a treatment control unit, a headset and a feedback unit. The detection control unit is used for conducting tinnitus detection and involves pure tone threshold detection, tinnitus frequency matching and tinnitus loudness matching. The treatment control unit processes audio files for treatment according to the result of the tinnitus detection, and therefore the individual treatment scheme is obtained. By means of the method and the apparatus, the tinnitus detection time is shortened, and the fault tolerance capacity is improved; by means of the tinnitus therapeutic apparatus, diagnosis and treatment are integrated, the treatment efficiency is improved, and the treatment cost is reduced.

The invention provides an image matching type indoor positioning method with the assistance of a crowd sensing WiFi signal fingerprint. According to the method, preliminary positioning is realized by means of WiFi; and according to a preliminary positioning result, auxiliary image positioning is carried out. Therefore, image positioning complexity is reduced; and the real-time performance of the indoor positioning result is improved.

The biometrics verification system uses an application server and an authentication server, where the application server and the authentication server operate in parallel. The application server has a BIC card read module, a BIC card verification module, and a result display module. Whereas, the authentication server has a facial detection module, a facial feature extraction module, and a facial feature matching module. The BIC card read module reads source facial features from a BIC card. The BIC card verification module verifies the source facial features. The result display module displays matching results generated by the facial feature matching module. The facial detection module detects target facial images. The facial feature extraction module extracts target facial features from the target facial images. The facial feature matching module matches the target facial features with the source facial features transmitted via the secure channel service. The facial feature matching module generates the matching results.

The invention provides a rapid fractal compression and decompression method for multi-cast stereo video. The method comprises the following steps of: selecting an intermediate cast as a reference cast; and compressing the intermediate cast by using a motion compensation prediction (MCP) principle and compressing other casts by using a principle of disparity compensation prediction (DCP) and MCP. Three casts are taken for example; the intermediate cast is used as the reference cast and is coded by a separate MCP mode; an initial frame is subjected to block discrete cosine transform (DCT) transform coding, and non-I frames are subjected to block motion estimation / compensation coding; a pixel sum and a pixel quadratic sum of a subblock related to a subblock domain and a father block domain are calculated; a pixel sum and a pixel quadratic sum of an interpolation corresponding block in a subpixel are calculated; a pre-search limiting condition is judged; and the most similar block is searched in a front frame search window through subpixel block matching and an adaptive hexagonal search algorithm based on a motion vector field. According to the method, the MCP mode and the DCP mode are adopted for coding left casts and right casts, the subpixel block matching and disparity distribution constraint condition are utilized during coding of the DCP mode, and deblocking loop filtering is adopted during decoding.

The invention provides an infrared matching method with a feedback function. The method comprises the steps: storing and transmitting an infrared code by adopting a cloud server, automatically transmitting the infrared code to an infrared matching device after the cloud server receives a mobile terminal matching instruction, transmitting an infrared signal to an electric appliance after the infrared matching device receives an infrared code instruction set, and monitoring a power-on situation of the household electric appliance by virtue of an electric appliance state monitoring device, wherein whether the matching is succeeded or not can be remotely confirmed. According to the infrared matching method, the automation is completely realized, the infrared matching can be realized only by pressing a starting button, and the operation is easy and convenient; according to the entire infrared code matching process, only a power-on instruction needs to be matched by simplifying the instruction set, so that the matching time is shortened, the matching success rate is increased, and the user experience is improved. The invention also provides an infrared matching system utilizing the method. The infrared matching system comprises the mobile terminal, the cloud server, the infrared matching device and the electric appliance state monitoring device.

The invention provides a quick fractal video compression and decompression method, comprising the following steps: firstly, coding an initial frame by block DCT (discrete cosine transformation); carrying out block movement estimation / compensation coding on a non-I frame; calculating the pixel sum and the pix quadratic sum of a sub block relevant to a sub block region and a father block region; meanwhile, calculating the pixel sum and the pixel quadratic sum of the interpolated value corresponding block of a subpixel; then, carrying out preview search restricted condition judgment; finding the most similar matching block in a previous frame of search window by an unsymmetrical cross-shaped multi-level hexagon lattice point search algorithm matched and improved by a subpixel block; and finally, compressing an iterated function system coefficient by a Huffman coding method. The corresponding decompression process comprises the following steps: decoding the I frame in an inverse DCT mode; performing Huffman decoding on the non-I frame to obtain the iterated function system coefficient; then, decoding on the basis of a macroblock; calculating the pixel sum and the pixel quadratic sum of a relevant sub block in the father block region; then, successively decoding each macroblock in the current frame; and utilizing a deblocking loop filter method.

The invention belongs to the field of three-dimensional (3D) video coding technologies and provides a novel multi-view video fractal coding, compressing and decompressing method. According to the method, mass data of a multi-view 3D video is efficiently compressed so as to be stored and transmitted; in a coding process, the time and space combined prediction is realized, and a video compressing method in which quick disparity estimation and center-biased pentagonal motion estimation / prediction are combined with fractal coding is provided, so that the data redundancy is effectively reduced; a five-view video is taken as an example, K, L, C, R and S sequentially represent a video view point respectively, a prediction structure of C to L to K and C to R to S is provided, namely that both the view point R and the view point L are predicted by using the view point C and the view point S and the view point K are respectively predicted by using the view point R and the view point L, and start frames of the five view points are all frames I; and view point decoding sequences are same, and the blocking effect is removed by adopting a loop filter. The method has the advantages that under the conditions that better video decoding quality is obtained, the coding rate and compression ratio are greatly increased, the operational complexity is reduced, and a foundation for real-time application of multi-view video coding is laid.

The invention discloses an overhead contact system rod insulator fault detection method based on Harris corners and image difference. The method includes the following steps: the Harris corners of a selected template image and an image to be detected are first respectively detected; the sequential similarity detection algorithm is then utilized to match the corners in the template image and the image to be detected; the matched corners are then fuzzily clustered, and because matching can cause the loss of useful corners, the corners need to be recovered; afterwards, the least square method is utilized to fit a straight line; finally, according to the symmetry of the images on two sides of the straight line, the image is differentiated, the vertical grey level is calculated, a fault information curve is obtained, and a fault diagnosis is presented. The method realizes the rotation resistance of template matching, moreover, the fault diagnosis is simple, and the method provides a new idea for the development of intelligentized patrol inspection systems for overhead contact systems, and can purposefully enhance the safe reliability of overhead contact systems of electrified railways.

The invention proposes a quick mosaic method for aviation images with high tilt rate and low overlapping rate. By utilizing the method, the robustness of registration of the images with high tilt rate and low overlapping rate can be improved, the mosaic error can be reduced, and the synthesis efficiency of a wide image can be enhanced. The method is implemented by the following technical scheme of firstly, calculating a position distribution relationship of the images by utilizing imaging assistance data of the aviation images, establishing an image position relationship matrix, and calculating a reference image; secondly, calculating overlapped regions between adjacent images on adjacent paths through an adjacent image path between a shortest path search image and the reference image, and extracting significant feature points of the overlapped regions; thirdly, normalizing the feature points or the regions into a vertex, constructing a multi-scale image by utilizing different adjacent distance point sets, and performing matching by applying image matching to calculate a spatial transformation matrix; and finally, calculating corresponding coordinates of synthesized image pixels in a source image by using the spatial transformation matrix, and calculating the pixel values of the synthesized image by using bilinear interpolation, thereby obtaining a final mosaic image.

The invention provides a fractal-based binocular stereoscopic video compression and decompression method. In binocular stereoscopic video coding, a left channel is taken as a basic layer, a single motion compensation predictive mode (MCP) is adopted for coding, and the method comprises the following steps of: performing block DCT transformation coding on a left-eye start frame, performing motion estimation / compensation coding on a left-eye non-I frame, and calculating the pixel sum and the sum of squares of pixels of subblock domain and father block domain-related subblocks; searching the most similar matching block by using a full search method in a previous frame, namely a reference frame searching window of left-eye video; and finally compressing the coefficient of an iterated function system by using a Huffman coding method. A right channel is taken as an enhancement layer, the MCP and a parallax compensation predictive mode (DCP) are adopted for coding, and the lowest error is selected as a predicted result. During the DCP coding mode, the polalization and directionality in a stereoscopic parallel shooting structure are fully utilized; and the corresponding decompression process comprises the following steps of: for the left eye, decoding the start frame I by adopting a reverse DCT transformation mode, and performing Huffman decoding on the non-I frame so as to acquire the coefficient of the iterated function system; performing macrolbock-based decoding, calculating the pixel sum and the sum of squares of pixels of father block domain-related subblocks in the previous frame; and for a right eye, calculating the pixel sum and the sum of squares of pixels of the father block domain-related subblocks in the right-eye previous frame and a left-eye corresponding frame.

The invention relates to a single-action type variable length connecting rod and a crank-connecting rod transmission mechanism, the single-action type variable length connecting rod comprises an inner connecting rod and an outer connecting rod, which are nested together and in sliding fit and connection, and the single-action type variable length connecting rod is characterized in that a guide groove is formed on the outer connecting rod and a cushion block which is in sliding fit with the guide groove is arranged in the guide groove; connecting plates for articulating the inner connecting rod and the cushion block together are respectively arranged on the two sides of the inner connecting rod and the cushion block; a guide cylinder is mounted on the outer connecting rod, a guide plate ofthe guide cylinder is fixed on the outer connecting rod through a screw, a guide hole arranged on the wall of the guide cylinder is in sliding fit with a guide short shaft on the guide plate, and a piston rod of the guide cylinder is fixed with the cushion block; a short stroke cylinder is mounted below the guide cylinder which is positioned on the outer connecting rod, and the connecting plates are used for connecting a cylinder body of the guide cylinder with the piston rod of the short stroke cylinder so as to enable the regulation of the length of the connecting rod to be more convenient and faster and enable the electric control to be easier; and the length of the variable length connecting rod can be adjusted in three positions, namely the initial position, the middle position and the hitting position, so that the variable connecting rod in the structure can be applied more widely.

The invention provides a video compression and decompression method based on fractal and H.264. Intra prediction of coding based on the H.264 is adopted for an I frame to obtain a prediction frame. A block motion estimation or complementary coding which are based on fractal is used for obtaining a prediction frame of a P frame. Difference between each initial frame and each corresponding prediction frame is a residual frame. After the residual frames are transformed through discrete cosine transformation (DCT) and are quantified, on one hand, the residual frames are written in a code rate, on the other hand, the residual frames are inversely quantified and reversely transformed though the DCT and then plus the prediction frames to get rebuilt frames (as reference frames). Fractal parameter is generated when the P frame is encoded in a predictive mode, the residual frames of the I frame and the P frame are compressed by the utilization entropy encoding CALCV, and the fractal parameter is compressed by utilization of an exponential-Golomb code with symbols, and a corresponding decompression process is that a prediction frame is obtained from an intra prediction of the I frame, and a prediction frame is obtained by a prediction of a frame in front of the P frame. Residual information in the code rate is reversely quantified and reversely transformed through the DCT to respectively obtain the residual frames of the I frame and the P frame.

The invention discloses a fast character string matching method based on a filtering type. According to the method, a pattern string is preprocessed: the prefix P0 of the pattern string is cut into (k+s) pattern string blocks with the length being h, the length of each pattern string block is lengthened by (k+q-1), and the lengthened pattern string blocks are respectively recorded as Q1, Q2 to Q(k+s); and then, from the initial position of a text string, q characters of the text string are sequentially read every h length and are used as text string indexes, and the text string indexes are respectively marked as d1, d2 to dn / h; a matching number group B[d, j] is recreated: if one text string index di belongs to Qj, the matching number group B[di, j] is equal to 1; and the matching number of (k+s) continuous text string indexes and the pattern string blocks is calculated, and finally, the approximate matching is detected. The method has the advantages that a dynamic programming algorithm and a filter algorithm are combined, in addition, new filter strategies are added, the average time of the approximate matching is shortened, and the matching performance is greatly improved.

The embodiment of the invention provides a method and an apparatus for content matching. The method comprises: based on at least one set hash algorithm, performing a hash operation to at least one target string to respectively obtain hash results for each target; forming a hash table item of the target string according to each target hash result, and combinging the hash table item of the target string to be a hash table; according to the at least one hash algorithm, performing a hash operation to to-be-tested strings to obtain to-be-tested hash results; according to of the to-be-tested hash results of the to to-be-tested strings, matching the each of the hash items in the hash table, to obtain matching results. According to the invention, the system resources occupied by the matching can be simplified; the string extraction process and the string hash matching process is in parallel execution, so matching speed is improved; and when target strings are increased or decreased, recompilation of the hash matching table is not needed, easy for upgrade and maintenance.

The invention relates to an image splicing method, image splicing equipment and a readable storage medium. The image splicing method comprises the steps: obtaining foreground images in a plurality ofimages to be spliced, wherein the plurality of images to be spliced comprise at least two adjacent images to be spliced; performing intersection taking processing on the foreground images in the two adjacent to-be-spliced images to obtain first overlapping areas corresponding to the foreground images of the two adjacent to-be-spliced images; carrying out feature point matching processing on the first overlapped area to obtain a first target relative displacement between the two adjacent images to be spliced; and splicing the two adjacent to-be-spliced images by using the first target relativedisplacement. By adopting the image splicing method, the image splicing efficiency can be improved.

The invention discloses an image corner point matching method based on a self-adaptive threshold and RANSAC. The image corner matching method comprises the following steps: firstly, pre-screening corner points by adopting a way of suppressing a non-maximum value by means of self-adaptation; secondly, performing secondary screening on the corner points by adopting an Forstner operator; then, performing coarse matching on detected Harris corner points by adopting a normalized cross-correlation matching algorithm; and finally, accurately matching images by using a random sampling unification algorithm. An experimental result proves that by adopting the improved method, the time required for detecting the corner points and matching the images is shortened, and the matching accuracy of the images can be effectively improved. The image corner point matching method based on the self-adaptive threshold and the RANSAC has the advantages of high processing efficiency and high matching accuracy.

The invention discloses a rapid fuzzy matching method for testing bad conditions of high-speed rail catenary rod type insulators. The method comprises the following steps: performing corresponding deformation treatment for a selected template image, and layering an image and a template by a pyramid neighbor average algorithm; performing normalized cross-correlation calculation for the layered image and the template, and extracting a peak point to achieve rapid fuzzy matching; then extracting a matched target area, and detecting a transverse grey singular value of the target area; and finally, judging bad conditions of the rod type insulators accurately. According to the method, the calculation amount of the normalized cross-correlation is effectively reduced, the image matching speed is accelerated, the fault diagnosis difficulty is simplified, the fault detection accuracy is improved, and safe operation problems of the high-speed rail catenary can be specifically solved.

The invention provides a multi-view stereoscopic video compression and decompression method based on fractal and H.264. A middle view is used as a base layer and encoded on the principle of a motion compensated prediction (MCP) method in a compression mode, and other views are encoded on the principle of MCP + digitally controlled potentiometers (DCP) in a compression mode. Three views are taken for example, intra prediction coding of the H.264 is adopted by an I frame of the middle view, a rebuilt frame (as a reference frame) is obtained after filtration, a P frame of the middle view is encoded with block MCP by the utilization of the encoded rebuilt frame as the reference frame, the most matched fractal parameter of the block of each time is recorded, the fractal parameters are respectively substituted in a compression iterative function system to achieve a prediction frame of the P frame, and the rebuilt frame is obtained after filtration. The MCP + DCP is adopted for coding by a left view and a right view and a reference frame can be an encoded front frame of the respective view or an encoded frame of other views. Entropy encoding CALCV is used for compressing a residual frame of each frame and an exponential-Golomb code with symbols is used for compressing the fractal parameter.