#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2012

2016

- This year (0)
- Last 5 years (13)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Method

Learn More

- Selvaraaju Murugesan, David B. H. Tay
- ISCAS
- 2012

- Selvaraaju Murugesan, David B. H. Tay
- IEEE Trans. on Circuits and Systems
- 2012

- David B. H. Tay, Selvaraaju Murugesan
- Digital Signal Processing
- 2014

- Selvaraaju Murugesan, David B. H. Tay
- IEEE Transactions on Image Processing
- 2012

It is a well-known fact that (compact-support) dyadic wavelets [based on the two channel filter banks (FBs)] cannot be simultaneously orthogonal and symmetric. Although orthogonal wavelets have the energy preservation property, biorthogonal wavelets are preferred in image processing applications because of their symmetric property. In this paper, a novel… (More)

- Selvaraaju Murugesan, David B. H. Tay, Ira R Cooke, Pierre Faou
- Comp. in Bio. and Med.
- 2015

Mass Spectrometry (MS) is a widely used technique in molecular biology for high throughput identification and sequencing of peptides (and proteins). Tandem mass spectrometry (MS/MS) is a specialised mass spectrometry technique whereby the sequence of peptides can be determined. Preprocessing of the MS/MS data is indispensable before performing any… (More)

- David B. H. Tay, Zhiping Lin, Selvaraaju Murugesan
- IEEE Signal Processing Letters
- 2014

For a time-limited sequence, the Root-Mean-Square (RMS) bandwidth is the normalized second moment of the spectrum. The RMS bandwidth is a useful and analytically tractable measure of the frequency localization of a discrete-time filter. In this work the design of orthogonal wavelet filter banks with a prescribed number of Vanishing Moment (VM) and having a… (More)

- Selvaraaju Murugesan, David B. H. Tay
- Signal Processing
- 2014

A 3-equitable prime cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, ..., |V |} such that if an edge uv is assigned the label 1 if gcd(f(u), f(v)) = 1 and gcd(f(u) + f(v), f(u)−f(v)) = 1, the label 2 if gcd(f(u), f(v)) = 1 and gcd(f(u) + f(v), f(u)− f(v)) = 2 and 0 otherwise, then the number of edges labeled with i and the… (More)

- Selvaraaju Murugesan, Dheepakkumaran Jayaraman, +6 authors S. Navaneethakrishnan
- 2013

A square divisor cordial labeling of a graph G with vertex set V is a bijection f from V to f1; 2; : : : ; j V jg such that if each edge uv is assigned the label 1 if [f (u)]2jf (v) or [f (v)]2jf (u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1. If a graph has a square divisor cordial… (More)

A (p,q) graph G is said to admit n order triangular sum labeling if its vertices can be labeled by non negative integers such that the induced edge labels obtained by the sum of the labels of end vertices are the first q n order triangular numbers. A graph G which admits n order triangular sum labeling is called n order triangular sum graph. In this paper… (More)