CN117014590A - Image processing method, device, terminal and storage medium - Google Patents

Abstract

The disclosure provides an image processing method and device, a terminal and a storage medium. The image processing method comprises the following steps: acquiring a time range required by a processor to process image frames in a plurality of application scenes; and determining a filling time reserved for the current image frame on screen based on the time range of the corresponding application scene in the plurality of application scenes and the first time of the processor for processing the last image frame, wherein the sum of the first time and the filling time is larger than the maximum value of the time range. The historical data of the time range required by the processor for processing the image frames in a plurality of application scenes is acquired to determine the filling time reserved for the current image frame on-screen, so that the aim of shortening MTP delay can be fulfilled while the frame dropping condition is avoided, the prediction precision can be improved, the dizziness of a user is reduced, and the user experience is improved.

Description

Image processing method, device, terminal and storage medium

Technical Field

The disclosure relates to the field of information technology, and in particular, to an image processing method and device, a terminal and a storage medium.

Background

In Virtual Reality (VR) applications, motion-to-photon delay (MTP delay) is an important indicator. The motion-to-photon delay is the time that the motion of a user needs to be adequately reflected on the display screen. Virtual reality requires support from many components in modern cell phones. The VR application (and other programs in the background) is run from the sensor for recording head movements, the Central Processing Unit (CPU), then the Graphics Processor (GPU) begins to work and compute a corrected image created as VR images, which are finally presented on the screen. All of these components need to cooperate closely to create what is known as an immersive experience. The time required to implement these functions is generally referred to as the motion-to-photon delay (motion to photon latency), the time taken from the start of user motion to the display of the corresponding picture onto the screen.

The shorter the MTP delay is, the more accurate the predicted pose is when the screen is lightened, the more accurate the content seen by the user is, and the dizziness of the user can be reduced. In addition, the image frames need to be displayed as far as possible to avoid the situation that the image frames are missed or missing (i.e. dropped).

Disclosure of Invention

In order to solve the existing problems, the present disclosure provides an image processing method and apparatus, a terminal, and a storage medium.

The present disclosure adopts the following technical solutions.

An embodiment of the present disclosure provides an image processing method including: acquiring a time range required by a processor to process image frames in a plurality of application scenes; determining a filling time reserved for the current image frame on screen based on the time range of the corresponding application scene in the plurality of application scenes and a first time of the processor for processing the last image frame, wherein the sum of the first time and the filling time is larger than the maximum value of the time range.

Another embodiment of the present disclosure provides an image processing apparatus including: an acquisition module configured to acquire a time range required for the processor to process the image frames in the plurality of application scenes; and the determining module is configured to determine a filling time reserved for the current image frame on screen based on the time range of the corresponding application scene in the plurality of application scenes and the first time of the processor for processing the last image frame, wherein the sum of the first time and the filling time is larger than the maximum value of the time range.

In some embodiments, the present disclosure provides a terminal comprising: at least one memory and at least one processor; the memory is used for storing program codes, and the processor is used for calling the program codes stored in the memory to execute the image processing method.

In some embodiments, the present disclosure provides a storage medium for storing program code for performing the above-described image processing method.

According to the method and the device, the historical data of the time range required by the processor for processing the image frames in the application scenes are acquired to determine the filling time reserved for the current image frames on the screen, the MTP delay can be shortened while the frame dropping condition is avoided, so that the prediction precision can be improved, the dizziness of a user is reduced, and the user experience is improved.

Drawings

The above and other features, advantages, and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. The same or similar reference numbers will be used throughout the drawings to refer to the same or like elements. It should be understood that the figures are schematic and that elements and components are not necessarily drawn to scale.

Fig. 1 is a schematic diagram of the processing flow and time spent on the image frame screen.

Fig. 2 is a flowchart of an image processing method of an embodiment of the present disclosure.

Fig. 3 is a partial block diagram of an image processing apparatus according to another embodiment of the present disclosure.

Fig. 4 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure.

Detailed Description

Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure have been shown in the accompanying drawings, it is to be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein, but are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are for illustration purposes only and are not intended to limit the scope of the present disclosure.

It should be understood that the various steps recited in the method embodiments of the present disclosure may be performed in and/or in parallel. Furthermore, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present disclosure is not limited in this respect.

The term "including" and variations thereof as used herein are intended to be open-ended, i.e., including, but not limited to. The term "based on" is based at least in part on. The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments. Related definitions of other terms will be given in the description below.

It should be noted that the terms "first," "second," and the like in this disclosure are merely used to distinguish between different devices, modules, or units and are not used to define an order or interdependence of functions performed by the devices, modules, or units.

It should be noted that references to "a" and "an" in this disclosure are intended to be illustrative rather than limiting, and those of ordinary skill in the art will appreciate that "one or more" is intended to be construed as "one or more" unless the context clearly indicates otherwise.

The names of messages or information interacted between the various devices in the embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.

In the VR display process, in order to shorten the display delay as much as possible, it is predicted how long after the execution of the previous image frame is completed, the next image frame is displayed on the display screen, and then the display time point of the next image frame is obtained by estimating the predicted lighting screen time forward according to the data of the historical image frame.

As shown in fig. 1, the on-screen display of each image frame can be simply divided into 5 stages: the first stage: wake time (woke_time) to commit (submit); and a second stage: runtime (runtime) between commit (submit) to transfer (delivery); and a third stage: a sleep (sleep) period of time to transmit (release) to the fetch; fourth and fifth stages: and a time period from fetch to light up (lighting). The lighting is followed by a vertical synchronization (vsync) time. The 5 critical phases in fig. 1, shortening the delay of each critical phase, can shorten the MTP delay.

For the third stage described above, it is referred to as the fill time stage. Typically, a fixed interval range is reserved, for example 0.35 to 0.4 frame times, for example 13.8 ms when the screen refresh rate is 72Hz, then the fixed interval range is 4.83 to 5.52 ms. Within this interval, the filling time of the current image frame, i.e. the time of the third stage (transmission) to fetch, is calculated from the actual rendering interval of the previous image frame. The benefit of reserving this fill time is: the method can cope with some emergency conditions, such as sudden and complex scenes, and increased time consumption of application, so long as the increased time consumption is within the interval of filling time, the image frame can still be normally displayed, and the condition of image frame missing (namely frame dropping) is avoided.

However, for many applications with small loads, the time consumption in the application is basically fixed, so that a fixed filling time is reserved, the MTP delay is usually unnecessarily increased, and if the filling time can be shortened, the purpose of shortening the MTP delay can be achieved.

Fig. 2 provides a flowchart of an image processing method of an embodiment of the present disclosure. The image processing method of the present disclosure may include step S101 of acquiring a time range required for the processor to process the image frames in a plurality of application scenes. In some embodiments, step S101 is to acquire historical data of a time range required for the processor of each application scene to process the image frames, that is, to count time-consuming data of one image frame of the processor image of each application in each application scene. In some embodiments, the time it takes for the processor to process each image frame may be stored, and as such, such time data may provide a reference for the determination of fill time in later image processing.

In some embodiments, the method of the present disclosure may further include step S102 of determining a fill time reserved for the current image frame on screen based on a time range of a corresponding application scene of the plurality of application scenes and a first time at which the processor processes the last image frame. In some embodiments, the time consumed by the processor to process the image frames is typically different in different application scenarios. For example, application a consumes a time ranging from 1-3 milliseconds for a processor in a scenario where only application a participates in drawing an image frame itself; in the scene of the image frames of the superposition drawing of the application A and the application B, the time consumption range of the processor is 2-5 milliseconds; in the scenario where application a, application B, and application C superimpose the image frames, the processor time-consuming range is 4-8 milliseconds, and so on. Thus, in some embodiments, in a particular respective application scenario, the fill time reserved for the current image frame on screen is determined based on the time range of processing the image frame by the processor of the previously acquired respective application scenario and the first time the last image frame was processed by the processor. Generally, the previous image frame and the current image frame are used as adjacent image frames, and have a larger reference meaning.

In some embodiments, the sum of the first time and the fill time is greater than a maximum of the time range. In this way, it is ensured that no frame dropping occurs. For example, in an application scenario where application a only participates in drawing an image frame itself, the time taken for the processor to process the last image frame is 2 milliseconds, and in this scenario, assuming that the statistical time taken for the processor ranges from 1 to 3 milliseconds, the maximum time taken for the processor is 3 milliseconds, so long as the predicted time taken for the processor to process the current image frame plus the fill time is greater than the maximum of the statistical or acquired time range. In this way, it is ensured that no frame dropping occurs.

In addition, for example, assuming that the time taken by the prediction processor to process the current image frame is 2 ms, and the value of the padding time is also 2 ms, such that 2 ms+2 ms=4 ms is always greater than the maximum time taken to process the image frame counted in the application scene by 3 ms, it is ensured that the frame is not dropped, and the padding time is reduced from the original fixed minimum time taken of 4.83 ms to 2 ms, the MTP delay is also reduced by 2.83 ms. Therefore, the image processing method of the present disclosure can realize the effect of shortening the MTP delay while ensuring that no frame dropping occurs.

Other application scenes also adopt the same method, so that the sum of the first time and the filling time is ensured to be larger than the maximum value of the time range of the processor image frames under the acquired corresponding application scene, thus not only ensuring that frame dropping does not occur, but also shortening MTP delay, improving prediction precision and reducing dizziness of users.

In some embodiments, the difference between the sum of the first time and the fill time and the maximum value of the above time range is less than or equal to a preset value. By making the difference between the sum of the first time and the filling time and the maximum value of the above-described time range smaller than or equal to a preset value, it is ensured that the MTP delay is shortened as much as possible. In some embodiments, the preset value is between 0.5 milliseconds and 2 milliseconds. If the preset value is too small, the safety margin provided is relatively low; if the preset value is too large, it is disadvantageous to shorten the MTP delay as much as possible.

In some embodiments, the fill time is less than or equal to 0.2 times the frame time of the image frame. For example, assuming a screen refresh rate of 72Hz, the frame time of the image frames is 13.8 milliseconds and the fill time is less than or equal to 2.76 milliseconds. In this way, the MTP delay can be reduced as much as possible while ensuring that no dropped frames occur.

In some embodiments, the image processing methods of the present disclosure are applied to virtual reality applications. In virtual reality applications, the index of motion-to-photon delay is important to enhance the user experience. In some embodiments, the time frame required by the acquisition processor to process the image frames in the plurality of application scenarios includes: a time frame required by the processor to render the image frames in the plurality of application scenarios is acquired. In some embodiments, the processor includes a central processor and a graphics processor. Thus, the range of time required for the processor to process an image frame may include the time it takes for the central processor and the graphics processor to render the image frame.

The image processing method disclosed by the invention can ensure that the MTP delay is shortened as much as possible while the frame dropping is avoided, the prediction precision is improved, the dizziness of a user is reduced, and the user experience is improved.

Embodiments of the present disclosure also provide an image processing apparatus 400. The image processing apparatus 400 includes an acquisition module 401 and a determination module 402. In some embodiments, the acquisition module 401 is configured to acquire a time range required for the processor to process image frames in a plurality of application scenarios. In some embodiments, the determining module 402 is configured to determine the fill time reserved for the current image frame on screen based on a time range of a respective application scene of the plurality of application scenes and a first time at which the processor processed the last image frame, wherein a sum of the first time and the fill time is greater than a maximum value of the time range.

It should be understood that the descriptions regarding the image processing method also apply to the image processing apparatus 400 herein, and for the sake of simplicity, will not be described in detail herein.

In some embodiments, the difference between the sum of the first time and the fill time and the maximum value of the time range is less than or equal to a preset value. In some embodiments, the preset value is between 0.5 milliseconds and 2 milliseconds. In some embodiments, the fill time is less than or equal to 0.2 times the frame time of the image frame. In some embodiments, the image processing method is applied to a virtual reality application. In some embodiments, the time frame required by the acquisition processor to process the image frames in the plurality of application scenarios includes: a time frame required by the processor to render the image frames in the plurality of application scenarios is acquired. In some embodiments, the processor includes a central processor and a graphics processor.

In addition, the present disclosure also provides a terminal, including: at least one memory and at least one processor; the memory is used for storing program codes, and the processor is used for calling the program codes stored in the memory to execute the image processing method.

Further, the present disclosure also provides a computer storage medium storing a program code for executing the above-described image processing method.

The image processing method and apparatus of the present disclosure are described above based on the embodiments and application. In addition, the present disclosure also provides a terminal and a storage medium, which are described below.

Referring now to fig. 4, a schematic diagram of an electronic device (e.g., a terminal device or server) 500 suitable for use in implementing embodiments of the present disclosure is shown. The terminal devices in the embodiments of the present disclosure may include, but are not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and the like, and stationary terminals such as digital TVs, desktop computers, and the like. The electronic device shown in fig. 4 is merely an example and should not be construed to limit the functionality and scope of use of the disclosed embodiments.

As shown in fig. 4, the electronic device 500 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 501, which may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 502 or a program loaded from a storage means 508 into a Random Access Memory (RAM) 503. In the RAM503, various programs and data required for the operation of the electronic apparatus 500 are also stored. The processing device 501, the ROM 502, and the RAM503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.

In general, the following devices may be connected to the I/O interface 505: input devices 506 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; an output device 507 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 508 including, for example, magnetic tape, hard disk, etc.; and communication means 509. The communication means 509 may allow the electronic device 500 to communicate with other devices wirelessly or by wire to exchange data. While fig. 4 shows an electronic device 500 having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead.

In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via the communication means 509, or from the storage means 508, or from the ROM 502. The above-described functions defined in the methods of the embodiments of the present disclosure are performed when the computer program is executed by the processing device 501.

It should be noted that the computer readable medium described in the present disclosure may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this disclosure, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present disclosure, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.

In some implementations, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.

The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device.

The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to perform the methods of the present disclosure described above.

Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units involved in the embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. Wherein the names of the units do not constitute a limitation of the units themselves in some cases.

The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary states of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.

In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

According to one or more embodiments of the present disclosure, there is provided an image processing method including: acquiring a time range required by a processor to process image frames in a plurality of application scenes; determining a filling time reserved for the current image frame on screen based on the time range of the corresponding application scene in the plurality of application scenes and a first time of the processor for processing the last image frame, wherein the sum of the first time and the filling time is larger than the maximum value of the time range.

According to one or more embodiments of the present disclosure, a difference between the sum of the first time and the filling time and a maximum value of the time range is less than or equal to a preset value.

According to one or more embodiments of the present disclosure, the preset value is between 0.5 milliseconds and 2 milliseconds.

According to one or more embodiments of the present disclosure, the fill time is less than or equal to 0.2 times a frame time of the image frame.

According to one or more embodiments of the present disclosure, the image processing method is applied to a virtual reality application.

According to one or more embodiments of the present disclosure, acquiring a time range required for a processor to process image frames in a plurality of application scenarios includes: a time frame required by the processor to render an image frame in a plurality of application scenarios is acquired.

In accordance with one or more embodiments of the present disclosure, the processor includes a central processor and a graphics processor.

According to one or more embodiments of the present disclosure, there is also provided an image processing apparatus including: an acquisition module configured to acquire a time range required for the processor to process the image frames in the plurality of application scenes; and the determining module is configured to determine a filling time reserved for the current image frame on screen based on the time range of the corresponding application scene in the plurality of application scenes and the first time of the processor for processing the last image frame, wherein the sum of the first time and the filling time is larger than the maximum value of the time range.

According to one or more embodiments of the present disclosure, there is provided a terminal including: at least one memory and at least one processor; wherein the at least one memory is configured to store program code, and the at least one processor is configured to invoke the program code stored by the at least one memory to perform any of the methods described above.

According to one or more embodiments of the present disclosure, there is provided a storage medium for storing program code for performing the above-described method.

The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by persons skilled in the art that the scope of the disclosure referred to in this disclosure is not limited to the specific combinations of features described above, but also covers other embodiments which may be formed by any combination of features described above or equivalents thereof without departing from the spirit of the disclosure. Such as those described above, are mutually substituted with the technical features having similar functions disclosed in the present disclosure (but not limited thereto).

Moreover, although operations are depicted in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order. In certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limiting the scope of the present disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.

Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are example forms of implementing the claims.

Claims (10)

1. An image processing method, characterized in that the image processing method comprises:

acquiring a time range required by a processor to process image frames in a plurality of application scenes;

based on the time range of the corresponding application scene of the plurality of application scenes and the first time the processor processes the last image frame, determining a fill time reserved for the current image frame on screen,

wherein the sum of the first time and the filling time is greater than the maximum value of the time range.

2. The image processing method according to claim 1, wherein a difference between a sum of the first time and the filling time and a maximum value of the time range is less than or equal to a preset value.

3. The image processing method according to claim 2, wherein the preset value is between 0.5 ms and 2 ms.

4. The image processing method according to claim 1, wherein the fill time is less than or equal to 0.2 times a frame time of the image frame.

5. The image processing method according to claim 1, wherein the image processing method is applied to a virtual reality application.

6. The image processing method according to claim 1, wherein acquiring a time range required for the processor to process the image frames in the plurality of application scenes includes: a time frame required by the processor to render an image frame in a plurality of application scenarios is acquired.

7. The image processing method according to claim 1, wherein the processor includes a central processor and a graphic processor.

8. An image processing apparatus, characterized in that the image processing apparatus comprises:

an acquisition module configured to acquire a time range required for the processor to process the image frames in the plurality of application scenes;

a determining module configured to determine a fill time reserved for the current image frame on screen based on the time range of a corresponding application scene of the plurality of application scenes and a first time at which the processor processed a previous image frame,

wherein the sum of the first time and the filling time is greater than the maximum value of the time range.

9. A terminal, comprising:

at least one memory and at least one processor;

wherein the at least one memory is configured to store program code, and the at least one processor is configured to invoke the program code stored in the at least one memory to perform the image processing method of any of claims 1 to 7.

10. A storage medium storing program code for executing the image processing method according to any one of claims 1 to 7.