Method for interrupting construction of scanning order perception pyramid and memory closed loop release and application thereof

Abstract

The application provides a scanning sequence sensing pyramid interruptable construction and memory closed loop release method and application thereof, and belongs to the technical field of fluorescent digital slice processing. In view of the problems of high memory peak value and long intermediate data residence time in fluorescent scanning, the scheme points include: using the scanning sequence to calculate the expected sub-tile number in advance and determining the submit level boundary index of each sequence unit; in the running time, the interruptable layering is completed by combining the boundary index and the parent tile filling completion degree, that is, when the parent tile is not completed, the interrupt propagation is interrupted and the result is temporarily stored; when the parent tile is completed, the compression is triggered in real time and the lower layer cache is released; and the windowed output and resource recovery are executed according to the historical dependence truncation condition of the write-back window. The application is mainly used for fluorescent slice scanning, can realize the memory closed loop release and the continuous convergence of the occupancy, and ensures the correct and stable hierarchical output.

Description

Technical Field

[0001] This invention relates to the field of digital pathological slide and microscopic image processing technology, and in particular to a method for interruptible construction of a scan sequence-aware pyramid and closed-loop release of memory, and its application. Background Technology

[0002] In fluorescence digital slide scanning, a slide typically needs to be acquired point-by-point along a predetermined trajectory, generating images with multiple channels and focal planes at each scanning location. To meet the requirements of subsequent browsing, diagnosis, and standardized storage, the acquired results need to be further organized into a multi-pyramid-level tile structure. Currently, there are two main approaches to constructing such pyramids:

[0003] The first type is the traditional full-scale pyramid construction method. This method directly downsamples the current image layer by layer to the top of the pyramid after each scanning position is reached, and retains the intermediate images of each layer, the parent tile cache, and the compressed data to be written for a relatively long time. The data is then written to the disk in a concentrated manner after the entire row or the entire area is scanned.

[0004] The second type is the simple streaming downsampling method, which attempts to downsample and write as the scan progresses. However, when dealing with multi-level dependencies, due to the lack of explicit scan order prior utilization and parent tile dependency prediction, the system has difficulty accurately determining whether a certain upper-level parent tile has the final output conditions.

[0005] Therefore, there is an urgent need for an interruptible construction method for scanning sequence sensing pyramids and memory closed-loop release method for multi-channel multi-focal plane fluorescence digital slices, and its application, to solve the problems existing in the current technology. Summary of the Invention

[0006] This invention provides a method for interruptible construction of scanning sequence-aware pyramids and closed-loop release of memory, and its application. It addresses the problems in existing technologies during multi-channel, multi-focal plane fluorescence digital slicing scanning, such as the inability to effectively predict cross-level parent tile dependencies and completion timing, leading to the premature generation of a large number of invalid high-level tiles and excessively long intermediate data lifecycles, resulting in excessively high peak memory usage.

[0007] The core technology of this invention is to extract the expected number of child tiles and the boundary index of the committable level by prior calculation of the scanning order, and then implement interruptible layer promotion in the running state with the completion degree of the parent tile filling as the only state determination variable. Compression and immediate release are triggered only when the parent tile reaches the completion condition, and a windowed write-back strategy based on historical dependency truncation conditions is used to achieve a complete closed-loop cleanup of the memory pool.

[0008] In a first aspect, the present invention provides a method for interruptible construction and closed-loop release of a scan-sequence-aware pyramid, the method comprising the following steps:

[0009] Obtain the scanning order prior and, based on the scanning order prior and the skip scan mask information, pre-calculate the expected number of child tiles for each level of parent tile;

[0010] Forward simulation is performed on the scan sequence to determine the committable level boundary index of each scan sequence unit based on the expected number of sub-tiles, which serves as the boundary constraint for cross-level dependency propagation.

[0011] After the scan sequence unit arrives, the filling completion degree of the parent tile is used as the determination variable for hierarchical propagation. The hierarchical propagation logic is executed in combination with the submittable hierarchical boundary index: if the filling completion degree of the parent tile of the current layer has not reached the completion condition, the propagation to the next layer is interrupted in the current layer and the result of the current layer is temporarily stored.

[0012] If the current parent tile reaches the completion condition, compress the current parent tile immediately and release the lower source graph cache that has no further dependencies in a timely manner.

[0013] Based on the historical dependency truncation condition, windowed write-back is performed on data that has been completed and has no subsequent dependencies, and the historical cache is truncated and released after the write-back.

[0014] Furthermore, determining the committable hierarchical boundary index for each scan sequence unit includes:

[0015] Simulated filling is performed based on spatial location as the basic unit according to the scanning order, and the forward filling count of each parent tile is counted.

[0016] After determining whether the current scan sequence unit is mapped to the parent tile of each level, the incremented forward padding count is less than the expected number of child tiles;

[0017] The level that first satisfies the less than condition is determined as the committable level boundary index of the corresponding scan sequence unit.

[0018] Furthermore, the method also includes:

[0019] Set up critical levels in the pyramid and divide the pyramid levels into direct cutting areas and dependent convergence areas;

[0020] Within the direct cutting area, tiles of each level are generated by directly cropping and scaling the current scanned image.

[0021] Within the dependency convergence area, the current image or the completed lower layer tile is used as a child tile to fill the temporary cache of the corresponding parent tile, and the filling completion rate is updated based on the filling count of the parent tile after filling.

[0022] Furthermore, for sparse parent tiles with an expected number of child tiles less than a preset threshold, when creating the corresponding source map temporary cache for the first time, background pre-filling is performed first, and then the arrived valid child tiles are written to the corresponding quadrant positions.

[0023] Furthermore, performing a windowed write-back includes:

[0024] The window is continuously truncated and written back according to the scan sequence, and a dependency check is performed on the end of the window when the preset closing event arrives.

[0025] If there is data at the end of the window that affects subsequent write-backs, the window is trimmed, and only the prefix sequence that meets the historical dependency truncation condition is handed over to the write-back process.

[0026] After performing windowed write-back, the historical image cache, the preceding scan image cache, and the written compressed result cache corresponding to the prefix sequence are released synchronously.

[0027] Furthermore, the method also includes:

[0028] If the fill count of the target parent tile is still less than the expected number of child tiles when the closure event occurs, it will be marked as an incomplete exception and the commit and write-back at the corresponding position will be suspended.

[0029] If the actual arrival order is inconsistent with the prior scan order, the corresponding spatial location will be marked as an order mismatch anomaly, and the original committable level boundary index will be discontinued.

[0030] Furthermore, the method also includes:

[0031] In scenarios where multiple channels and multiple focal planes coexist, the channel order, focal plane order, and tower top thumbnail generation requirements are incorporated into a unified control chain;

[0032] For a specified focal plane and channel that participates in thumbnail generation, the source image data is temporarily retained at the top level of the tower until the thumbnail is generated after the scan is completed. For a focal plane or channel that does not participate in thumbnail generation, the source image data is released immediately after the compression of its top parent tile is completed.

[0033] Secondly, the present invention provides a scan-sequence-aware pyramid interruptible construction and memory closed-loop release device, comprising:

[0034] The dependency prediction module is used to obtain the prior scan order and pre-calculate the expected number of child tiles for each level of parent tile;

[0035] The boundary constraint module is used to perform forward simulation and determine the committable hierarchical boundary index for each scan sequence unit;

[0036] The state-driven build module is used to perform hierarchical propagation, interrupt build, and temporary storage based on the committable hierarchical boundary index and the parent tile fill completion.

[0037] The instant release module is used to trigger compression and release of the lower-level cache when the parent tile meets the completion conditions;

[0038] The closed-loop write-back module is used to perform windowed write-back and historical data truncation based on historical dependency truncation conditions.

[0039] Thirdly, the present invention provides an electronic device including a memory and a processor, wherein the memory stores a computer program and the processor is configured to run the computer program to execute the above-described method for interruptible construction of a scan sequence-aware pyramid and memory closed-loop release.

[0040] Fourthly, the present invention provides a readable storage medium storing a computer program, the computer program including program code for controlling a process to execute the process, the process including the interruptible construction of a pyramid based on the above-described scan sequence and the memory closed-loop release method.

[0041] The main contributions and innovations of this invention are as follows:

[0042] 1. By utilizing scan order priors and pre-computing the submittable layer boundary index using skip scan masks, this invention can constrain the cross-layer propagation range of each arriving image from the source. The system does not need to blindly perform full layer upgrades for each image, which significantly reduces the invalid high-layer tile pre-construction process and lowers the initial computation and allocation load of the system.

[0043] 2. By using the completion degree of the parent tile as the control variable for hierarchical propagation, this invention constructs an interruptible hierarchical construction mechanism. The current image stops propagating to higher layers when it encounters the first incomplete parent tile, avoiding long-term disordered memory occupation caused by the premature generation of "higher-level data that does not yet meet the output conditions".

[0044] 3. By introducing a windowed write-back mechanism that combines immediate release and historical dependency truncation, this invention ensures that compression and release actions no longer lag behind the completion of a full row or full tile scan. Once the parent tile meets the completion conditions, compression is immediately triggered and lower-level source maps without subsequent dependencies are released. Furthermore, disk cleanup is only performed on safe data prefixes that are unlikely to be modified later, greatly shortening the residence time of intermediate data in multi-channel and multi-focal plane scenarios and achieving continuous convergence of peak memory usage.

[0045] 4. By introducing a threshold control for the expected number of child tiles and background pre-filling logic for sparse parent tiles, this invention can still accurately determine the completion status of tiles and maintain the continuity of the construction process when facing complex scanning scenarios with irregular tissue regions or skipped scan holes, thus ensuring the correctness and stability of the final pyramid-level output structure.

[0046] Details of one or more embodiments of the present invention are set forth in the following drawings and description, so that other features, objects and advantages of the invention will be more readily understood. Attached Figure Description

[0047] The accompanying drawings, which are included to provide a further understanding of the invention and form part of this invention, illustrate exemplary embodiments of the invention and are used to explain the invention, but do not constitute an undue limitation of the invention. In the drawings:

[0048] Figure 1 This is a flowchart of a scan-sequence-aware pyramid interruptible construction and memory closed-loop release method according to an embodiment of the present invention;

[0049] Figure 2 This is a schematic diagram of the hardware structure of an electronic device according to an embodiment of the present invention. Detailed Implementation

[0050] Exemplary embodiments will now be described in detail, examples of which are illustrated in the accompanying drawings. When the following description relates to the drawings, unless otherwise indicated, the same numerals in different drawings denote the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with one or more embodiments of this specification. Rather, they are merely examples of apparatuses and methods consistent with some aspects of one or more embodiments of this specification as detailed in the appended claims.

[0051] It should be noted that the steps of the corresponding methods are not necessarily performed in the order shown and described in this specification in other embodiments. In some other embodiments, the methods may include more or fewer steps than described in this specification. Furthermore, a single step described in this specification may be broken down into multiple steps in other embodiments; and multiple steps described in this specification may be combined into a single step in other embodiments.

[0052] Example 1

[0053] This embodiment provides a method for interruptible construction of a scan-sequence-aware pyramid and closed-loop memory release for multi-channel, multi-focal-plane fluorescence digital slices. To avoid confusion in terminology, several core definitions involved in this embodiment are as follows:

[0054] Definition D1: Scan sequence unit, referring to a single image and its associated information that arrives in the actual scanning order of the device, denoted as D1. Each It must carry at least two-dimensional scan coordinates, channel index, focal plane index, and their order of appearance in the entire scan sequence.

[0055] Definition D2: Scanning order prior, refers to the image arrival order constraint that the system can determine before scanning begins or maintain a stable order during scanning, denoted as O. In some implementations, O includes the serpentine scanning order, the left-right switching rule within a line, the channel switching order, and the focal plane switching order.

[0056] Define D3: the critical level of the pyramid, denoted as... This refers to a layer from which the upper-layer tiles are no longer directly cut from a single scanned image, but rather require the convergence of multiple lower-layer sub-tiles to form a layer boundary. Below this level... The layer can be directly cut and output from the current scanned image; not lower than The hierarchy requires parent-child tile dependency control.

[0057] Define D4: Expected number of sub-tiles, denoted as , refers to the first Each pyramid level, with row and column indexes as follows: Theoretically, a parent tile should be filled with a certain number of effective lower-layer child tiles. This value is pre-calculated based on the skip-scan mask, the distribution of effective lower-layer tiles, and the parent-child mapping relationship of the pyramid.

[0058] Define D5: Parent tile fill count, denoted as This refers to the number of pages that have actually been written during the current runtime. Each pyramid level of parent tile The number of effective sub-tiles in the array.

[0059] Define D6: Parent tile fill completion, denoted as Defined as .when When this occurs, it indicates that the parent tile still depends on future child tiles, and the current image is not allowed to propagate to higher layers; when When the parent tile is complete, it can be compressed and used as a child tile in the next layer to continue the construction process.

[0060] Define D7: The committable hierarchical boundary index, denoted as , refers to the scanned sequence unit Upon arrival, the current image encounters a layer boundary where the parent tile is not yet complete for the first time during cross-layer propagation. Preferably, for 0 to... The current image is considered a completed layer; for the 1st layer... For layers, the system only allows local filling and temporary storage; it does not count this layer as a completed submission layer of the current image, nor does it propagate the result of this layer to higher layers. Furthermore, for layers with the same spatial location... Each channel and each focal plane scanning sequence unit shares the same The calculation results are used to ensure that multi-channel, multi-focal plane data at the same spatial location maintains consistency in cross-level propagation range.

[0061] Define D8: Upper temporary storage tile, denoted as , referring to the Pyramid levels, locations ,aisle focal plane The corresponding parent tile source image cache. This cache is created only when child tiles are first needed and is released after subsequent compression or thumbnail generation.

[0062] Define D9: Write back to the window, denoted as This refers to a sequence of data that is continuously truncated from the scanned sequence, and whose last data segment satisfies the condition of "complete and without subsequent dependencies". Only when entering... Only scan sequence units are allowed to execute file write-back and release history cache.

[0063] Define D10: Historical dependency truncation condition, denoted as This means that a batch of compressed data has been written back, and subsequent scan sequences will no longer modify its corresponding parent tile, child tile, or intermediate source map. At this time, it is allowed to perform compression result release, source map release, and discard historical data on the left side of the window.

[0064] Based on the above definition, such as Figure 1 As shown, the method includes the following steps:

[0065] Step S1: Obtain the scan order prior O as defined in definition D2, and based on the scan order prior O and the skip scan mask information, pre-calculate the expected number of child tiles for each level of parent tile as defined in definition D4. .

[0066] Specifically, upon starting the scan, the system acquires fundamental parameters such as scan grid size, serpentine wrapping rules, channel switching order, focal plane switching order, skip scan mask, single tile pixel size, overall pixel matrix size, and the number of pyramid levels, and forms a priori O for the scan order. For any pyramid level... The row and column indexes are The parent tile, its expected number of child tiles The number of effective lower-layer child tiles that should theoretically fill the parent tile is obtained from the skip-scan mask and the distribution of effective lower-layer tiles. Preferably, it is calculated according to the following recursive rule:

[0067]

[0068] in, Indicates the first Whether the layer position (i,j) is a valid sub-tile. For critical layer scenes, V is directly obtained from the skip scan mask; for higher layers, V is recursively obtained from the N>0 relation of the lower layer.

[0069] Step S2: Perform forward simulation on the scan sequence, based on the expected number of sub-tiles. Determine each scan sequence unit as defined in D1 The corresponding committable hierarchical boundary index is as described in definition D7. , as a boundary constraint for cross-level dependency propagation.

[0070] Specifically, the system performs a priori checks on all scan sequence units according to the scan order. Perform a forward simulation. This forward simulation first performs simulated filling using spatial positions (x, y) as the basic unit, and counts the forward filling of each parent tile. , indicating as of When the corresponding spatial location is processed, the first Layered tiles The cumulative number of valid sub-tiles received. Determine the current scan sequence unit. After mapping to each level of parent tile, is the incremented forward fill count less than the expected number of child tiles? The level that first satisfies the less than condition is determined as the committable level boundary index of the corresponding scan sequence unit. ,Right now:

[0071]

[0072] If no level meets the above conditions, then let The total number of pyramid levels, H, is taken as the boundary index. This boundary index pre-constrains the propagation range of the current scanned image across levels. When the situation of "the current parent tile is not yet completed" is first encountered at a certain level, the inclusion of higher levels in the completed submission range of the current image is stopped.

[0073] Step S3: In the scan sequence unit as defined in D1 Upon arrival, the parent tile will be filled to completion as defined in D6. As a decision variable for hierarchical propagation, it is combined with the committable hierarchical boundary index as described in Definition D7. Execution hierarchy propagation logic.

[0074] In this embodiment, a pyramid critical level is set as defined in D3. The pyramid hierarchy is divided into direct cutting areas and dependent convergence areas.

[0075] Within the direct cutting zone (below) The tiles at each level are generated by directly cropping and scaling the current scanned image;

[0076] Within the dependency convergence zone (not less than) (The hierarchy), filling the corresponding parent tile's upper temporary tile as defined in definition D8 with the current image or the completed lower layer tile as a child tile. Cache, and based on the parent tile fill count as defined in definition D5 after filling. Update parent tile fill completion The completion rate is defined as:

[0077]

[0078] Submit hierarchical boundary index Completion of filling with parent tile Together they constitute the two control variables of this invention.

[0079] For any level to be processed ,when and At this time, the result of the current layer is included in the set of completed layers and continues to be used as the input for the next layer;

[0080] when and If the fill completion of the current layer's parent tile has not met the completion condition, the process will be interrupted at the current layer and the result of the current layer will be temporarily stored. Only local filling and temporary storage are allowed at this layer, and this layer will not be counted as a completed and submitted layer of the current image.

[0081] Additionally, as defined in D7, hierarchical boundary indexes can be submitted. For scanning sequence units of each channel and each focal plane at the same spatial location, the results are shared, ensuring the consistency of multi-channel and multi-focal plane data across the propagation range.

[0082] For sparse parent tiles within a dependent convergence region, if the expected number of child tiles of the target parent tile... Less than a preset threshold (e.g.) When creating the corresponding source image temporary cache for the first time, background pre-filling (such as black background, gray background, transparent placeholder, or device calibration background value) is performed first, and then the arrived valid sub-tiles are scaled and written to the corresponding quadrant positions. This ensures the stable construction of upper-layer tiles in irregularly organized areas or skip-scan areas. In addition, the system provides upper-layer temporary storage tiles. Establish a unified resource pool. The parent tile source image cache adopts a fixed-size image memory pool for unified leasing and return, so as to reduce memory fragmentation.

[0083] Step S4: If the current layer's parent tile has a high fill completion rate... If the completion condition is met, immediately compress the current parent tile and release the lower-level source graph cache that has no further dependencies.

[0084] like This indicates that the current parent tile has been completed, and the system immediately stores the upper-level temporary tiles as defined in D8. The data is compressed to JPEG format, and the parent tile is treated as a child tile of the next layer to continue participating in the construction of higher layers. After the parent tile is completed and the compression result is generated, the system immediately releases the lower layer source image or child tile source image that has no further dependencies, strictly pruning the lifecycle of the child tile until "the current parent tile is filled".

[0085] In scenarios with multiple channels and multiple focal planes, the channel order, focal plane order, and tower top thumbnail generation requirements are incorporated into a unified control chain. For designated focal planes and channels participating in thumbnail generation, the source image data is temporarily retained at the top level of the tower until the scanning is completed and the thumbnail is generated, at which point it is released. For focal planes or channels not participating in thumbnail generation, the source image data is released immediately after the compression of their top-level parent tile is completed.

[0086] Step S5: Based on the historical dependency truncation condition as defined in definition D10 For data that has been completed and has no further dependencies, perform a write-back window as defined in definition D9. The windowed write-back is performed, and the history cache is truncated and released after the write-back.

[0087] Define a write-back window consisting of consecutive scan sequences. and historical dependency cutoff conditions (This refers to a batch of compressed data that has been written back, and subsequent scan sequences will not modify its corresponding parent tile, child tile, or intermediate source image.) The write-back window is continuously captured according to the scan sequence. Furthermore, when a preset closure event occurs (such as the closure of the channel focal plane sequence at the same spatial location, the closure of the current scan line, the end of the preset waiting window, or the end of the entire scan), a dependency check is performed on the tail of the window. If there is data at the tail of the window that affects subsequent write-backs, the window is truncated, and only data that meets the historical dependency truncation conditions is included. The prefix sequence is handed over to the write-back process. After the windowed write-back is executed, the historical image cache, the preceding scan image cache, and the written compressed result cache corresponding to the prefix sequence are released synchronously, forming a closed-loop memory release.

[0088] For handling abnormal situations, if the fill count of the target parent tile is reached when a closure event occurs... Still less than the expected number of sub-tiles If the actual arrival order is inconsistent with the prior scan order O, or if the expected scan sequence unit is not found, then mark it as an incomplete parent tile exception and suspend the commit and write-back of the corresponding position and level, and add the corresponding position to the exception pending set; If the destination is not reached within the preset waiting window, the corresponding spatial location will be marked as a sequence mismatch anomaly, and the original committable level boundary index will be discontinued. Only retain those that have already been satisfied. The security prefix is ​​used to enter the write-back process.

[0089] For abnormal locations, the final submission for the affected location is paused, the abnormal location is transferred to the supplementary sampling or reconstruction queue, and the fill count for that location is recalculated after the corresponding scan data is supplemented. , completion rate and boundary index It also resumes at least one convergence action in subsequent hierarchical construction and write-back. If the abnormal location is not fully recovered after the entire scan is completed, the abnormal location remains in a blocked submission state and an abnormal record is output.

[0090] Example 2

[0091] This embodiment provides a device for interruptible construction of a scanning sequence-aware pyramid and closed-loop release of memory for multi-channel, multi-focal-plane fluorescence digital slices. It adopts the same technical concept as Embodiment 1, and the device includes:

[0092] The dependency prediction module is used to obtain the scan order prior O as defined in definition D2, and based on the scan order prior O and the skip scan mask information, to pre-calculate the expected number of child tiles for each level of parent tile as defined in definition D4. ;

[0093] The boundary constraint module is used to perform forward simulation on the scan sequence based on the expected number of sub-tiles. Determine each scan sequence unit as defined in D1 The corresponding committable hierarchical boundary index is as described in definition D7. , serving as a boundary constraint for cross-level dependency propagation;

[0094] State-driven building blocks are used to scan sequence units Upon arrival, the parent tile will be filled to completion as defined in D6. As a decision variable for hierarchical propagation, combined with the submittable hierarchical boundary index Execute hierarchical propagation logic: If the current layer's parent tile has a certain fill completion rate... If the completion condition is not met, the process of moving to the next layer is interrupted at the current layer, and the result at the current layer is temporarily stored.

[0095] The instant release module is used when the current layer's parent tile has reached the fill completion level. If the completion condition is met, immediately compress the current parent tile and release the lower-level source graph cache that has no further dependencies.

[0096] The closed-loop write-back module is used to implement historical dependency truncation conditions as defined in definition D10. For data that has been completed and has no further dependencies, perform a write-back window as defined in definition D9. The windowed write-back is performed, and the history cache is truncated and released after the write-back.

[0097] The above modules work together to realize a continuous control chain from prior prediction to closed-loop release.

[0098] Example 3

[0099] This embodiment also provides an electronic device, see reference. Figure 2 It includes a memory 404 and a processor 402, wherein the memory 404 stores a computer program and the processor 402 is configured to run the computer program to perform the steps in any of the above method embodiments.

[0100] Specifically, the processor 402 may include a central processing unit (CPU), an application-specific integrated circuit (ASIC), or one or more integrated circuits that can be configured to implement embodiments of the present invention.

[0101] Memory 404 may include a mass storage device for data or instructions. For example, and not limitingly, memory 404 may include a hard disk drive (HDD), a floppy disk drive, a solid-state drive (SSD), flash memory, an optical disk drive, a magneto-optical disk drive, magnetic tape, or a Universal Serial Bus (USB) drive, or a combination of two or more of these. Where appropriate, memory 404 may include removable or non-removable (or fixed) media. Where appropriate, memory 404 may be internal or external to a data processing device. In a particular embodiment, memory 404 is non-volatile memory. In a particular embodiment, memory 404 includes read-only memory (ROM) and random access memory (RAM). Where appropriate, the ROM may be a mask-programmed ROM, a programmable read-only memory (PROM), an erasable read-only memory (EPROM), an electrically erasable read-only memory (EEPROM), an electrically alterable read-only memory (EAROM), or flash memory, or a combination of two or more of these. Where appropriate, the RAM can be Static Random-Access Memory (SRAM) or Dynamic Random-Access Memory (DRAM). DRAM can be Fast Page Mode Dynamic Random-Access Memory (FPMDRAM), Extended Data Out Dynamic Random-Access Memory (EDODRAM), Synchronous Dynamic Random-Access Memory (SDRAM), etc.

[0102] The memory 404 can be used to store or cache various data files that need to be processed and / or communicated, as well as possible computer program instructions executed by the processor 402.

[0103] The processor 402 reads and executes computer program instructions stored in the memory 404 to implement any of the scan sequence-aware pyramid interruptible construction and memory closed-loop release methods in the above embodiments.

[0104] Optionally, the electronic device may further include a transmission device 406 and an input / output device 408, wherein the transmission device 406 is connected to the processor 402, and the input / output device 408 is connected to the processor 402.

[0105] The transmission device 406 can be used to receive or send data via a network. Specific examples of the network described above may include wired or wireless networks provided by the communication provider of the electronic device. In one example, the transmission device includes a Network Interface Controller (NIC), which can connect to other network devices via a base station to communicate with the Internet. In another example, the transmission device 406 may be a Radio Frequency (RF) module used for wireless communication with the Internet.

[0106] Input / output device 408 is used to input or output information.

[0107] Example 4

[0108] This embodiment also provides a readable storage medium storing a computer program, the computer program including program code for controlling a process to execute the process, the process including the interruptible construction and memory closed-loop release method of the perceptual pyramid according to the scan sequence of Embodiment 1.

[0109] It should be noted that the specific examples in this embodiment can refer to the examples described in the above embodiments and optional implementations, and will not be repeated here.

[0110] Generally, various embodiments can be implemented in hardware or dedicated circuitry, software, logic, or any combination thereof. Some aspects of the invention can be implemented in hardware, while others can be implemented by firmware or software executed by a controller, microprocessor, or other computing device, but the invention is not limited thereto. Although various aspects of the invention may be shown and described as block diagrams, flowcharts, or using some other graphical representation, it should be understood that, by way of non-limiting example, these blocks, apparatuses, systems, techniques, or methods described herein can be implemented in hardware, software, firmware, dedicated circuitry or logic, general-purpose hardware or controllers or other computing devices, or some combination thereof.

[0111] Embodiments of the present invention can be implemented by computer software, which may be executable by a data processor of a mobile device, such as a processor entity, or by hardware, or by a combination of software and hardware. Computer software or programs (also referred to as program products) including software routines, applets, and / or macros can be stored in any device-readable data storage medium, and they include program instructions for performing specific tasks. The computer program product may include one or more computer-executable components configured to perform the embodiments when the program is run. The one or more computer-executable components may be at least one piece of software code or a portion thereof. Additionally, it should be noted in this respect that, as Figure 1 Any box in the logical flow can represent a program step, or interconnected logic circuits, boxes and functions, or a combination of program steps and logic circuits, boxes and functions. Software can be stored on physical media such as memory chips or blocks of storage implemented within a processor, magnetic media such as hard disks or floppy disks, and optical media such as DVDs and their data variants, CDs, etc. The physical medium is a non-transient medium.

[0112] Those skilled in the art should understand that the technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments have been described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0113] The above embodiments are merely illustrative of several implementations of the present invention, and their descriptions are relatively specific and detailed, but they should not be construed as limiting the scope of the present invention. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of the present invention, and these all fall within the protection scope of the present invention. Therefore, the protection scope of the present invention should be determined by the appended claims.

Claims

1. A method for interruptible construction and closed-loop release of a scan-sequence-aware pyramid, characterized in that, Includes the following steps: Obtain the scanning order prior and, based on the scanning order prior and the skip scan mask information, pre-calculate the expected number of child tiles for each level of parent tile; Forward simulation is performed on the scan sequence. Simulation filling is performed using spatial location as the basic unit according to the prior scan order. The forward filling count of each parent tile is counted. It is determined whether the auto-incremented forward filling count after the current scan sequence unit is mapped to each level parent tile is less than the expected number of child tiles. The level that first satisfies the condition of being less than is determined as the submittable level boundary index of the corresponding scan sequence unit, which serves as the boundary constraint for cross-level dependency propagation. After the scan sequence unit arrives, the filling completion degree of the parent tile is used as the determination variable for hierarchical propagation. The hierarchical propagation logic is executed in conjunction with the submittable hierarchical boundary index: if the filling completion degree of the parent tile in the current layer has not reached the completion condition, the upward layer is interrupted in the current layer and the result of the current layer is temporarily stored. If the current parent tile reaches the completion condition, compress the current parent tile immediately and release the lower source graph cache that has no further dependencies in a timely manner. Based on the historical dependency truncation condition, windowed write-back is performed on data that has been completed and has no subsequent dependencies, and the historical cache is truncated and released after the write-back.

2. The interruptible construction and memory closed-loop release method for scanning sequence-aware pyramids as described in claim 1, characterized in that, The method further includes: Set up critical levels in the pyramid and divide the pyramid levels into direct cutting areas and dependent convergence areas; Within the direct cutting area, tiles of each level are generated by directly cropping and scaling the current scanned image; Within the dependency convergence area, the current image or the completed lower-layer tile is used as a child tile to fill the temporary cache of the corresponding parent tile, and the filling completion rate is updated based on the filling count of the parent tile after filling.

3. The interruptible construction and memory closed-loop release method for scanning sequence-aware pyramids as described in claim 2, characterized in that, For sparse parent tiles with an expected number of child tiles less than a preset threshold, when creating the corresponding source map temporary cache for the first time, background pre-filling is performed first, and then the arrived valid child tiles are written to the corresponding quadrant positions.

4. The interruptible construction and memory closed-loop release method for scanning sequence-aware pyramids as described in claim 1, characterized in that, Performing a windowed write-back includes: The window is continuously truncated and written back according to the scan sequence, and a dependency check is performed on the end of the window when the preset closing event arrives. If there is data at the end of the window that affects subsequent write-backs, the window is trimmed, and only the prefix sequence that meets the historical dependency truncation condition is handed over to the write-back process. After performing windowed write-back, the historical image cache, the preceding scan image cache, and the written compression result cache corresponding to the prefix sequence are released synchronously.

5. The interruptible construction and memory closed-loop release method for scanning sequence-aware pyramids as described in claim 4, characterized in that, The method further includes: If the fill count of the target parent tile is still less than the expected number of child tiles when the closing event occurs, it is marked as an incomplete exception and the submission and write-back at the corresponding position are suspended. If the actual arrival order is inconsistent with the prior scan order, the corresponding spatial location will be marked as an order mismatch anomaly, and the original committable level boundary index will be discontinued.

6. The interruptible construction and memory closed-loop release method for scanning sequence-aware pyramids as described in claim 1, characterized in that, The method further includes: In scenarios where multiple channels and multiple focal planes coexist, the channel order, focal plane order, and tower top thumbnail generation requirements are incorporated into a unified control chain; For a specified focal plane and channel that participates in thumbnail generation, the source image data is temporarily retained at the top level of the tower until the thumbnail is generated after the scan is completed. For a focal plane or channel that does not participate in thumbnail generation, the source image data is released immediately after the compression of its top parent tile is completed.

7. An apparatus for implementing the interruptible construction and memory closed-loop release method for scanning sequence-aware pyramids as described in any one of claims 1 to 6, characterized in that, include: The dependency prediction module is used to obtain the prior scan order and pre-calculate the expected number of child tiles for each level of parent tile; The boundary constraint module is used to perform forward simulation and simulate filling according to the prior spatial position as the basic unit in the scanning order, and count the forward filling count of each parent tile; determine whether the auto-incremented forward filling count after the current scanning sequence unit is mapped to each level parent tile is less than the expected number of child tiles; and determine the level that first meets the condition of being less than as the submittable level boundary index of the corresponding scanning sequence unit. The state-driven construction module is used to perform hierarchical propagation, interrupt construction, and temporary storage based on the committable hierarchical boundary index and the parent tile fill completion degree. The instant release module is used to trigger compression and release of the lower-level cache when the parent tile meets the completion conditions; The closed-loop write-back module is used to perform windowed write-back and historical data truncation based on historical dependency truncation conditions.

8. An electronic device comprising a memory and a processor, characterized in that, The memory stores a computer program, and the processor is configured to run the computer program to perform the scan sequence-aware pyramid interruptible construction and memory closed-loop release method according to any one of claims 1 to 6.

9. A readable storage medium, characterized in that, The readable storage medium stores a computer program, the computer program including program code for controlling a process to execute the process, the process including the scan sequence-aware pyramid interruptible construction and memory closed-loop release method according to any one of claims 1 to 6.

Images