Abstract: An image tracking device and an image tracking method thereof are provided. The image tracking device includes an image capture interface, a storage means, and a processor means. The storage means has a multi-dimensional storage space for storing a plurality of first images, each dimension of the multi-dimensional storage space being corresponding to a feature-related variance of a multi-dimensional variance. The processor means is configured to execute the following operations: marking a second image in the picture frame; calculating a multi-dimensional variance between the second image and each of the first images separately; determining whether the second image contains the object according to the multi-dimensional variance calculated; and if the second image is determined as one containing the object, storing the second image as one of the first images, in a specific subspace of the multi-dimensional storage space according to the multi-dimensional variance calculated.

Abstract: A beautifying method for quick response code (QR code) is provided herein and includes the following steps: a step of setting an image in a QR code; a step of determining an ideal value of a correction code for the QR code; a step of calculating an energy function related to vision beauty condition in accordance with the image, the correction code and the ideal value and a step of optimizing the energy function to obtain a minimum procedure of the energy function of the ideal value.

Abstract: A beautifying method for quick response code (QR code) is provided herein and includes the following steps: a step of setting an image in a QR code; a step of determining an ideal value of a correction code for the QR code; a step of calculating an energy function related to vision beauty condition in accordance with the image, the correction code and the ideal value and a step of optimizing the energy function to obtain a minimum procedure of the energy function of the ideal value.

Abstract: An image tracking device and an image tracking method thereof are provided. The image tracking device includes an image capture interface, a storage means, and a processor means. The storage means has a multi-dimensional storage space for storing a plurality of first images, each dimension of the multi-dimensional storage space being corresponding to a feature-related variance of a multi-dimensional variance. The processor means is configured to execute the following operations: marking a second image in the picture frame; calculating a multi-dimensional variance between the second image and each of the first images separately; determining whether the second image contains the object according to the multi-dimensional variance calculated; and if the second image is determined as one containing the object, storing the second image as one of the first images, in a specific subspace of the multi-dimensional storage space according to the multi-dimensional variance calculated.

Abstract: A decoder for decoding a message using an arbitrary-side growing (ASG) Huffman tree including a plurality of codewords and symbols includes a database, a processing module, and a bit pattern matching module. The database stores a plurality of parameters corresponding to the ASG Huffman tree divided into several sub-trees according to a Hashemian cut operation and a bits-pattern-Xor (BPX) operation. The plurality of parameters include a bit pattern of a sub-tree of the ASG Huffman tree divided according to the BPX operation and a code length of the bit pattern. The processing module receives a bit stream corresponding to the ASG Huffman tree from an encoder. The bit pattern matching module selects bits from the bit stream according to the code length of the bit pattern and decodes the selected bits into a symbol in the ASG Huffman tree by comparing the selected bits with the bit pattern.

Abstract: A decoder for decoding a message using an arbitrary-side growing (ASG) Huffman tree including a plurality of codewords and symbols includes a database, a processing module, and a bit pattern matching module. The database stores a plurality of parameters corresponding to the ASG Huffman tree divided into several sub-trees according to a Hashemian cut operation and a bits-pattern-Xor (BPX) operation. The plurality of parameters include a bit pattern of a sub-tree of the ASG Huffman tree divided according to the BPX operation and a code length of the bit pattern. The processing module receives a bit stream corresponding to the ASG Huffman tree from an encoder. The bit pattern matching module selects bits from the bit stream according to the code length of the bit pattern and decodes the selected bits into a symbol in the ASG Huffman tree by comparing the selected bits with the bit pattern.

Abstract: Digital content processing methods and systems are provided. First, an image property and a specific value corresponding to the image property are determined according to an image enhancement operation. Then, a specific region is sought within a first digital content, wherein pixels in the specific region have the specific value corresponding to the image property. Specific information is embedded in the specific region of the first digital content to generate a second digital content having the specific information. A digital content playback device performs the image enhancement operation on the second digital content to obtain the specific information.

Abstract: A novel steganographic approach analogous to the real-world secret communication mechanism, in which messages to be concealed are written on white papers using invisible ink like lemon juice or milk and are revealed only after the papers are heated, is proposed. Carefully designed informed-embedders now play the role of “invisible ink”; some pre-negotiated attacks that can be provided by common content processing tools correspond to required “heating” process. Theoretic models and feasible implementations of the proposed digital-invisible-ink (DII) watermarking approach are provided. The proposed DII watermarking schemes can prevent the supervisor from interpreting secret messages even the watermark extractor, decryption tool, as well as session keys are available to the supervisor.

Abstract: A system to display automatically organized images coordinating with pace of background music is disclosed. Users only need to give images and a music clip, and the system will automatically generate a presentation that combines visual and aural effects to display the organized images synchronously accompanying the music. Multiple images that have similar characteristics are well arranged and displayed at the same frame to emphasize the atmosphere of viewing experience. In addition, collaborative presentation of images that is synchronous to music even improves the enjoyment of image browsing.

Abstract: An image authentication method by embedding digital watermarks into images, comprising: providing an original image and a watermark image; applying pseudo-random permutations to the watermark image for generating a dispersed watermark image; applying block-based permutations to the original image and the dispersed watermark image in order to form a plurality of original image blocks with each of the watermark blocks dispersed over the corresponding image block only; applying FDCT (Forward Discrete Cosine Transform) on each of the original image blocks independently so that each of the original image blocks is transformed into a DCT coefficient block that corresponds to different frequency ranges; embedding said watermark image blocks into said DCT coefficient blocks, in order to form a plurality of combined DCT coefficient blocks; applying IDCT (Inverse Discrete Cosine Transform) to the combined DCT coefficient blocks to form an embedded watermark image.

Abstract: An automatic feature extraction system for analyzing a face image and finding the facial features of the face. In the pre-processing stage, a second-chance region growing method is applied to determine a face region on the face image. In the feature extraction stage, three primary facial features, including both eyes and the mouth, are extracted first. Then other facial features can be extracted according to these extracted primary facial features. Searching feature points can be achieved by calculating the cost function of each point using a simple feature template. In addition, a genetic algorithm can be used to accelerate the process of searching feature points.

Abstract: A method and system of processing referral fees for accessing to a server computer via media player modules. First, a media player module provided by an organization contains a default web page previously defined by the organization. This default web page further contains at least one dynamic links to other web servers that provide relevant products. When one of the dynamic links is chosen, an access command containing a string data representative of the organization is issued to setup the network connection. The linked web server can pay the referral fees to the organization determined by the string if the introduced users complete some transactions.

Abstract: A method of generating a symmetrical reversible variable length code. This symmetrical reversible variable length code is derived from an original variable length code. Compared with the conventional generating method, the novel method is independent of the bit alignment patterns of the codeword of the original variable length code. In addition, the assignment of codewords of the symmetrical reversible variable length code is performed by a selection priority. Therefore, the overall coding efficiency is improved.