Abstract:
A method for storing node information of a Huffman tree. The method creates an index of each node in the Huffman tree using a breadth first search (BFS) algorithm. The method further reads each node of the Huffman tree beginning from a root node according to a sequence of the index of each node, and stores node information of each node into an array of the Huffman tree.
Abstract:
An electronic device controls a client to play videos using internet protocol television (IPTV). The electronic device includes a display. The display displays a program list that includes a plurality of programs, a play option for activating play of a user selected television program and a browse option for activating display of information of the user selected television program. Videos of the programs are stored in an IPTV server connected to the client. In response to the user selects a television program on the display, the client obtains a video of the selected television program and displays the video on the client. If the user selects the browse option, the client obtains the information of the selected television program. The display of the electronic device displays the information of the selected television program.
Abstract:
A method for encoding images receives a specified type of an image request from a terminal device, obtains encoded images from a storage device of the server directly upon the condition that the image request has been processed. The method further adds a task into a coder of the server to process the image request upon the condition that the image request has not been processed, encodes captured images by the coder according to the image request, stores the encoded images and the corresponding specified type of the image request in the storage device, and outputs the encoded images to the terminal device.
Abstract:
A method for improving display speed of decoding video bit streams obtains the video bit streams from a storage system of a computer by a decoder, and decodes the video bit streams in a display block of a memory of the computer to obtain decoded images by the decoder. The method further selects an image from the decoded images by the decoder, and updates a reference image stored in a buffer block of the memory with the selected image.
Abstract:
A method for merging separated pixel blocks into an integral image of an object is provided. The method performs binary image processing on an obtained image to obtain a binary image, finds pixel blocks in the binary image whose area is greater than a first preset value, and stores a position and a size of each found pixel block in a data structure. The method further merges two pixel blocks in the data structure if a distance between the two pixel blocks is less than a second preset value, so as to generate the integral image of the object.
Abstract:
A method for storing node information of a Huffman tree. The method creates an index of each node in the Huffman tree using a breadth first search (BFS) algorithm. The method further reads each node of the Huffman tree beginning from a root node according to a sequence of the index of each node, and stores node information of each node into an array of the Huffman tree.
Abstract:
A method for filtering noise in an image filters noise pixels in a discrepant block between a current image and a background image firstly, and further filter each small block whose area is less than a preset value from the discrepant block. The method further calculates a total area of each big block whose area is greater than or equal to the preset value from the discrepant block, and adds the current image to a background list of the current image if the total area is less than another preset value.
Abstract:
A method for seeking a file position of a file first seeks an estimated file position corresponding to a specified time point in the file, and adjusts the estimated file position according to a preset estimation formula. The method further determines the estimated file position is an accurate file position of the specified time point in the file until a difference between the estimated file position and the specified time point is less than a preset value.
Abstract:
A method for protecting electronic keys sets a plurality of hash functions, divides an electronic key into a plurality of key segments, creates a data storage structure for each of the key segments, and calculates a hash address for each of the key segments of the electronic key using each of the hash functions. The method further obtains a plurality of hash addresses of the plurality of key segments corresponding to the plurality of hash functions, stores information of the data storage structure of each key segment in a hash table according to the hash address of the key segment corresponding to one of the hash functions.
Abstract:
A method embeds product information in videos with product placements using an electronic device. The electronic device converts product information of products into advertisement information, and saves the advertisement information in an ad database. The advertisement information includes product images and advertisements of the products. The electronic device exports the advertisement of a presented product displayed on a display device from the ad database according to the product images during the video broadcasts. The advertisement of the presented product is displayed on the display device.