The search functionality is under construction.

Author Search Result

[Author] King-Chu HUNG(2hit)

1-2hit
  • Non-recursive Discrete Periodized Wavelet Transform Using Segment Accumulation Algorithm and Reversible Round-Off Approach

    Chin-Feng TSAI  Huan-Sheng WANG  King-Chu HUNG  Shih-Chang HSIA  

     
    PAPER-VLSI Systems

      Vol:
    E91-D No:11
      Page(s):
    2666-2674

    Wavelet-based features with simplicity and high efficacy have been used in many pattern recognition (PR) applications. These features are usually generated from the wavelet coefficients of coarse levels (i.e., high octaves) in the discrete periodized wavelet transform (DPWT). In this paper, a new 1-D non-recursive DPWT (NRDPWT) is presented for real-time high octave decomposition. The new 1-D NRDPWT referred to as the 1-D RRO-NRDPWT can overcome the word-length-growth (WLG) effect based on two strategies, resisting error propagation and applying a reversible round-off linear transformation (RROLT) theorem. Finite precision performance analysis is also taken to study the word length suppression efficiency and the feature efficacy in breast lesion classification on ultrasonic images. For the realization of high octave decomposition, a segment accumulation algorithm (SAA) is also presented. The SAA is a new folding technique that can reduce multipliers and adders dramatically without the cost of increasing latency.

  • Efficient XML Retrieval Service with Complete Path Representation

    Hsu-Kuang CHANG  King-Chu HUNG  I-Chang JOU  

     
    PAPER-Data Engineering, Web Information Systems

      Vol:
    E96-D No:4
      Page(s):
    906-917

    Compiling documents in extensible markup language (XML) increasingly requires access to data services which provide both rapid response and the precise use of search engines. Efficient data service should be based on a skillful representation that can support low complexity and high precision search capabilities. In this paper, a novel complete path representation (CPR) associated with a modified inverted index is presented to provide efficient XML data services, where queries can be versatile in terms of predicates. CPR can completely preserve hierarchical information, and the new index is used to save semantic information. The CPR approach can provide template-based indexing for fast data searches. An experiment is also conducted for the evaluation of the CPR approach.