Relevant bibliographies by topics / Discrete sine transform

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Discrete sine transform'

Author: Grafiati
Published: 4 June 2021
Last updated: 14 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Discrete sine transform.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Discrete sine transform"

1

Kober, Vitaly. "Fast Hopping Discrete Sine Transform." IEEE Access 9 (2021): 94293–98. http://dx.doi.org/10.1109/access.2021.3094277.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Zhongde. "Fast discrete sine transform algorithms." Signal Processing 19, no. 2 (February 1990): 91–102. http://dx.doi.org/10.1016/0165-1684(90)90033-u.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kasparyan, M. S. "GENERALIZED DISCRETE ORTHOGONAL SINE-COSINE TRANSFORM." Computer Optics 38, no. 4 (January 1, 2014): 881–85. http://dx.doi.org/10.18287/0134-2452-2014-38-4-881-885.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Britaňák, Vladimir. "A unified discrete cosine and discrete sine transform computation." Signal Processing 43, no. 3 (May 1995): 333–39. http://dx.doi.org/10.1016/0165-1684(95)00010-b.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wang, Zhongde, and Lifeng Wang. "Interpolation using the fast discrete sine transform." Signal Processing 26, no. 1 (January 1992): 131–37. http://dx.doi.org/10.1016/0165-1684(92)90059-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Murty, M. Narayan, and K. Sreekanth. "Relation between Type-II Discrete Sine Transform and Type -I Discrete Hartley Transform." International Journal of Engineering Research and Applications 07, no. 06 (June 2017): 26–30. http://dx.doi.org/10.9790/9622-0706012630.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pan, Sung Bum. "Unified systolic array for fast computation of the discrete cosine transform, discrete sine transform, and discrete Hartley transform." Optical Engineering 36, no. 12 (December 1, 1997): 3439. http://dx.doi.org/10.1117/1.601583.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

CHAU, LAP-PUI, and WAN-CHI SIU. "Transform domain recursive algorithm to compute discrete cosine and sine transforms." International Journal of Electronics 80, no. 3 (March 1996): 433–39. http://dx.doi.org/10.1080/002072196137273.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Junhe Zhou and Min Zhang. "All-Optical Discrete Sine Transform and Discrete Cosine Transform Based on Multimode Interference Couplers." IEEE Photonics Technology Letters 22, no. 5 (March 2010): 317–19. http://dx.doi.org/10.1109/lpt.2009.2038713.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Poornachandra, S., V. Ravichandran, and N. Kumaravel. "Mapping of Discrete Cosine Transform (DCT) and Discrete Sine Transform (DST) based on Symmetries." IETE Journal of Research 49, no. 1 (January 2003): 35–42. http://dx.doi.org/10.1080/03772063.2003.11416321.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Discrete sine transform"

1

MASERA, MAURIZIO. "Transform algorithms and architectures for video coding." Doctoral thesis, Politecnico di Torino, 2018. http://hdl.handle.net/11583/2709432.

Full text
Abstract:
During the last years, the increasing popularity of very high resolution formats and the growing of video applications have posed critical issues on both the coding efficiency and the complexity of video compression systems. This thesis focuses on the transform coding stage of the most recent video coding technologies, by addressing both the complexity evaluation and the design of custom hardware architectures. First, the thesis thoroughly analyzes the HEVC transform complexity, by relying on the proposed CI metric. A tool-by-tool investigation is performed to quantify the complexity of the transform stage as function of different coding options, thus identifying which parameters are mainly related to the quality-complexity trade-off. The analysis is concluded with the determination of the transform stage requirements for real life HEVC encoders working in real-time. The obtained results motivate the need of transform hardware architectures. Therefore, an exploration of alternative solutions for hardware architectures to compute the transforms required by the standard is provided. Different DCT and DST factorizations and approximations have been compared in terms of arithmetic cost and sharing degree between multiple transform sizes in order to select the best promising ones for hardware implementation. Then, 1D and 2D transform architectures are proposed and their performance are evaluated within HEVC. The rate-distortion analysis and the hardware synthesis show that the proposed DCT and DST architectures achieve significant area and power reduction with respect to the state-of-art implementations at the expense of very small coding efficiency loss. Finally, this thesis investigates some adaptive transform coding techniques for beyond HEVC video compression, which try to represent the signal with a more sparse representation. The first technique employs odd type sinusoidal transforms. Therefore, some relationships for odd type DCTs and DSTs are recalled and exploited to reuse known factorizations of the DCT-VI and DST-VII to obtain other odd type transforms by applying simple permutations and sign inversions. Low-complexity DCT-V and DCT-VIII are derived and implemented as accelerators of transform functions of the future video coding technology. The synthesis results show lower hardware costs and improved efficiency with respect to the reference implementations. The second technique relies on the steerable method, which is extended to design directional transforms starting from any two-dimensional separable transform. Then, the HEVC steerable integer DCT and DST are defined and integrated on the top of the standard. The simulations show coding efficiency gains when using transforms with different orientation. Finally, the application of steerable transforms to partial video encryption is also analyzed.
APA, Harvard, Vancouver, ISO, and other styles
2

Martucci, Stephen A. "Symmetric convolution and the discrete sine and cosine transforms : principles and applications." Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/15038.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Logette, Patrice. "Etude et réalisation d'un processeur acousto-optique numérique de traitement des signaux." Valenciennes, 1997. https://ged.uphf.fr/nuxeo/site/esupversions/bbfd31df-2499-46a6-843d-52f346b1db41.

Full text
Abstract:
Un système hybride acousto-optique/numérique axe principalement sur le filtrage F. I. R. A été développé au laboratoire dans le cadre d'une thèse antérieure. L'objet du présent travail est, d'une part, d'améliorer le système existant et, d'autre part, de tester les aptitudes du système ainsi modifié à effectuer d'autres types de calcul. Nous commençons par un résumé des travaux relatifs à l'ancien système, afin de bien positionner le problème. Nous exposons ensuite la conception du nouveau système. Une première partie décrit les modifications des circuits électroniques, avec l'utilisation de circuits de logique programmable de marque Altera. Une seconde partie est dédiée à l'aspect commande. On y détaille le programme de pilotage du système, la création et l'utilisation de modules indépendants pour chaque type de calcul, ainsi que les utilitaires associés (simulation, génération d'algorithmes). Nous terminons par une présentation de quelques exemples de calculs (FIR, IIR, DFT, DCT, corrélation) et évaluons les performances de notre système pour chacun de ces types d’opérations. Le bilan est assez satisfaisant dans l'ensemble, bien que l'apport des circuits Altera ne se soit pas révélé à la hauteur de nos espérances. Le filtrage IIR est le moins performant et nécessiterait la recherche d'autres algorithmes. Cependant, pour être réellement opérationnel, il faudrait améliorer la partie acousto-optique, ou à moyen terme, passer au tout numérique. Nous pourrions, alors, disposer d'un système simple et pratique pour simuler, tester ou valider, sur maquette, des algorithmes ou des sous-systèmes développés au laboratoire dans divers domaines du traitement de signal.
APA, Harvard, Vancouver, ISO, and other styles
4

Coudoux, François-Xavier. "Evaluation de la visibilité des effets de blocs dans les images codées par transformée : application à l'amélioration d'images." Valenciennes, 1994. https://ged.uphf.fr/nuxeo/site/esupversions/a0a7cc38-609d-4d86-9c3a-a018590bc012.

Full text
Abstract:
Les méthodes de codage avec perte basées sur la Transformée en Cosinus Discrète constituent la base de la plupart des standards actuels de compression d'images numériques. Ce type de codage par Transformée nécessite une segmentation préalable de l'image en blocs de pixels disjoints. L'effet de blocs constitue le principal défaut de ce type de codage: les frontières entre blocs adjacents deviennent visibles pour des taux de compression élevés. Ce défaut est particulièrement gênant pour l'observateur, et affecte sévèrement la qualité visuelle de l'image reconstruite. Le but de notre étude est de proposer une méthode de détection locale des artefacts, ainsi qu'une mesure de leur importance visuelle. Cette mesure, qui prend en compte plusieurs propriétés du système visuel humain, caractérise la dégradation introduite dans l'image par la distorsion de blocs. Elle est utilisée afin d'établir un critère de qualité globale des images codées JPEG. Ce critère permet de quantifier la qualité des images reconstruites, en attribuant une note de qualité à l'image dégradée. Une application directe des résultats de la mesure des visibilités des effets de blocs concerne la détection et la correction de ces défauts à l'intérieur d'une image traitée par blocs. Nous présentons une méthode originale de réduction des effets de blocs; elle consiste en un filtrage local adaptatif à la visibilité des artefacts de blocs dans l'image. La correction apportée permet de réduire sensiblement les défauts les plus visibles, sans dégrader le reste de l'image. La méthode est validée dans le cas d'images fixes codées JPEG; son extension immédiate aux standards MPEG1 et MPEG2 de compression de séquences d'images reste possible, moyennant éventuellement la prise en compte des propriétés temporelles de la vision. Une implémentation matérielle est envisagée sous forme d'un circuit électronique, qui pourra être utilisé sur les terminaux de consultation multimédia afin d'améliorer la qualité visuelle de l'image avant affichage final.
APA, Harvard, Vancouver, ISO, and other styles
5

Coquelin, Loïc. "Contribution aux traitements des incertitudes : application à la métrologie des nanoparticules en phase aérosol." Phd thesis, Supélec, 2013. http://tel.archives-ouvertes.fr/tel-01066760.

Full text
Abstract:
Cette thèse a pour objectif de fournir aux utilisateurs de SMPS (Scanning Mobility Particle Sizer) une méthodologie pour calculer les incertitudes associées à l'estimation de la granulométrie en nombre des aérosols. Le résultat de mesure est le comptage des particules de l'aérosol en fonction du temps. Estimer la granulométrie en nombre de l'aérosol à partir des mesures CNC revient à considérer un problème inverse sous incertitudes.Une revue des modèles existants est présentée dans le premier chapitre. Le modèle physique retenu fait consensus dans le domaine d'application.Dans le deuxième chapitre, un critère pour l'estimation de la granulométrie en nombre qui couple les techniques de régularisation et de la décomposition sur une base d'ondelettes est décrit.La nouveauté des travaux présentés réside dans l'estimation de granulométries présentant à la fois des variations lentes et des variations rapides. L'approche multi-échelle que nous proposons pour la définition du nouveau critère de régularisation permet d'ajuster les poids de la régularisation sur chaque échelle du signal. La méthode est alors comparée avec la régularisation classique. Les résultats montrent que les estimations proposées par la nouvelle méthode sont meilleures (au sens du MSE) que les estimations classiques.Le dernier chapitre de cette thèse traite de la propagation de l'incertitude à travers le modèle d'inversiondes données. C'est une première dans le domaine d'application car aucune incertitude n'est associée actuellement au résultat de mesure. Contrairement à l'approche classique qui utilise un modèle fixe pour l'inversion en faisant porter l'incertitude sur les entrées, nous proposons d'utiliser un modèle d'inversion aléatoire (tirage Monte-Carlo) afin d'intégrer les erreurs de modèle. Une estimation moyenne de la granulométrie en nombre de l'aérosol et une incertitude associée sous forme d'une région de confiance à 95 % est finalement présentée sur quelques mesures réelles.
APA, Harvard, Vancouver, ISO, and other styles
6

Cook, James Allen. "A decompositional investigation of 3D face recognition." Thesis, Queensland University of Technology, 2007. https://eprints.qut.edu.au/16653/1/James_Allen_Cook_Thesis.pdf.

Full text
Abstract:
Automated Face Recognition is the process of determining a subject's identity from digital imagery of their face without user intervention. The term in fact encompasses two distinct tasks; Face Verficiation is the process of verifying a subject's claimed identity while Face Identification involves selecting the most likely identity from a database of subjects. This dissertation focuses on the task of Face Verification, which has a myriad of applications in security ranging from border control to personal banking. Recently the use of 3D facial imagery has found favour in the research community due to its inherent robustness to the pose and illumination variations which plague the 2D modality. The field of 3D face recognition is, however, yet to fully mature and there remain many unanswered research questions particular to the modality. The relative expense and specialty of 3D acquisition devices also means that the availability of databases of 3D face imagery lags significantly behind that of standard 2D face images. Human recognition of faces is rooted in an inherently 2D visual system and much is known regarding the use of 2D image information in the recognition of individuals. The corresponding knowledge of how discriminative information is distributed in the 3D modality is much less well defined. This dissertations addresses these issues through the use of decompositional techniques. Decomposition alleviates the problems associated with dimensionality explosion and the Small Sample Size (SSS) problem and spatial decomposition is a technique which has been widely used in face recognition. The application of decomposition in the frequency domain, however, has not received the same attention in the literature. The use of decomposition techniques allows a map ping of the regions (both spatial and frequency) which contain the discriminative information that enables recognition. In this dissertation these techniques are covered in significant detail, both in terms of practical issues in the respective domains and in terms of the underlying distributions which they expose. Significant discussion is given to the manner in which the inherent information of the human face is manifested in the 2D and 3D domains and how these two modalities inter-relate. This investigation is extended to cover also the manner in which the decomposition techniques presented can be recombined into a single decision. Two new methods for learning the weighting functions for both the sum and product rules are presented and extensive testing against established methods is presented. Knowledge acquired from these examinations is then used to create a combined technique termed Log-Gabor Templates. The proposed technique utilises both the spatial and frequency domains to extract superior performance to either in isolation. Experimentation demonstrates that the spatial and frequency domain decompositions are complimentary and can combined to give improved performance and robustness.
APA, Harvard, Vancouver, ISO, and other styles
7

Cook, James Allen. "A decompositional investigation of 3D face recognition." Queensland University of Technology, 2007. http://eprints.qut.edu.au/16653/.

Full text
Abstract:
Automated Face Recognition is the process of determining a subject's identity from digital imagery of their face without user intervention. The term in fact encompasses two distinct tasks; Face Verficiation is the process of verifying a subject's claimed identity while Face Identification involves selecting the most likely identity from a database of subjects. This dissertation focuses on the task of Face Verification, which has a myriad of applications in security ranging from border control to personal banking. Recently the use of 3D facial imagery has found favour in the research community due to its inherent robustness to the pose and illumination variations which plague the 2D modality. The field of 3D face recognition is, however, yet to fully mature and there remain many unanswered research questions particular to the modality. The relative expense and specialty of 3D acquisition devices also means that the availability of databases of 3D face imagery lags significantly behind that of standard 2D face images. Human recognition of faces is rooted in an inherently 2D visual system and much is known regarding the use of 2D image information in the recognition of individuals. The corresponding knowledge of how discriminative information is distributed in the 3D modality is much less well defined. This dissertations addresses these issues through the use of decompositional techniques. Decomposition alleviates the problems associated with dimensionality explosion and the Small Sample Size (SSS) problem and spatial decomposition is a technique which has been widely used in face recognition. The application of decomposition in the frequency domain, however, has not received the same attention in the literature. The use of decomposition techniques allows a map ping of the regions (both spatial and frequency) which contain the discriminative information that enables recognition. In this dissertation these techniques are covered in significant detail, both in terms of practical issues in the respective domains and in terms of the underlying distributions which they expose. Significant discussion is given to the manner in which the inherent information of the human face is manifested in the 2D and 3D domains and how these two modalities inter-relate. This investigation is extended to cover also the manner in which the decomposition techniques presented can be recombined into a single decision. Two new methods for learning the weighting functions for both the sum and product rules are presented and extensive testing against established methods is presented. Knowledge acquired from these examinations is then used to create a combined technique termed Log-Gabor Templates. The proposed technique utilises both the spatial and frequency domains to extract superior performance to either in isolation. Experimentation demonstrates that the spatial and frequency domain decompositions are complimentary and can combined to give improved performance and robustness.
APA, Harvard, Vancouver, ISO, and other styles
8

Vezzoli, Massimiliano. "Intrinsic kinetics of titania photocatalysis : simplified models for their investigation." Thesis, Queensland University of Technology, 2012. https://eprints.qut.edu.au/51574/1/Massimiliano_Vezzoli_Thesis.pdf.

Full text
Abstract:
Even though titanium dioxide photocatalysis has been promoted as a leading green technology for water purification, many issues have hindered its application on a large commercial scale. For the materials scientist the main issues have centred the synthesis of more efficient materials and the investigation of degradation mechanisms; whereas for the engineers the main issues have been the development of appropriate models and the evaluation of intrinsic kinetics parameters that allow the scale up or re-design of efficient large-scale photocatalytic reactors. In order to obtain intrinsic kinetics parameters the reaction must be analysed and modelled considering the influence of the radiation field, pollutant concentrations and fluid dynamics. In this way, the obtained kinetic parameters are independent of the reactor size and configuration and can be subsequently used for scale-up purposes or for the development of entirely new reactor designs. This work investigates the intrinsic kinetics of phenol degradation over titania film due to the practicality of a fixed film configuration over a slurry. A flat plate reactor was designed in order to be able to control reaction parameters that include the UV irradiance, flow rates, pollutant concentration and temperature. Particular attention was paid to the investigation of the radiation field over the reactive surface and to the issue of mass transfer limited reactions. The ability of different emission models to describe the radiation field was investigated and compared to actinometric measurements. The RAD-LSI model was found to give the best predictions over the conditions tested. Mass transfer issues often limit fixed film reactors. The influence of this phenomenon was investigated with specifically planned sets of benzoic acid experiments and with the adoption of the stagnant film model. The phenol mass transfer coefficient in the system was calculated to be km,phenol=8.5815x10-7Re0.65(ms-1). The data obtained from a wide range of experimental conditions, together with an appropriate model of the system, has enabled determination of intrinsic kinetic parameters. The experiments were performed in four different irradiation levels (70.7, 57.9, 37.1 and 20.4 W m-2) and combined with three different initial phenol concentrations (20, 40 and 80 ppm) to give a wide range of final pollutant conversions (from 22% to 85%). The simple model adopted was able to fit the wide range of conditions with only four kinetic parameters; two reaction rate constants (one for phenol and one for the family of intermediates) and their corresponding adsorption constants. The intrinsic kinetic parameters values were defined as kph = 0.5226 mmol m-1 s-1 W-1, kI = 0.120 mmol m-1 s-1 W-1, Kph = 8.5 x 10-4 m3 mmol-1 and KI = 2.2 x 10-3 m3 mmol-1. The flat plate reactor allowed the investigation of the reaction under two different light configurations; liquid and substrate side illumination. The latter of particular interest for real world applications where light absorption due to turbidity and pollutants contained in the water stream to be treated could represent a significant issue. The two light configurations allowed the investigation of the effects of film thickness and the determination of the catalyst optimal thickness. The experimental investigation confirmed the predictions of a porous medium model developed to investigate the influence of diffusion, advection and photocatalytic phenomena inside the porous titania film, with the optimal thickness value individuated at 5 ìm. The model used the intrinsic kinetic parameters obtained from the flat plate reactor to predict the influence of thickness and transport phenomena on the final observed phenol conversion without using any correction factor; the excellent match between predictions and experimental results provided further proof of the quality of the parameters obtained with the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
9

Rodesten, Stephan. "Program för frekvensanalys." Thesis, Örebro universitet, Institutionen för naturvetenskap och teknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-58157.

Full text
Abstract:
Denna rapport täcker arbetsprocessen bakom att skapa en spektrumanalysator. Läsaren kommer att få läsa om den valda metoden men även alternativa metoder. Utöver detta kommer även de teoretiska delarna bakom varje moment att undersökas samt jämföras med potentiella alternativa lösningar. Projektet har utförts på uppdrag av KA Automation. Syftet med projektet var att skapa en basplattform för analys av ljudfrekvenser. Målet med detta var att kunna identifiera ljudegenskaper i form av frekvenserna hos exempelvis servomotorer i vattenpumpar. Tanken var att i ett senare utvecklingsskede kunna identifiera om och när nya frekvenser dykt upp i ljudprofilen vilket i sådana fall kan resultera i att motorn är i behov av service. Basplattformen är uppbyggd med hjälp av C# och ljudbehandlingsbiblioteket NAudio. Från resultatet kan slutsatsen dras att detta program kan analysera ljud och visa de olika frekvensernas styrka och därmed är en lämplig basplattform för vidareutveckling.
This report will cover the work process behind creating a spectrum analyzer. The reader will be able to read about the chosen method but also the alternative methods. Apart from this the theoretical parts behind every moment will also be covered and compared to potential alternative solutions. The project has been carried out on behalf of KA Automation. The purpose of the project was to create a base for analyzing sound frequencies. The goal was to be able to identify sound properties in the form of frequencies in servo motors in for example water pumps. The idea was to be able to in a later development stage be able to identify when new frequencies have entered the audio profile which might result in the motor to be in need of service. The base is created with the help of C# and the sound library NAudio. From the result one can conclude that this program can analyze sound and display the magnitude of its frequency components and is therefore a suitable base for future development.
APA, Harvard, Vancouver, ISO, and other styles
10

Peng, Chun-cheng, and 彭俊程. "IMAGE INTERPOLATION BY APPLICATIONOF DISCRETE SINE TRANSFORM." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/31767727391176020662.

Full text
Abstract:
碩士
大同大學
電機工程學系(所)
101
Interpolation has been widely utilized in the generally adapted techniques for image processing nowadays, such as polynomial interpolation and Discrete Fourier Transform with zero padding. Somehow there usually deficiencies exist within and further optimization is highly demanded for the even finer needs for the current visual applications. In this treatise, it has been found and discovered that interpolation techniques with Discrete Sine/Cosine Transform perform satisfactorily on in image processing one-dimensional, especially the so-called DST-Ⅰ according to the experiments in this thesis. Some limitations of DST-Ⅰfound in previously works have been alleviated by our team while the improved version of DST-Ⅱhas also been derived and been utilized in the interpolation techniques. The visual differences of processed images after enlargement would be displayed and compared between DST-Ⅰ &; DST-Ⅱ in the later chapters. The picture viewer software handy usually generate defects as enlarging the images, it would bring unpleasant experiences for some applications require visual details. Our Team has successfully improved the Discrete Sine Transform technique that previously not applicable to one-dimensional image processing and pleasant results have been obtained. The procedures and effects DST-Ⅰ &; DST-Ⅱtechniques are depicted and the images after enlargement are also displayed and compared in this work..
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Discrete sine transform"

1

C, Yip P., and Rao K. Ramamohan, eds. Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations. Amsterdam: Academic Press, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Britanak, Vladimir. Discrete cosine and sine transforms: General properties, fast algorithms and integer approximations. Amsterdam: Academic, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Discrete Cosine and Sine Transforms. Elsevier, 2007. http://dx.doi.org/10.1016/b978-0-12-373624-6.x5000-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Britanak, Vladimir, Patrick C. Yip, and K. R. Rao. Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations. Academic Press, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Britanak, Vladimir, Patrick C. Yip, and K. R. Rao. Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations. Academic Press, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Britanak, Vladimir, Patrick C. Yip, and K. R. Rao. Discrete Cosine and Sine Transforms: General Properties, Fast Algorithms and Integer Approximations. Elsevier Science & Technology Books, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Discrete sine transform"

1

Ochoa-Domínguez, Humberto, and K. R. Rao. "The Discrete Sine Transform." In Discrete Cosine Transform, 95–112. Second edition. | Boca Raton, FL : Taylor & Francis Group, CRC Press, 2019. | Revised edition of: Discrete cosine transform : algorithms, advntages, applications / K. R. Rao, P. Yip. 1990.: CRC Press, 2019. http://dx.doi.org/10.1201/9780203729854-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Jain, Anamika, Neeta Pandey, and Priyanka Jain. "FPGA-Based Architecture for Implementation of Discrete Sine Transform." In Lecture Notes in Electrical Engineering, 13–22. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-0665-5_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jain, Anamika, and Neeta Pandey. "Implementation of Discrete Sine Transform Realization Though Systolic Architecture." In Lecture Notes in Electrical Engineering, 699–709. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-0275-7_57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Jerri, Abdul J. "The Discrete Sine (DST) and Cosine (DCT) Transforms for Boundary Value Problems." In Linear Difference Equations with Discrete Transform Methods, 329–53. Boston, MA: Springer US, 1996. http://dx.doi.org/10.1007/978-1-4757-5657-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zeng, Huicong, Zhiwei Cai, Peijia Zheng, Hongmei Liu, and Weiqin Luo. "Secure Evaluation of Discrete Sine Transform in Homomorphic Encrypted Domain." In Lecture Notes in Computer Science, 513–25. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-06788-4_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Di Benedetto, Fabio. "The use of discrete sine transform in computations with Toeplitz matrices." In Lecture Notes in Computer Science, 126–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-62598-4_86.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kekre, H. B., Archana Athawale, and Dipali Sadavarti. "A novel steganographic scheme using discrete sine transform based on energy distribution." In Thinkquest~2010, 247–50. New Delhi: Springer India, 2011. http://dx.doi.org/10.1007/978-81-8489-989-4_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Dahiya, Pragati, and Priyanka Jain. "Realization of Recursive Algorithm for One-Dimensional Discrete Sine Transform and Its Inverse." In Advances in Intelligent Systems and Computing, 357–67. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-1822-1_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Garg, Shilpa, Richa Yadav, and Manjeet Kumar. "Discrete Sine Transform Interpolation-Based Design of 2-D FIR Fractional Delay Digital Filter." In Proceedings of Second International Conference on Computational Electronics for Wireless Communications, 423–35. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-19-6661-3_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Dirickx, M., S. Denis, B. Vanderheyden, L. Dusoulier, and M. Ausloos. "Inversion of the Biot-Savart Law: An Approach Based on Discrete Sine and Cosine Transforms." In Magneto-Optical Imaging, 257–64. Dordrecht: Springer Netherlands, 2004. http://dx.doi.org/10.1007/978-94-007-1007-8_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Discrete sine transform"

1

Koc, Ut-Va, and K. J. Ray Liu. "Discrete-cosine/sine-transform based motion estimation." In Proceedings of 1st International Conference on Image Processing. IEEE, 1994. http://dx.doi.org/10.1109/icip.1994.413784.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kai Xie. "Discrete sine transform shrinkage functions based image denoising." In 2011 Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC). IEEE, 2011. http://dx.doi.org/10.1109/csqrwc.2011.6037207.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Binesh, T., M. H. Supriya, and P. R. S. Pillai. "Discrete Sine Transform based HMM underwater signal classifier." In 2011 International Symposium on Ocean Electronics (SYMPOL 2011). IEEE, 2011. http://dx.doi.org/10.1109/sympol.2011.6170513.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Li, Xueyao, Hua Xie, and Bailing Cheng. "Noisy Speech Enhancement Based on Discrete Sine Transform." In 2006 International Multi-Symposiums on Computer and Computational Sciences (IMSCCS). IEEE, 2006. http://dx.doi.org/10.1109/imsccs.2006.91.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Yao, Yong, Haopeng Liu, Hebing Lei, and Haokun Wu. "A difference tracking algorithm based on discrete sine transform." In Ninth International Conference on Graphic and Image Processing, edited by Hui Yu and Junyu Dong. SPIE, 2018. http://dx.doi.org/10.1117/12.2302771.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Madhukar, B. N., and Sanjay Jain. "A duality theorem for the discrete sine transform (DST)." In 2015 International Conference on Applied and Theoretical Computing and Communication Technology (iCATccT). IEEE, 2015. http://dx.doi.org/10.1109/icatcct.2015.7456874.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kus, Yasin, Mukremin Kavlak, Ugur Elmagoz, and Ali Ozen. "Zero tail unique word discrete sine transform spread OFDM." In 2018 26th Signal Processing and Communications Applications Conference (SIU). IEEE, 2018. http://dx.doi.org/10.1109/siu.2018.8404710.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Surve, N., and A. Kulkarni. "Iris recognition using discrete sine transform and neural network." In ICWET '10: International Conference and Workshop on Emerging Trends in Technology. New York, NY, USA: ACM, 2010. http://dx.doi.org/10.1145/1741906.1742081.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Tseng, Chien-Cheng, and Su-Ling Lee. "Closed-form design of fixed fractional hubert transformer using discrete sine transform." In 2014 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS). IEEE, 2014. http://dx.doi.org/10.1109/apccas.2014.7032823.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Eichmann, George, J. Zhu, C. Lu, and Y. Li. "New discrete image transform processing." In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1989. http://dx.doi.org/10.1364/oam.1989.fn2.

Full text
Abstract:
Image data compression is an important research area in image processing. A basic image data compression technique is to use an invertible linear transformation, such as Fourier, cosine, sine, and Hadamard transformations, to generate approximate uncorrelated coefficients in the transform domain. The optimal uncorrelated transform, the so-called Karhunen-Leove, coefficients are image dependent. Here, computationally efficient linear, invertible integer, the so-called Newton and Stirling, transforms are proposed. Integer arithmetic promises substantial computational savings. Some of the properties of these transforms are described.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Discrete sine transform"

1

Geist, Jon, and M. Yaqub Afridi. Simulated Sinewave Testing of Data Acquisition Systems using Sine Fitting and Discrete Fourier Transform Methods Part 1: Frequency Offset, Random, Quantization, and Jitter Noise. National Institute of Standards and Technology, July 2015. http://dx.doi.org/10.6028/nist.ir.8073.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Discrete sine transform' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography