# journal.bib

@article{bayer2012dct,
title = {{DCT}-like transform for image compression requires 14 additions only},
author = {F. M. Bayer and R. J. Cintra},
journal = {Electronics Letters},
year = {2012},
number = {15},
pages = {919--921},
volume = {48},
abstract = {A low-complexity 8-point orthogonal approximate discrete cosine transform (DCT) is introduced. The proposed transform requires no multiplications or bit-shift operations. The derived fast algorithm requires only 14 additions, less than any existing DCT approximation. Moreover, in several image compression scenarios, the proposed transform could outperform the well-known signed DCT, as well as state-of-the-art algorithms.},
doi = {10.1049/el.2012.1148},
owner = {rjdsc},
timestamp = {2012.07.27}
}

@article{bayer2010image,
title = {Image compression via a fast {DCT} Approximation},
author = {F. M. Bayer and R. J. Cintra},
journal = {IEEE Latin America Transactions},
year = {2010},
month = dec,
number = {6},
pages = {708--713},
volume = {8},
abstract = {Discrete transforms play an important role in digital signal processing. In particular, due to its transform domain energy compaction properties, the discrete cosine transform (DCT) is pivotal in many image processing problems. This paper introduces a numerical approximation method for the DCT based on round-off techniques. The proposed method is a multiplierless technique with low arithmetic complexity. Emphasis was given to approximating the 8-point DCT. A fast algorithm for the introduced 8-point approximate transform was derived. An application in image compression was examined. In several scenarios, the utilization of the proposed method for image compression resulted in comparable or better performances, when compared to the usual DCT-based methodology.},
doi = {10.1109/TLA.2010.5688099},
owner = {rjdsc},
timestamp = {2011.03.09}
}

@article{bayer2012digital,
title = {A digital hardware fast algorithm and {FPGA}-based prototype for a novel 16-point approximate {DCT} for image compression applications},
author = {F. M. Bayer and R. J. Cintra and A. Edirisuriya and A. Madanayake},
journal = {Measurement Science and Technology},
year = {2012},
month = oct,
number = {11},
pages = {1--10},
volume = {23},
doi = {http://dx.doi.org/10.1088/0957-0233/23/11/114010},
owner = {rjdsc},
timestamp = {2012.08.05}
}

@article{bayer2013multiplierless,
title = {Multiplierless approximate 4-point {DCT} {VLSI} architectures for transform block coding},
author = {Bayer, F. M. and Cintra, R. J. and Madanayake, A. and Potluri, U. S.},
journal = {Electronics Letters},
year = {2013},
month = nov,
number = {24},
pages = {1532-1534},
volume = {49},
doi = {10.1049/el.2013.1352},
owner = {rjdsc},
timestamp = {2014.10.08}
}

@article{cintra2011integer,
title = {An Integer Approximation Method for Discrete Sinusoidal Transforms},
author = {R. J. Cintra},
journal = {Circuits, Systems, and Signal Processing},
year = {2011},
number = {6},
pages = {1481--1501},
volume = {30},
abstract = {Approximate methods have been considered as a means to the evaluation of discrete transforms. In this work, we propose and analyze a class of integer transforms for the discrete Fourier, Hartley, and cosine transforms (DFT, DHT, and DCT), based on simple dyadic rational approximation methods. The introduced method is general, applicable to several blocklengths, whereas existing approaches are usually dedicated to specific transform sizes. The suggested approximate transforms enjoy low multiplicative complexity and the orthogonality property is achievable via matrix polar decomposition. We show that the obtained transforms are competitive with archived methods in literature. New 8-point square wave approximate transforms for the DFT, DHT, and DCT are also introduced as particular cases of the introduced methodology.},
doi = {10.1007/s00034-011-9318-5},
owner = {rjdsc},
timestamp = {2011.03.09}
}

@article{cintra2011dct,
title = {A {DCT} Approximation for Image Compression},
author = {R. J. Cintra and F. M. Bayer},
journal = {IEEE Signal Processing Letters},
year = {2011},
month = oct,
number = {10},
pages = {579--582},
volume = {18},
abstract = {An orthogonal approximation for the 8-point discrete cosine transform (DCT) is introduced. The proposed transformation matrix contains only zeros and ones; multiplications and bit-shift operations are absent. Close spectral behavior relative to the DCT was adopted as design criterion. The proposed algorithm is superior to the signed discrete cosine transform. It could also outperform state-of-the-art algorithms in low and high image compression scenarios, exhibiting at the same time a comparable computational complexity.},
doi = {10.1109/LSP.2011.2163394},
owner = {rjdsc},
timestamp = {2011.10.15}
}

@article{cintra2014low,
title = {Low-complexity 8-point {DCT} approximations based on integer functions},
author = {Cintra, R. J. and Bayer, F. M. and Tablada, C. J.},
journal = {Signal Processing},
year = {2014},
month = jun,
pages = {201--214},
volume = {99},
doi = {10.1016/j.sigpro.2013.12.027},
owner = {rjdsc},
timestamp = {2014.01.08}
}

@article{cintra2009robust,
title = {Robust image watermarking using non-regular wavelets},
author = {R. J. Cintra and T. Cooklev},
journal = {Signal, Image and Video Processing},
year = {2009},
pages = {241--250},
volume = {3},
abstract = {An approach to watermarking digital images using non-regular wavelets is advanced. Non-regular transforms spread the energy in the transform domain. The proposed method leads at the same time to increased image quality and increased robustness with respect to lossy compression. The approach provides robust watermarking by suitably creating watermarked messages that have energy compaction and frequency spreading. Our experimental results show that the application of non-regular wavelets, instead of regular ones, can furnish a superior robust watermarking scheme. The generated watermarked data is more immune against non-intentional JPEG and JPEG2000 attacks.},
doi = {10.1007/s11760-008-0070-7},
issn = {1863-1703},
keywords = {Robust watermarking, Non-regular wavelets, JPEG compression},
owner = {rjdsc},
publisher = {Springer},
timestamp = {2010.08.10}
}

@article{cintra2010arithmetic,
title = {The Arithmetic Cosine Transform: Exact and Approximate Algorithms},
author = {R. J. Cintra and V. S. Dimitrov},
journal = {IEEE Transactions on Signal Processing},
year = {2010},
month = jun,
number = {6},
pages = {3076--3085},
volume = {58},
abstract = {In this paper, we introduce a new class of transform method-the arithmetic cosine transform (ACT). We provide the central mathematical properties of the ACT, necessary in designing efficient and accurate implementations of the new transform method. The key mathematical tools used in the paper come from analytic number theory, in particular the properties of the Riemann zeta function. Additionally, we demonstrate that an exact signal interpolation is achievable for any block-length. Approximate calculations were also considered. The numerical examples provided show the potential of the ACT for various digital signal processing applications.},
doi = {10.1109/TSP.2010.2045781},
keywords = {approximation theory, discrete cosine transforms, interpolation, signal processing},
owner = {rjdsc},
timestamp = {2010.08.10}
}

@article{cintra2009fragile,
title = {Fragile watermarking using finite field trigonometrical transforms},
author = {R. J. Cintra and V. S. Dimitrov and H. M. Oliveira and R. M. {Campello de Souza}},
journal = {Signal Processing: Image Communication},
year = {2009},
month = aug,
number = {7},
pages = {587--597},
volume = {24},
abstract = {Fragile digital watermarking has been applied for authentication and alteration detection in images. Utilizing the cosine and Hartley transforms over finite fields, a new transform domain fragile watermarking scheme is introduced. A watermark is embedded into a host image via a blockwise application of two-dimensional finite field cosine or Hartley transforms. Additionally, the considered finite field transforms are adjusted to be number theoretic transforms, appropriate for error-free calculation. The employed technique can provide invisible fragile watermarking for authentication systems with tamper location capability. It is shown that the choice of the finite field characteristic is pivotal to obtain perceptually invisible watermarked images. It is also shown that the generated watermarked images can be used as publicly available signature data for authentication purposes.},
doi = {10.1016/j.image.2009.04.003},
issn = {0923-5965},
keywords = {Fragile watermarking; Number theoretic transforms; Finite field trigonometry},
owner = {rjdsc},
timestamp = {2010.08.10}
}

@article{cintra2013parametric,
title = {Parametric and Nonparametric Tests for Speckled Imagery},
author = {R. J. Cintra and A. D. C. Nascimento and A. C. Frery},
journal = {Pattern Analysis and Applications},
year = {2013},
number = {2},
pages = {141--161},
volume = {16},
abstract = {Synthetic aperture radar (SAR) has a pivotal role as a remote imaging method. Obtained by means of coherent illumination, SAR images are contaminated with speckle noise. The statistical modeling of such contamination is well described according to the multiplicative model and its implied G0 distribution. The understanding of SAR imagery and scene element identification is an important objective in the field. In particular, reliable image contrast tools are sought. Aiming the proposition of new tools for evaluating SAR image contrast, we investigated new methods based on stochastic divergence. We propose several divergence measures specifically tailored for G0 distributed data. We also introduce a nonparametric approach based on the Kolmogorov-Smirnov distance for G0 data. We devised and assessed tests based on such measures, and their performances were quantified according to their test sizes and powers. Using Monte Carlo simulation, we present a robustness analysis of test statistics and of maximum likelihood estimators for several degrees of innovative contamination. It was identified that the proposed tests based on triangular and arithmetic-geometric measures outperformed the Kolmogorov-Smirnov methodology.},
doi = {10.1007/s10044-011-0249-3},
keywords = {Robust statistics, Information theory, Nonparametric methods, Parametric inference},
owner = {rjdsc},
timestamp = {2011.03.09}
}

@article{cintra2004short,
title = {A Short Survey on Arithmetic Transforms},
author = {R. J. Cintra and H. M. Oliveira},
journal = {Journal of Communication and Information Systems},
year = {2004},
month = aug,
note = {ISSN: 1980-6604},
number = {2},
pages = {68--79},
volume = {19},
abstract = {Arithmetic complexity has a main role in the performance of algorithms for spectrum evaluation. Arithmetic transform theory offers a method for computing trigonometrical transforms with minimal number of multiplications. In this paper, the proposed algorithms for the arithmetic Fourier transform are surveyed. A new arithmetic transform for computing the discrete Hartley transform is introduced: the Arithmetic Hartley transform. The interpolation process as the key to the arithmetic transform theory is also examined.},
comment = {http://iecom.dee.ufcg.edu.br/~jcis/Agosto%202004/volume%2019/JCIS_2004_19_2_02.htm},
owner = {rjdsc},
timestamp = {2010.08.10},
url = {http://arxiv.org/abs/1504.06106}
}

@article{cintra2014beta,
title = {Beta Generalized Normal Distribution with an Application for {SAR} Image Processing},
author = {R. J. Cintra and L. C. R\^ego and G. M. Cordeiro and A. D. C. Nascimento},
journal = {Statistics},
year = {2014},
month = dec,
number = {2},
pages = {279-294},
volume = {48},
doi = {10.1080/02331888.2012.748776},
owner = {rjdsc},
timestamp = {2011.03.09}
}

@article{cintra2004canine,
title = {Wavelet analysis in a canine model of gastric electrical uncoupling},
author = {R. J. Cintra and I. V. Tchervensky and V. S. Dimitrov and M. P. Mintchev},
journal = {Physiological Measurement},
year = {2004},
month = sep,
number = {6},
pages = {1355},
volume = {25},
abstract = {Abnormal gastric motility function could be related to gastric electrical uncoupling, the lack of electrical, and respectively mechanical, synchronization in different regions of the stomach. Therefore, non-invasive detection of the onset of gastric electrical uncoupling can be important for diagnosing associated gastric motility disorders. The aim of this study is to provide a wavelet-based analysis of electrogastrograms (EGG, the cutaneous recordings of gastric electric activity), to detect gastric electric uncoupling. Eight-channel EGG recordings were acquired from 16 dogs in basal state and after each of two circular gastric myotomies. These myotomies simulated mild and severe gastric electrical uncoupling, while keeping the separated gastric sections electrophysiologically active by preserving their blood supply. After visual inspection, manually selected 10 min EGG segments were submitted to wavelet analysis. Quantitative methodology to choose an optimal wavelet was derived. This 'matching' wavelet was determined using the Pollen parametrization for 6-tap wavelet filters and error minimization criteria. After a wavelet-based compression, the distortion of the approximated EGG signals was computed. Statistical analysis on the distortion values allowed us to significantly ($p < 0.05$) distinguish basal state from mild and severe gastric electrical uncoupling groups in particular EGG channels.},
doi = {10.1088/0967-3334/25/6/002},
owner = {rjdsc},
timestamp = {2010.08.10}
}

@article{cooklev2011generalized,
title = {A Generalized Prefix Construction for {OFDM} Systems over Quasi-Static Channels},
author = {T. Cooklev and H. Do\u{g}an and R. J. Cintra and H. Y{\i}ld{\i}z},
journal = {IEEE Transactions on Vehicular Technology},
year = {2011},
month = oct,
number = {8},
pages = {3684--3693},
volume = {60},
abstract = {All practical orthogonal frequency-division multiplexing (OFDM) systems require a prefix to eliminate intersymbol interference (ISI) at the receiver. Cyclic prefix (CP) and zero padding are well-known prefix construction methods, with the former being the most employed technique in practice due to its lower complexity. In this paper, we construct an OFDM system with a generalized CP. It is shown that the proposed generalized prefix effectively makes the channel experienced by the packet different from the actual channel. Using an optimization procedure, lower bit error rates (BERs) can be achieved, outperforming other prefix construction techniques. At the same time, the complexity of the technique is comparable with the CP method. The presented simulation results show that the proposed technique not only outperforms the CP method but is more robust in the presence of channel estimation errors and mobility as well. Therefore, the proposed method is appropriate for practical OFDM systems.},
doi = {10.1109/TVT.2011.2165741},
owner = {rjdsc},
timestamp = {2011.03.09}
}

@article{cordeiro2012mcdonald,
title = {The {M}c{D}onald Normal Distribution},
author = {G. M. Cordeiro and R. J. Cintra and L. C. R\^ego and E. M. M. Ortega},
journal = {Pakistan Journal of Statistics and Operation Research},
year = {2012},
month = jul,
number = {3},
pages = {301--329},
volume = {8},
abstract = {A five-parameter distribution called the McDonald normal distribution is defined and studied. The new distribution contains, as special cases, several important distributions discussed in the literature, such as the normal, skew-normal, exponentiated normal, beta normal and Kumaraswamy normal distributions, among others. We obtain its ordinary moments, moment generating function and mean deviations. We also derive the ordinary moments of the order statistics. We use the method of maximum likelihood to fit the new distribution and illustrate its potentiality with three applications to real data.},
doi = {10.18187/pjsor.v8i3.510},
owner = {rjdsc},
timestamp = {2012.06.07}
}

@article{coutinho2015multiplierless,
title = {A multiplierless pruned {DCT}-like transformation for image and video compression that requires ten additions only},
author = {V. A. Coutinho and R. J. Cintra and F. M. Bayer and S. Kulasekera and A. Madanayake},
journal = {Journal of Real-Time Image Processing},
year = {2015},
month = mar,
doi = {10.1007/s11554-015-0492-8},
owner = {rjdsc},
timestamp = {2015.07.22}
}

@article{edirisuriya2013single,
title = {A Single-Channel Architecture for Algebraic Integer Based 8$\times$8 {2-D} {DCT} Computation},
author = {A. Edirisuriya and A. Madanayake and R. J. Cintra and V. S. Dimitrov and N. T. Rajapaksha},
journal = {IEEE Transactions on Circuits and Systems for Video Technology},
year = {2013},
number = {12},
pages = {2083--2089},
volume = {23},
doi = {10.1109/TCSVT.2013.2270397},
owner = {rjdsc},
timestamp = {2013.10.11}
}

@article{edirisuriya2012vlsi,
title = {{VLSI} Architecture for 8-Point {AI}-based {A}rai {DCT} having Low Area-Time Complexity and Power at Improved Accuracy},
author = {A. Edirisuriya and A. Madanayake and V. Dimitrov and R. J. Cintra and J. Adikari},
journal = {Journal of Low Power Electronics and Applications},
year = {2012},
number = {2},
pages = {127--142},
volume = {2},
doi = {10.3390/jlpea2020127},
owner = {rjdsc},
timestamp = {2012.03.28}
}

@article{frery2013entropy,
title = {Entropy-based Statistical Analysis of {PolSAR} Data},
author = {A. C. Frery and R. J. Cintra and A. D. C. Nascimento},
journal = {IEEE Transactions on Geoscience and Remote Sensing},
year = {2012},
month = jun,
number = {6},
pages = {3733--3743},
volume = {51},
doi = {10.1109/TGRS.2012.2222029},
owner = {rjdsc},
timestamp = {2012.09.30}
}

@article{frery2013analytic,
title = {Analytic Expressions for Stochastic Distances Between Relaxed Complex {W}ishart Distributions},
author = {A. C. Frery and A. D. C. Nascimento and R. J. Cintra},
journal = {IEEE Transactions on Geoscience and Remote Sensing},
year = {2013},
number = {2},
pages = {1213--1226},
volume = {52},
doi = {10.1109/TGRS.2013.2248737},
owner = {rjdsc},
timestamp = {2011.03.09}
}

@article{frery2011information,
title = {Information Theory and Image Understanding: An Application to Polarimetric {SAR} Imagery},
author = {A. C. Frery and A. D. C. Nascimento and R. J. Cintra},
journal = {Chilean Journal of Statistics},
year = {2011},
month = sep,
number = {2},
pages = {81--100},
volume = {2},
owner = {rjdsc},
timestamp = {2011.10.15},
url = {http://chjs.deuv.cl/Vol2N2/ChJS_SEEMI7.pdf}
}

@article{lira2004mathieu,
title = {Elliptic-cylindrical wavelets: the {M}athieu wavelets},
author = {M. M. S. Lira and H. M. Oliveira and R. J. Cintra},
journal = {IEEE Signal Processing Letters},
year = {2004},
month = jan,
number = {1},
pages = {52--55},
volume = {11},
abstract = {This note introduces a new family of wavelets and a multiresolution analysis that exploits the relationship between analyzing filters and Floquet's solution of Mathieu differential equations. The transfer function of both the detail and the smoothing filter is related to the solution of a Mathieu equation of the odd characteristic exponent. The number of notches of these filters can be easily designed. Wavelets derived by this method have potential application in the fields of optics and electromagnetism.},
doi = {10.1109/LSP.2003.819341},
owner = {rjdsc},
timestamp = {2010.08.10}
}

@article{madanayake2015low,
title = {Low-Power {VLSI} Architectures for {DCT}/{DWT}: Precision vs Approximation for {HD} Video, Biomedical, and Smart Antenna Applications},
author = {Madanayake, A. and Cintra, R. J. and Bayer, F. M. and Dimitrov, V. and Wahid, K. and Rajapaksha, N. T. and Kulasekera, S. and Edirisuriya, A. and Madishetty, S. K. and Potluri, U. S.},
journal = {IEEE Circuits and Systems Magazine},
year = {2015},
month = feb,
number = {1},
pages = {25--47},
volume = {15},
doi = {10.1109/MCAS.2014.2385553},
owner = {rjdsc},
timestamp = {2014.10.08}
}

@article{madanayake2012block,
title = {Block-Parallel Systolic-Array Architectures for 2-{D} {NTT}-based Fragile Watermark Embedding},
author = {A. Madanayake and R. J. Cintra and V. S. Dimitrov and L. T. Bruton},
journal = {Parallel Processing Letters},
year = {2012},
number = {3},
pages = {{1250009--1}-{1250009--12}},
volume = {22},
abstract = {Number-theoretic transforms (NTTs) have been applied in the fragile watermarking of digital images. A block-parallel systolic-array architecture is proposed for watermarking based on the 2-D special Hartley NTT (HNTT). The proposed core employs two 2-D special HNTT hardware cores, each using digital arithmetic over GF(3), and processes 4 x 4 blocks of pixels in parallel every clock cycle. Prototypes are operational on a Xilinx Sx35-10ff668 FPGA device. The maximum estimated throughput of the FPGA circuit is 100 million 4 x 4 HNTT fragile watermarked blocks per second, when clocked at 100 MHz. Potential applications exist in high-traffic back-end servers dealing with large amounts of protected digital images requiring authentication, in remote-sensing for high-security surveillance applications, in real-time video processing of information of a sensitive nature or matters of national security, in video/photographic content management of corporate clients, in authenticating multimedia for the entertainment industry, in the authentication of electronic evidence material, and in real-time news streaming.},
doi = {10.1142/S0129626412500090},
keywords = {Fragile watermarking; number-theoretic transforms},
owner = {rjdsc},
timestamp = {2012.03.28}
}

@article{madanayake2012row,
title = {A Row Parallel $8\times8$ {2D} {DCT} Architecture Using Algebraic Integer Based Exact Arithmetic},
author = {A. Madanayake and R. J. Cintra and N. Rajapaksha and V. S. Dimitrov and D. Onen and L. T. Bruton and A. Edirisuriya},
journal = {IEEE Transactions on Circuits and Systems for Video Technology},
year = {2012},
month = jun,
number = {6},
pages = {915--929},
volume = {22},
doi = {10.1109/TCSVT.2011.2181232},
owner = {rjdsc},
timestamp = {2012.01.19}
}

@article{madanayake2013vlsi,
title = {{VLSI} architecture for 4-{D} depth filtering},
author = {A. Madanayake and R. Wimalagunarathne and D. G. Dansereau and R. J. Cintra and L. T. Bruton},
journal = {Signal, Image and Video Processing},
year = {2013},
month = jul,
number = {4},
pages = {809-818},
volume = {9},
doi = {10.1007/s11760-013-0511-9},
owner = {rjdsc},
timestamp = {2013.10.11}
}

@article{madhishetty2013vlsi,
title = {{VLSI} Architectures for the 4-Tap and 6-Tap {2-D} {D}aubechies Wavelet Filters Using Algebraic Integers},
author = {S. Madhishetty and A. Madanayake and R. J. Cintra and D. Mugler and V. S. Dimitrov},
journal = {IEEE Transactions on Circuits and Systems I: Regular Papers},
year = {2012},
month = jun,
number = {6},
pages = {1455--1468},
volume = {60},
doi = {10.1109/TCSI.2012.2221171},
owner = {rjdsc},
timestamp = {2013.10.11}
}

@article{madishetty2014precise,
title = {Precise {VLSI} Architecture for {AI} based 1-{D}/ 2-{D} {D}aub-6 Wavelet Filter banks with Low Adder-Count},
author = {Madishetty, S. K. and Madanayake, A. and Cintra, R. J. and Dimitrov, V. S.},
journal = {IEEE Transactions on Circuits and Systems I},
year = {2014},
month = jul,
number = {7},
pages = {1984--1993},
volume = {61},
doi = {10.1109/TCSI.2014.2298283},
owner = {rjdsc},
timestamp = {2014.01.08}
}

@article{madishetty2014algebraic,
title = {Algebraic integer architecture with minimum adder count for the 2-{D} {D}aubechies 4-tap filters banks},
author = {S. K. Madishetty and A. Madanayake and R. J. Cintra and V. S. Dimitrov and D. H. Mugler},
journal = {Multidimensional Systems and Signal Processing},
year = {2014},
month = oct,
number = {4},
pages = {829--845},
volume = {25},
doi = {10.1007/s11045-013-0245-4},
owner = {rjdsc},
timestamp = {2013.10.11}
}

@article{nascimento2010hypothesis,
title = {Hypothesis Testing in Speckled Data With Stochastic Distances},
author = {A. D. C. Nascimento and R. J. Cintra and A. C. Frery},
journal = {IEEE Transactions on Geoscience and Remote Sensing},
year = {2010},
month = aug,
number = {1},
pages = {373--385},
volume = {48},
abstract = {Images obtained with coherent illumination, as is the case of sonar, ultrasound-B, laser, and synthetic aperture radar, are affected by speckle noise which reduces the ability to extract information from the data. Specialized techniques are required to deal with such imagery, which has been modeled by the G0 distribution and, under which, regions with different degrees of roughness and mean brightness can be characterized by two parameters; a third parameter, which is the number of looks, is related to the overall signal-to-noise ratio. Assessing distances between samples is an important step in image analysis; they provide grounds of the separability and, therefore, of the performance of classification procedures. This paper derives and compares eight stochastic distances and assesses the performance of hypothesis tests that employ them and maximum likelihood estimation. We conclude that tests based on the triangular distance have the closest empirical size to the theoretical one, while those based on the arithmetic-geometric distances have the best power. Since the power of tests based on the triangular distance is close to optimum, we conclude that the safest choice is using this distance for hypothesis testing, even when compared with classical distances as Kullback-Leibler and Bhattacharyya.},
doi = {10.1109/TGRS.2009.2025498},
keywords = {data acquisition, geophysical techniques, maximum likelihood estimation, radar imaging, stochastic systems},
owner = {rjdsc},
timestamp = {2010.08.10}
}

@article{nascimento2014bias,
title = {Bias Correction and Modified Profile Likelihood Under the {W}ishart Complex Distribution},
author = {Nascimento, A. D. C. and Frery, A. C. and Cintra, R. J.},
journal = {IEEE Transactions on Geoscience and Remote Sensing},
year = {2014},
month = aug,
number = {8},
pages = {4932-4941},
volume = {52},
doi = {10.1109/TGRS.2013.2285927},
owner = {rjdsc},
timestamp = {2014.10.08}
}

@article{nascimento2013comparing,
title = {Comparing Edge Detection Methods Based on Stochastic Entropies and Distances for {PolSAR} Imagery},
author = {A. D. C. Nascimento and M. M. Horta and A. C. Frery and R. J. Cintra},
journal = {IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing},
year = {2013},
number = {2},
pages = {648--663},
volume = {7},
doi = {10.1109/JSTARS.2013.2266319},
owner = {rjdsc},
timestamp = {2013.10.11}
}

@article{price2005dfnn,
title = {Classification Of Biomedical Signals Using The Dynamics Of The False Nearest Neighbours ({DFNN}) Algorithm},
author = {C. {Newton-Price} and R. J. Cintra and D. T. Westwick and M. P. Mintchev},
journal = {International Journal on Information Theory and Applications},
year = {2005},
pages = {18--28},
volume = {12},
abstract = {Accurate and efficient analysis of biomedical signals can be facilitated by proper identification based on their dominant dynamic characteristics (deterministic, chaotic or random). Specific analysis techniques exist to study the dynamics of each of these three categories of signals. However, comprehensive and yet adequately simple screening tools to appropriately classify an unknown incoming biomedical signal are still lacking. This study is aimed at presenting an efficient and simple method to classify model signals into the three categories of deterministic, random or chaotic, using the dynamics of the False Nearest Neighbours (DFNN) algorithm, and then to utilize the developed classification method to assess how some specific biomedical signals position with respect to these categories. Model deterministic, chaotic and random signals were subjected to state space decomposition, followed by specific wavelet and statistical analysis aiming at deriving a comprehensive plot representing the three signal categories in clearly defined clusters. Previously recorded electrogastrographic (EGG) signals subjected to controlled, surgically-invoked uncoupling were submitted to the proposed algorithm, and were classified as chaotic. Although computationally intensive, the developed methodology was found to be extremely useful and convenient to use.},
keywords = {Biomedical signals, classification, chaos, multivariate signal analysis, electrogastrography, gastric electrical uncoupling},
owner = {rjdsc},
timestamp = {2010.08.10},
url = {http://www.foibg.com/ijita/vol12/ijita12-1-p03.pdf}
}

@article{oliveira2015discrete,
title = {A Discrete {T}chebichef Transform Approximation for Image and Video Coding},
author = {P. A. M. Oliveira and R. J. Cintra and F. M. Bayer and S. Kulasekera and A. Madanayake},
journal = {IEEE Signal Processing Letters},
year = {2015},
month = jan,
number = {8},
pages = {1137--1141},
volume = {22},
abstract = {In this letter, we introduce a low-complexity approximation for the discrete Tchebichef transform (DTT). The proposed forward and inverse transforms are multiplication-free and require a reduced number of additions and bit-shifting operations. Numerical compression simulations demonstrate the efficiency of the proposed transform for image and video coding. Furthermore, Xilinx Virtex-6 FPGA based hardware realization shows 44.9\% reduction in dynamic power consumption and 64.7\% lower area when compared to the literature.},
doi = {10.1109/LSP.2015.2389899},
owner = {rjdsc},
timestamp = {2015.02.08}
}

@article{pauchard2015fast,
title = {Fast Computation of Residual Complexity Image Similarity Metric Using Low-complexity Transforms},
author = {Y. Pauchard and R. J. Cintra and A. Madanayake and F. M. Bayer},
journal = {IET Image Processing},
year = {2015},
month = aug,
number = {8},
pages = {699-708},
volume = {9},
doi = {10.1049/iet-ipr.2014.0939},
owner = {rjdsc},
timestamp = {2015.02.08}
}

@article{potluri2014improved,
title = {Improved 8-point Approximate {DCT} for Image and Video Compression Requiring Only 14 Additions},
author = {U. S. Potluri and A. Madanayake and R. J. Cintra and F. M. Bayer and S. Kulasekera and A. Edirisuriya},
journal = {IEEE Transactions on Circuits and Systems I},
year = {2014},
month = jun,
number = {6},
pages = {1727--1740},
volume = {61},
doi = {10.1109/TCSI.2013.2295022},
owner = {rjdsc},
timestamp = {2013.11.06}
}

@article{potluri2012multiplier,
title = {Multiplier-Free {DCT} Approximations for {RF} Multi-Beam Digital Aperture-Array Space Imaging and Directional Sensing},
author = {U. S. Potluri and A. Madanayake and R. J. Cintra and F. M. Bayer and N. Rajapaksha},
journal = {Measurement Science and Technology},
year = {2012},
month = nov,
number = {11},
pages = {1--15},
volume = {23},
doi = {10.1088/0957-0233/23/11/114003},
owner = {rjdsc},
timestamp = {2012.08.07}
}

@article{rego2013extension,
title = {An Extension of the {D}irichlet Density for Sets of {G}aussian Integers},
author = {L. C. R\^ego and R. J. Cintra},
year = {2013},
month = mar,
pages = {161--172},
volume = {56},
abstract = {Several measures for the density of sets of integers have been proposed, such as the asymptotic density, the Schnirelmann density, and the Dirichlet density. There has been some work in the literature on extending some of these concepts of density to higher dimensional sets of integers. In this work, we propose an extension of the Dirichlet density for sets of Gaussian integers and investigate some of its properties.},
doi = {10.4153/CMB-2011-149-9},
owner = {rjdsc},
timestamp = {2011.10.18}
}

@article{rego2012some,
title = {On Some Properties of the Beta Normal Distribution},
author = {L. C. R\^ego and R. J. Cintra and G. M. Cordeiro},
journal = {Communications in Statistics - Theory and Methods},
year = {2012},
number = {20},
pages = {3722--3738},
volume = {41},
abstract = {The beta normal distribution is a generalization of both the normal distribution and the normal order statistics. Some of its mathematical properties and a few applications have been studied in the literature. We provide a better foundation for some properties and an analytical study of its bimodality. The hazard rate function and the limiting behavior are examined. We derive explicit expressions for moments, generating function, mean deviations using a power series expansion for the quantile function, and Shannon entropy.},
doi = {10.1080/03610926.2011.568156},
owner = {rjdsc},
timestamp = {2012.08.09}
}

@article{rajapaksha2013asynchronous,
title = {Asynchronous Realization of Algebraic Integer-Based {2D} {DCT} Using {A}chronix {S}peedster {SPD60} {FPGA}},
author = {N. Rajapaksha and A. Edirisuriya and A. Madanayake and R. J. Cintra and D. Onen and I. Amer and V. S. Dimitrov},
journal = {Journal of Electrical and Computer Engineering},
year = {2013},
pages = {1--9},
volume = {2013},
doi = {10.1155/2013/834793},
owner = {rjdsc},
timestamp = {2013.04.05}
}

@article{rajapaksha2014vlsi,
title = {{VLSI} Computational Architectures for the Arithmetic Cosine Transform},
author = {Rajapaksha, N. and Madanayake, A. and Cintra, R. J. and Adikari, J. and Dimitrov, V.},
journal = {IEEE Transactions on Computers},
year = {2014},
doi = {10.1109/TC.2014.2366732},
issn = {0018-9340},
keywords = {Complexity theory;Computer architecture;Discrete cosine transforms;Hardware;Signal processing algorithms;Vectors;Arithmetic cosine transform;Discrete cosine transform;VLSI;fast algorithms},
owner = {rjdsc},
timestamp = {2014.11.20}
}

@article{silveira2014orthogonal,
title = {An orthogonal 16-point approximate {DCT} for image and video compression},
author = {Silveira, T. L. T. and Bayer, F. M. and Cintra, R. J. and Kulasekera, S. and Madanayake, A.},
journal = {Multidimensional Systems and Signal Processing},
year = {2014},
month = aug,
doi = {10.1007/s11045-014-0291-6},
owner = {rjdsc},
timestamp = {2015.07.22}
}

@article{suarez2014multi,
title = {Multi-beam {RF} aperture using multiplierless {FFT} approximation},
author = {Suarez, D. and Cintra, R. J. and Bayer, F. M. and Kulasekera, S. and Madanayake, A.},
journal = {Electronics Letters},
year = {2014},
month = nov,
number = {24},
pages = {1788-1790},
volume = {50},
doi = {10.1049/el.2014.3561},
owner = {rjdsc},
timestamp = {2015.02.08}
}

@article{tablada2015class,
title = {A class of {DCT} approximations based on the {F}eig-{W}inograd algorithm},
author = {C. J. Tablada and F. M. Bayer and R. J. Cintra},
journal = {Signal Processing},
year = {2015},
pages = {38-51},
volume = {113},
abstract = {A new class of matrices based on a parametrization of the Feig–Winograd factorization of 8-point DCT is proposed. Such parametrization induces a matrix subspace, which unifies a number of existing methods for DCT approximation. By solving a comprehensive multicriteria optimization problem, we identified several new DCT approximations. Obtained solutions were sought to possess the following properties: (i) low multiplierless computational complexity, (ii) orthogonality or near orthogonality, (iii) low complexity invertibility, and (iv) close proximity and performance to the exact DCT. Proposed approximations were submitted to assessment in terms of proximity to the DCT, coding performance, and suitability for image compression. Considering Pareto efficiency, particular new proposed approximations could outperform various existing methods archived in literature.},
doi = {10.1016/j.sigpro.2015.01.011},
owner = {rjdsc},
timestamp = {2015.02.08}
}

@article{tchervensky2006centre,
title = {Centre-specific multichannel electrogastrographic testing utilizing wavelet-based decomposition},
author = {I. V. Tchervensky and R. J. Cintra and E. Neshev and V. S. Dimitrov and D. C. Sadowski and M. P. Mintchev},
journal = {Physiological Measurement},
year = {2006},
number = {7},
pages = {569},
volume = {27},
abstract = {Although the principles of electrogastrography (EGG) have been known for years, the clinical utility of EGG has not been clearly demonstrated, and EGG recording and analysis techniques have not been fully standardized. The aim of this study was to develop a multichannel EGG technique for detecting abnormal gastric motility using an EGG database specifically designed for a particular testing centre, maximizing the sensitivity and the specificity of the test. Eight healthy volunteers formed a reference group to which 4 study groups (17 gastro-oesophageal reflux disease (GORD) patients, 7 functional dyspepsia patients, 8 post-fundoplication patients and 12 healthy volunteers) were compared. Eight-channel EGG was recorded in the postprandial and fasting states for 30 min each. The recorded signals were wavelet compressed and the resulting error (per cent root mean square difference (PRD)) after the compression was utilized to compare the study groups to the reference group. A threshold in the number of channels with significantly different PRD values was introduced. Sensitivity (SE), specificity (SP) and correct classification rate (CC) of the test in recognizing each clinical condition in the study groups for several channel thresholds and compressions were calculated, and were maximized. Increasing the compression and channel threshold levels improved the specificity, but decreased the sensitivity of the multichannel EGG test. An optimal combination region was identified based on a centre-specific adjustment of the channel threshold and the wavelet compression. The achieved maximum sensitivity, specificity and correct classification for this region in our test centre were as follows: GORD --- SE 82.4\%, SP 83.3\%, CC 82.8\%; functional dyspepsia --- SE 100\%, SP 75\%, CC 84.2\%; post-fundoplication --- SE 75.0\%, SP 83.3\%, CC 80.0\%. The utilization of a wavelet-based decomposition technique to process multichannel EGG signals can be a very effective method for enhancing the clinical utility of EGG, provided it is specifically developed for a given testing centre.},
doi = {10.1088/0967-3334/27/7/002},
owner = {rjdsc},
timestamp = {2010.08.10}
}


This file was generated by bibtex2html 1.97.