Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "singular value decomposition" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 56
Tytuł:
A 2D system approach to the design of a robust modified repetitive-control system with a dynamic output-feedback controller
Autorzy:
Zhou, L.
She, J.
Zhou, S.
Powiązania:
https://bibliotekanauki.pl/articles/330403.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
repetitive control
dynamic output feedback
two dimensional system
singular value decomposition
linear matrix inequality
sterowanie powtarzalne
sprzężenie zwrotne dynamiczne
system dwuwymiarowy
liniowa nierówność macierzowa
Opis:
This paper is concerned with the problem of designing a robust modified repetitive-control system with a dynamic output feedback controller for a class of strictly proper plants. Employing the continuous lifting technique, a continuous-discrete two-dimensional (2D) model is built that accurately describes the features of repetitive control. The 2D control input contains the direct sum of the effects of control and learning, which allows us to adjust control and learning preferentially. The singular-value decomposition of the output matrix and Lyapunov stability theory are used to derive an asymptotic stability condition based on a Linear Matrix Inequality (LMI). Two tuning parameters in the LMI manipulate the preferential adjustment of control and learning. A numerical example illustrates the tuning procedure and demonstrates the effectiveness of the method.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 2; 325-334
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A fast neural network learning algorithm with approximate singular value decomposition
Autorzy:
Jankowski, Norbert
Linowiecki, Rafał
Powiązania:
https://bibliotekanauki.pl/articles/330870.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
Moore–Penrose pseudoinverse
radial basis function network
extreme learning machine
kernel method
machine learning
singular value decomposition
deep extreme learning
principal component analysis
pseudoodwrotność Moore–Penrose
radialna funkcja bazowa
maszyna uczenia ekstremalnego
uczenie maszynowe
analiza składników głównych
Opis:
The learning of neural networks is becoming more and more important. Researchers have constructed dozens of learning algorithms, but it is still necessary to develop faster, more flexible, or more accurate learning algorithms. With fast learning we can examine more learning scenarios for a given problem, especially in the case of meta-learning. In this article we focus on the construction of a much faster learning algorithm and its modifications, especially for nonlinear versions of neural networks. The main idea of this algorithm lies in the usage of fast approximation of the Moore–Penrose pseudo-inverse matrix. The complexity of the original singular value decomposition algorithm is O(mn2). We consider algorithms with a complexity of O(mnl), where l < n and l is often significantly smaller than n. Such learning algorithms can be applied to the learning of radial basis function networks, extreme learning machines or deep ELMs, principal component analysis or even missing data imputation.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2019, 29, 3; 581-594
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A note on minimax rates of convergence in the Spektor-Lord-Willis problem
Autorzy:
Szkutnik, Z.
Powiązania:
https://bibliotekanauki.pl/articles/254773.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
poisson inverse problem
rate minimaxity
singular value decomposition
stereology
Opis:
In this note, attainable lower bounds are constructed for the convergence rates in a stereological problem of unfolding spheres size distribution from linear sections, which shows that a spectral type estimator is strictly rate minimax over some Sobolev-type classes of functions.
Źródło:
Opuscula Mathematica; 2010, 30, 2; 203-207
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A practical application of kernel-based fuzzy discriminant analysis
Autorzy:
Gao, J. Q.
Fan, L. Y.
Li, L.
Xu, L. Z.
Powiązania:
https://bibliotekanauki.pl/articles/908344.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
analiza dyskryminacyjna
algorytm najbliższego sąsiada
SVD
kernel fuzzy discriminant analysis
fuzzy k-nearest neighbor
QR decomposition
singular value decomposition (SVD)
fuzzy membership matrix
t-test
Opis:
A novel method for feature extraction and recognition called Kernel Fuzzy Discriminant Analysis (KFDA) is proposed in this paper to deal with recognition problems, e.g., for images. The KFDA method is obtained by combining the advantages of fuzzy methods and a kernel trick. Based on the orthogonal-triangular decomposition of a matrix and Singular Value Decomposition (SVD), two different variants, KFDA/QR and KFDA/SVD, of KFDA are obtained. In the proposed method, the membership degree is incorporated into the definition of between-class and within-class scatter matrices to get fuzzy between-class and within-class scatter matrices. The membership degree is obtained by combining the measures of features of samples data. In addition, the effects of employing different measures is investigated from a pure mathematical point of view, and the t-test statistical method is used for comparing the robustness of the learning algorithm. Experimental results on ORL and FERET face databases show that KFDA/QR and KFDA/SVD are more effective and feasible than Fuzzy Discriminant Analysis (FDA) and Kernel Discriminant Analysis (KDA) in terms of the mean correct recognition rate.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 4; 887-903
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Signal Subspace Speech Enhancement Approach Based on Joint Low-Rank and Sparse Matrix Decomposition
Autorzy:
Sun, C.
Xie, J.
Leng, Y.
Powiązania:
https://bibliotekanauki.pl/articles/177990.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
subspace speech enhancement
singular value decomposition
joint low-rank and sparse matrix decomposition
Opis:
Subspace-based methods have been effectively used to estimate enhanced speech from noisy speech samples. In the traditional subspace approaches, a critical step is splitting of two invariant subspaces associated with signal and noise via subspace decomposition, which is often performed by singular-value decomposition or eigenvalue decomposition. However, these decomposition algorithms are highly sensitive to the presence of large corruptions, resulting in a large amount of residual noise within enhanced speech in low signal-to-noise ratio (SNR) situations. In this paper, a joint low-rank and sparse matrix decomposition (JLSMD) based subspace method is proposed for speech enhancement. In the proposed method, we firstly structure the corrupted data as a Toeplitz matrix and estimate its effective rank value for the underlying clean speech matrix. Then the subspace decomposition is performed by means of JLSMD, where the decomposed low-rank part corresponds to enhanced speech and the sparse part corresponds to noise signal, respectively. An extensive set of experiments have been carried out for both of white Gaussian noise and real-world noise. Experimental results show that the proposed method performs better than conventional methods in many types of strong noise conditions, in terms of yielding less residual noise and lower speech distortion.
Źródło:
Archives of Acoustics; 2016, 41, 2; 245-254
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Single Number Index to Assess Selected Acoustic Parameters in Churches with Redundant Information
Autorzy:
Kosała, K.
Powiązania:
https://bibliotekanauki.pl/articles/177017.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
acoustic quality
index method
sacral objects
singular value decomposition (SVD)
redundant information
Opis:
The paper presents an innovative approach for the index assessment of the acous- tic properties of churches. A new formula for an approximate single number index to assess selected acoustic parameters of church interiors, such as reverberation time (RT), speech intelligibility index (RASTI) and music clarity index (C80), is presented in the paper. The formula is created by means of the Singular Value Decomposition (SVD) method. An innovative approach for calculating the weights of partial in- dices is shown by solving the problem of redundant information, i.e., the system of overdetermined linear equations, using a computed pseudoinverse matrix. The new procedures for calculating the values of three partial indices and the single number index to assess selected acoustic parameters are presented. The proposed method was verified by measurements in several selected churches.
Źródło:
Archives of Acoustics; 2011, 36, 3; 545-560
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A study of parallel techniques for dimensionality reduction and its impact on the quality of text processing algorithms
Autorzy:
Pietroń, M.
Wielgosz, M.
Karwatowski, M.
Wiatr, K.
Powiązania:
https://bibliotekanauki.pl/articles/114190.pdf
Data publikacji:
2015
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
singular value decomposition
vector space model
TFIDF
Opis:
The presented algorithms employ the Vector Space Model (VSM) and its enhancements such as TFIDF (Term Frequency Inverse Document Frequency) with Singular Value Decomposition (SVD). TFIDF were applied to emphasize the important features of documents and SVD was used to reduce the analysis space. Consequently, a series of experiments were conducted. They revealed important properties of the algorithms and their accuracy. The accuracy of the algorithms was estimated in terms of their ability to match the human classification of the subject. For unsupervised algorithms the entropy was used as a quality evaluation measure. The combination of VSM, TFIDF, and SVD came out to be the best performing unsupervised algorithm with entropy of 0.16.
Źródło:
Measurement Automation Monitoring; 2015, 61, 7; 352-353
2450-2855
Pojawia się w:
Measurement Automation Monitoring
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Approximate Evaluation of BER Performance for Downlink GSVD-NOMA with Joint Maximum-likelihood Detector
Autorzy:
Hai, Ngo Thanh
Khoa, Dang Le
Powiązania:
https://bibliotekanauki.pl/articles/2142315.pdf
Data publikacji:
2022
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
generalized singular value decomposition
GSVD
joint maximum-likelihood
joint modulation
MIMO
non-orthogonal multiple access
NOMA
Opis:
Generalized Singular Value Decomposition (GSVD) is the enabling linear precoding scheme for multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) systems. In this paper, we extend research concerning downlink MIMO-NOMA systems with GSVD to cover bit terror rate (BER) performance and to derive an approximate evaluation of the average BER performance. Specifically, we deploy, AT the base station, the well-known technique of joint-modulation to generate NOMAsymbols and joint maximum-likelihood (ML) to recover the transmitted data at end user locations. Consequently, the joint ML detector offers almost the same performance, In terms of average BER as ideal successive interference cancellation. Next, we also investigate BER performance of other precoding schemes, such as zero-forcing, block diagonalization, and simultaneous triangularization, comparing them with GSVD. Furthermore, BER performance is verified in different configurations in relation to the number of antennas. In cases where the number of transmit antennas is greater than twice the number of receive antennas, average BER performance is superior.
Źródło:
Journal of Telecommunications and Information Technology; 2022, 3; 25--37
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An infinite horizon predictive control algorithm based on multivariable input-output models
Autorzy:
Ławryńczuk, M.
Tatjewski, P.
Powiązania:
https://bibliotekanauki.pl/articles/907410.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sterowanie predykcyjne
horyzont nieskończony
programowanie kwadratowe
model predictive control
stability
infinite horizon
singular value decomposition
quadratic programming
Opis:
In this paper an infinite horizon predictive control algorithm, for which closed loop stability is guaranteed, is developed in the framework of multivariable linear input-output models. The original infinite dimensional optimisation problem is transformed into a finite dimensional one with a penalty term. In the unconstrained case the stabilising control law, using a numerically reliable SVD decomposition, is derived as an analytical formula, calculated off-line. Considering constraints needs solving on-line a quadratic programming problem. Additionally, it is shown how free and forced responses can be calculated without the necessity of solving a matrix Diophantine equation.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 2; 167-180
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of dynamics of gene exspression using singular value decomposition
Autorzy:
Simek, K.
Kimmel, M.
Powiązania:
https://bibliotekanauki.pl/articles/332865.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:
wielokrotna ekspresja genów
dynamiczny model danych ekspresji genów
pojedynczy rozkład wartości
multiple gene expression
dynamic model of gene expression data
singular value decomposition
Opis:
Recently, data on multiple gene expression at sequential time points were analyzed, using Singular Value Decomposition (SVD) as a means to capture dominant trends, called characteristic modes, followed by fitting of a linear discrete-time dynamical model in which the expression values at a given time point are linear combinations of the values at a previous time point. We attempt to address several aspects of the method. To obtain the model we formulate a nonlinear optimization problem and present how to solve it numerically using standard MATLAB procedures. We use publicly available data to test the approach. Then, we investigate the sensitivity of the method to missing measurements and its possibilities to reconstruct missing data. Summarizing we point out that approximation of multiple gene expression data preceded by SVD provides some insight into the dynamics but may also lead to unexpected difficulties.
Źródło:
Journal of Medical Informatics & Technologies; 2002, 3; MI31-40
1642-6037
Pojawia się w:
Journal of Medical Informatics & Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of the possibility of using the singular value decomposition in image compression
Autorzy:
Łukasik, Edyta
Łabuć, Emilia
Powiązania:
https://bibliotekanauki.pl/articles/38432811.pdf
Data publikacji:
2022
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
singular value decomposition
JPEG 2000
JPEG
discrete wavelet transform
discrete cosine transform
Opis:
In today’s highly computerized world, data compression is a key issue to minimize the costs associated with data storage and transfer. In 2019, more than 70% of the data sent over the network were images. This paper analyses the feasibility of using the SVD algorithm in image compression and shows that it improves the efficiency of JPEG and JPEG2000 compression. Image matrices were decomposed using the SVD algorithm before compression. It has also been shown that as the image dimensions increase, the fraction of eigenvalues that must be used to reconstruct the image in good quality decreases. The study was carried out on a large and diverse set of images, more than 2500 images were examined. The results were analyzed based on criteria typical for the evaluation of numerical algorithms operating on matrices and image compression: compression ratio, size of compressed file, MSE, number of bad pixels, complexity, numerical stability, easiness of implementation.
Źródło:
Applied Computer Science; 2022, 18, 4; 53-67
1895-3735
2353-6977
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of SVD decomposition in correction tasks of mathematical models of dynamic objects
Zastosowanie rozkładu SVD w zadaniach korekcji modeli matematycznych obiektów dynamicznych
Autorzy:
Piela, P.
Popov, O.
Powiązania:
https://bibliotekanauki.pl/articles/156104.pdf
Data publikacji:
2009
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
model matematyczny
sterowalność
rozkład względem wartości szczególnych
mathematical model
controllability
singular value decomposition
Opis:
In the paper one of the possible approaches to the problem of developing and verifying of mathematical models of dynamic processes and their computer implementation is considered. This problem plays a decisive role in the efficient design of complex control systems of dynamic objects, in the development of computer tutoring systems for operators of such objects, in preparing simulation systems for pilots, helmsmen ships, and in many other issues. The proposed methodology is based on analysis of characteristics of controllability and observability of suitable objects. Mathematical base for this methodology is singular value decomposition of appropriate matrix.
W artykule zaprezentowano podejście do tworzenia i weryfikowania modeli matematycznych procesów dynamicznych. Opisywany problem odgrywa ważną rolę w procesie opracowywania systemów sterowania złożonymi obiektami dynamicznymi, przy tworzeniu komputerowych systemów nauczania dla operatorów obiektów dynamicznych, w przygotowywaniu systemów symulacyjnych dla pilotów, sterników statków i w innych zagadnieniach. W zadaniach korekcji modeli matematycznych ważna jest odpowiedź na pytania w jakim sensie system jest niesterowalny (nieobserwowalny) i jak zmieniać charakterystyki systemu, żeby system stał się systemem sterowalnym (obserwowalnym). W zadaniach walidacji modeli dynamiki podstawą jest wyjaśnienie stopnia wpływu parametrów modelu na badane charakterystyki. Powstaje problem, w jaki sposób zmieniać charakterystyki modelu, aby jego zachowanie odpowiadało zachowaniu obiektu rzeczywistego. Odpowiedzi należy formułować z wykorzystaniem ogólnosystemowych pojęć znanych i zrozumiałych dla matematyków i programistów. Pojęcie miary cech systemu określa nie tylko stwierdzenie faktu, że system jest lub nie jest sterowalny (obserwowalny), ale także pozwala ocenić bliskość granicy utraty sterowalności (obserwowalności) systemu. W artykule przedstawiono zadanie korekcji efektywności sygnałów sterujących matematycznych modeli dynamiki z wykorzystaniem miary sterowalności liniowych systemów dynamicznych. Podstawą matematyczną opisywanej metodologii jest rozkład SVD odpowiednich macierzy.
Źródło:
Pomiary Automatyka Kontrola; 2009, R. 55, nr 10, 10; 856-859
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Automatyczne tworzenie podsumowań tekstów metodami algebraicznymi
Automatic text summarization using algebraic approach
Autorzy:
Gramacki, J.
Gramacki, A.
Powiązania:
https://bibliotekanauki.pl/articles/156932.pdf
Data publikacji:
2011
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
automatyczne podsumowywanie
ukryta semantyka dokumentów
przekształcenie SVD
generic text summarization
sentence extraction
latent semantic analysis
singular value decomposition
Opis:
Duża liczba zwracanych (na przykład przez różnego rodzaju wyszukiwarki internetowe) dokumentów oznacza, że często zmuszeni jesteśmy do czasochłonnego ich przeglądania, celem weryfikacji trafności zwracanych wyników. Gdy dokumenty są długie, czas ich przeglądania znacznie się wydłuża. Można by go wydatnie skrócić, gdyby istniała możliwość automatycznego generowania sensownych podsumowań (streszczeń). W artykule omawiamy wybrane algebraiczne metody służące automatycznemu wydobywaniu z tekstu jego najistotniejszych słów kluczowych oraz najistotniejszych zdań.
Text summarization is a real practical problem due to explosion of the volume of textual information available nowadays. In order to solve this problem, text summarization systems which extract brief information from a given text are created. The end user, by looking only at the summary, may decide whether the document is or is not of interest to him/her. Built summaries can have 2 fundamental forms. Firstly, extractive summarization may collect important sentences from the input text to constitute the summary. Secondly, abstractive summarization tries to capture main concepts of the text and then some new sentences, summarizing the input text, are generated. Nowadays, however, it seems that the latter approach still needs extensive works to be really useful. A summary can be extracted from a single document or multiple documents. In the paper the authors build summaries of one document only. The extension into multi-document summaries is the straightforward task in the case when a set of semantically uniform texts is summarized. Summaries may also be categorized as generic and query-based summaries. In the first case, there are generated summaries con-taining main topics of a document. In the second case, summaries contain the sentences that are related to the given queries. In the paper there are built generic summaries. Summarization systems use different approaches to determine important sentences. Here there is used semantic oriented approach based on a method known as Latent Semantic Analysis (LSA). LSA is an algebraic method that extracts meaning of words and similarity of sentences using the information about usage of the words in the context. It uses Singular Value Decomposition (SVD) for finding semantically similar words and sentences. Using the results of SVD the authors try to select best sentences (which constitute the best summary of the text). The paper is organized as follows. In Section 2 there is formulated the problem. In Section 3 there is shown how a docu-ment may be represented in a useful algebraic format. The so called Term-Sentence matrix (TSM) is used. The authors also point at some preliminary tasks necessary to be performed for successful further analysis. In Subsection 3.2 there is shortly presented an idea of LSA as based on SVD decomposition. In the last section 4 two examples of text summarizations build for both Polish and English texts are given. The two methods used differ slightly from each other. The authors' extracting key words and key sentences seems to be proper content-related summaries of the input texts.
Źródło:
Pomiary Automatyka Kontrola; 2011, R. 57, nr 7, 7; 751-755
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Calculation Models for Acoustic Analysis of St. Elizabeth of Hungary Church in Jaworzno Szczakowa
Autorzy:
Kosała, K.
Powiązania:
https://bibliotekanauki.pl/articles/177877.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
acoustic quality
index method
church acoustics
Singular Value Decomposition
SVD
acoustic simulation tests
Opis:
In parallel with research conducted using conventional methods, a uniform index method for assessing the acoustic quality of Roman Catholic churches has been developed. The latest version of the index method has been created using the index observation matrix of 12 churches which have been rated by means of the single number global index. Assessments of the acoustic quality of any Roman Catholic church, using two calculation models: the Global Acoustic Properties Index (GAP) and the Global Index (GI), are shown in the article. The verification was performed on the example of one church, showing the way of calculating global indices to assess the acoustic quality of a new facility. The next stages in the development of the index method for assessing the acoustic quality of churches were taking into account the audience, using simulation tests and determining the spatial distribution of the single number GAP index in an examined church. An attempt to use the GAP and GI calculation models to assess the acoustic properties of some churches is also shown in the article.
Źródło:
Archives of Acoustics; 2016, 41, 3; 485-498
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Color image encryption using singular value decomposition in discrete cosine Stockwell transform domain
Autorzy:
Vaish, A.
Kumar, M.
Powiązania:
https://bibliotekanauki.pl/articles/173700.pdf
Data publikacji:
2018
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
discrete cosine Stockwell transform
image encryption
singular value decomposition
mean square error
structural similarity index measurement
Opis:
In this paper, an image encryption technique using singular value decomposition (SVD) and discrete cosine Stockwell transform (DCST) is proposed. The original source image is encrypted using bands of DCST along with the SVD decomposed images. The number of bands in DCST, parameters used to mask the singular values, the way of permutation used to shuffle the values of SVD transformed images and the way of arrangement of SVD matrices are used as encryption keys. It is necessary to have correct knowledge of all the keys along with their respective values, for correct decryption of encrypted images. The robustness and the quality measurement of proposed work are analyzed by comparing it with some existing works.
Źródło:
Optica Applicata; 2018, 48, 1; 25-38
0078-5466
1899-7015
Pojawia się w:
Optica Applicata
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 56

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies