Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

2results about How to "Reduce positioning delay" patented technology

A method for distinguishing and labeling multiple foreground objects in image data streams

PendingCN122090243AMeet real-time positioning needsReduce positioning delayImage analysisCharacter and pattern recognitionData streamLight spot
This invention discloses a method for distinguishing and marking multiple foreground objects in image data streams. The steps include: 1) connecting a camera to an FPGA, whereby the camera transmits the acquired fiber optic unit array image to the FPGA line-by-line in real-time in a streaming manner; 2) the FPGA detects the received image pixels, identifies and marks the light spot pixels; 3) the FPGA calculates the optical centroid coordinates of the corresponding light spot pixels based on the marked light spot pixels. This invention can process the image data stream in real-time at the image acquisition end, distinguishing and marking each fiber optic light spot pixel. This allows for real-time calculation of the light spot centroid at the image acquisition end while maintaining accuracy, thereby greatly reducing data transmission volume and enabling the host computer to obtain the optical centroid coordinates of the fiber optic unit in real-time. This provides an accurate and real-time labeled image data stream for subsequent optical centroid calculation, thus improving overall positioning efficiency.
Owner:UNIV OF SCI & TECH OF CHINA

An optimization method and system for timing chart subgraph matching

PendingCN122346567ABranch jumps are accurateReduce the effective solution spaceAlgorithmGraph match
The present application relates to a kind of optimization method and system of timing diagram subgraph matching.The method includes: time block is carried out to original timing diagram, and the edge with same end point is aggregated and compressed in each time block to generate intra-block multi-edge object, to build block index in turn;Query graph with time constraint is received, with the edge in query graph as matching unit to execute search, and maintain current legal time window;In candidate generation stage, according to current to be matched data vertex pair and current legal time window, construct cache key, and carry out exploration in hotspot cache;If hotspot cache is not hit, then use current legal time window to locate target time block, and execute intersection operation in target time block to generate candidate multi-edge list;When current to be matched data vertex pair meets preset hotspot condition, the candidate multi-edge list is written into hotspot cache;Continue to execute search based on the candidate multi-edge list of hit or generated candidate multi-edge list, until outputting model matching result.
Owner:HUAZHONG UNIV OF SCI & TECH