Publications
Topics: Sampling Theory and Applications | Biomedical Signal and Image Processing | Array Signal Processing | Linguistics and Speech Processing | Watermarking | Perceptual Quality | Optimization | Miscellaneous
Years: 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2002 | 2001 | 2000 | 1999 | 1996 | all
Type: Journals | Conferences | Thesis | Patents
| Zhang, K., Lu, W., Marziliano, P. (2013), "The Unified Estreme Learning Machines and Discriminative Random Fields for Automatic Knee Cartilage and Meniscus Segmentation from Multi-Contrast MR Images ",
Machine Vision and Applications
|
| Abstract: Segmenting articular cartilage and meniscus from magnetic resonance (MR) images is an essential task for the assessment of knee pathology. Most of the previous classification based works for cartilage and meniscus segmentation only rely on independent labellings by a classifier, but do not consider the spatial context interaction. The labels of most image voxels are actually dependent upon their neighbours. In this study, we present an automatic knee segmentation system working on multi-contrast MR images where a novel classification model unifying an extreme learning machine (ELM)-based association potential and a discriminative random field (DRF)-based interaction potential is proposed. The DRF model introduces spatial dependencies between neighbouring voxels to the independent ELM classification. We exploit a rich set of features from multi-contrast MR images to train the proposed classification model and perform the loopy belief propagation for the inference. The proposed model is evaluated on multi-contrast MR datasets acquired from 11 subjects with results outperforming the independent classifiers in terms of segmentation accuracy of both cartilages and menisci. |
BibTeX:
@article{ZhangLM2013,
author = { Zhang, K., Lu, W., Marziliano, P.},
title = {The Unified Estreme Learning Machines and Discriminative Random Fields for Automatic Knee Cartilage and Meniscus Segmentation from Multi-Contrast MR Images },
journal = {Machine Vision and Applications},
year = {2013},
issue={}
volume = {},
pages = { },
doi = { }
}
biomed_ |
| Amin, T. B., Marziliano, P., German, J.S. (2012), "Nine voices, one artist: Linguistic and Acoustic Analysis",
IEEE International Conference on Multimedia & Expo, pp. 450-454, July 9-13, 2012
(Top 11%, 30% acceptance rate).
|
| Abstract: Voice impersonators possess a flexible voice and thus can change their voice identity.They are able to imitate various people and characters which differ in age, gender, accent and voice quality. State of the art electronic voice conversion systems are not able to successfully mimic their human counterparts as they lack naturalness. To understand why human impersonators are successful and what parameters they rely on to change their voice, we analyze nine voices produced by a professional voice impersonator. We compute different acoustical measures and discuss their linguistic implications. The acoustical measures include pitch, speech rate and formant frequencies. Our results show that differences in the voice identity features such as age and gender are reflected in the acoustic parameters of the impersonations. The analysis is distinguished from previous studies on impersonators in giving full consideration to voice identity features. |
BibTeX:
@inproceedings{AminMG2012,
author = {Amin, T. B., Marziliano, P., German, J. S.},
title = {Nine voices, one artist: Linguistic and Acoustic Ananlysis},
booktitle = {In Proc. IEEE International Conference on Multimedia & Expo},
year = {2012},
volume = {},
pages = {450-454},
doi = { 10.1109/ICME.2012.142}
}
speech_ |
| Chen C., Marziliano, P., Kot, A. C. (2012), "2D Finite Rate of Innovation Reconstruction Method for Step Edge and Polygon Signals in the Presence of Noise ",
IEEE Transactions on Signal Processing, Vol. 60, pp. 2851-2859, June, 2012
|
| Abstract: Finite Rate of Innovation (FRI) principle is developed for sampling a class of non-bandlimited signals that have a finite number of degrees of freedom per unit of time, i.e., signals with FRI. This sampling scheme is later extended to three classes of sampling kernels with compact support and applied to the step edge reconstruction problem by treating the image row by row. In this paper, we regard step edges as 2D FRI signals and reconstruct them block by block. The step edge parameters are obtained from the 2D moments of a given image block. Experimentally, our technique can reconstruct the edge more precisely and track the Cramer-Rao Bounds (CRB) closely with Signal-to-Noise (SNR) larger than 4 dB on synthetic step edge images. Experiments on real images show that our proposed method can reconstruct the step edges under practical conditions, i.e., in the presence of various types of noise and using a real sampling kernel. The results on locating the corners of data matrix barcodes using our method also outperform some state-of- the-art barcode decoders. |
BibTeX:
@article{ChenMK2012b,
author = {Chen C., Marziliano, P., Kot, A. C. },
title = {2D Finite Rate of Innovation Reconstruction Method for Step Edge and Polygon Signals in the Presence of Noise},
journal = {IEEE Transactions on Signal Processing},
year = {2012},
issue={6}
volume = {60},
pages = {2851 - 2859 },
doi = {10.1109/TSP.2012.2189391 }
}
samplingtheory_ |
| Chen C., Marziliano, P., Kot, A. C. (2012), "Step-edge Reconstruction Using 2D Finite Rate of Innovation Principle",
In Proc. IEEE International Conference on Acoustics, Speech and Signal Processing, pp.3833-3836, March 25-30, 2012.
|
| Abstract: Parametric signals that have a finite number of degrees of freedom per unit of time are defined as signals with Finite Rate of Innovation (FRI) . Sampling and reconstruction schemes have been developed based on the 1D FRI principle and applied to reconstructing step edge images on a row by row basis. In this paper, we derive the 2D FRI principle by exploiting the separability of the B-spline sampling kernel. The proposed 2D FRI principle regards the sampling and reconstruction as block by block operations. The step-edge parameters can be retrieved in high accuracy with no post-processing. The performance on synthetic images shows that our proposed technique is more precise than the row by row approaches on Signal-to-Noise Ratio (SNR) levels larger than 4 dB. Experimental results on real images demonstrate that the proposed method can reconstruct the step-edge precisely under noisy and practical sampling conditions. |
BibTeX:
@inproceedings{ChenMK2012a,
author = {Chen C., Marziliano, P., Kot, A. C. },
title = {Step-edge Reconstruction Using 2D Finite Rate of Innovation Principle},
booktitle = {Proc. IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2012},
volume = {3},
pages = {3833-3836},
doi = { 10.1109/ICASSP.2012.6288753 }
}
samplingtheory_ |
| Tian, J., Marziliano, P., Mani, B., Wong, H-T., Aung T. (2011), "Automatic Anterior Chamber Angle Assessment in HD-OCT images", IEEE Transactions on Biomedical Engineering,
58 (11) pp. 3042-3049
|
| Abstract: Angle closure glaucoma is a major blinding eye disease and could be detected by measuring the anterior chamber angle in the human eyes. High-definition OCT (CirrusTM HD-OCT) is an emerging non-invasive, high-speed, and highresolution imaging modality for the anterior segment of the eye. Here we propose a novel algorithm which automatically detects a new landmark, Schwalbe’s line, and measures the anterior chamber angle in the HD-OCT images. The distortion caused by refraction is corrected by dewarping the HD-OCT images and three biometric measurements are defined to quantitatively assess the anterior Chamber angle. The proposed algorithm was tested on 40 HD-OCT images of the eye and provided accurate measurements in about 1 second. |
BibTeX:
@article{TianMMWA2011,
author = { Tian, J., Marziliano, P., Mani, B., Wong, H-T., Aung T.},
title = {Automatic Anterior Chamber Angle Assessment in HD-OCT images},
journal = {IEEE Transactions on Biomedical Engineering},
year = {2011},
pages = {3042--3049},
doi = {}
}
biomed_ |
| Deslauriers-Gauthier, S., Marziliano, P., Tan, C. H.(2011), "Application of Finite Rate of Innovation Methods to the Reconstruction of Magnetic Resonance Image of the Liver
; 9th International Conference on Sampling Theory and Applications, May 2-6, 2011.
|
| Abstract: We present a new magnetic resonance image reconstruction technique based on methods for sampling and reconstruction of signals with a finite rate of innovation. The main advantages of the proposed reconstruction technique are its computational efficiency and the use of a conventional sampling scheme. In this work, we highlight the main ideas behind the approach and show the results obtained on the Shepp-Logan phantom. Preliminary results obtained on two clinical images of the liver are also presented. |
BibTeX:
@inproceedings{DeslauriersMT2011,
author = {Samuel Deslauriers-Gauthier, Pina Marziliano, Cher Heng Tan},
title = {Application of Finite Rate of Innovation Methods to the Reconstruction of Magnetic Resonance Image of the Liver},
booktitle = {9th International Conference on Sampling Theory and Applications},
month= {May}
year = {2011},
pages = {},
doi = {}
}
biomed_ |
| Deslauriers-Gauthier, S., Marziliano, P., (2011), "Magnetic
resonance image reconstruction using the annihilating filter method", 2011 IEEE International Symposium on Biomedical Imaging, March 30-April, 2011.
|
| Abstract: Compressed sensing reconstruction algorithms exploit the sparsity of MRI images to significantly undersample the k-space. However, these algorithms are computationally expensive, may be slow to converge, and perform best when the samples are randomly selected. We propose a new sparse reconstruction algorithm based on the annihilating filter method to palliate these issues. This new method is non iterative and does not require random sampling. We demonstrate that our technique outperforms the basis pursuit theoretical limit for very sparse signals. As an application, we show clinical MRI images reconstructed using our method.. |
BibTeX:
@inproceedings{DeslauriersM2011,
author = {Samuel Deslauriers-Gauthier, Pina Marziliano},
title = {Magnetic resonance image reconstruction using the annihilating filter method},
booktitle = {IEEE International Symposium on Biomedical Imaging},
month= {March}
year = {2011},
pages = {},
doi = {}
}
biomed_ |
| Tian, J., Marziliano, P., & Wong, H-T. (2010), "Automatic detection of Schwalbe's line in the anterior chamber angle of the eye using HD-OCT images",
In Proc. 32nd Annual International Conference of the IEEE Engineering in Medicine and Biology Society, pp.3013-3016, 2010.
|
| Abstract: Angle-closure glaucoma is a major cause of blindness in Asia and could be detected by measuring the anterior chamber angle (ACA) using gonioscopy, ultrasound biomicroscopy or anterior segment (AS) optical coherence tomography (OCT). The current software in the VisanteTM OCT system by Zeiss is based on manual labeling of the scleral spur, cornea and iris and is a tedious process for ophthalmologists. Furthermore, the scleral spur can not be identified in about 20% to 30% of OCT images and thus measurements of the ACA are not reliable. However, high definition (HD) OCT has identified a more consistent landmark: Schwalbe's line. This paper presents a novel algorithm which automatically detects Schwalbe's line in HD-OCT scans. The average deviation between the values detected using our algorithm and those labeled by the ophthalmologist is less than 0.5% and 0.35% in the horizontal and vertical image dimension, respectively. Furthermore, we propose a new measurement to quantify ACA which is defined as Schwalbe's line bounded area (SLBA). |
BibTeX:
@inproceedings{TianMW2010,
author = {Tian, J., Marziliano,P.,& Wong, H-T },
title = {Automatic detection of Schwalbe's line in the anterior chamber angle of the eye using HD-OCT images},
booktitle = {Proc. 32nd Annual International Conference of the Engineering in Medicine and Biology Society },
year = {2010},
pages = {3013 - 3016},
doi = {http://dx.doi.org/10.1109/IEMBS.2010.5626167}
}
biomed_ |
| Bhandari, A. & Marziliano, P. (2010), "Sampling and Reconstruction of Sparse Signals in Fractional Fourier Domain", IEEE Signal Processing Letters, March 2010.
|
| Abstract: Sampling theory for continuous time signals which have a bandlimited representation in fractional Fourier transform (FrFT) domain—a transformation which generalizes the conventional Fourier transform—has blossomed in the recent past. The mechanistic principles behind Shannon’s sampling theorem for fractional bandlimited (or fractional Fourier bandlimited) signals are the same as for the Fourier domain case i.e. sampling (and reconstruction) in FrFT domain can be seen as an orthogonal projection of a signal onto a subspace of fractional bandlimited signals. As neat as this extension of Shannon’s framework is, it inherits the same fundamental limitation that is prevalent in Fourier regime—what happens if the signals have singularities in the time domain (or the signal has a nonbandlimited spectrum)? In this paper, we propose a uniform sampling and reconstruction scheme for a class of signals which are nonbandlimited in FrFT sense. Specifically, we assume that samples of a smoothed version of a periodic stream of Diracs are accessible (which is sparse in time-domain). In its parametric form, this signal has a finite number of degrees of freedom per unit time. Based on the representation of this signal in FrFT domain, we derive conditions under which exact recovery of parameters of the signal is possible. Knowledge of these parameters leads to exact reconstruction of original signal. |
BibTeX:
@article{Bhan2010b,
author = {Bhandari, A. & Marziliano, P.},
title = {Sampling and Reconstruction of Sparse Signals in Fractional Fourier Domain},
journal = {IEEE Signal Processing Letters},
year = {2010}
}
samplingtheory_ |
| Bhandari, A. & Marziliano, P. (2010), "Fractional Delay Filters Based on Generalized Cardinal Exponential Splines", IEEE Signal Processing Letters, March 2010.
|
| Abstract: Fractional delay filters (FDFs) play an important role in certain areas of digital signal processing and communication engineering, where it is desirable to generate delays that are of the order of a fraction of the sampling period. In this paper, we advocate the use of generalized cardinal exponential splines—a class of compactly supported functions that is much richer than the existing B-spline family—for designing precision FDFs. One advantage of using generalized cardinal exponential splines is that it provides ready access to several spline families and other kernels which could be used for FDF design. The B-spline and Lagrange interpolator based FDFs are a special case of our proposition. We also discuss a design example and show that it is possible to design filters that have lower interpolation errors as compared to its B-spline counterparts. |
BibTeX:
@article{Bhan2010a,
author = {Bhandari, A. & Marziliano, P.},
title = {Fractional Delay Filters Based on Generalized Cardinal Exponential Splines},
journal = {IEEE Signal Processing Letters},
year = {2010}
}
misce_ |
| Poh, K.-K. & Marziliano, P. (2010), "Compressive sampling of EEG signals with finite rate of innovation", EURASIP Journal on Advances in Signal Processing, vol. 2010, Article ID 183105, February 2010. doi:10.1155/2010/183105 .
|
| Abstract: Analyses of electroencephalographic signals and subsequent diagnoses can only be done effectively on long term recordings that preserve the signals' morphologies. Currently, electroencephalographic signals are obtained at Nyquist rate or higher, thus introducing redundancies. Existing compression methods remove these redundancies, thereby achieving compression. We propose an alternative compression scheme based on a sampling theory developed for signals with a finite rate of innovation (FRI) which compresses electroencephalographic signals during acquisition. We model the signals as FRI signals and then sample them at their rate of innovation. The signals are thus effectively represented by a small set of Fourier coefficients corresponding to the signals' rate of innovation. Using the FRI theory, original signals can be reconstructed using this set of coefficients. Seventy-two hours of electroencephalographic recording are tested and results based on metrices used in compression literature and morphological similarities of electroencephalographic signals are presented. The proposed method achieves results comparable to that of wavelet compression methods, achieving low reconstruction errors while preserving the morphologiies of the signals. More importantly, it introduces a new framework to acquire electroencephalographic signals at their rate of innovation, thus entailing a less costly low-rate sampling device that does not waste precious computational resources. |
BibTeX:
@article{Poh2010a,
author = {Poh, K.-K. & Marziliano, P.},
title = {Compressive sampling of EEG signals with finite rate of innovation},
journal = {EURASIP Journal on Advances in Signal Processing},
year = {2010}
}
biomed_ |
| Bhandari, A., Marziliano, P. & Munoz Barrutia, A. (2009), "Need for Speed: Fast Stockwell Transform (FST) with O(N) Complexity", IEEE International Conference on Information, Communications and Signal Processing, Macau, December 2009
|
| Abstract: In this paper, we propose two fast, spline based, algorithms for computing the Stockwell Transform or the Stransform. It is a redundant, time-frequency representation that has certain desirable features which make it an attractive choice for signal analysis in different areas and motivated by its diverse applications, we seek to reduce its computational complexity. The S-transform bears an acute resemblance with the Gabor transform and can also be associated to the Continuous Wavelet Transform (CWT). Our formulation is based on the above mentioned connectivity with the two classical time-frequency tools. What singles out our approach is that it is recursive in nature and leads to a complexity of O(N)–for arbitrary scales, independent of scale of window. |
BibTeX:
@inproceedings{Bhan2009a,
author = {Bhandari, A., Marziliano, P., Munoz Barrutia, A.},
title = {Need for Speed: Fast Stockwell Transform (FST) with O(N) Complexity},
year = {2009}
}
misce_ |
| Bhandari, A. & Marziliano, P. (2009), "Sampling Sparse Signals in Fractional Fourier Domain", Sampling Theory and Applications (SampTA) Conference, Marseille, May 2009
|
| Abstract: In this paper, we formulate the problem of sampling sparse signals in fractional Fourier domain. The fractional Fourier transform (FrFT) can be seen as a generalization of the classical Fourier transform. Extension of Shannon’s sampling theorem to the class of signals which are fractional bandlimited shows its association to a Nyquist-like bound. Thus proving that signals that have a non-bandlimited representation in FrFT domain cannot be sampled. We prove that under suitable conditions, it is possible to sample sparse (in time) signals by using the Finite Rate of Innovation (FRI) signal model. In particular, we propose a uniform sampling and reconstruction procedure for a periodic stream of Diracs, which have a nonbandlimited representation in FrFT domain. This generalizes the FRI sampling and reconstruction scheme in the Fourier domain to the FrFT domain. |
BibTeX:
@inproceedings{Bhan2009b,
author = {Bhandari, A. and Marziliano, P.},
title = {Sampling Sparse Signals in Fractional Fourier Domain},
year = {2009}
}
samplingtheory_ |
| Blu, T., Dragotti, P.L., Vetterli, M., Marziliano, P. & Coulot, L. (2008), "Sparse Sampling of Signal Innovations",
IEEE Signal Processing Magazine, Vol. 25(2), pp. 31-40, 2008.
|
| Abstract: Sparse sampling of continuous-time sparse signals is addressed. In particular, it is shown that sampling at the rate of innovation is possible, in some sense applying Occam's razor to the sampling of sparse signals. The noisy case is analyzed and solved, proposing methods reaching the optimal performance given by the Cramer-Rao bounds. Finally, a number of applications have been discussed where sparsity can be taken advantage of. The comprehensive coverage given in this article should lead to further research in sparse sampling, as well as new applications. One main application to use the theory presented in this article is ultra-wide band (UWB) communications. |
BibTeX:
@article{Blu2008a,
author = {Blu, T. and Dragotti, P. -L. and Vetterli, M. and Marziliano, P. and Coulot, L.},
title = {Sparse Sampling of Signal Innovations},
journal = {IEEE Signal Processing Magazine},
year = {2008},
volume = {25},
number = {2},
pages = {31--40},
doi = {http://dx.doi.org/10.1109/MSP.2007.914998}
}
samplingtheory_ |
| Ho, A.T.S., Zhu, X., Shen, J. & Marziliano, P. (2008), "Fragile Watermarking Based on Encoding of the Zeroes of the
|
| Abstract: |
BibTeX:
@article{Ho2008a,
author = {Ho, A. T. S. and Zhu, Xunzhan and Shen, Jun and Marziliano, P.},
title = {Fragile Watermarking Based on Encoding of the Zeroes of the watermarking_ |
| Poh, K.-K. & Marziliano, P. (2008), "Compression of neonatal EEG seizure signals with finite rate of innovation", In Proc. IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 433-436,
2008.
|
| Abstract: Analyses of neonatal EEG seizures and subsequent diagnoses can only be done effectively on long-term recordings on the condition that the morphology of the EEG signals are retained. Therefore, a reliable, accurate and efficient compression and reconstruction technique is necessary to store and retrieve the data. In this paper, we propose a new compression technique for neonatal EEG seizure signals via sampling theory developed for signals with a finite rate of innovation. Firstly, the EEG seizure signals are modeled as periodic nonuniform linear splines. Next, through the sampling and reconstruction scheme developed for signals with finite rate of innovation, we show that neonatal EEG seizure signals can be highly compressed while preserving their morphologies. |
BibTeX:
@inproceedings{Poh2008a,
author = {Poh, Kok-Kiong and Marziliano, P. },
title = {Compression of neonatal EEG seizure signals with finite rate of innovation},
booktitle = {Proc. IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2008},
pages = {433--436},
doi = {http://dx.doi.org/10.1109/ICASSP.2008.4517639}
}
biomed_ |
| Marziliano, P. (2007), "Reproducible Research: A Case Study of Sampling Signals with Finite Rate of Innovation", In Proc. IEEE International Conference on Acoustics, Speech and Signal Processing, Vol. 4, pp. 1265-1268,
2007.
|
| Abstract: A case study on reproducible research in sampling theory of signals containing a finite rate of innovation is the topic of this paper. By building a solid research which is furthermore reproducible enables the researcher to build intuition in a research area and to progress at a much faster pace. Here, we show that the founding problem of sampling and exact reconstruction of periodic streams of Dirac pulse will be the basis of the sampling theory for signals with finite rate of innovation. The sampling theory can be extended to other signals such as piecewise polynomials, bandlimited signals with additive shot noise and the sum of bandlimited signals with piecewise polynomial signals. It is shown that the implementation is based on the one for streams of Dirac pulses, thus making the new research reproducible as well |
BibTeX:
@inproceedings{Marziliano2007a,
author = {Marziliano, P. },
title = {Reproducible Research: A Case Study of Sampling Signals with Finite Rate of Innovation},
booktitle = {Proc. IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2007},
volume = {4},
pages = {1265--1268},
doi = {http://dx.doi.org/10.1109/ICASSP.2007.367307}
}
samplingtheory_ |
| Poh, K.-K. & Marziliano, P. (2007), "Analysis of Neonatal EEG Signals using Stockwell Transform", In Proc. 29th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, pp. 594-597,
2007.
|
| Abstract: In this paper, we investigate the Stockwell transform, a linear time-frequency spectral localisation technique, on non-stationary, multicomponent neonatal seizure EEG signals. The seizure signals of interest are namely slow wave and sharp spike seizures. The performance of Stockwell transform is compared to that of existing quadratic time-frequency representation, namely the Choi-Williams Distribution and the B Distribution, on both simulated and real EEG seizure signals. The results show that the Stockwell Transform yields distinctive, interference free time-frequency patterns corresponding to the neonatal EEG seizure signals. By capturing both high- frequency spike components and predominantly low frequency components of neonatal seizures concurrently and accurately, the Stockwell Transform is able to distinguish these two types of neonatal seizure signals with unique signatures. These signatures can then be effectively used for seizure modelling, detection and prediction. |
BibTeX:
@inproceedings{Poh2007a,
author = {Poh, Kok-Kiong and Marziliano, P. },
title = {Analysis of Neonatal EEG Signals using Stockwell Transform},
booktitle = {Proc. 29th Annual International Conference of the IEEE Engineering in Medicine and Biology Society},
year = {2007},
pages = {594--597},
doi = {http://dx.doi.org/10.1109/IEMBS.2007.4352360}
}
biomed_ |
| Zhang, J., Ho, A.T.S., Qiu, G. & Marziliano, P. (2007), "Robust Video Watermarking of H.264/AVC", IEEE Transactions on Circuits and Systems II: Express Briefs. Vol. 54,
no.2, pp. 205-209, 2007.
|
| Abstract: A robust video watermarking scheme of the state-of-the-art video coding standard H.264/AVC is proposed in this brief. 2-D 8-bit watermarks such as detailed company trademarks or logos can be used as inconvertible watermark for copyright protection. A grayscale watermark pattern is first modified to accommodate the H.264/AVC computational constraints, and then embedded into video data in the compressed domain. With the proposed method, the video watermarking scheme can achieve high robustness and good visual quality without increasing the overall bit-rate. Experimental results show that our algorithm can robustly survive transcoding process and strong common signal processing attacks, such as bit-rate reduction, Gaussian filtering and contrast enhancement |
BibTeX:
@article{Zhang2007a,
author = {Zhang, Jing and Ho, Anthony T. S. and Qiu, Gang and Marziliano, Pina},
title = {Robust Video Watermarking of H.264/AVC},
journal = {IEEE Transactions on Circuits and Systems II: Express Briefs},
year = {2007},
volume = {54},
number = {2},
pages = {205--209},
doi = {http://dx.doi.org/10.1109/TCSII.2006.886247}
}
watermarking_ |
| Vetterli, M., Marziliano, P. & Blu, T. (2007), "Sampling Method, Reconstruction Method, and Device for Sampling and/or Reconstructing Signals". WO/2002/078197, EP20020718204, US2007/0143078 A1
|
BibTeX:
@patent{PinaPatent1,
author = {Vetterli, M., Marziliano, P. & Blu, T.},
title = {Sampling Method, Reconstruction Method, and Device for Sampling and/or Reconstructing Signals},
company = {Qualcomm Inc.},
year = {2007},
links = http://www.prnewswire.co.uk/cgi/news/release?id=215181samplingtheory_ |
| Marziliano, P., Vetterli, M. & Blu, T. (2006), "Sampling and exact reconstruction of bandlimited signals with additive shot noise", IEEE Transactions on Information Theory, Vol. 52(5), pp. 2230-2233,
2006.
|
| Abstract: In this correspondence, we consider sampling continuous-time periodic bandlimited signals which contain additive shot noise. The classical sampling scheme does not perfectly recover these particular nonbandlimited signals but only reconstructs a lowpass filtered approximation. By modeling the shot noise as a stream of Dirac pulses, we first show that the sum of a bandlimited signal with a stream of Dirac pulses falls into the class of signals that contain a finite rate of innovation, that is, a finite number of degrees of freedom. Second, by taking into account the degrees of freedom of the bandlimited signal in the sampling and reconstruction scheme developed previously for streams of Dirac pulses, we derive a sampling and perfect reconstruction scheme for the bandlimited signal with additive shot noise. |
BibTeX:
@article{Marziliano2006a,
author = {Marziliano, P. and Vetterli, M. and Blu, T. },
title = {Sampling and exact reconstruction of bandlimited signals with additive shot noise},
journal = {IEEE Transactions on Information Theory},
year = {2006},
volume = {52},
number = {5},
pages = {2230--2233},
doi = {http://dx.doi.org/10.1109/TIT.2006.872844}
}
samplingtheory_ |
| Zhu, X., Ho, A.T.S. & Marziliano, P. (2006), "Image Authentication and Restoration Using Irregular Sampling for Traffic Enforcement Applications", In Proc. First International Conference on Innovative Computing, Information and Control, Vol. 3, pp. 62-65,
2006.
|
| Abstract: Traffic image sequences are important information for the purpose of traffic system control and traffic accidents surveillance, for example, the determination of offending vehicles. A semi-fragile watermarking method for the automatic authentication and restoration of traffic images using irregular sampling is described. Watermarks are embedded into the pinned field of the pinned sine transform (PST) of the original image, which reflects local malicious tampering on the texture of the image. When tampered blocks are detected, the restoration problem is formulated as an irregular sampling problem in approximation subspaces. These blocks are then reconstructed, making use of the information embedded in the same watermarked image, through iterative projections onto convex sets in approximation subspaces. The restoration process is a variant of the Papoulis- Gerchberg algorithm, and is robust to common image processing operations such as lossy transcoding and image filtering. |
BibTeX:
@inproceedings{Zhu2006a,
author = {Zhu, Xunzhan and Ho, A. T. S. and Marziliano, P. },
title = {Image Authentication and Restoration Using Irregular Sampling for Traffic Enforcement Applications},
booktitle = {Proc. First International Conference on Innovative Computing, Information and Control ICICIC '06},
year = {2006},
volume = {3},
pages = {62--65},
doi = {http://dx.doi.org/10.1109/ICICIC.2006.460}
}
watermarking_ |
| Hao, Y., Marziliano, P., Vetterli, M. & Blu, T. (2005), "Compression of ECG as a Signal with Finite Rate of Innovation", In Proc. 27th Annual International Conference of the
IEEE Engineering in Medicine and Biology Society, pp. 7564-7567, 2005.
|
| Abstract: Compression of ECG (electrocardiogram) as a signal with finite rate of innovation (FRI) is proposed in this paper. By modelling the ECG signal as the sum of bandlimited and nonuniform linear spline which contains finite rate of innovation (FRI), sampling theory is applied to achieve effective compression and reconstruction of ECG signal. The simulation results show that the performance of the algorithm is quite satisfactory in preserving the diagnostic information as compared to the classical sampling scheme which uses the sinc interpolation |
BibTeX:
@inproceedings{Hao2005a,
author = {Hao, Yanyan and Marziliano, P. and Vetterli, M. and Blu, T. },
title = {Compression of ECG as a Signal with Finite Rate of Innovation},
booktitle = {Proc. 27th Annual International Conference of the Engineering in Medicine and Biology Society },
year = {2005},
pages = {7564--7567},
doi = {http://dx.doi.org/10.1109/IEMBS.2005.1616262}
}
biomed_ |
| Lu, R., Marziliano, P. & Thng, C.H. (2005), "Liver Tumor Volume Estimation By Semi-Automatic Segmentation Method", In Proc. 27th Annual International Conference of the
IEEE Engineering in Medicine and Biology Society, pp. 3296-3299, 2005.
|
| Abstract: Liver cancer is one of the most popular cancer diseases and causes a large amount of death every year. In order to make decisions such as liver resections, doctors will need to know the tumor volume, and further, the functional liver volume. Thus, an important task in radiology is the determination of tumor volume. Accurate segmentation of liver tumor from an abdominal image is one of the most important steps in 3D representation for liver volume measurement, liver transplant, and treatment planning. Since manual segmentation is inconvenient, time consuming and depends on the individual operator to a large extent, automatic segmentation is much more preferred. In this paper, an active contour model is used to segment tumors from CT abdominal images. Initial boundary is manually placed by operators outside the tumor region. The snake deforms to the tumor boundary with the minimization of energy function. We then calculate the tumor volume using the series of segmented tumor slices. Results show that this method is quite efficient in tumor volume estimation compared with the WHO criteria, which measures the tumor by multiplying the longest perpendicular diameters |
BibTeX:
@inproceedings{Lu2005a,
author = {Lu, Rui and Marziliano, P. and Thng, Choon Hua},
title = {Liver Tumor Volume Estimation By Semi-Automatic Segmentation Method},
booktitle = {Proc. 27th Annual International Conference of the Engineering in Medicine and Biology Society},
year = {2005},
pages = {3296--3299},
doi = {http://dx.doi.org/10.1109/IEMBS.2005.1617181}
}
biomed_ |
| Hao, Y. & Marziliano, P. (2004), "An efficient wavelet-based pattern matching scheme for ECG data compression", In Proc. IEEE International Workshop on Biomedical Circuits and Systems, pp. S2/4-S5-8,
2004.
|
| Abstract: A novel coding scheme for ECG data compression is proposed in this paper. Following beat delineation, the periods of the beats are normalized by multi-rate processing. Amplitude normalization is performed afterwards, and discrete wavelet transform is applied to each normalized beat. Due to the period and amplitude normalization, the wavelet transform coefficients bear a high correlation across beats. To increase the compression ratio, a pattern matching unit is utilized. The difference between the actual period and the standard period, and amplitude scale factor are also retained for each beat. At the decoder, the inverse wavelet transform is computed from the reconstructed wavelet transform coefficients. The original amplitude and period of each beat are then recovered. The simulation results show that the performance of the proposed compression algorithm is quite satisfactory and achieves significant improvement in comparison with some recent techniques. |
BibTeX:
@inproceedings{Hao2004a,
author = {Hao, Yanyan and Marziliano, P. },
title = {An efficient wavelet-based pattern matching scheme for ECG data compression},
booktitle = {Proc. IEEE International Workshop on Biomedical Circuits and Systems},
year = {2004},
pages = {S2/4--S5-8},
doi = {http://dx.doi.org/10.1109/BIOCAS.2004.1454133}
}
biomed_ |
| Ho, A. T. S., Puhan, N. B., Makur, A., Marziliano, P. & Guan, Y. L. (2004), "Imperceptible data embedding in sharply-contrasted binary images", In Proc. ICARCV 2004 8th Control, Automation, Robotics and Vision Conference, Vol. 2, pp. 958-963, 2004.
|
| Abstract: Data embedding in sharply-contrasted binary images like text, drawing, signature and cartoon is a challenging issue due to simple pixel statistics in such images. Arbitrary modification to the pixels can be visually perceptible in the process of data embedding. The use of a valid perceptual model is important to minimize the effect of such visual distortion in binary images. In this paper, a novel perceptual model is used to embed significant amount of information such that the original and the marked images before and after data embedding process are perceptually similar. In our model, the distortion that occurs after flipping a pixel is estimated on the curvature-weighted distance difference (CWDD) measure between two contour segments. |
BibTeX:
@inproceedings{Ho2004c,
author = {Ho, A. T. S. and Puhan, N. B. and Makur, A. and Marziliano, P. and Guan, Y. L. },
title = {Imperceptible data embedding in sharply-contrasted binary images},
booktitle = {Proc. ICARCV 2004 8th Control, Automation, Robotics and Vision Conference},
year = {2004},
volume = {2},
pages = {958--963},
doi = {http://dx.doi.org/10.1109/ICARCV.2004.1468970}
}
watermarking_ |
| Ho, A.T.S., Puhan, N.B., Marziliano, P., Makur, A. & Guan, Y.L. (2004), "Perception based binary image watermarking", In Proc. International Symposium on Circuits and Systems, Vol. 2, pp.37-40,
2004.
|
| Abstract: The use of a suitable perceptual model is necessary to minimize visual distortion in marked images, because minor modifications to the pixels can be perceptible since the pixels are either black or white. In this paper, a new perceptual model is proposed for binary images that is useful for data hiding applications. In our model, the distortion that occurs after flipping a pixel is estimated on the novel curvature-weighted distance difference (CWDD) measure between two contour segments. Through subjective tests the perceptual measure is validated and highly correlated with human perception. |
BibTeX:
@inproceedings{Ho2004e,
author = {Ho, A. T. S. and Puhan, N. B. and Marziliano, P. and Makur, A. and Guan, Y. L. },
title = {Perception based binary image watermarking},
booktitle = {Proc. International Symposium on Circuits and Systems ISCAS '04},
year = {2004},
volume = {2},
pages = {37--40}
}
watermarking_ |
| Ho, A. T. S., Zhu, X., Guan, Y. L. & Marziliano, P. (2004), "Slant transform watermarking for textured images", In Proc. International Symposium on Circuits and Systems,
Vol. 5, pp. 700-703, 2004.
|
| Abstract: We propose a digital watermarking algorithm based on the Slant transform for the copyright protection of complex textured images. A lot of images in practical applications, such as remote sensing and medical archiving, contain complex textures. With more AC energies concentrating in the high frequency components, images with complex textures usually suffer more from common image processing operations than smooth images do. Therefore, watermarking robustness is more an issue for textured images though it is commonly recognized that highly textured images provide more capacity for data hiding without introducing too much degradation to the visual quality of original images. Experimental results showed that our Slant transform watermarking provides significant advantage for watermarking insertion and retrieval for images with complex textures such as satellite images. An analytical comparative study on the performance of the Slant transform adapting our earlier watermarking schemes for fast Hadamard transform will be performed based on its robustness against various Stirmark and Checkmark attacks. |
BibTeX:
@inproceedings{Ho2004d,
author = {Ho, A. T. S. and Zhu, X. and Guan, Y. L. and Marziliano, P. },
title = {Slant transform watermarking for textured images},
booktitle = {Proc. International Symposium on Circuits and Systems},
year = {2004},
volume = {5},
pages = {700--703}
}
watermarking_ |
| Lu, R., Marziliano, P. & Thng, C.H. (2004), "Comparison of scene-based interpolation methods applied to CT abdominal images", In Proc. 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, Vol. 1, pp. 1561-1564,
2004.
|
| Abstract: Three-dimensional (3-D) interpolation from 2-D image slices is widely used to aid the display, analysis and other biomedical image processing. We investigate the performance of 5 scene-based interpolation methods: linear, cubic spline, modified cubic spline and sine-based functions (Dirichlet apodization and Hanning apodization). We test our methods on four sets of computed tomography (CT) abdominal images, which have more organs in them compared to other biomedical images. Results show that, contrary to the 1-D or 2-D cases, linear interpolation acts as well as, even slightly better than all the other methods in the sense of signal to noise ratio in most cases, while the computational load of linear interpolation is only about half of the other methods. The reason for the relative high performance of linear interpolation is probably the large distance between consecutive images, which indicates low inter-slice correlation. |
BibTeX:
@inproceedings{Lu2004a,
author = {Lu, R. and Marziliano, P. and Thng, C. H. },
title = {Comparison of scene-based interpolation methods applied to CT abdominal images},
booktitle = {Proc. 26th Annual International Conference of the IEEE Engineering in Medicine and Biology Society},
year = {2004},
volume = {1},
pages = {1561--1564},
doi = {http://dx.doi.org/10.1109/IEMBS.2004.1403476}
}
biomed_ |
| Marziliano, P., Winkler, S., Dufaux, F. & Ebrahimi, T. (2004), "Perceptual Blur and Ringing Metrics: Application to JPEG2000", Elsevier Signal Processing: Image Communication, Vol.19, no.2, pp. 163-172, 2004.
|
| Abstract: In this paper, we present full-reference as well as no-reference metrics for typical JPEG 2000 compression artifacts, namely blur and ringing. These metrics are based on an analysis of the edges and adjacent regions in an image. Their perceptual significance is corroborated through subjective experiments. The proposed measurement algorithms are shown to perform well over a wide range of image content and compression ratios. They have low computational complexity and are near real-time. Potential applications of these novel metrics include source coding optimization and network resource management. |
BibTeX:
@inproceedings{Marziliano2004a,
author = {Marziliano, P. and Winkler, S. and Dufaux, F. and Ebrahimi, T. },
title = {Perceptual Blur and Ringing Metrics: Application to JPEG2000},
booktitle = {Elsevier Signal Processing: Image Communication},
year = {2004},
volume = {19},
pages = {163-172},
doi = {http://infoscience.epfl.ch/record/87134}
}
perceptual_ |
| Qiu, G., Marziliano, P., Ho, A.T.S., He, D. & Sun, Q. (2004), "A hybrid watermarking scheme for H.264/AVC video", In Proc. 17th International Conference on Pattern Recognition, Vol. 4, pp. 865-868,
2004.
|
| Abstract: A novel H.264/AVC watermarking method is proposed in this paper. By embedding the robust watermark into DCT domain and the fragile watermark into motion vectors respectively, the proposed method can jointly achieve both copyright protection and authentication. Our scheme outperforms other video watermarking schemes on higher watermarking capacity especially in lower compression bit-rates. Furthermore, being well aligned with Lagrangian optimization for mode choice featured in H.264/AVC, the proposed scheme only introduces small distortions into the video content. Experimental results also demonstrate that the proposed solution is very computationally efficient during watermark extraction. |
BibTeX:
@inproceedings{Qiu2004a,
author = {Qiu, Gang and Marziliano, P. and Ho, A. T. S. and He, Dajun and Sun, Qibin},
title = {A hybrid watermarking scheme for H.264/AVC video},
booktitle = {Proc. 17th International Conference on Pattern Recognition },
year = {2004},
volume = {4},
pages = {865--868},
doi = {http://dx.doi.org/10.1109/ICPR.2004.1333909}
}
watermarking_ |
| Marziliano, P., Dufaux, F., Winkler, S. & Ebrahimi, T. (2002), "A no-reference perceptual blur metric", In Proc. International Conference on Image Processing, Vol. 3, pp.57-60,
2002.
|
| Abstract: We present a no-reference blur metric for images and video. The blur metric is based on the analysis of the spread of the edges in an image. Its perceptual significance is validated through subjective experiments. The novel metric is near real-time, has low computational complexity and is shown to perform well over a range of image content. Potential applications include optimization of source coding, network resource management and autofocus of an image capturing device. |
BibTeX:
@inproceedings{Marziliano2002a,
author = {Marziliano, P. and Dufaux, F. and Winkler, S. and Ebrahimi, T. },
title = {A no-reference perceptual blur metric},
booktitle = {Proc. IEEE International Conference on Image Processing },
year = {2002},
volume = {3},
pages = {57--60},
doi = {http://dx.doi.org/10.1109/ICIP.2002.1038902}
}
perceptual_ |
| Ferland, J. A. & Marziliano, P. (2001), "Efficient and Local Efficient Solutions for Assigment Type Problems", RAIRO 35 pp. 301-314,
2001.
|
| Abstract: In this paper, we analyse the multiobjective problem generated by applying a goal programming approach to deal with linear assignment type problem. We specify sucient conditions for a solution to be ecient for this problem. The notion of eciency with respect to a neighborhood is also introduced and characterized through sufficient conditions. Unfortunately, these conditions are not necessary in general. |
BibTeX:
@inproceedings{Ferland2001a,
author = {Ferland J. A. and Marziliano, P.},
title = {Efficient and Local Efficient Solutions for Assigment Type Problems},
booktitle = {RAIRO},
year = {2001},
volume = {35},
pages = {301-314},
}
optimization_ |
| Vetterli, M., Marziliano, P. & Blu, T. (2002), "Sampling signals with finite rate of innovation", IEEE Transactions on Signal Processing, Vol. 50(6), pp. 1417-1428,
2002.
|
| Abstract: The authors consider classes of signals that have a finite number of degrees of freedom per unit of time and call this number the rate of innovation. Examples of signals with a finite rate of innovation include streams of Diracs (e.g., the Poisson process), nonuniform splines, and piecewise polynomials. Even though these signals are not bandlimited, we show that they can be sampled uniformly at (or above) the rate of innovation using an appropriate kernel and then be perfectly reconstructed. Thus, we prove sampling theorems for classes of signals and kernels that generalize the classic "bandlimited and sinc kernel" case. In particular, we show how to sample and reconstruct periodic and finite-length streams of Diracs, nonuniform splines, and piecewise polynomials using sinc and Gaussian kernels. For infinite-length signals with finite local rate of innovation, we show local sampling and reconstruction based on spline kernels. The key in all constructions is to identify the innovative part of a signal (e.g., time instants and weights of Diracs) using an annihilating or locator filter: a device well known in spectral analysis and error-correction coding. This leads to standard computational procedures for solving the sampling problem, which we show through experimental results. Applications of these new sampling results can be found in signal processing, communications systems, and biological systems |
BibTeX:
@article{Vetterli2002a,
author = {Vetterli, M. and Marziliano, P. and Blu, T. },
title = {Sampling signals with finite rate of innovation},
journal = {IEEE Transactions on Signal Processing},
year = {2002},
volume = {50},
number = {6},
pages = {1417--1428},
doi = {http://dx.doi.org/10.1109/TSP.2002.1003065}
}
samplingtheory_ |
| Marziliano, P. (2001), "Sampling Innovations". Thesis
No.2369, Ecole Polytechnique Federale de Lausanne, Switzerland, April, 2001.
|
BibTeX:
@phdthesis{PinaPhDThesis,
author = {Pina Marziliano},
title = {Sampling Innovations},
school = {Ecole Polytechnique Federale de Lausanne, Switzerland},
year = {2001},
note = {No. 2369}
}
samplingtheory_ |
| Vetterli, M., Marziliano, P. & Blu, T. (2001), "A sampling theorem for periodic piecewise polynomial signals",
In Proc. IEEE International Conference on Acoustics, Speech, and Signal
Processing, Vol. 6, pp. 3893-3896, 2001.
|
| Abstract: We consider the problem of sampling signals which are not bandlimited, but still have a finite number of degrees of freedom per unit of time, such as, for example, piecewise polynomials. We demonstrate that by using an adequate sampling kernel and a sampling rate greater or equal to the number of degrees of freedom per unit of time, one can uniquely reconstruct such signals. This proves a sampling theorem for a wide class of signals beyond bandlimited signals. Applications of this sampling theorem can be found in signal processing, communication systems and biological systems |
BibTeX:
@inproceedings{Vetterli2001a,
author = {Vetterli, M. and Marziliano, P. and Blu, T. },
title = {A sampling theorem for periodic piecewise polynomial signals},
booktitle = {Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '01)},
year = {2001},
volume = {6},
pages = {3893--3896},
doi = {http://dx.doi.org/10.1109/ICASSP.2001.940694}
}
samplingtheory_ |
| Marziliano, P. & Vetterli, M. (2000), "Reconstruction of irregularly sampled discrete-time bandlimited signals with unknown sampling locations", IEEE Transactions on Signal Processing. Vol. 48(12), pp. 3462-3471,
2000.
|
| Abstract: The purpose of this paper is to develop methods that can reconstruct a bandlimited discrete-time signal from an irregular set of samples at unknown locations. We define a solution to the problem using first a geometric and then an algebraic point of view. We find the locations of the irregular set of samples by treating the problem as a combinatorial optimization problem. We employ an exhaustive method and two descent methods: the random search and cyclic coordinate methods. The numerical simulations were made on three types of irregular sets of locations: random sets; sets with jitter around a uniform set; and periodic nonuniform sets. Furthermore, for the periodic nonuniform set of locations, we develop a fast scheme that reduces the computational complexity of the problem by exploiting the periodic nonuniform structure of the sample locations in the DFT. |
BibTeX:
@article{Marziliano2000a,
author = {Marziliano, P. and Vetterli, M. },
title = {Reconstruction of irregularly sampled discrete-time bandlimited signals with unknown sampling locations},
journal = {IEEE Transactions on Signal Processing},
year = {2000},
volume = {48},
number = {12},
pages = {3462--3471},
doi = {http://dx.doi.org/10.1109/78.887038}
}
samplingtheory_ |
| Marziliano, P. & Vetterli, M. (1999), "Irregular sampling with unknown locations", In Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing
,Vol. 3, pp. 1657-1660, 1999.
|
| Abstract: This paper is concerned with finding the locations of an irregularly sampled finite discrete-time band-limited signal. First a geometrical approach is described and is transformed into an optimization problem. Due to the structure of the problem, multiple solutions exist and are shifts of each other. Three methods of solution are suggested: an exhaustive method which finds the exact set of locations; random search method and cyclic coordinate method, both descent methods, which find approximate or exact solutions. The cyclic coordinate method is less likely to fall in a local minimum and proves to be more satisfactory than the random search method in the presence of jitter. A practical example, where a signal is sampled several times with a regular spacing, is also described |
BibTeX:
@inproceedings{Marziliano1999a,
author = {Marziliano, P. and Vetterli, M. },
title = {Irregular sampling with unknown locations},
booktitle = {Proc. IEEE International Conference on Acoustics, Speech, and Signal Processing ICASSP '99},
year = {1999},
volume = {3},
pages = {1657--1660 },
doi = {http://dx.doi.org/10.1109/ICASSP.1999.756310}
}
samplingtheory_ |
| Marziliano, P. (1996), "Problèmes multicritère avec contraintes d'affectation".
MSc Thesis, Département d'Informatique et de Recherche Opérationelle, Université de Montréal, Montreal, Canada, November, 1996.
|
BibTeX:
@mastersthesis{PinaMScThesis,
author = {Pina Marziliano},
title = {Problèmes multicritères avec contraintes d'affectation},
school = {Département d'Informatique et de Recherche Opérationelle, Université de Montréal},
year = {1996}
}
optimization_ |