Auswahl der wissenschaftlichen Literatur zum Thema „Transformée de Walsh“

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Transformée de Walsh" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Transformée de Walsh"

1

Hu Liang, 胡亮, 胡学娟 Hu Xuejuan, 黄圳鸿 Huang Zhenhong, 徐露 Xu Lu und 连丽津 Lian Lijin. „基于离散Walsh-Hadamard变换和引导滤波的多聚焦图像融合“. Laser & Optoelectronics Progress 58, Nr. 22 (2021): 2210003. http://dx.doi.org/10.3788/lop202158.2210003.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Sasikala, D., und R. Neelaveni. „Correlation Coefficient Measure of Mono and Multimodal Brain Image Registration using Fast Walsh Hadamard Transform“. International Journal of Engineering and Technology 3, Nr. 2 (2011): 154–60. http://dx.doi.org/10.7763/ijet.2011.v3.215.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Birkeland, Peter. „Supermarkets Transformed: Understanding Organizational and Technological Innovations.John P. Walsh“. American Journal of Sociology 100, Nr. 3 (November 1994): 845–46. http://dx.doi.org/10.1086/230598.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Berti, E., F. Chiaraluce, N. E. Evans und J. J. McKee. „Reduction of Walsh-transformed electrocardiograms by double logarithmic coding“. IEEE Transactions on Biomedical Engineering 47, Nr. 11 (2000): 1543–47. http://dx.doi.org/10.1109/10.880108.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Jeyasurya, B., und M. Rahman. „Application of Walsh Functions for Microprocessor-Based Transformer Protection“. IEEE Transactions on Electromagnetic Compatibility EMC-27, Nr. 4 (November 1985): 221–25. http://dx.doi.org/10.1109/temc.1985.304293.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Magomed-Kasumov, Magomedrasul, und Salikh Magomedov. „Быстрое преобразование Фурье по системе функций, ортогональных по Соболеву и порожденных системой Уолша“. Daghestan Electronic Mathematical Reports, Nr. 15 (2021): 55–66. http://dx.doi.org/10.31029/demr.15.5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Mustafa, Ziyad Tariq, Alaa Al-Hammami und Jasim Al-Samarai. „Evaluation of Wavelet Transform Audio Hiding“. Iraqi Journal for Computers and Informatics 40, Nr. 1 (31.12.2002): 32–44. http://dx.doi.org/10.25195/ijci.v40i1.224.

Der volle Inhalt der Quelle
Annotation:
Audio hiding is method for embedding information into an audio signal. It seeks to do so in a robust Fashion, while not perceivably degrading the host signal (coves audio). Hiding data in audio signals presents & varicty of challenges: due in part to the wider dynamic and differential range of the Human Auditory System (HAS) as compared to other senses. Transform are usually used for robust audio hiding (audio watcrmarking). But, the audio hiding process is affected by the type of transform used. Therefore, this paper presents an evaluation of wavelet transform hiding in comprison with sclccted types of transforms (Walsh transform and cosine transform) hiding. In order to generate the audio stegecover, the research concludce (Wavelet, Walsh, or Cosine) transform of the audio cover, replacing some transformed cover cocfficients with secret audio message coefficients, and inverse (Wavelet, Walsit, or Carsine Irannom for audio cover with replaced coefficients. While, the extracting method concludes (Wavelel, Walsh, or Cosine runsform of the stego ove18 and extracting the secrecy extracted Audio message.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

WU, Wei. „Characteristics of Dual-cylinder Hydraulic Transformer with Rotatable Wash Plate“. Journal of Mechanical Engineering 49, Nr. 22 (2013): 144. http://dx.doi.org/10.3901/jme.2013.22.144.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Shuo-Yen Tseng. „Synthesis of a 4 $\times$ 4 Walsh–Hadamard Transformer Using Long-Period Waveguide Grating Arrays“. IEEE Photonics Technology Letters 21, Nr. 14 (Juli 2009): 972–74. http://dx.doi.org/10.1109/lpt.2009.2021154.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

MAGAÑA, SONIA, SARAH M. SCHLEMMER, GORDON R. DAVIDSON, ELLIOT T. RYSER und DANIEL V. LIM. „Laboratory and Pilot-Scale Dead-End Ultrafiltration Concentration of Sanitizer-Free and Chlorinated Lettuce Wash Water for Improved Detection of Escherichia coli O157:H7“. Journal of Food Protection 77, Nr. 8 (01.08.2014): 1260–68. http://dx.doi.org/10.4315/0362-028x.jfp-13-421.

Der volle Inhalt der Quelle
Annotation:
An automated dead-end (single pass, no recirculation) ultrafiltration device, the Portable Multi-use Automated Concentration System (PMACS), was evaluated as a means to concentrate Escherichia coli O157:H7 from 40 liters of simulated commercial lettuce wash water. The assessment included generating, sieving, and concentrating sanitizer-free lettuce wash water, either uninoculated or inoculated with green fluorescent protein–transformed E. coli O157:H7 at a high (1.00 log CFU/ml) or low (−1.00 log CFU/ml) concentration. Cells collected within the filters were recovered in approximately 400 ml of buffer to create lettuce wash retentates. The extent of concentration was determined by viable plate counts using a medium selective for the transformed E. coli O157:H7. The samples were qualitatively analyzed for E. coli O157:H7 according to the U.S. Food and Drug Administration Bacteriological Analytical Manual enrichment method and with an electrochemiluminescence immunoassay. This concentration method was then evaluated in a pilot-scale production line at Michigan State University using chlorinated (100, 30, and 10 ppm of available chlorine) lettuce wash water. The total PMACS processing times were 82 ±6 and 65 ±5 min for sanitizer-free and chlorinated washes, respectively. Overall, E. coli O157:H7 populations were approximately 2 log higher in retentates than in unconcentrated lettuce wash samples. The higher E. coli O157:H7 levels in the retentates enabled cultural and electrochemiluminescence immunoassay detection in some samples when the corresponding lettuce wash samples were negative. When combined with standard and rapid detection methods, the PMACS concentration method may provide a means to enhance pathogen monitoring of produce wash water.
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dissertationen zum Thema "Transformée de Walsh"

1

Flórez, Gutiérrez Antonio. „Improved Techniques in the Cryptanalysis of Symmetric Primitives“. Electronic Thesis or Diss., Sorbonne université, 2022. http://www.theses.fr/2022SORUS281.

Der volle Inhalt der Quelle
Annotation:
Dans cette thèse, on propose des améliorations qui peuvent être appliquées à plusieurs techniques de cryptanalyse de primitives symétriques. On dédie une attention spéciale à la cryptanalyse linéaire, pour laquelle une technique basée sur la transformée de Walsh rapide était déjà connue (Collard et al., ICISC 2007). On introduit une version généralisée de cette attaque, qui permet de l'appliquer pour la récupération de clé considerant plusieurs tours, ainsi que le réduction de la complexité du problème en utilisant par example des informations provénantes du key-schedule. On propose aussi une technique générale pour accélérer les attaques par récupération de clé qui est basée sur la représentation des boîtes S en tant que arbres binaires. Finalement, on montre comment on a obtenu une approximation linéaire sur la version complète de la permutation Gimli en utilisant l'optimisation par mixed-integer linear programming (MILP)
This thesis proposes improvements which can be applied to several techniques for the cryptanalysis of symmetric primitives. Special attention is given to linear cryptanalysis, for which a technique based on the fast Walsh transform was already known (Collard et al., ICISIC 2007). We introduce a generalised version of this attack, which allows us to apply it on key recovery attacks over multiple rounds, as well as to reduce the complexity of the problem using information extracted, for example, from the key schedule. We also propose a general technique for speeding key recovery attacks up which is based on the representation of Sboxes as binary decision trees. Finally, we showcase the construction of a linear approximation of the full version of the Gimli permutation using mixed-integer linear programming (MILP) optimisation
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Lazaridis, George. „Image processing using the Walsh transform“. Thesis, University of Surrey, 2004. http://epubs.surrey.ac.uk/843950/.

Der volle Inhalt der Quelle
Annotation:
This thesis presents a new algorithm which can be used to register images of the same or different modalities e.g images with multiple channels such as X-rays, temperature, or elevation or simply images of different spectral bands. In particular, a correlation-based scheme is used, but instead of grey values, it correlates numbers formulated by different combinations of the extracted local Walsh coefficients of the images. Each image patch is expanded in terms of Walsh basis functions. Each Walsh basis function can be thought of as measuring a different aspect of local structure, eg horizontal edge, corner, etc. The coefficients of the expansion, therefore, can be thought of as dense local features, estimating at each point the degree of presence of, for example, a horizontal edge, a corner with contrast of a certain type, etc. These coefficients are normalised and used as digits in a chosen number system which allows one to create a unique number for each type of local structure. The choice of the basis of the number system allows one to give different emphasis to different types of local feature (e.g. corners versus edges) and thus the method we present forms a unified framework in terms of which several feature matching methods may be interpreted. The algorithm is compared with wavelet based approaches, using simulated and real images. The images used for the registration experiments are assumed to differ from each other by a rotation and a translation only. Additionally, the method was extended to cope with 3D image sets, while as an add-on, it was also tried in performing image segmentation.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Furis, Mihai Alexandru Johnson Jeremy. „Cache miss analysis of Walsh-Hadamard Transform algorithms /“. Philadelphia : Drexel University, 2003. http://dspace.library.drexel.edu/handle/1721.1/109.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

O'Dowd, Timothy R. „Discovery of bent functions using the Fast Walsh Transform“. Thesis, Monterey, California. Naval Postgraduate School, 2010. http://hdl.handle.net/10945/5080.

Der volle Inhalt der Quelle
Annotation:
Approved for public release; distribution is unlimited
Linear cryptanalysis attacks are a threat against cryptosystems. These attacks can be defended against by using combiner functions composed of highly nonlinear Boolean functions. Bent functions, which have the highest possible nonlinearity, are uncommon. As the number of variables in a Boolean function increases, bent functions become extremely rare. A method of computing the nonlinearity of Boolean functions using the Fast Walsh Transform (FWT) is presented. The SRC-6 reconfigurable computer allows testing of functions at a much faster rate than a PC. With a clock frequency of 100 MHz, throughput of the SRC-6 is 100,000,000 functions per second. An implementation of the FWT used to compute the nonlinearity of Boolean functions with up to five variables is presented. Since there are 22n Boolean functions of n variables, computation of the nonlinearity of every Boolean function with six or more variables takes thousands of years to complete. This makes discovery of bent functions difficult for large n. An algorithm is presented that uses information in the FWT of a function to produce similar functions with increasingly higher nonlinearity. This algorithm demonstrated the ability to enumerate every bent function for n = 4 without the necessity of exhaustively testing all fourvariable functions.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Davis, Jeffrey H. „A study of potential uses for Walsh transformed images in target recognition“. Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA292722.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Desmond, Allan Peter. „An analytical signal transform derived from the Walsh Transform for efficient detection of dual tone multiple frequency (DTMF) signals“. Thesis, Bucks New University, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.401474.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Sagdicoglu, Serhat. „Cryptological Viewpoint Of Boolean Functions“. Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/1082403/index.pdf.

Der volle Inhalt der Quelle
Annotation:
Boolean functions are the main building blocks of most cipher systems. Various aspects of their cryptological characteristics are examined and investigated by many researchers from different fields. This thesis has no claim to obtain original results but consists in an attempt at giving a unified survey of the main results of the subject. In this thesis, the theory of boolean functions is presented in details, emphasizing some important cryptological properties such as balance, nonlinearity, strict avalanche criterion and propagation criterion. After presenting many results about these criteria with detailed proofs, two upper bounds and two lower bounds on the nonlinearity of a boolean function due to Zhang and Zheng are proved. Because of their importance in the theory of boolean functions, construction of Sylvester-Hadamard matrices are shown and most of their properties used in cryptography are proved. The Walsh transform is investigated in detail by proving many properties. By using a property of Sylvester-Hadamard matrices, the fast Walsh transform is presented and its application in finding the nonlinearity of a boolean function is demonstrated. One of the most important classes of boolean functions, so called bent functions, are presented with many properties and by giving several examples, from the paper of Rothaus. By using bent functions, relations between balance, nonlinearity and propagation criterion are presented and it is shown that not all these criteria can be simultaneously satisfied completely. For this reason, several constructions of functions optimizing these criteria which are due to Seberry, Zhang and Zheng are presented.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

RAJYALAKSHMI, P. S., und R. K. RAJANGAM. „DATA COMPRESSION SYSTEM FOR VIDEO IMAGES“. International Foundation for Telemetering, 1986. http://hdl.handle.net/10150/615539.

Der volle Inhalt der Quelle
Annotation:
International Telemetering Conference Proceedings / October 13-16, 1986 / Riviera Hotel, Las Vegas, Nevada
In most transmission channels, bandwidth is at a premium and an important attribute of any good digital signalling scheme is to optimally utilise the bandwidth for transmitting the information. The Data Compression System in this way plays a significant role in the transmission of picture data from any Remote Sensing Satellite by exploiting the statistical properties of the imagery. The data rate required for transmission to ground can be reduced by using suitable compression technique. A data compression algorithm has been developed for processing the images of Indian Remote Sensing Satellite. Sample LANDSAT imagery and also a reference photo are used for evaluating the performance of the system. The reconstructed images are obtained after compression for 1.5 bits per pixel and 2 bits per pixel as against the original of 7 bits per pixel. The technique used is uni-dimensional Hadamard Transform Technique. The Histograms are computed for various pictures which are used as samples. This paper describes the development of such a hardware and software system and also indicates how hardware can be adopted for a two dimensional Hadamard Transform Technique.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Ahmed, Kamal Ali. „Digital watermarking of still images“. Thesis, University of Manchester, 2013. https://www.research.manchester.ac.uk/portal/en/theses/digital-watermarking-of-still-images(0dc4b146-3d97-458f-9506-8c67bc3a155b).html.

Der volle Inhalt der Quelle
Annotation:
This thesis presents novel research work on copyright protection of grey scale and colour digital images. New blind frequency domain watermarking algorithms using one dimensional and two dimensional Walsh coding were developed. Handwritten signatures and mobile phone numbers were used in this project as watermarks. In this research eight algorithms were developed based on the DCT using 1D and 2D Walsh coding. These algorithms used the low frequency coefficients of the 8 × 8 DCT blocks for embedding. A shuffle process was used in the watermarking algorithms to increase the robustness against the cropping attacks. All algorithms are blind since they do not require the original image. All algorithms caused minimum distortion to the host images and the watermarking is invisible. The watermark is embedded in the green channel of the RGB colour images. The Walsh coded watermark is inserted several times by using the shuffling process to improve its robustness. The effect of changing the Walsh lengths and the scaling strength of the watermark on the robustness and image quality were studied. All algorithms are examined by using several grey scale and colour images of sizes 512 × 512. The fidelity of the images was assessed by using the peak signal to noise ratio (PSNR), the structural similarity index measure (SSIM), normalized correlation (NC) and StirMark benchmark tools. The new algorithms were tested on several grey scale and colour images of different sizes. Evaluation techniques using several tools with different scaling factors have been considered in the thesis to assess the algorithms. Comparisons carried out against other methods of embedding without coding have shown the superiority of the algorithms. The results have shown that use of 1D and 2D Walsh coding with DCT Blocks offers significant improvement in the robustness against JPEG compression and some other image processing operations compared to the method of embedding without coding. The originality of the schemes enables them to achieve significant robustness compared to conventional non-coded watermarking methods. The new algorithms offer an optimal trade-off between perceptual distortion caused by embedding and robustness against certain attacks. The new techniques could offer significant advantages to the digital watermark field and provide additional benefits to the copyright protection industry.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

El, Omer. „Avalanche Properties And Randomness Of The Twofish Cipher“. Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605571/index.pdf.

Der volle Inhalt der Quelle
Annotation:
In this thesis, one finalist cipher of the Advanced Encryption Standard (AES) block cipher contest, Twofish proposed by Schneier et al, is studied in order to observe the validity of the statement made by Arikan about the randomness of the cipher, which contradicts National Institute of Standards and Technology (NIST)&rsquo
s results. The strength of the cipher to cryptanalytic attacks is investigated by measuring its randomness according to the avalanche criterion. The avalanche criterion results are compared with those of the Statistical Test Suite of the NIST and discrepancies in the second and third rounds are explained theoretically.
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Transformée de Walsh"

1

Golubov, B., A. Efimov und V. Skvortsov. Walsh Series and Transforms. Dordrecht: Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-011-3288-6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

V, Efimov A., und Skvort͡s︡ov V. A, Hrsg. Walsh series and transforms: Theory and applications. Dordrecht [Netherlands]: Kluwer Academic Publishers, 1991.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Golubov, B. Walsh Series and Transforms: Theory and Applications. Dordrecht: Springer Netherlands, 1991.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Golubov, B., V. Skvortsov und A. Efimov. Walsh Series and Transforms: Theory and Applications. Springer Netherlands, 2012.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Transformée de Walsh"

1

Klapper, Andrew, und Mark Goresky. „A With-Carry Walsh Transform“. In Sequences and Their Applications – SETA 2010, 217–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15874-2_18.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Wu, Chuan-Kun, und Dengguo Feng. „Boolean Functions and Their Walsh Transforms“. In Advances in Computer Science and Technology, 1–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-48865-2_1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Golubov, Boris I. „Dyadic Derivative and Walsh-Fourier Transform“. In Dyadic Walsh Analysis from 1924 Onwards Walsh-Gibbs-Butzer Dyadic Differentiation in Science Volume 1 Foundations, 443–47. Paris: Atlantis Press, 2015. http://dx.doi.org/10.2991/978-94-6239-160-4_11.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Arndt, Jörg. „The Walsh transform and its relatives“. In Matters Computational, 459–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14764-7_23.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Klapper, Andrew. „Arithmetic Walsh Transform of Quadratic Boolean Functions“. In Lecture Notes in Computer Science, 65–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30615-0_6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Srivastva, Ranjeet, und Yogendra Narain Singh. „ECG Biometric Analysis Using Walsh–Hadamard Transform“. In Advances in Data and Information Sciences, 201–10. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-8360-0_19.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Jin, Wengang, Xiaoni Du, Jinxia Hu und Yanzhong Sun. „Boolean Functions with a Few Walsh Transform Values“. In Advances in Artificial Intelligence and Security, 642–55. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-78618-2_53.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Diana Andrushia, A., und R. Thangarjan. „Saliency-Based Image Compression Using Walsh–Hadamard Transform (WHT)“. In Biologically Rationalized Computing Techniques For Image Processing Applications, 21–42. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-61316-1_2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Flórez-Gutiérrez, Antonio. „Optimising Linear Key Recovery Attacks with Affine Walsh Transform Pruning“. In Advances in Cryptology – ASIACRYPT 2022, 447–76. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-22972-5_16.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Gong, Guang, Tor Helleseth, Honggang Hu und Chunlei Li. „New Three-Valued Walsh Transforms from Decimations of Helleseth-Gong Sequences“. In Lecture Notes in Computer Science, 327–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-30615-0_30.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Transformée de Walsh"

1

Uri, Joseph B. „The Cormack - Walsh Transform“. In 14th Congress of the International Commission for Optics, herausgegeben von Henri H. Arsenault. SPIE, 1987. http://dx.doi.org/10.1117/12.967374.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Glasser, Adrian, und Howard C. Howland. „Artistic transformations in image processing“. In OSA Annual Meeting. Washington, D.C.: Optica Publishing Group, 1986. http://dx.doi.org/10.1364/oam.1986.thn9.

Der volle Inhalt der Quelle
Annotation:
We have examined certain transformations, linear and nonlinear, which transform frame-grabbed black-and-white photographic images into artistic renditions of the original. Such transforms resemble sketches, sketch and wash renditions, or mosaics. Generally these transforms involve a large reduction in information of the original photographic image, and we have attempted to measure this reduction using coding algorithms. The reverse, increase in information when an artist creates a painting from a sketch, was also evaluated. Lastly, we also studied the importance of the information retained and discarded in the recognition of faces in a series of artistically transformed, frequency filtered images. We conclude that information necessary for recognizing faces (and many other objects) is broadly and redundantly distributed throughout the spatial frequency spectrum.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Irion, Jeff, und Naoki Saito. „The generalized Haar-Walsh transform“. In 2014 IEEE Statistical Signal Processing Workshop (SSP). IEEE, 2014. http://dx.doi.org/10.1109/ssp.2014.6884678.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Ben Uri, Joseph. „Coded holography for Walsh transform and Haar transform“. In Holographics International '92, herausgegeben von Yuri N. Denisyuk und Frank Wyrowski. SPIE, 1993. http://dx.doi.org/10.1117/12.140399.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Ittycheriah, Abraham P., John F. Walkup und Thomas F. Krile. „Applications of a Polarization-Based Optical Processor“. In Optical Computing. Washington, D.C.: Optica Publishing Group, 1989. http://dx.doi.org/10.1364/optcomp.1989.tui10.

Der volle Inhalt der Quelle
Annotation:
Optical logic and transforms such as the Walsh and Haar are examples of optical binary arithmetic. A processor capable of evaluating polynomials1 has been used to perform optical logic and Walsh and Haar transforms. This summary describes these applications.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Lee, Man Hee, Muhammad Basit Shahab, Md Fazlul Kader und Soo Young Shin. „Spatial multiplexing using walsh-hadamard transform“. In 2016 International Conference on Smart Green Technology in Electrical and Information Systems (ICSGTEIS). IEEE, 2016. http://dx.doi.org/10.1109/icsgteis.2016.7885764.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Falkowski, Bogdan J., und Shixing Yan. „Ternary Walsh spectral transform decision diagrams“. In 2007 6th International Conference on Information, Communications & Signal Processing. IEEE, 2007. http://dx.doi.org/10.1109/icics.2007.4449769.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Lu, Yi. „Practical tera-scale Walsh-Hadamard Transform“. In 2016 Future Technologies Conference (FTC). IEEE, 2016. http://dx.doi.org/10.1109/ftc.2016.7821757.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Falkowski, Bogdan, und Shixing Yan. „Arithmetic-Walsh Spectral Transform Decision Diagrams“. In 2006 IEEE International Symposium on Information Theory. IEEE, 2006. http://dx.doi.org/10.1109/isit.2006.261902.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

El-Konyaly, El-Sayed H., Sabry F. Saraya und Wael W. A. A. Al-Khazragy. „Point feature matching adopting Walsh transform“. In Intelligent Systems & Advanced Manufacturing, herausgegeben von David P. Casasent. SPIE, 1997. http://dx.doi.org/10.1117/12.290330.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Transformée de Walsh"

1

Liberty, Edo, Nir Ailon und Amit Singer. Fast Random Projections Using Lean Walsh Transforms. Fort Belvoir, VA: Defense Technical Information Center, Dezember 2007. http://dx.doi.org/10.21236/ada489771.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie