|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
b3336012 |
| 003 |
MWH |
| 005 |
20200211182551.0 |
| 007 |
cr nn 008mamaa |
| 008 |
171103s2018 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319690698
|
| 024 |
7 |
|
|a 10.1007/978-3-319-69069-8
|2 doi
|
| 035 |
|
|
|a (DE-He213)978-3-319-69069-8
|
| 050 |
|
4 |
|a E-Book
|
| 072 |
|
7 |
|a TTBM
|2 bicssc
|
| 072 |
|
7 |
|a TEC008000
|2 bisacsh
|
| 072 |
|
7 |
|a TTBM
|2 thema
|
| 072 |
|
7 |
|a UYS
|2 thema
|
| 100 |
1 |
|
|a Thanki, Rohit.
|e author.
|0 (orcid)0000-0002-0645-6266
|1 https://orcid.org/0000-0002-0645-6266
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 245 |
1 |
0 |
|a Advance Compression and Watermarking Technique for Speech Signals
|h [electronic resource] /
|c by Rohit Thanki, Komal Borisagar, Surekha Borra.
|
| 250 |
|
|
|a 1st ed. 2018.
|
| 264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2018.
|
| 300 |
|
|
|a XVIII, 69 p. 38 illus., 28 illus. in color.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a SpringerBriefs in Speech Technology, Studies in Speech Signal Processing, Natural Language Understanding, and Machine Learning,
|x 2191-737X
|
| 490 |
1 |
|
|a Springer eBook Collection
|
| 520 |
|
|
|a This book introduces methods for copyright protection and compression for speech signals. The first method introduces copyright protection of speech signal using watermarking; the second introduces compression of the speech signal using Compressive Sensing (CS). Both methods are tested and analyzed. The speech watermarking method uses technology such as Finite Ridgelet Transform (FRT), Discrete Wavelet Transform (DWT) and Singular Value Decomposition (SVD). The performance of the method is evaluated and compared with existing watermarking methods. In the speech compression method, the standard Compressive Sensing (CS) process is used for compression of the speech signal. The performance of the proposed method is evaluated using various transform bases like Discrete Fourier Transform (DFT), Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT), Singular Value Decomposition (SVD), and Fast Discrete Curvelet Transform (FDCuT).
|
| 590 |
|
|
|a Loaded electronically.
|
| 590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
| 650 |
|
0 |
|a Signal processing.
|
| 650 |
|
0 |
|a Image processing.
|
| 650 |
|
0 |
|a Speech processing systems.
|
| 650 |
|
0 |
|a Computational linguistics.
|
| 650 |
|
0 |
|a Natural language processing (Computer science).
|
| 650 |
|
0 |
|a Database management.
|
| 690 |
|
|
|a Electronic resources (E-books)
|
| 700 |
1 |
|
|a Borisagar, Komal.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 700 |
1 |
|
|a Borra, Surekha.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 830 |
|
0 |
|a SpringerBriefs in Speech Technology, Studies in Speech Signal Processing, Natural Language Understanding, and Machine Learning,
|x 2191-737X
|
| 830 |
|
0 |
|a Springer eBook Collection.
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/978-3-319-69069-8
|3 Click to view e-book
|t 0
|
| 907 |
|
|
|a .b33360121
|b 04-18-22
|c 02-26-20
|
| 998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g gw
|h 0
|i 1
|
| 912 |
|
|
|a ZDB-2-ENG
|
| 950 |
|
|
|a Engineering (Springer-11647)
|
| 902 |
|
|
|a springer purchased ebooks
|
| 903 |
|
|
|a SEB-COLL
|
| 945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i22491740
|z 02-26-20
|
| 999 |
f |
f |
|i 8b8a6078-3d08-5cf5-8baf-a9597368ac6c
|s 2c224055-4a3c-5a98-8f63-0fd2378d3364
|t 0
|
| 952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|t 0
|e E-Book
|h Library of Congress classification
|i Elec File
|