Chien-Fa Li’s research while affiliated with National Chung Cheng University and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (3)


Code Transformation Algorithms for Two Breadth-First Linear Quadtrees
  • Article

December 2008

·

10 Reads

·

2 Citations

·

Chien-Fa Li

·

In this paper, the code transformation algorithms between the fixed binary linear quadtree scheme (FBLQ)and the constant bit-length linear quadtree scheme(CBLQ) are proposed. There exists no code transformation algorithm between FBLQ and CBLQ. To solve this problem that when one receives a FBLQ or CBLQ code and does not have the corresponding decoding program, with our new code transformation algorithms at hand, she/he can transform the received code into CBLQ or FBLQ code that she/he can handle.The code transformation algorithms can also be used to reduce the load an image lays on the system by transforming it from a higher complexity code to a lower one.


A novel quadtree-structured scheme for transmitting Chinese calligraphy progressively

October 2004

·

5 Reads

·

1 Citation

Progressive image transmission (PIT) techniques are useful in Web applications. A user can get a rough preview of an image and decide if the entire detail of a picture needs to be transmitted, especially when the network bandwidth is restricted. In this paper, we propose a new progressive image transmission scheme for Chinese calligraphy. Because the colors used in Chinese calligraphy are very simple, we can apply the quadtree-structure to transmit the calligraphy progressively. The preliminary results show that transmitted bits can be saved in the first few rounds. The PSNR values in the first few rounds are much better than other PIT techniques.


Fig. 2 The DF-expression of quadtree codes for the image shown in Fig. 1(a)  
Fig. 3 The corresponding DF-expression codes of a bintree for the image in Fig. 1(a)  
Fig. 5 Example of a DF-expression from a quadtree to a bintree transformation  
Fig. 7 Example of a DF-expression of a bintree to quadtree transformation  
Code transformation of DF-expression between bintree and quadtree
  • Conference Paper
  • Full-text available

January 2004

·

181 Reads

In this paper, algorithms for transforming code between bintree and quadtree are proposed. The quadtree and bintree are two commonly used representations for image manipulations. However, there exists no algorithm for transforming code between bintree and quadtree. When one receives a DF-expression of a bintree or quadtree code and does not have the corresponding decoding program, she/he, with our new code transformation algorithms at hand, can transform the received code into a quadtree or bintree code that she/he can handle. After code transformation, the receiver can see whether the output code is smaller than the input code. From it, she/he can further decide which code is more economic in its memory space needed; therefore, she/he can store the code with smaller size for saving more memory space.

Download

Citations (1)


... This research is based on the breadth-first traversal of linear quadtree proposed by Chan and Chang (2001) and Chang et al. (2008). It consists of two lists, i.e., a tree list and a color list. ...

Reference:

Single Core Hardware Module to Implement Partial Encryption of Compressed Image
Code Transformation Algorithms for Two Breadth-First Linear Quadtrees
  • Citing Article
  • December 2008