Hulya Kodal Sevindir
Research Subjects
Hulya Kodal Sevindir has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
Cuneyt Yazici
7 shared publications- Suleyman Cetinkaya
Kocaeli University
7 shared publications Ali Demir
Department of Mathematics
3 shared publications- Cüneyt Yazici
Kocaeli University
3 shared publications A. H. Siddiqi
2 shared publications- Ali Demir
Kocaeli University
2 shared publications
Latest Publications
- Open Access
- 30 September 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (19) , 9723
A Lossless Secret Sharing Scheme for Color Images
In this study, we introduce a new lossless visual secret sharing scheme (VSSS), inspired by Naor and Shamir’s pioneering visual cryptography scheme. While Naor and Shamir’s scheme uses Boolean algebra on binary images, this proposed method uses a transparent (acetate) base for the generation of each share and does not use Boolean algebra. Furthermore, the proposed method not only supports color images but also enables users to select the number of shares. For each share, selected pixels are randomly chosen from the secret image and placed at the exact location in a transparent base. To further reduce the visibility of the secret data shares, these shares are processed by utilizing the enhanced Arnold transform, thereby yielding the final noise-like share images via this hybrid algorithm. To evaluate the performance of the hybrid algorithm, image quality metrics were calculated. The results with the newly proposed scheme show that the secret image can be successfully reconstructed by merging the generated shares. The proposed method combined with the Arnold transform ensures that individual shares carry no intelligible information, while the combination of all shares allows for a perfect reconstruction of the original content. Experimental results and statistical analyses confirm the high correlation and homogeneity of the generated shares. Considering the existing studies in this field, the proposed hybrid VSSS contributes to the literature by providing a random pixel distribution and lossless image secret sharing. The proposed method successfully eliminates issues such as pixel expansion, contrast loss, and lossy data reconstruction using a newly proposed secret sharing scheme supported by Arnold’s Cat Map. The lossless nature of our algorithm is achieved as a direct result of the precise information-splitting process. The proposed method successfully addresses secure image splitting, storage, and subsequent lossless reconstruction.
- 30 September 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (19) , 9723
Open AccessA Lossless Secret Sharing Scheme for Color Images
In this study, we introduce a new lossless visual secret sharing scheme (VSSS), inspired by Naor and Shamir’s pioneering visual cryptography scheme. While Naor and Shamir’s scheme uses Boolean algebra on binary images, this proposed method uses a transparent (acetate) base for the generation of each share and does not use Boolean algebra. Furthermore, the proposed method not only supports color images but also enables users to select the number of shares. For each share, selected pixels are randomly chosen from the secret image and placed at the exact location in a transparent base. To further reduce the visibility of the secret data shares, these shares are processed by utilizing the enhanced Arnold transform, thereby yielding the final noise-like share images via this hybrid algorithm. To evaluate the performance of the hybrid algorithm, image quality metrics were calculated. The results with the newly proposed scheme show that the secret image can be successfully reconstructed by merging the generated shares. The proposed method combined with the Arnold transform ensures that individual shares carry no intelligible information, while the combination of all shares allows for a perfect reconstruction of the original content. Experimental results and statistical analyses confirm the high correlation and homogeneity of the generated shares. Considering the existing studies in this field, the proposed hybrid VSSS contributes to the literature by providing a random pixel distribution and lossless image secret sharing. The proposed method successfully eliminates issues such as pixel expansion, contrast loss, and lossy data reconstruction using a newly proposed secret sharing scheme supported by Arnold’s Cat Map. The lossless nature of our algorithm is achieved as a direct result of the precise information-splitting process. The proposed method successfully addresses secure image splitting, storage, and subsequent lossless reconstruction.
- Open Access
- 24 December 2021
- Published by Wiley in Advances in Mathematical Physics
- Vol. 2021, 1-10
On Effects of a New Method for Fractional Initial Value Problems
The aim of this study is to analyze nonlinear Liouville-Caputo time-fractional problems by a new technique which is a combination of the iterative and ARA transform methods and is denoted by IAM. First, the ARA transform method and its inverse are utilized to get rid of time fractional derivative. Later, the iterative method is applied to establish the solution of the problem in infinite series form. The main advantages of this method are that it converges to analytic solution of the problem rapidly and implementation of method is easy. Finally, outcomes of the illustrative examples prove the efficiency and accuracy of the method.
- 24 December 2021
- Published by Wiley in Advances in Mathematical Physics
- Vol. 2021, 1-10
Open AccessOn Effects of a New Method for Fractional Initial Value Problems
The aim of this study is to analyze nonlinear Liouville-Caputo time-fractional problems by a new technique which is a combination of the iterative and ARA transform methods and is denoted by IAM. First, the ARA transform method and its inverse are utilized to get rid of time fractional derivative. Later, the iterative method is applied to establish the solution of the problem in infinite series form. The main advantages of this method are that it converges to analytic solution of the problem rapidly and implementation of method is easy. Finally, outcomes of the illustrative examples prove the efficiency and accuracy of the method.
- Open Access
- 29 April 2021
- Published by Wiley in Advances in Mathematical Physics
- Vol. 2021, 1-8
Solution of Space-Time-Fractional Problem by Shehu Variational Iteration Method
In this study, we deal with the problem of constructing semianalytical solution of mathematical problems including space-time-fractional linear and nonlinear differential equations. The method, called Shehu Variational Iteration Method (SVIM), applied in this study is a combination of Shehu transform (ST) and variational iteration method (VIM). First, ST is utilized to reduce the time-fractional differential equation with fractional derivative in Liouville-Caputo sense into an integer-order differential equation. Later, VIM is implemented to construct the solution of reduced differential equation. The convergence analysis of this method and illustrated examples confirm that the proposed method is one of best procedures to tackle space-time-fractional differential equations.
- 29 April 2021
- Published by Wiley in Advances in Mathematical Physics
- Vol. 2021, 1-8
Open AccessSolution of Space-Time-Fractional Problem by Shehu Variational Iteration Method
In this study, we deal with the problem of constructing semianalytical solution of mathematical problems including space-time-fractional linear and nonlinear differential equations. The method, called Shehu Variational Iteration Method (SVIM), applied in this study is a combination of Shehu transform (ST) and variational iteration method (VIM). First, ST is utilized to reduce the time-fractional differential equation with fractional derivative in Liouville-Caputo sense into an integer-order differential equation. Later, VIM is implemented to construct the solution of reduced differential equation. The convergence analysis of this method and illustrated examples confirm that the proposed method is one of best procedures to tackle space-time-fractional differential equations.
- 1 January 2020
- Published by University of Nis in Facta Universitatis, Series: Mathematics and Informatics
- Vol. 35 (1) , 243-252
THE ANALYTIC SOLUTION OF INITIAL BOUNDARY VALUE PROBLEM INCLUDING TIME FRACTIONAL DIFFUSION EQUATION
The motivation of this study is to determine the analytic solution of initial boundary value problem including time fractional differential equation with Neumann boundary conditions in one dimension. By making use of seperation of variables, the solution is constructed in the form of a Fourier series with respect to the eigenfunctions of a corresponding Sturm-Liouville eigenvalue problem.
- 1 January 2020
- Published by University of Nis in Facta Universitatis, Series: Mathematics and Informatics
- Vol. 35 (1) , 243-252
THE ANALYTIC SOLUTION OF INITIAL BOUNDARY VALUE PROBLEM INCLUDING TIME FRACTIONAL DIFFUSION EQUATION
The motivation of this study is to determine the analytic solution of initial boundary value problem including time fractional differential equation with Neumann boundary conditions in one dimension. By making use of seperation of variables, the solution is constructed in the form of a Fourier series with respect to the eigenfunctions of a corresponding Sturm-Liouville eigenvalue problem.
- Open Access
- 1 December 2018
- Published by Afyon Kocatepe Universitesi Fen Ve Muhendislik Bilimleri Dergisi in Afyon Kocatepe University Journal of Sciences and Engineering
- Vol. 18 (3) , 888-894
Visual Cryptology Based on Wavelet Transform
- 1 December 2018
- Published by Afyon Kocatepe Universitesi Fen Ve Muhendislik Bilimleri Dergisi in Afyon Kocatepe University Journal of Sciences and Engineering
- Vol. 18 (3) , 888-894
Open AccessVisual Cryptology Based on Wavelet Transform
- 1 December 2018
- Published by Sakarya University Journal of Science in Sakarya University Journal of Science
- Vol. 22 (6) , 1544-1551
Asymptotic Analysis of Shearlet Transfom for Inpainting
Supply of missing data, also known as inpainting, is an important application of image processing.Wavelets are commonly used for inpainting algorithms. Shearlet transform which is an affinetransformation is the improvement of the wavelet transform. An asymptotic analysis may help to evaluatethe performance of an algorithm. In this article we compare the asymptotical analysis for wavelet andshearlet transforms in the case of inpainting where the missing data is shaped like a rectangle.
- 1 December 2018
- Published by Sakarya University Journal of Science in Sakarya University Journal of Science
- Vol. 22 (6) , 1544-1551
Asymptotic Analysis of Shearlet Transfom for Inpainting
Supply of missing data, also known as inpainting, is an important application of image processing.Wavelets are commonly used for inpainting algorithms. Shearlet transform which is an affinetransformation is the improvement of the wavelet transform. An asymptotic analysis may help to evaluatethe performance of an algorithm. In this article we compare the asymptotical analysis for wavelet andshearlet transforms in the case of inpainting where the missing data is shaped like a rectangle.
- Open Access
- 5 July 2018
- Published by Springer Nature in Boundary Value Problems
- Vol. 2018 (1) , 106
The stability analysis of a system with two delays
- 5 July 2018
- Published by Springer Nature in Boundary Value Problems
- Vol. 2018 (1) , 106
Open AccessThe stability analysis of a system with two delays
- Open Access
- 6 June 2018
- Published by Wiley in Advances in Mathematical Physics
- Vol. 2018, 1-6
The Solution of Initial Boundary Value Problem with Time and Space-Fractional Diffusion Equation via a Novel Inner Product
The main goal of this study is to find the solution of initial boundary value problem for the one-dimensional time and space-fractional diffusion equation which is a very intriguing topic for many researchers. With the aim of newly defined inner product, which is the main contribution of this study, the analytic solution of the boundary value problem is obtained. The time and space-fractional derivatives are defined in the Caputo sense which is more suitable than Riemann-Liouville sense. We apply the separation of variables method to reduce the problem to two separate fractional ODEs. The generalized solution is constructed/formed in the form of a Fourier series with respect to the eigenfunctions of a certain eigenvalue problem. In order to obtain the coefficients of the Fourier series for the solution, we define a new inner product which is the key point of study.
- 6 June 2018
- Published by Wiley in Advances in Mathematical Physics
- Vol. 2018, 1-6
Open AccessThe Solution of Initial Boundary Value Problem with Time and Space-Fractional Diffusion Equation via a Novel Inner Product
The main goal of this study is to find the solution of initial boundary value problem for the one-dimensional time and space-fractional diffusion equation which is a very intriguing topic for many researchers. With the aim of newly defined inner product, which is the main contribution of this study, the analytic solution of the boundary value problem is obtained. The time and space-fractional derivatives are defined in the Caputo sense which is more suitable than Riemann-Liouville sense. We apply the separation of variables method to reduce the problem to two separate fractional ODEs. The generalized solution is constructed/formed in the form of a Fourier series with respect to the eigenfunctions of a certain eigenvalue problem. In order to obtain the coefficients of the Fourier series for the solution, we define a new inner product which is the key point of study.
- 9 April 2018
- Published by Balikesir Universitesi Fen Bilimleri Enstitusu Dergisi in Balıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi
- Vol. 20 (1) , 94-109
Makine öğrenmesi algoritmaları ve dalgacık dönüşümü ile EKG sinyalinden özellik çıkarımı
Günümüzde biyomedikal sinyallerin analizinde dalgacık dönüşümünün kullanılması oldukça yaygın olup elde edilen sonuçlar etkileyicidir. Bu çalışmada, biyomedikal sinyallerden elektrokardiyogram (EKG) sinyallerinde QRS zirvesi belirleme hedeflenmiş ve daha iyi sonuçlar almak için öncelikle EKG sinyallerindeki zemin gezinme gürültüsünün giderilmesi ve yüksek frekanslı gürültünün temizlenmesi amacıyla dalgacık analizi kullanılmıştır. Daubechies 10 (db10) dalgacık dönüşümü uygulanan sinyalin 10. seviye yaklaşım katsayısı ve 10. seviye detay katsayısı çıkartılarak sinyaldeki zemin gezinmesi problemi giderilmistir. Yüksek frekans gürültüsünün giderilmesi için ise zemin gezinmesi problemi giderilmiş olan sinyale dalgacık gürültü temizleme uygulanmıştır. Gürültüsü temizlenen sinyalde QRS zirvelerini belirlemek için sinyalin 1. türev ve 2. türev bilgileri ele alınarak Destek Vektör Makineleri ve Naive Bayes algoritmaları kullanılmıştır. QRS zirvelerinin bulunmasında, MIT-BIH aritmi veri tabanında verilen QRS zirvelerinin konum bilgileri kullanılmıştır. QRS zirvelerini doğru belirlemede Destek Vektör Makineleri algoritması Naive Bayes algoritmasından daha yavaş sonuç vermesine rağmen %99.46 duyarlılık, %100 seçicilik ve %0.54 hata değerlerine ulaşmıştır.
- 9 April 2018
- Published by Balikesir Universitesi Fen Bilimleri Enstitusu Dergisi in Balıkesir Üniversitesi Fen Bilimleri Enstitüsü Dergisi
- Vol. 20 (1) , 94-109
Makine öğrenmesi algoritmaları ve dalgacık dönüşümü ile EKG sinyalinden özellik çıkarımı
Günümüzde biyomedikal sinyallerin analizinde dalgacık dönüşümünün kullanılması oldukça yaygın olup elde edilen sonuçlar etkileyicidir. Bu çalışmada, biyomedikal sinyallerden elektrokardiyogram (EKG) sinyallerinde QRS zirvesi belirleme hedeflenmiş ve daha iyi sonuçlar almak için öncelikle EKG sinyallerindeki zemin gezinme gürültüsünün giderilmesi ve yüksek frekanslı gürültünün temizlenmesi amacıyla dalgacık analizi kullanılmıştır. Daubechies 10 (db10) dalgacık dönüşümü uygulanan sinyalin 10. seviye yaklaşım katsayısı ve 10. seviye detay katsayısı çıkartılarak sinyaldeki zemin gezinmesi problemi giderilmistir. Yüksek frekans gürültüsünün giderilmesi için ise zemin gezinmesi problemi giderilmiş olan sinyale dalgacık gürültü temizleme uygulanmıştır. Gürültüsü temizlenen sinyalde QRS zirvelerini belirlemek için sinyalin 1. türev ve 2. türev bilgileri ele alınarak Destek Vektör Makineleri ve Naive Bayes algoritmaları kullanılmıştır. QRS zirvelerinin bulunmasında, MIT-BIH aritmi veri tabanında verilen QRS zirvelerinin konum bilgileri kullanılmıştır. QRS zirvelerini doğru belirlemede Destek Vektör Makineleri algoritması Naive Bayes algoritmasından daha yavaş sonuç vermesine rağmen %99.46 duyarlılık, %100 seçicilik ve %0.54 hata değerlerine ulaşmıştır.
- 1 July 2016
- Published by Natural Sciences Publishing in Applied Mathematics & Information Sciences
- Vol. 10 (4) , 1447-1452
Comparison of Wavelet and Shearlet Transforms for Medical Images
- 1 July 2016
- Published by Natural Sciences Publishing in Applied Mathematics & Information Sciences
- Vol. 10 (4) , 1447-1452
Comparison of Wavelet and Shearlet Transforms for Medical Images