Skip to main content

    Simon Liao

    Cardiovascular disease is the leading cause for death in developed countries. Measuring and Tracking the heart parameters with less cost can benefits the public health directly. This paper proposes a cardiovascular remote monitoring... more
    Cardiovascular disease is the leading cause for death in developed countries. Measuring and Tracking the heart parameters with less cost can benefits the public health directly. This paper proposes a cardiovascular remote monitoring system which collects data from ubiquitous computing device with ECG, Blood Pressure (BP), and Oximeter sensors. The monitoring device has USB connectivity which is widely used with Personal Computer and many other portable devices. It stores the data at local and sends a copy to data processing center for analysis. The communicating message follows HL7 Version 3 standard and can be used to exchange information among different Health Information Systems. Users can manage their own health information by visiting the website hosted at server side. The processing center includes a Decision Support System which analyzes cardiovascular data with related models. It also learns from doctor’s decisions for self wellness purpose. The whole system is portable, low...
    In this research, we have analyzed the Chebyshev-Fourier moments computing and found out that the errors are mainly caused by the computational issues of both radial and Fourier polynomials. To increase the accuracy of moments computing,... more
    In this research, we have analyzed the Chebyshev-Fourier moments computing and found out that the errors are mainly caused by the computational issues of both radial and Fourier polynomials. To increase the accuracy of moments computing, we utilized the k × k numerical scheme in the computations of Chebyshev-Fourier moments and conducted the image reconstructions to verify our solution. The experimental results show that the performances of image reconstructions are highly satisfied. We have also performed image reconstructions from the different radial and Fourier orders of moments, and observed that the radial and Fourier orders of Chebyshev-Fourier moments preserve the information of circular and radial patterns, respectively.
    In this research, a study on color image reconstruction from Bessel-Fourier moments is conducted. We have calculated the Bessel-Fourier moments of a color image in three different color channels, reconstructed images in different color... more
    In this research, a study on color image reconstruction from Bessel-Fourier moments is conducted. We have calculated the Bessel-Fourier moments of a color image in three different color channels, reconstructed images in different color channels, and integrated the separately reconstructed images to a color image. Our experimental results show that the color image reconstruction performances from different radial and Fourier orders of Bessel-Fourier moments, up to n = m = 100, are highly satisfactory.
    Abstract In this research, we have developed a new algorithm to compute the moments defined in a rectangular region. By applying the recurrent formulas, symmetry properties, and particularly the parallelized matrix operations, our... more
    Abstract In this research, we have developed a new algorithm to compute the moments defined in a rectangular region. By applying the recurrent formulas, symmetry properties, and particularly the parallelized matrix operations, our proposed computational method can improve the efficiency of computing Legendre, Gegenbauer, and Jacobi moments extensively with highly satisfied accuracy. To verify this new computational algorithm, the image reconstructions from the higher orders of Legendre, Gegenbauer, and Jacobi moments are performed on a testing image sized at 1024 × 1024 with very encouraging results. It took only a few seconds to compute moments and conduct the image reconstructions from the 1000-th order of the Legendre, Gegenbauer, and Jacobi moments with the PSNR values up to 45. By utilizing our new algorithm, image analysis and recognition applications using the higher orders of moments defined in a rectangular region in the range of milliseconds will be possible.
    In this research, a matrix notation method to extract discrete orthogonal Racah moments is proposed to reduce the computation time. To verify this new computational method, the image reconstructions from higher orders of Racah moments are... more
    In this research, a matrix notation method to extract discrete orthogonal Racah moments is proposed to reduce the computation time. To verify this new computational method, the image reconstructions from higher orders of Racah moments are performed. Our experimental results show that the Racah moments computing time has been reduced tremendously, while the testing image can be reconstructed completely by Racah moments of orders up to 510 without any error.
    Chinese character recognition systems based on local structure features face difficulties to recognize characters with similar structures. Since moment-based features could capture the global statistic properties of an image rather than... more
    Chinese character recognition systems based on local structure features face difficulties to recognize characters with similar structures. Since moment-based features could capture the global statistic properties of an image rather than local structure features, they are introduced into Chinese character recognition systems. This paper proposed a set of feature vectors based on pseudo-Zernike moments for Chinese character recognition. Three different feature vectors are composed of different parts of four selected lower pseudo-Zernike moments. Experiments on a set of 6,762 Chinese characters show that this method performs well to recognize similar-shaped Chinese characters. The rotational invariant property of pseudo-Zernike moments is also verified.
    In this paper, we have discussed the computational aspects regarding to Jacobi-Fourier moments. A $k$ × $k$ numerical scheme has been applied to improve the computing accuracy of Jacobi-Fourier moments. To verify our proposed method,... more
    In this paper, we have discussed the computational aspects regarding to Jacobi-Fourier moments. A $k$ × $k$ numerical scheme has been applied to improve the computing accuracy of Jacobi-Fourier moments. To verify our proposed method, image reconstructions of the higher orders of Jacobi-Fourier moments have been carried out. The experimental results of reconstructing a testing image sized at 512 × 512 are highly satisfying. We have also conducted a study on image reconstructions from uneven order pairs of Jacobi-Fourier moments, {n, m}, and concluded that the order $n$ and repetition $m$ preserve the circular and radial pattern information of image, respectively.
    In this research, we have studied the symmetrical properties of Legendre moments. Our research leads to the conclusion that if the original image is centrally symmetrical, all Legendre moments composed of any odd order of Legendre... more
    In this research, we have studied the symmetrical properties of Legendre moments. Our research leads to the conclusion that if the original image is centrally symmetrical, all Legendre moments composed of any odd order of Legendre polynomials are nil. We conducted the image reconstructions from different sets of Legendre moments, and verified the proposed symmetry properties. Our experimental results show that the reconstructed central symmetrical images from the Legendre moments with only even orders of Legendre polynomials are identical to those from the corresponding complete order sets of Legendre moments.
    In this research, we have analysed the image feature descriptive properties of discrete orthogonal Hahn moments, and proposed a new object recognition scheme with three modes of Hahn moment descriptors, global, local, and hybrid,... more
    In this research, we have analysed the image feature descriptive properties of discrete orthogonal Hahn moments, and proposed a new object recognition scheme with three modes of Hahn moment descriptors, global, local, and hybrid, respectively. For each mode, we have employed the four highest variances values from ten lowest order of Hahn moments to compose a four-dimensional feature vector. To clarify our new scheme of using discrete orthogonal Hahn moment characteristics, we utilised a set of 6,763 Chinese characters defined in China's national standard GB2312, with the font of song, as the testing object set. Each of the three Hahn moment modes has performed very well, while the experimental results of utilising the three Hahn moment modes are independent from each other.
    Cardiovascular refers to the Cardio (heart) and vascular (blood vessels). The system has two major functional parts: central circulation system and systemic circulation system. Central circulation includes the pulmonary circulation and... more
    Cardiovascular refers to the Cardio (heart) and vascular (blood vessels). The system has two major functional parts: central circulation system and systemic circulation system. Central circulation includes the pulmonary circulation and the heart from where the pulse wave is generated. Systemic circulation is the path that the blood goes from and to the heart. (Green 1984) Pulse wave is detected at arteries which include elastic arteries, medium muscular arteries, small arteries and arterioles. The typical muscular artery has three layers: tunica intima as inner layer, tunica media as middle layer, and tunica adventitia for the outer layer. (Kangasniemi & Opas 1997) The material properties of arteries are highly nonlinear. (langewouters et al. 1984) It depends on the contents of arterial wall: how collagen, elastin and protein are located in the arteries. Functional and structural changes in the arterial wall can be used as early marker for the hypertensive and cardiac diseases. Bloo...
    For patients with chronic heart failure, the coenzyme Q10 can improve the symptom. This study is to using a pulse wave analysis system to evaluate the cardiac hemodynamics of patients with coenzyme Q10 treatment. A total of 10 people... more
    For patients with chronic heart failure, the coenzyme Q10 can improve the symptom. This study is to using a pulse wave analysis system to evaluate the cardiac hemodynamics of patients with coenzyme Q10 treatment. A total of 10 people participated in the study. We found that treatment for 3 months with coenzyme Q10 resulted in a significant decrease in Systolic blood pressure at rest, and a significant increase in SI and CI. All these parameters remained unchanged in the placebo group.
    The orthogonal moments defined in a circular domain, such as Zernike moments and pseudo-Zernike moments, have attracted attention due to their distinctive invariance properties. In this research, the accuracy analysis of Zernike and... more
    The orthogonal moments defined in a circular domain, such as Zernike moments and pseudo-Zernike moments, have attracted attention due to their distinctive invariance properties. In this research, the accuracy analysis of Zernike and pseudo-Zernike moment functions has been conducted. Based on our numerical schemes to improve the accuracy of the circularly orthogonal moment functions, the simulation results show that the individual orders of Zernike and pseudo-Zernike moments represent image features uniquely. In particular, we discovered that the even orders of Zernike and pseudo-Zernike moments describe most of the image characteristics, while the contributions of odd orders are very limited.
    In this research, we conducted a study on Charlier polynomials and discrete orthogonal Charlier moments. With the three channel method, we have carried out the color image reconstructions from Charlier moments with satisfied results. Our... more
    In this research, we conducted a study on Charlier polynomials and discrete orthogonal Charlier moments. With the three channel method, we have carried out the color image reconstructions from Charlier moments with satisfied results. Our experimental results show that the color images can be precisely reconstructed in each of three primary color channels individually. We conclude that the moment methods developed for gray-level images can be applied in color image analysis.
    In image watermarking, the watermark’s vulnerability to geometric transformations has long been a difficult problem. Using invariant image features to carry the watermark is an effective approach to addressing this problem. In this paper,... more
    In image watermarking, the watermark’s vulnerability to geometric transformations has long been a difficult problem. Using invariant image features to carry the watermark is an effective approach to addressing this problem. In this paper, a multibit geometrically robust image watermarking algorithm using Zernike moments (ZMs) and pseudo-Zernike moments (PZMs) is proposed. Unlike its counterparts in literature, this algorithm is based on our finding that not all the ZMs/PZMs are suitable for invariant watermarking. We distinguish the ’good’ ZMs/PZMs from the ’bad’ ones. By avoiding embedding watermarks onto the ’bad’ ZMs/PZMs, we have achieved impressively good watermarking results. For some selected ’good’ ZMs/PZMs of an image, dither modulation is employed to quantize their magnitudes in order to embed an array of bits. The watermarked image is obtained via reconstruction from the modified moments and those left intact. In watermark extraction, the embedded bits are estimated from ...
    ABSTRACT
    Research Interests:
    We investigate data hiding with Zernike moments (ZMs) of an image, in an attempt to achieve geometric robustness by drawing on the fact that the magnitudes of ZMs are invariant under image rotation and flipping. However, with the... more
    We investigate data hiding with Zernike moments (ZMs) of an image, in an attempt to achieve geometric robustness by drawing on the fact that the magnitudes of ZMs are invariant under image rotation and flipping. However, with the conventional Cartesian method for ZM computation, the invariance property is far from ideal. We propose a polar coordinate based approach to compute
    ABSTRACT Influenza poses a significant risk to public health, as evident by the 2009 H1N1 pandemic. Hospital emergency departments monitor infectious diseases such as influenza with surveillance systems based on arriving chief complaints.... more
    ABSTRACT Influenza poses a significant risk to public health, as evident by the 2009 H1N1 pandemic. Hospital emergency departments monitor infectious diseases such as influenza with surveillance systems based on arriving chief complaints. However, existing systems are too reliant on the completeness of data and are not acceptably accurate in a practical setting. To improve prediction accuracy, we propose a data cleaning process for data collected in hospital settings. Besides, we also propose a novel feature selection method ...
    We investigate data hiding with Zernike moments (ZMs) of an image, in an attempt to achieve geometric robustness by drawing on the fact that the magnitudes of ZMs are invariant under image rotation and flipping. However, with the... more
    We investigate data hiding with Zernike moments (ZMs) of an image, in an attempt to achieve geometric robustness by drawing on the fact that the magnitudes of ZMs are invariant under image rotation and flipping. However, with the conventional Cartesian method for ZM computation, the invariance property is far from ideal. We propose a polar coordinate based approach to compute
    Moment descriptors have long been applied in object recognition since the early years of the development of the moment theories. Nowadays, discrete orthogonal moments have been studied and proposed for they are superior to traditional... more
    Moment descriptors have long been applied in object recognition since the early years of the development of the moment theories. Nowadays, discrete orthogonal moments have been studied and proposed for they are superior to traditional continuous ones. In this paper, a set of moment features extracted from the discrete Krawtchouk moments for Chinese character recognition is presented. A new method of evaluating the variance values of each moment feature is applied in this research. Tested on a set of 6,763 Chinese characters, our newly proposed Krawtchouk moment features perform very well in distinguishing all Chinese character pairs that have similar structures.…
    Abstract. In this paper, we applied the decomposition method to obtain a new winning strategy for 7x7 Hex game. We also find that some positions on the 7x7 Hex board, which are called “trivial positions”, were never occupied by Black... more
    Abstract. In this paper, we applied the decomposition method to obtain a new winning strategy for 7x7 Hex game. We also find that some positions on the 7x7 Hex board, which are called “trivial positions”, were never occupied by Black among all of strategies in the new solution. In other words, Black can still win the game by using the strategies described in this paper even if White already has pieces on those positions. Considering the symmetry properties of a Hex board for both players, we derived 14 losing positions on a 7x7 Hex board for Black’s first move.
    When a constraint is removed, confluent cells migrate directionally into the available space. How the migration directionality and speed increase are initiated at the leading edge and propagate into neighboring cells are not well... more
    When a constraint is removed, confluent cells migrate directionally into the available space. How the migration directionality and speed increase are initiated at the leading edge and propagate into neighboring cells are not well understood. Using a quantitative visualization technique-Particle Image Velocimetry (PIV)-we revealed that migration directionality and speed had strikingly different dynamics. Migration directionality increases as a wave propagating from the leading edge into the cell sheet, while the increase in cell migration speed is maintained only at the leading edge. The overall directionality steadily increases with time as cells migrate into the cell-free space, but migration speed remains largely the same. A particle-based compass (PBC) model suggests cellular interplay (which depends on cell-cell distance) and migration speed are sufficient to capture the dynamics of migration directionality revealed experimentally. Extracellular Ca(2+) regulated both migration s...
    In image watermarking, the watermark's vulner- ability to geometric transformations has long been a difficult problem. Using invariant image features to carry the watermark is an effective approach to addressing this problem.... more
    In image watermarking, the watermark's vulner- ability to geometric transformations has long been a difficult problem. Using invariant image features to carry the watermark is an effective approach to addressing this problem. In this paper, a multibit geometrically robust image watermarking algorithm using Zernike moments (ZMs) and pseudo-Zernike moments (PZMs) is proposed. Unlike its counterparts in literature, this algorithm is based on our finding that not all the ZMs/PZMs are suitable for invariant watermarking. We distinguish the 'good' ZMs/PZMs from the 'bad' ones. By avoiding embedding water- marks onto the 'bad' ZMs/PZMs, we have achieved impressively good watermarking results. For some selected 'good' ZMs/PZMs of an image, dither modulation is employed to quantize their magnitudes in order to embed an array of bits. The watermarked image is obtained via reconstruction from the modified moments and those left intact. In watermark extraction, the embedded bits are estimated from the invariant magnitudes of the ZMs/PZMs using a minimum distance decoder. Simulation results show that the embedded information can be decoded at low error rates, robust against image rotation, scaling, flipping, and as well, a variety of other processes such as additive noise and lossy compression.
    ABSTRACT Moment descriptors have been applied in object recognition as the features since the moment method was introduced by Hu [1]. The moment based features capture the global properties of an object rather than the local ones. In this... more
    ABSTRACT Moment descriptors have been applied in object recognition as the features since the moment method was introduced by Hu [1]. The moment based features capture the global properties of an object rather than the local ones. In this research, a set of Zernike moment based feature vectors is proposed for a Chinese characters recognition system. We have composed three different feature vectors in the four-dimensional Zernike moment space by evaluating the variance values of lower order Zernike moments with ...
    ABSTRACT
    ABSTRACT In certain games such as Hex, human experts are still much stronger than the best existing computer programs. By combining human Hex experts' excellent "sense" of good and bad opening moves and our newly... more
    ABSTRACT In certain games such as Hex, human experts are still much stronger than the best existing computer programs. By combining human Hex experts' excellent "sense" of good and bad opening moves and our newly developed search algorithms, knowledge representations, and detailed rules, this paper describes a new Hex solver. As the result, a new winning solution on 8 times 8 Hex board has discovered with the first move at F3.
    ABSTRACT
    ABSTRACT
    Research Interests:
    ABSTRACT
    ABSTRACT
    Zernike moment (ZM) is a useful image feature because of its distinguishing properties such as the magnitude invariance to image rotation. However, we find that for digital images, the invariant property of ZMs is far from ideal when they... more
    Zernike moment (ZM) is a useful image feature because of its distinguishing properties such as the magnitude invariance to image rotation. However, we find that for digital images, the invariant property of ZMs is far from ideal when they are computed with the commonly used Cartesian method, which inevitably brings about geometric error and integral error. In this paper, we propose a polar coordinate based algorithm for the computation of ZMs, which avoids both kinds of errors. We provide solutions to the key issues in ZM computation under polar coordinate system, including the derivation of computation formulas, the polar pixel arrangement scheme, and the interpolation-based image conversion etc. Simulation results show that the proposed polar approach improves the rotational invariance of ZMs significantly.
    Research Interests:
    In this research, an attempt to analyze images with the orthogonal Fourier-Mellin moments is conducted. It leads to the conclusions that the lower order of orthogonal Fourier-Mellin moments primarily contain the fundamental image... more
    In this research, an attempt to analyze images with the orthogonal Fourier-Mellin moments is conducted. It leads to the conclusions that the lower order of orthogonal Fourier-Mellin moments primarily contain the fundamental image information; the higher order moments preserve more detailed image information; and each finite set of the moments will contribute individually in the reconstruction process. We have also discovered that, for the orthogonal Fourier-Mellin moments, the radial order n and harmonic order m tend to contain more information on harmonic patterns and radial patterns, respectively.

    And 25 more