Abstract: An image processing and recording system and an image processing and recording method thereof are provided. An image processing and recording system includes a recording module, an access module, and an identification module. The recording module stores an image which includes N image blocks, and the N image blocks compose M image tiles. The identification module performs an image recognition procedure to identify a predetermined feature of the N image blocks picked up by the access module and generates N identification results. Each result includes an address of the tile in the image corresponding to the Kth image block, a corresponding address of the Kth image block in the image tile and whether the Kth image block has the predetermined feature. Thus, the access module can pick up the image blocks having the predetermine feature to perform a next image recognition procedure.

Abstract: The present invention discloses a configure image process system and a configure image process method thereof applicable to a predetermine image process structure. The configure image process system includes N pieces of logic hardware and a control module, wherein N is a positive integer. Each piece of the logic hardware respectively corresponds to an algorithm structure, and the control module connects to each piece of the logic hardware. The control module can selectively apply the N pieces of logic hardware to combine at least one part of the predetermine image process structure to perform the image process.

Abstract: An image processing and recording system and an image processing and recording method thereof are provided. An image processing and recording system includes a recording module, an access module, and an identification module. The recording module stores an image which includes N image blocks, and the N image blocks compose M image tiles. The identification module performs an image recognition procedure to identify a predetermined feature of the N image blocks picked up by the access module and generates N identification results. Each result includes an address of the tile in the image corresponding to the Kth image block, a corresponding address of the Kth image block in the image tile and whether the Kth image block has the predetermined feature. Thus, the access module can pick up the image blocks having the predetermine feature to perform a next image recognition procedure.

Abstract: A method for encoding images according to object shapes is provided. The method enables reduced usage of storage space when an image encoding system encodes a received image frame. The method uses a bottom-up and sequential approach for encoding coefficients. The coefficients in each subband are numbered using a tree structure, wherein level N subband is designated as a root of the whole tree, level (N-1) subbands are designated as roots of subtrees, and level (N=1) subbands are designated as terminal nodes of subtrees. The terminal nodes for one of the subtrees are numbered first, and then this subtree is numbered in the bottom-up sequence. After that, the terminal nodes for another subtree are numbered, and this numbering sequence continues to number all the other subtrees until the root of the tree has been numbered, so as to allow a bottom-up encoding process for the coefficient to be performed.

Abstract: A method for encoding images according to object shapes is provided. The method enables reduced usage of storage space when an image encoding system encodes a received image frame. The method uses a bottom-up and sequential approach for encoding coefficients. The coefficients in each subband are numbered using a tree structure, wherein level N subband is designated as a root of the whole tree, level (N?1) subbands are designated as roots of subtrees, and level (N=1) subbands are designated as terminal nodes of subtrees. The terminal nodes for one of the subtrees are numbered first, and then this subtree is numbered in the bottom-up sequence. After that, the terminal nodes for another substree are numbered, and this numbering sequence continues to number all the other subtrees until the root of the tree has been numbered, so as to allow a bottom-up encoding process for the coefficient to be performed.