Y.Y. Tang’s research while affiliated with Concordia College 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 (86)


Linear discriminant relationship analysis between all classes and class specified for face recognition
  • Article

January 2013

·

7 Reads

International Journal of Applied Mathematics and Statistics

X. Wu

·

Y.Y. Tang

·

·

[...]

·

C. Xing

Class specified-based feature extraction method becomes an important reference in classification, such as common vector(CV) algorithm and class frequency analysis(CFA). CV algorithm does not consider the relationship among the different classes, but CFA does while only works on the frequency domain. Furthermore, we found that the relationship among different classes is also important in recognition task. To overcome the disadvantages mentioned above, we proposed an algorithm to adjust the relationship among subspaces of different classes, and at last achieved smaller within-class scatter in each class, larger between-class scatter and closer mean centers in the remaining classes. In the case, features of each class and the relationship with the remaining classes can be shown clearly in its the whole feature subspace. Moreover, it relieves the restriction in a same subspace. We also study the comparable problem in multiple subspaces and reorganize different subspaces in our objective function. The proposed algorithm is an important supplement to CFA and CV in linear discriminant relationship analysis. The experimental results show its advantages in orl and Extend yale B face database. Furthermore, the proposed method is not limited to face recognition, also can be extended to other image-based object recognition.


Edge extraction of images by reconstruction using wavelet decomposition details at different resolution levels

November 2011

·

101 Reads

·

26 Citations

This paper describes a novel method for edge feature detection of document images based on wavelet decomposition and reconstruction. By applying the wavelet decomposition technique, a document image becomes a wavelet representation, i.e. the image is decomposed into a set of wavelet approximation coefficients and wavelet detail coefficients. Discarding wavelet approximation, the edge extraction is implemented by means of the wavelet reconstruction technique. In consideration of the mutual frequency, overlapping will occur between wavelet approximation and wavelet details, a multiresolution-edge extraction with respect to an iterative reconstruction procedure is developed to ameliorate the quality of the reconstructed edges in this case. A novel combination of this multiresolution-edge results in clear final edges of the document images. This multi-resolution reconstruction procedure follows a coarser-to-finer searching strategy. The edge feature extraction is accompanied by an energy distribution estimation from which the levels of wavelet decomposition are adaptively controlled. Compared with the scheme of wavelet transform, our method does not incur any redundant operation. Therefore, the computational time and the memory requirement are less than those in wavelet transform.


OFFLINE SIGNATURE VERIFICATION BY THE ANALYSIS OF CURSIVE STROKES
  • Article
  • Publisher preview available

November 2011

·

816 Reads

·

4 Citations

In this paper, a method is proposed for offline signature verification. It is based on a smoothness criterion. It is observed that the cursive segments of forgery signatures are generally less smooth and less natural than the genuine ones, especially for those signatures that consist of cursive graphic patterns. Two approaches are proposed to extract a smoothness feature: a crossing method and a fractal dimension method. When the proposed smoothness feature is combined with other global shape features for signature verification, satisfactory results are obtained.

View access options

AN IMPROVED EMBEDDED ZEROTREE WAVELET IMAGE CODING METHOD BASED ON COEFFICIENT PARTITIONING USING MORPHOLOGICAL OPERATION

November 2011

·

3 Reads

·

3 Citations

In recent years, wavelets have attracted great attention in both still image compression and video coding, and several novel wavelet-based image compression algorithms have been developed so far, one of which is Shapiro's embedded zerotree wavelet (EZW) image compression algorithm. However, there are still some deficiencies in this algorithm. In this paper, after the analysis of the deficiency in EZW, a new algorithm based on quantized coefficient partitioning using morphological operation is proposed. Instead of encoding the coefficients in each subband line-by-line, regions in which most of the quantized coefficients are significant are extracted by morphological dilation and encoded first. This is followed by using zerotrees to encode the remaining space which has mostly zeros. Experimental results show that the proposed algorithm is not only superior to the EZW, but also compares favorably with the most efficient wavelet-based image compression algorithms reported so far.


SHAPE TRANSFORMATION MODELS AND THEIR APPLICATIONS IN PATTERN RECOGNITION

November 2011

·

18 Reads

·

3 Citations

This paper presents linear and bilinear shape transformations including basic transformations, analyzes their geometric properties, and provides computer algorithms. The shape transformations can be used to simplify the recognition of Roman letters, Chinese characters and other pictorial patterns by normalizing their shapes to the standard forms. Important theoretical analyses have been performed to illustrate that the linear and bilinear transformations are applicable to computer recognition of digitized patterns. A number of pictorial examples have been computed to confirm the analyses and conclusions made.




Skeletonization of ribbon-like shapes based on local minimum modules of wavelet transform

December 2007

·

14 Reads

·

5 Citations

In this paper, we propose a novel singularity location method to extract the skeleton of a ribbon-like shape based on wavelet maxima. The image firstly is decomposed by a new wavelet transform; then the strict local minima is computed; finally, filter the value of wavelet minima with a predefined threshold to obtain the final skeleton. The framework of our method based on above three steps is very simple with the same computation complexity with the wavelet maxima. The experimental results show that our method is a "good" method closing to human conception.


An Affine Invariant Eulidean Distance Between Images

September 2006

·

15 Reads

·

3 Citations

In this paper, we propose a novel affine invariant Euclidean distance of images, named annulus Euclidean distance (AED). Unlike the traditional Euclidean distance, the AED takes into account the spatial correlation between images. Therefore, it is invariant to the scale, rotation and shift transformation for images. The method is motivated that the annulus is intuitively rotation invariant, then combined with the centralization and normalization of the images, the AED is variant to affine transformation (AT). The key advantage of this distance is that it is a simple and tractable way to measure the difference between images with some deformations. Some examples in optical character recognition (OCR) and texture retrieval are presented to show the power of the AED. Experimental results demonstrate that the AED is a simple, efficient and powerful way to measure the difference between images


A Statistical Image Fusion Scheme for Multi Focus Applications

May 2006

·

18 Reads

Lecture Notes in Computer Science

In this paper, we propose a statistical scheme to judge the activity level measurement (ALM) that is based on wavelet-domain hidden Markov model (WD-HMM) and maximum likelihood (MLK). The source images are firstly decomposed by the wavelets and only the coefficients in the high frequency (HH) are utilized. Considering the shift-variance of wavelets, the merged image is obtained from the source images directly. The regions of each source image are obtained by the Hough transform (HT) and their ALM are decided by the ALM of their coefficients in HH according to MLK. Finally, two multi focus images are merged by our new framework. The fusion results show the high ability of our scheme in preserving edge information and avoiding shift-variant.


Citations (51)


... We have devoted great efforts to splitting algorithms in Step III (see [13,14]) and harmonic transformations by numerical methods in Step II (see [12]). This paper will focus on ...

Reference:

Face Boundary Formulation for Harmonic Models: Face Image Resembling
Computer Transformation of Digital Images and Patterns
  • Citing Book
  • November 2011

... Some algorithms also require segmentation, for instance into "components" that are perceptually significant according to a motor model. Features can be extracted from the preprocessed signature, which can then be represented according to two broad paradigms [2,3]: in the function-oriented paradigm signals, extracted from signature data are considered as functions of time, the values of which directly constitute the feature vectors; in the parametric paradigm, local or global parameters are computed from the measured signals and used as features. Local parameters represent properties of sampling points, pen strokes, or components and can be extracted from local segments of the signature; examples of local parameters are the starting angle at initial pen-down, a segment's local radius of curvature, etc. ...

An Efficient Function-based On-line Signature Recognition System
  • Citing Chapter
  • June 1999

... Tang [40] first proposed the method of ring projection for converting 2-D patterns to 1-D patterns, thus, reducing the large pattern into a smaller dimension for feature extraction. Ring projection is utilised in this work for transforming 2-D voltage image into 1-D voltage information by projecting the pixels along circles. ...

Transformation-ring-projection (TRP) algorithm and its VLSI implementation
  • Citing Article
  • January 1991

... Random numbers can be generated using the Lévy flight method by obtaining the directional details of the Lévy flight with the help of a uniform distribution. These random numbers are used to implement the concept of random walk in the cuckoo search procedure by computing the step size that follows the Lévy distribution (Siswantoro, 2013) and the step size is computed by applying the Mategna's method (Mantegna, 1994) to reduce the computational burden (Yang & Deb, 2009 p is a constant and 2 0 p  . The iteration count and the count of the random points are represented by the 3 p and 4 p respectively. ...

Editorial: Intelligent computing and applications
  • Citing Article
  • March 2006

International Journal of Pattern Recognition and Artificial Intelligence

... In the last 20 years, several attempts have been reported, such as Curvelets, Complex wavelets, Composite wavelets, Shearlets, Grouplets, and Bandelets, to fulfil wavelet decompositions in higher dimensions. An interested reader can also refer the applications in time series analysis [47,44,45], signal processing [59,36], image processing [24,49,38], statistics [2,1,60,48] and some others in [31,52,63,30,29,34]. Some outstanding review works that include mathematical aspects of wavelets is found in [9,54,55,11,10,61,62,41]. ...

Wavelet Theory and Its Application to Pattern Recognition
  • Citing Article
  • January 2000

... Laplacian is precise in locating image step edge points, but it is highly sensitive to noise and prone to producing detection edges with discontinuities; Canny is not easily affected 2 of 12 by noise and can detect the real weak edges, but it often loses the high-frequency edge information in its anti-noise process. Other image edge detection methods include fuzzy edge detection [9], neural network edge detection [10], and wavelet edge detection [11], among others. Fractional-order calculus is obtained by changing its order to a fraction based on integer-order calculus. ...

Edge extraction of images by reconstruction using wavelet decomposition details at different resolution levels
  • Citing Article
  • November 2011

... Consequently, a number of amazing results have been obtained. Several efficient discrete algorithms, such as SSM, SIM, CSIM, CIIM, etc., have been developed and many fascinating applications have been found, see[27,[35][36][37][38][39][40][41][42]. Since 1993, our efforts have ...

SHAPE TRANSFORMATION MODELS AND THEIR APPLICATIONS IN PATTERN RECOGNITION
  • Citing Article
  • November 2011

... However, this codec architecture does not produce an embedded bit-stream, since good R-D performance are also due to a pre-processing stage which eliminates all isolated significant coefficients, whose positions are too expensive to code; moreover, in [4], the assessment accuracy of cluster boundaries is conceived as a static tradeoff between structuring element extent and related bit cost. The extent of the structuring elements is also an issue related to the performance of the embedded approaches proposed by Zhong et al. in [5,6,7]. In [8] we presented a coding technique called Embedded Morphological Dilation Coding for 2D and 3D data that we refined in [9]. ...

AN IMPROVED EMBEDDED ZEROTREE WAVELET IMAGE CODING METHOD BASED ON COEFFICIENT PARTITIONING USING MORPHOLOGICAL OPERATION
  • Citing Article
  • November 2011