Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A high-definition picture cutting and display method

A cutting method and image technology, applied in the information field, can solve problems such as long network noise and lost data, and achieve the effects of reducing loading time, preventing illegal theft, and reducing access traffic

Active Publication Date: 2019-10-01
HOHAI UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, loading high-definition pictures on the webpage in the traditional way will cause the network to ring for a long time, and even lose data in an environment with poor network quality

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A high-definition picture cutting and display method
  • A high-definition picture cutting and display method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0023] Below in conjunction with accompanying drawing, technical scheme of the present invention is described in further detail:

[0024] Such as figure 1 As shown, the present invention provides a kind of high-definition picture cutting method, comprises the following steps:

[0025] Step 1. According to the size of the uploaded image and the predefined minimum rectangle size, calculate the maximum number of compression levels for the uploaded image, specifically:

[0026] lv = ceil(log 2 ( max(width_pic / width_i, height_pic / height_i)))

[0027] Among them, lv is the maximum number of levels, width_pic and height_pic are the width and height of the uploaded picture respectively, width_i and height_i are the width and height of the predefined smallest rectangle respectively, and ceil( ) means rounding up;

[0028] Step 2, set the current level now_lv to 0;

[0029] Step 3, calculate the size (width, height) of the current required compression according to the current level,...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a high-definition picture cutting and displaying method. The method comprises the steps of compressing a picture to have different sizes according to different levels; cutting pictures with different levels into same rectangular blocks; and storing the rectangular blocks with different levels. The pictures finished by the cutting method are used for special picture displaying, and the cutting method relates to the technical field of information. For the picture displaying, a plurality of same rectangular pictures are displayed at the same time. According to the high-definition picture cutting and displaying method, a large-sized high-definition picture with more than one hundred million pixels can be displayed in an environment with a relatively poor network quality, so that the response time of a webpage is shortened and the access flow is saved.

Description

technical field [0001] The invention relates to a high-definition picture cutting method and a display method, belonging to the field of information technology. Background technique [0002] In recent years, due to the improvement of photo quality, people have higher and higher requirements for the quality of pictures, so the size of pictures will become larger and larger. However, loading high-definition pictures on the webpage in the traditional way will cause the network to ring for too long, and even lose data in an environment with poor network quality. [0003] GUTTMAN proposed a data structure R-Tree that supports extended object access methods in 1984. R-Tree is currently mostly used in spatial databases. Each node of the R-tree corresponds to disk page D and area I. If the node is not a leaf node, the areas of all child nodes of the node are in area I. Within the range, and stored in disk page D. If the node is a leaf node, then what is stored in the disk page D ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06F16/957
Inventor 安纪存陈洁张雪洁王龙宝孙泽群马鹏举
Owner HOHAI UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com