Multi-focus image fusion creates one specified image from multiple images containing useful information in different areas of focus. The source material describes the approach as combining photographs of the same scene captured at different focal lengths, with the aim of maintaining sharpness across the scene’s depth range. Potential application areas include medical imaging, photography, surveillance and remote sensing. MFSIF was designed to address limitations attributed to some existing fusion approaches, including blurred boundaries, artifact generation and the loss of fine structural details, particularly in highly textured or defocused regions. Its empirical evaluation used four grayscale datasets named “Bottle,” “Clock,” “Leaves” and “Balloons,” so the directly reported findings are confined to those test collections rather than to color images or application-specific clinical and surveillance data.

The framework has a two-stage design. In the first stage, unsharp masking and high-boost filtering are used to improve the sharpness, contrast and quality of the input images. These edge-aware sharpening filters are intended to strengthen the representation of fine details before the images are merged. In the second stage, the enhanced images are combined using transform-domain techniques that include the Discrete Wavelet Transform (DWT) and the Discrete Cosine Transform (DCT). By integrating established sharpening filters with transform-based fusion, the researchers sought to improve edge preservation, image sharpness and the representation of high-frequency information while maintaining computational efficiency. The supplied abstract does not report processing time, hardware specifications, memory consumption or a direct runtime comparison, so the efficiency claim cannot be independently assessed from the accessible material.

Among the evaluated fusion techniques, “DCT + HB” delivered the maximum reported performance across the study’s statistical measures. It combined the highest PSNR with the lowest RMSE, along with a mean absolute error of 1.6306 and entropy of 0.9324. The abstract says the outcome was supported by both qualitative and quantitative comparisons with existing fusion approaches. These results show that the DCT-plus-high-boost configuration performed best within the reported benchmark, rather than establishing universal superiority over every image-fusion method. The evaluation also provides evidence that the hybrid pipeline can improve the assessed features of fused grayscale outputs, but the accessible report does not supply a complete account of the statistical testing or uncertainty surrounding the numerical comparisons.

MFSIF also represents a different technical direction from the deep-learning fusion systems discussed in the source material. Recent approaches based on convolutional neural networks and generative adversarial networks have been developed to provide improved visual quality and feature extraction, whereas the proposed framework uses a non-neural pipeline of sharpening filters and wavelet- and cosine-transform operations. The study’s central reported result is that sharpening the source images before transform-based fusion can complement the subsequent combination step, producing more clearly defined edges and stronger representation of fine detail. That claim is supported by the four-dataset experiment, not by validation in medical diagnosis, surveillance analysis, remote sensing or other deployed systems. Whether the method performs similarly with color imagery, additional sensors, different resolutions or real-world imaging conditions remains outside the scope of the reported evaluation.

Subject of Research: Evaluation of a hybrid filtering and transform-domain framework for grayscale multi-focus image fusion.

Article Title: Multi-Focus Sharpened Image Fusion (MFSIF): a novel framework based on high boost filtering and discrete cosine transformation approaches

Article References: Shah, M., Khan, S. S., Danyal, M. M., Khan, M., Shah, M. A., & Arshad, M. (2026). Multi-Focus Sharpened Image Fusion (MFSIF): a novel framework based on high boost filtering and discrete cosine transformation approaches. Multimedia Tools and Applications, 85(11), Article 819. https://doi.org/10.1007/s11042-026-21979-z

Image Credits: AI Generated

DOI: 10.1007/s11042-026-21979-z

Keywords: multi-focus image fusion, high-boost filtering, unsharp masking, discrete cosine transform, discrete wavelet transform, image sharpening, edge preservation, grayscale imaging, PSNR, signal processing, Multi-Focus, Sharpened

The study, published in Frontiers in Imaging by Niccolò Marini and Stefano Berretti of the University of Florence and Roberto Caldelli of the National Interuniversity Consortium for Telecommunications and Universitas Mercatorum, addresses one of the central open problems in multimedia forensics. Most current deepfake detectors operate directly in the RGB domain, learning discriminative cues from spatial appearance alone. While such methods perform impressively when the test forgeries match the training distribution, their robustness often collapses when evaluated on unseen manipulation methods, different compression levels, or varying acquisition conditions. This limited cross-forgery generalization remains one of the main challenges in the field, and it is precisely the setting that matters in the real world, where new generative pipelines appear constantly.

The researchers’ motivation comes from a complementary perspective on images: frequency analysis. Image manipulation pipelines, whether they involve blending a swapped face, synthesizing textures, or resampling content, often introduce subtle local inconsistencies that are less evident in the pixel domain. Among frequency-based representations, the Discrete Wavelet Transform, or DWT, is particularly appealing because it provides a multi-scale decomposition of an image while preserving spatial locality. Unlike the Fourier transform, which represents a signal through globally supported sine and cosine functions, the DWT relies on localized basis functions called wavelets that decay rapidly. This makes it possible to separately analyze coarse structural information and directional high-frequency details, exposing forensic cues that are difficult to perceive directly in RGB.

Technically, the approach is intentionally lightweight. Given an input video frame, the team first extracts the facial region using a pre-trained MTCNN face detector, enlarges the bounding box by a factor of 1.3 to preserve useful context around facial boundaries and blending regions, converts the crop to a square, and resizes it to 224 by 224 pixels. They then apply a one-level Haar wavelet decomposition independently to each of the three RGB channels. Each channel is passed through low-pass and high-pass filters along both horizontal and vertical directions, producing four sub-bands: the LL approximation band, which captures the coarse low-frequency structure of the image, and three directional detail bands encoding vertical, horizontal, and diagonal high-frequency information. Stacking the four sub-bands from each of the three channels yields a 12-channel tensor of size 112 by 112, which becomes the network input.

A crucial subtlety is that this wavelet tensor is not a reduction of information. Because the DWT is critically sampled, the four sub-bands from each channel preserve the same total number of scalar coefficients as the original 224 by 224 channel. The 112 by 112 by 12 wavelet input therefore contains exactly the same 150,528 values as the 224 by 224 by 3 RGB tensor; the difference lies purely in how the same face crop is organized into spatial-frequency components. The researchers fed this representation into a modified ResNet-50 architecture in which only the first convolutional layer was adapted to accept 12 channels instead of three, leaving all remaining layers unchanged. Because the native 12-channel input is incompatible with standard ImageNet pretraining, the wavelet model was trained from scratch, while the RGB baselines used pretrained weights. The team also trained an RGB-112 control at reduced spatial resolution to isolate the effect of resolution from the effect of representation.

The evaluation protocol was rigorous. Using the widely adopted FaceForensics++ benchmark, each binary detector was trained on pristine samples and one manipulation type, then tested both on the same manipulation type, called in-forgery or diagonal evaluation, and on the remaining manipulation types, called cross-forgery or off-diagonal evaluation. The benchmark covers five manipulation methods, including Deepfakes, Face2Face, FaceSwap, NeuralTextures, and FaceShifter, at two compression levels, c23 and c40. Beyond the standard true positive and true negative rates, the researchers reported accuracy, precision, F1 score, and AUC, computed aggregate confidence intervals by bootstrapping over train-target pairs, and applied paired sign-flip tests over train-target metric differences. All models were trained on a single NVIDIA GeForce RTX 2080 Ti GPU, underscoring the accessibility of the approach.

The results reveal a nuanced picture rather than a uniform improvement. On the diagonal, where training and testing use the same forgery type, RGB remains the stronger representation: at the c23 compression level, RGB achieves 96.61 percent accuracy and 95.66 percent true positive rate on matched forgeries, compared with 92.65 percent and 94.33 percent for the wavelet model. RGB also preserves higher true negative rates, meaning it is more conservative on pristine samples and produces fewer false positives. But the behavior changes dramatically in the off-diagonal cross-forgery setting. On c23, off-diagonal accuracy changes only marginally from 53.20 to 54.14 percent, yet the true positive rate for fake samples nearly doubles from 8.83 to 17.32 percent, and the F1 score rises from 15.37 to 24.81 percent. At the same time, the true negative rate drops from 97.57 to 90.97 percent. The same pattern holds at c40, where off-diagonal true positive rate increases from 24.50 to 32.90 percent and F1 from 31.48 to 40.29 percent, while true negative rate falls from 83.97 to 77.30 percent.

In other words, the wavelet representation shifts the operating point of the detector toward higher sensitivity to fake samples and lower specificity on real ones. AUC, a threshold-independent measure of separability, does not show a consistent wavelet advantage, further confirming that the benefit is not a blanket improvement in detection capability. The cross-compression experiments reinforce the hypothesis: when models trained on c23 were tested on the more heavily compressed c40 data, the wavelet-based model consistently outperformed the pixel-domain method in cross-forgery scenarios, achieving higher true positive rates across manipulation techniques, this time also in the in-forgery cases. For manipulations such as Deepfakes and FaceShifter, the true positive rate improvements exceeded 10 to 15 percent compared with the pixel-domain method, suggesting that wavelet sub-bands capture forensic traces that are less sensitive to specific forgery techniques or compression artifacts.

What makes these findings scientifically valuable is the controlled framing. Unlike recent wavelet or frequency-aware works that introduce specialized architectures, multi-stage designs, or pretrained vision-language components such as Wavelet-CLIP, this study asks a narrower question: what changes when the input to the same ResNet-50 backbone is replaced by a native first-level wavelet representation? The answer is that wavelet sub-bands expose manipulation cues, such as edge distortions, resampling traces, and unnatural textures introduced by synthesis and blending operations, that are useful for detecting unseen fake classes, but they also make the detector less conservative on pristine samples. The authors are explicit that the wavelet formulation should be interpreted as a lightweight and complementary representation for cross-forgery detection, not as a universal replacement for RGB.

The practical implications depend on the deployment scenario. If the priority is to maximize fake recall on unseen manipulations, as in screening pipelines where missing a fake is the costlier error, the wavelet representation is advantageous in many off-diagonal cases. If the priority is to minimize false positives on real content, as in systems where wrongly flagging authentic media carries reputational or legal risk, RGB remains preferable. The researchers outline several directions for future work: extending the evaluation beyond FaceForensics++ to benchmarks such as Celeb-DF, DFDC, and DeeperForensics, testing newer generative pipelines including diffusion-based and recent identity-swap methods, investigating video-level aggregation strategies and temporal consistency cues, and exploring hybrid RGB-wavelet systems that preserve the strong specificity of pixel-domain models while exploiting the cross-forgery sensitivity of wavelet-domain features. As deepfakes continue to evolve, this study offers a sober lesson: generalizable detection will come not from a single image domain alone, but from carefully understanding which cues actually transfer across forgery families.

Subject of Research: Artificial Intelligence

Article Title: Wavelet-based features to improve cross-forgery generalization in deepfake detection

Article References: Marini, N., Berretti, S., & Caldelli, R. (2026). Wavelet-based features to improve cross-forgery generalization in deepfake detection. Frontiers in Imaging, 5, Article 1845480. https://doi.org/10.3389/fimag.2026.1845480

Image Credits: AI Generated

DOI: 10.3389/fimag.2026.1845480

Keywords: deepfake detection, discrete wavelet transform, machine learning, computer vision, digital forensics, Wavelet-based, features, improve, cross-forgery, generalization, deepfake, detection

The core challenge the researchers confronted is variability, and it comes from every direction. Seizures themselves are wildly heterogeneous: they arise from bursts of abnormally synchronized neuronal activity, but they can manifest as brief sensory changes, motor events, or altered awareness, and their appearance on EEG differs from patient to patient, with age and syndrome. Layer on top of that the technical messiness of real-world recording—different electrode montages, different hardware, different sampling rates, different electrode impedances—and noisy or incomplete labels in large clinical datasets, and you have a problem that defeats models trained on specific individuals. A practical system, the authors argue, must work across subjects and hospitals while keeping false alarms low and missed seizures rare. That reality demands what researchers call subject-disjoint evaluation: testing the model only on people it has never seen during training.

The team’s architecture begins with a deceptively simple idea: teach the model to decide, for every one-second window of EEG, which of the electrodes actually matter. A channel-attention front end pools information across time to produce a summary of each channel, passes it through a small bottleneck neural network, and outputs a set of gains between zero and one. These gains reweight the raw EEG signal, amplifying channels that carry discriminative activity and suppressing those dominated by noise or background. What makes this placement unusual is where it sits. Most attention mechanisms in deep learning recalibrate learned feature maps deep inside a network; here, the gate is applied directly to the input, before any feature extraction, so the same channel-weighted signal feeds both of the processing branches that follow. In qualitative visualizations, the effect is striking: weak, flat channels fade while a small subset carrying strong structure stands out in sharp contrast.

Those two branches are the second pillar of the design, and they draw on decades of signal-processing theory. The first branch applies empirical mode decomposition, or EMD, a fully data-adaptive technique that breaks a non-stationary signal into intrinsic mode functions—oscillatory components defined by the signal’s own local extrema rather than any predetermined mathematical basis. This makes EMD remarkably good at capturing irregular, patient-specific seizure morphologies, though it comes with known quirks such as mode mixing. The second branch applies the discrete wavelet transform, or DWT, a fixed-basis multiresolution analysis that uses a dyadic filter bank to separate the signal into progressively coarser temporal and frequency scales. DWT is stable and reproducible, well matched to EEG’s mix of brief high-frequency transients and longer low-frequency rhythms, but less flexible than EMD. The researchers’ bet is that these two decomposition principles are complementary: EMD adapts to what is unique in each signal, while DWT provides a consistent multiscale description across predefined frequency bands.

Each branch converts its decomposition into a compact statistical fingerprint. For every intrinsic mode function, the model computes six descriptors—mean, standard deviation, skewness, kurtosis, energy, and Shannon entropy—yielding 42 features per channel for the EMD branch; the six-level DWT yields 36 features per channel. Stacking these across channels produces two small two-dimensional feature maps that are treated like images and fed into shallow, attention-augmented convolutional neural networks, each with feature-wise and spatial attention modules and a learned global weighted average pooling step. The two branch embeddings are then concatenated and passed to a fully connected classifier with a sigmoid output, producing a seizure probability for each one-second window. During inference, probabilities from all windows within a contiguous labeled episode are averaged—a technique called soft voting—which smooths out isolated window-level errors and stabilizes the final episode-level decision.

The evaluation protocol is where this study sets itself apart from much of the literature. On the CHB-MIT pediatric scalp EEG database, sampled at 256 Hz and standardized to 18 common bipolar channels, the team used leave-one-subject-out cross-validation: each fold held out an entire patient for testing and trained on everyone else. On the TUH Seizure Corpus, version 2.0.3—a far larger and messier clinical corpus resampled to 250 Hz and standardized to 20 channels—they used the official subject-disjoint train, development, and evaluation split. These protocols matter because surveys have shown that random or mixed-subject splits leak subject-specific patterns into both training and test sets, inflating reported performance. Under honest subject-disjoint testing, many methods that look strong on paper show substantially lower accuracy, which is precisely the gap this work targets.

The ablation results make a compelling case for every design choice. Combining the EMD and DWT branches without any attention already beat either branch alone, confirming that the two decompositions carry complementary information. Adding the front-end channel attention to the dual-branch configuration produced a larger accuracy gain than adding attention inside the CNNs alone—1.62 percentage points on CHB-MIT and 1.78 points on TUSZ, versus 0.79 and 0.86 points respectively. Most tellingly, removing the EMD branch from the complete model cut mean accuracy by 10.30 percentage points on CHB-MIT and 9.01 points on TUSZ, while removing the DWT branch cost 6.68 and 6.75 points. The full configuration achieved the highest accuracy, AUROC, F1-score, and recall on both datasets, and paired Wilcoxon signed-rank tests with Holm correction confirmed that each component’s contribution was statistically significant. A t-SNE visualization captured the story in one image: raw EEG windows from unseen TUSZ patients form a hopelessly intermixed cloud, while the model’s learned embeddings separate cleanly into seizure and non-seizure clusters.

The team also stress-tested the system in ways that anticipate clinical reality. A sensitivity analysis showed that the one-second window with 50 percent overlap was the sweet spot—shorter windows lacked temporal context, longer ones blurred heterogeneous patterns, and higher overlap added nothing. In a continuous-recording evaluation, the model processed complete test recordings in temporal order without any knowledge of seizure boundaries, merging consecutive positive windows into single alarms and measuring false alarms per hour and detection latency against expert annotations. Error analysis revealed instructive failure modes: false positives were commonly triggered by muscle artifacts, electrode pops, and abrupt high-amplitude transients that mimic ictal time-frequency signatures, while false negatives tended to involve seizures shorter than ten seconds, low-amplitude discharges, or activity confined to a small set of channels. When additive Gaussian noise was injected at signal-to-noise ratios from 20 dB down to an extreme 0 dB without retraining, performance degraded gracefully rather than collapsing.

Perhaps most surprising for a field increasingly dominated by giant Transformer and foundation models is how computationally modest the whole pipeline is. The authors measured an average of 116.71 milliseconds to process a one-second EEG window on an ordinary workstation with an Intel Core i5 CPU and an RTX 4060 GPU—well under the 500-millisecond window-advancement interval imposed by the 50 percent overlap, meaning the system can in principle keep up with a live EEG stream. EMD, with its iterative sifting process, dominates the runtime, and the authors suggest that accelerated or parallel implementations could shrink it further. They are candid about the limits: the work involves binary seizure detection only, no external hospital cohort was available, and prospective real-time validation across independent clinical centers remains necessary before any deployment. Still, the message is clear and, for a field chasing ever-larger models, quietly radical. By combining an input-level attention gate, two mathematically complementary time-frequency views, and honest patient-disjoint testing, a compact and interpretable model can detect seizures in people it has never met—a step toward seizure monitoring that works reliably, anywhere, for anyone.

Subject of Research: Patient-independent EEG-based seizure detection using channel attention and dual-branch EMD–DWT time-frequency deep learning

Article Title: Patient-independent EEG seizure detection using channel attention and dual-branch time–frequency features

Article References: Tiwary, H., Bhavsar, A., & H., M. (2026). Patient-independent EEG seizure detection using channel attention and dual-branch time–frequency features. Neural Computing and Applications, 38(19), Article 791. https://doi.org/10.1007/s00521-026-12518-w

Image Credits: AI Generated

DOI: 10.1007/s00521-026-12518-w

Keywords: EEG, seizure detection, epilepsy, channel attention, empirical mode decomposition, discrete wavelet transform, deep learning, patient-independent, CHB-MIT, TUSZ, convolutional neural network, signal processing

The team, led by Abhijit Patil of K J Somaiya Institute of Technology in Mumbai, together with Ramesh Shelke of S. S. Jondhale College of Engineering and Dilendra Hiran of Pacific Academy of Higher Education and Research University, set out to fix a specific weakness in earlier watermarking research. Many existing schemes process audio in overlapping segments when embedding a watermark, which drives up computational cost without necessarily improving security. Overlapping windows are a standard tool in signal processing because they smooth transitions between frames, but in the watermarking context the authors argue that the redundancy they introduce is largely wasted effort. Their system instead guarantees non-overlapping segmentation from the very first stage, trimming the computational overhead that has plagued previous approaches.

The pipeline begins with a technique borrowed from classical spectral analysis: the FlatTop window. Windowing functions are mathematical tapers applied to short stretches of a signal before further processing, and each shape trades off different properties. FlatTop windows are prized for their exceptionally flat passband, which means they measure the amplitude of frequency components with minimal distortion, at the cost of a wider main lobe. In RAWS-SBS, the FlatTop window slices an incoming audio signal into frames that do not overlap, establishing a clean, computationally frugal foundation for everything that follows. This choice matters because every subsequent operation, from transform to embedding to extraction, operates on these frames, so inefficiency at the segmentation stage multiplies through the whole system.

Once segmented, the frames undergo a decomposition step using what the authors term a Polar Cartesian-based Discrete Wavelet Transform, or PC-DWT. The discrete wavelet transform is a workhorse of modern signal processing, breaking a signal into components that capture both frequency content and where in time that content occurs, unlike the plain Fourier transform, which discards timing information. The polar Cartesian variant reformulates this decomposition, and the transformed coefficients are then arranged into matrices from which features are extracted. These features feed the next critical decision: where, exactly, inside the audio should the watermark bits live? Placing a watermark carelessly makes it audible to listeners or fragile under compression and filtering; placing it too timidly makes it easy to destroy.

To answer that placement question, the researchers developed an optimization method they call Gamma Functional Energy Valley Optimization, or GFEVO. Optimization algorithms of this family search a large space of candidate solutions for the one that best balances competing objectives, and here the objective is finding embedding locations that maximize robustness while preserving perceptual quality. The reported results suggest the search paid off: the GFEVO stage achieved a Perceptual Evaluation of Speech Quality score of 4.256, a metric on a scale where values near 4.5 indicate quality nearly indistinguishable from the original. In practical terms, a listener hearing the watermarked audio would be very hard pressed to notice that anything hidden inside it at all.

Security enters the pipeline through the most colorful component of the system: Blancmange Curve Cryptography. The Blancmange curve, also known as the Takagi curve, is a fractal defined as an infinite sum of sawtooth-like functions. It is famous in mathematics for being continuous everywhere yet differentiable nowhere, a jagged, self-similar shape that never smooths out no matter how closely you zoom in. The authors harness this fractal’s irregular, deterministic complexity to encrypt the watermark image before embedding, converting the encrypted bits into a vector bit stream. An attacker who extracts the embedded payload without the key would face data scrambled according to the curve’s fractal arithmetic, adding a cryptographic layer on top of the steganographic one. It is a striking example of pure mathematics, a curve named after a wobbly pudding, finding duty in applied security engineering.

Embedding, however, is only half the problem. A watermark is useless if the legitimate owner cannot reliably pull it back out of an audio file that may have been compressed, filtered, resampled, or otherwise degraded on its journey through the digital world. For extraction, the team deployed a deep convolutional neural network with two distinctive design elements. The first is a spatial-and-cross architecture, which lets the network correlate information across different spatial regions of the transformed audio representation rather than treating each location in isolation. The second is a Scaled Gaussian Error Linear Unit, or SGELU, an activation function that governs how signals pass between network layers. Activation functions shape what a neural network can learn, and the Gaussian-error variant blends a smooth probabilistic weighting into the familiar rectified linear unit, potentially giving the extractor a richer response to the subtle statistical traces a watermark leaves behind.

The experimental numbers are where the system makes its case. The proposed method achieved a minimum Bit Error Rate of 0.03232, meaning that when the hidden watermark was extracted, fewer than four bits in every hundred came back wrong, a low error rate that translates directly into more reliable ownership verification. On overall watermarking accuracy, the system reached 97 percent. The authors benchmarked this against several established deep learning baselines, reporting improvements of 3.2 percent over a standard DCNN, 4.3 percent over a conventional CNN, 7.8 percent over a deep belief network, and 11.5 percent over a plain deep neural network. Those margins may look incremental, but in a field where a few percentage points of accuracy can determine whether a copyright claim holds up, they are meaningful.

Context helps explain why this line of research is heating up. Audio watermarking has moved far beyond its original role of tagging music files for royalty tracking. Recent work in the field targets desynchronization-resilient schemes that survive time-stretching attacks, blind quantum watermarking, neural approaches with invertible dual embedding, and systems designed specifically to detect deepfake audio proactively. As generative models make synthetic speech and music indistinguishable from human-created recordings, the ability to embed a verifiable, tamper-evident signature inside audio is becoming a frontline defense. Watermarks that survive aggressive processing while remaining inaudible are the technical backbone for proving that a clip is authentic, or flagging one that is not.

The RAWS-SBS study, received by the journal in 2023 and published on 31 August 2026 after an unusually long revision cycle, reflects that broader urgency. Its authors report no funding source and no competing interests, and they state that the data generated in the study are available from the corresponding author on reasonable request. Whether fractal-based encryption and non-overlapping segmentation become standard ingredients of future watermarking systems remains to be seen, but the work illustrates a clear trend: the fight to authenticate digital audio is increasingly fought with hybrid tools, marrying signal processing classics like wavelet transforms and windowing functions to deep networks and, now, to the jagged elegance of nowhere-differentiable fractals. For an industry drowning in unattributable sound, every percentage point of extraction accuracy counts.

Subject of Research: A robust deep learning-based audio watermarking system using Blancmange curve cryptography for digital media security

Article Title: A robust audio watermarking system with SC-SGELU-DCNN and BCC algorithm for security

Article References: Patil, A., Shelke, R., & Hiran, D. (2026). A robust audio watermarking system with SC-SGELU-DCNN and BCC algorithm for security. Multimedia Tools and Applications, 85(9), Article 725. https://doi.org/10.1007/s11042-026-21865-8

Image Credits: AI Generated

DOI: 10.1007/s11042-026-21865-8

Keywords: audio watermarking, deep learning, convolutional neural network, Blancmange curve cryptography, discrete wavelet transform, bit error rate, digital security, copyright protection, signal processing, SGELU activation, optimization, multimedia forensics

In a study published in the journal Cluster Computing, Samia A. El-Moneim Kabel and Walid El-Shafai proposed a new compression method that combines the Discrete Wavelet Transform (DWT) with fractal encoding. The approach is designed to exploit the self-similar characteristics inherent in FPCG signals. By identifying recurring patterns within the data, the method aims to represent these patterns using compact transformation information rather than storing the original coefficient blocks. This hybrid strategy seeks to balance high compression ratios with acceptable reconstruction quality for clinical use.

The proposed method begins by applying the Discrete Wavelet Transform to decompose the FPCG signal. This process separates the signal into approximation coefficients and detail coefficients. The approximation coefficients, which capture the broader trends of the signal, are then subjected to fractal encoding. This step involves identifying recurrent signal patterns and representing them through mathematical transformations. The detail coefficients, which contain finer variations, are preserved separately to ensure that important signal features are not lost during the compression process.

During the decompression phase, the method employs iterative fractal decoding to reconstruct the approximation coefficients from the compact transformation data. The preserved detail coefficients are then combined with the reconstructed approximation coefficients through an inverse DWT process. This reconstruction step aims to restore the original signal structure as closely as possible. The entire workflow is designed to be computationally efficient, addressing the real-time processing requirements often necessary in fetal monitoring applications.

The authors implemented the proposed method in MATLAB and evaluated its performance using FPCG signals. The evaluation metrics included compression ratio, mean square error, peak signal-to-noise ratio, compression time, and decompression time. These metrics provide a comprehensive view of both the efficiency of the data reduction and the quality of the reconstructed signal. The study utilized publicly available data, and the authors noted that no new datasets were generated or analyzed during the research, as the work focused on algorithmic development and simulation.

Experimental results indicated that the DWT-assisted fractal compression method achieves substantial data reduction. The study reported that the method maintains acceptable reconstruction quality, suggesting that diagnostically relevant information is preserved despite the significant reduction in file size. The authors highlighted the potential of this approach for efficient storage and transmission of FPCG signals in fetal health monitoring applications. The findings suggest that the method could be particularly useful in scenarios where bandwidth is limited, such as remote patient monitoring.

The research builds upon previous work in biomedical signal compression, which has explored various techniques including wavelet transforms and compressed sensing. Earlier studies have demonstrated the utility of wavelet-based methods for reducing the size of phonocardiogram signals. However, the integration of fractal encoding specifically targeting the approximation coefficients of the DWT decomposition is a distinct contribution of this work. The authors acknowledge the support of the Tanta High Institute of Engineering and Technology and the Automated Systems and Computing Lab at Prince Sultan University in the development of this research.

It is important to note that this study presents a proposed algorithm and its simulation results. The method has not yet been validated in clinical trials or real-world deployment scenarios. The authors did not receive external funding for this research and declared no competing interests. The study did not involve human participants, as it relied on publicly available data, and therefore ethical approval for human subject research was not required. The focus remains on the technical feasibility and performance metrics of the compression algorithm.

The potential application of this compression method extends to improving the infrastructure for remote fetal monitoring. By reducing the data size, the method could facilitate the transmission of FPCG signals over low-bandwidth connections, enabling more widespread access to fetal heart monitoring. This could be particularly beneficial in regions with limited healthcare infrastructure. However, further research is needed to assess the method’s robustness in diverse clinical environments and its impact on diagnostic accuracy in real-time settings. The study provides a foundation for future work in optimizing biomedical signal compression for IoT applications.

In conclusion, the DWT-assisted fractal compression method offers a promising approach to the challenge of storing and transmitting fetal phonocardiography signals. By leveraging the self-similarity of FPCG data through fractal encoding and the frequency decomposition capabilities of the DWT, the method achieves significant data reduction while maintaining signal quality. The results suggest that this hybrid technique could play a role in the development of more efficient remote fetal monitoring systems. As the field of biomedical signal processing continues to evolve, such methods may contribute to making fetal heart monitoring more accessible and efficient.

Subject of Research: Biomedical Signal Processing

Article Title: DWT-assisted fractal compression for efficient storage and transmission of fetal phonocardiography signals

Article References: Kabel, S. A. E.-M., & El-Shafai, W. (2026). DWT-assisted fractal compression for efficient storage and transmission of fetal phonocardiography signals. Cluster Computing, 29(13), Article 764. https://doi.org/10.1007/s10586-026-06501-2

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06501-2

Keywords: Fetal Phonocardiography, Signal Compression, Discrete Wavelet Transform, Fractal Encoding, Remote Monitoring, Biomedical Engineering, DWT-assisted, fractal, compression, efficient, storage, transmission

The framework, known as QF-FODA, short for Quantum-Fuzzy Framework for Aerial Object Detection via Frequency Domain Analysis, was developed by Dharmendra Prakash and Alkesh Agrawal of SRM University in India, Saifullah Khalid of IBMM Research in Sudan, and Dinesh Kumar Nishad of DSMNR University in Lucknow. The team implemented and validated the entire system in MATLAB 2024b, testing it on two widely used benchmarks: VisDrone2019, the large-scale drone detection challenge dataset, and the UAV Small Object Detection Dataset distributed on Kaggle under a CC0 public domain license. The results showed a mean Average Precision of 74.3 percent at an Intersection over Union threshold of 0.5, or mAP@50, on VisDrone2019, with a stricter mAP@50:95 score of 49.2 percent, and 78.6 percent mAP@50 on the Kaggle UAV dataset, outperforming the baseline methods by margins ranging from 4.2 to 9.7 percentage points.

The first pillar of the approach is its departure from purely spatial image analysis. Most modern detectors process raw pixels and rely on convolutional layers to learn features, but small objects lose too much of their spatial signature when compressed across multiple network stages. Instead, QF-FODA transforms imagery into the frequency domain using both the discrete cosine transform and the discrete wavelet transform. The DCT, a workhorse of image and video compression, concentrates the energy of natural images into a small number of low-frequency coefficients, which makes subtle texture and edge patterns more accessible. The DWT, rooted in Mallat’s classical theory of multiresolution signal decomposition, decomposes an image into approximate and detail sub-bands at successive scales, allowing the system to examine an object simultaneously at coarse and fine resolutions.

This multi-resolution frequency representation matters particularly for aerial imagery, where object scale varies enormously with altitude and where motion blur and haze distort high-frequency detail first. By analyzing the frequency content rather than only the pixel values, the framework can pick up the periodic structure of vehicle roofs, the edges of tiny pedestrians, and the characteristic signatures of cluttered urban backgrounds in a representation that is inherently more robust to contrast changes. Recent work by other groups, including frequency-aware transformers and frequency-domain modulation networks for hazy aerial imagery, has supported the broader idea that frequency information carries discriminative cues that spatial pipelines discard. QF-FODA builds that insight directly into the feature extraction stage rather than treating it as an afterthought.

The second pillar is a quantum-inspired amplitude encoding scheme. The researchers do not run their algorithm on a quantum computer; instead, they borrow a representational idea from quantum machine learning, in which classical data are encoded into high-dimensional amplitude vectors analogous to the state of a qubit register. In quantum systems, information is stored in the amplitudes of a superposed state, allowing an exponentially large state space to be described with relatively few physical qubits. The framework applies a similar principle to its frequency domain features, mapping them into an amplitude-encoded, high-dimensional representation in which differences between object classes become more separable. Quantum-inspired computing of this kind, explored in prior literature ranging from quantum convolutional neural networks to introductory treatments of quantum machine learning, seeks to capture some of the expressive power of quantum representations on conventional hardware.

The third pillar addresses a problem that deterministic classifiers handle poorly: uncertainty. Aerial images are riddled with ambiguity. A small blob of pixels might be a distant motorcycle or a patch of road markings. Occlusion by trees and buildings hides parts of objects, altitude changes alter apparent scale, and low contrast blurs the boundary between object and background. To manage this, the researchers employ a Type 2 fuzzy inference system, an extension of Lotfi Zadeh’s original 1965 fuzzy set theory in which the membership functions themselves are fuzzy. Where a Type 1 fuzzy system assigns each input a crisp degree of membership, a Type 2 system models the uncertainty in that membership, producing a footprint of uncertainty that captures how confident the system is even in its own fuzzy labels.

This added layer of uncertainty modeling, formalized in influential work by Mendel and John and refined in uncertainty measures for interval Type 2 fuzzy sets by Wu and Mendel, proves valuable in exactly the conditions where aerial detection fails most often. Under occlusion, scale variation, and low contrast, the fuzzy inference layer can weigh evidence from the frequency features and the quantum-inspired representation with an explicit tolerance for ambiguity, rather than forcing a hard decision from noisy inputs. The experimental results show that QF-FODA exhibits superior performance precisely under these adverse conditions, suggesting that the fuzzy layer is doing more than adding complexity; it is absorbing the variability that defeats conventional detectors.

The benchmark comparison is the most striking part of the study. VisDrone2019 is widely regarded as a brutal test: it contains thousands of drone-captured images spanning crowded streets, residential areas, and playgrounds, with objects that are often less than 32 pixels across. Beating YOLOv5, Faster R-CNN, and SSD on this dataset by 4.2 to 9.7 percentage points is a meaningful margin in a field where incremental gains are typically measured in fractions of a point. The stricter mAP@50:95 metric, which averages precision across multiple overlap thresholds, also indicates that the framework’s detections are not merely loose boxes but reasonably well-localized ones. Performance on the Kaggle UAV Small Object Detection Dataset, reaching 78.6 percent mAP@50, corroborates the results on a second, independently curated corpus.

The work arrives amid a surge of interest in rethinking aerial detection from first principles. Recent research has explored sub-region context modeling, end-to-end detection transformers tailored to UAV imagery, dual-backbone feature fusion, and attention-guided networks for infrared small targets, all attempting to solve the same underlying problem: objects seen from above are small, variable, and contextually confusing. What distinguishes QF-FODA is its willingness to combine three historically separate threads, signal processing, quantum-inspired representation, and fuzzy logic, into a single pipeline, and to show measurable gains rather than simply arguing for plausibility. The authors report that all simulations were conducted in MATLAB 2024b and that no external funding was received for the work.

The implications extend beyond academic benchmarks. Drone-based surveillance, traffic monitoring, search and rescue, infrastructure inspection, and disaster response all depend on reliably spotting small objects from the air, often in real time and under imperfect viewing conditions. A framework that remains robust under occlusion, scale variation, and low contrast could reduce missed detections in scenarios where those misses carry real costs. Because both datasets used in the study are publicly available, other research groups can directly verify and extend the results. And while the quantum component is classical software rather than a quantum processor, the study adds to the growing evidence that quantum-inspired representations can deliver practical advantages on today’s hardware, hinting that as actual quantum computing matures, hybrid architectures like this one may be well positioned to benefit. For now, QF-FODA offers a compelling demonstration that looking at aerial images through the lens of frequency, fuzzy logic, and quantum mathematics can reveal what conventional pixel-level pipelines leave behind.

Subject of Research: A hybrid quantum-inspired and fuzzy framework for detecting small aerial objects in UAV imagery using frequency domain analysis

Article Title: A Quantum-Fuzzy Framework for Aerial Object Detection via Frequency Domain Analysis in UAV Systems

Article References: Prakash, D., Agrawal, A., Khalid, S., & Nishad, D. K. (2026). A Quantum-Fuzzy Framework for Aerial Object Detection via Frequency Domain Analysis in UAV Systems. International Journal of Aeronautical and Space Sciences. https://doi.org/10.1007/s42405-026-01285-6

Image Credits: AI Generated

DOI: 10.1007/s42405-026-01285-6

Keywords: UAV object detection, quantum-inspired computing, Type 2 fuzzy inference system, frequency domain analysis, discrete cosine transform, discrete wavelet transform, VisDrone2019, drone surveillance, small object detection, computer vision, MATLAB, mean Average Precision