Academic literature on the topic 'Bit plan slice transform'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Bit plan slice transform.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Bit plan slice transform"

1

Alazawee, Warqaa Shaher, Zobeda Hatif Naji, and Weaam Talaat Ali. "Analyzing and detecting hemorrhagic and ischemic strokebased on bit plane slicing and edge detection algorithms." Indonesian Journal of Electrical Engineering and Computer Science 25, no. 2 (2022): 1003–10. https://doi.org/10.11591/ijeecs.v25.i2.pp1003-1010.

Full text
Abstract:
Nowadays, in the medical world, analyzing and diagnosing acute brain stroke and its location is a difficult process. In many hospitals, however, striking symptoms with the use of computed tomography (CT) imaging for patients is an important step in screening and diagnosis. Furthermore, computer-assisted accurate detection of diseased brain regions Because of the several sorts of strokes, their uneven form, and their great intensity and size, aided design is extremely challenging. Using the bit plan slice technique and the canny detector, we created and suggested a novel approach. Our algorithm produces excellent outcomes. The results demonstrate that our proposed algorithm is an accurate and reliable technique. This study also indicates that this system can detect two different types of strokes: hemorrhagic and ischemic strokes. The results of a comparison study of our suggested technique and other methods such as negative and logarithmic transformation methods are also included in this article.
APA, Harvard, Vancouver, ISO, and other styles
2

Baruah, Hilly Gohain, Vijay Kumar Nath, Deepika Hazarika, and Rakcinpha Hatibaruah. "Local bit-plane neighbour dissimilarity pattern in non-subsampled shearlet transform domain for bio-medical image retrieval." Mathematical Biosciences and Engineering 19, no. 2 (2021): 1609–32. http://dx.doi.org/10.3934/mbe.2022075.

Full text
Abstract:
<abstract><p>This paper introduces a novel descriptor non-subsampled shearlet transform (NSST) local bit-plane neighbour dissimilarity pattern (NSST-LBNDP) for biomedical image retrieval based on NSST, bit-plane slicing and local pattern based features. In NSST-LBNDP, the input image is first decomposed by NSST, followed by introduction of non-linearity on the NSST coefficients by computing local energy features. The local energy features are next normalized into 8-bit values. The multiscale NSST is used to provide translational invariance and has flexible directional sensitivity to catch more anisotropic information of an image. The normalised NSST subband features are next decomposed into bit-plane slices in order to capture very fine to coarse subband details. Then each bit-plane slices of all the subbands are encoded by exploiting the dissimilarity relationship between each neighbouring pixel and its adjacent neighbours. Experiments on two computed tomography (CT) and one magnetic resonance imaging (MRI) image datasets confirms the superior results of NSST-LBNDP when compared to many recent well known relevant descriptors both in terms of average retrieval precision (ARP) and average retrieval recall (ARR).</p></abstract>
APA, Harvard, Vancouver, ISO, and other styles
3

Guaragnella, Cataldo, Agostino Giorgio, and Maria Rizzi. "BFT—Low-Latency Bit-Slice Design of Discrete Fourier Transform." Journal of Low Power Electronics and Applications 13, no. 3 (2023): 45. http://dx.doi.org/10.3390/jlpea13030045.

Full text
Abstract:
Structures for the evaluation of fast Fourier transforms are important components in several signal-processing applications and communication systems. Their capabilities play a key role in the performance enhancement of the whole system in which they are embedded. In this paper, a novel implementation of the discrete Fourier transform is proposed, based on a bit-slice approach and on the exploitation of the input sequence finite word length. Input samples of the sequence to be transformed are split into binary sequences and each one is Fourier transformed using only complex sums. An FPGA-based solution characterized by low latency and low power consumption is designed. Simulations have been carried out, first in the Matlab environment, then emulated in Quartus IDE with Intel. The hardware implementation of the conceived system and the test for the functional accuracy verification have been performed, adopting the DE2-115 development board from Terasic, which is equipped with the Cyclone IV EP4CE115F29C7 FPGA by Intel.
APA, Harvard, Vancouver, ISO, and other styles
4

Osipov, A. V., E. S. Pleshakova, and S. T. Gataullin. "Production processes optimization through machine learning methods based on geophysical monitoring data." Computer Optics 48, no. 4 (2024): 633–42. http://dx.doi.org/10.18287/2412-6179-co-1373.

Full text
Abstract:
The purpose of the article is to create an effective method for low-delay monitoring of the operating state of a drill string and a drill bit without interfering with the proper drilling process. For the drilling process to be continuously controlled, an experimental setup that operates by utilizing the phase-metric method of control was developed. Any movement of the bit causes a change in the electrical characteristics of the probing signal. To obtain a stable signal from a bit immersion depth of up to 250 m, a frequency of probing electrical signals of 166 Hz and an amplitude of up to 500 V were used; the sampling rate of an analog-to-digital converter (ADC) was 10101 Hz. To identify the state of the drill string and the bit based on graphs of time-dependences of changes in the probing signal electrical characteristics, the present authors investigated a number of deep learning methods. Based on the results of the study, a series of capsular neural network methods ( CapsNet ) was chosen. The authors developed modifications of 2D-CapsNet: windowed Fourier transform (WFT) - 2D-CapsNet and frequency slice wavelet transform (FSWT) - 2D-CapsNet. Both of these methods showed a 99% accuracy in determining the transition between two layers of rocks with different properties, which is 2–3% higher than the currently used measurement-while-drilling (MWD) and logging-while-drilling (LWD) rock surveys. Both of these methods unambiguously reveal self-oscillations in the drill string. When determining a fully serviceable bit in the case of self-oscillations, the (FSWT) - 2D-CapsNet method showed an accuracy of 99%.
APA, Harvard, Vancouver, ISO, and other styles
5

Maity, Hirak Kumar, and Santi P. Maity. "FPGA Implementation for Modified RCM-RW on Digital Images." Journal of Circuits, Systems and Computers 26, no. 03 (2016): 1750044. http://dx.doi.org/10.1142/s021812661750044x.

Full text
Abstract:
Reversible contrast mapping (RCM) and its various modified forms are used extensively in reversible watermarking (RW) on digital images to embed secret information. Sometimes RW demands real-time implementation that can be made by hardware realization and RCM-based RW becomes appealing due to its integer transform nature followed by least significant bit (LSB) substitution for embedding. This motivates us to propose RCM-RW on digital images with two objectives: modification on the existing RCM algorithm to increase embedding rate with low visual distortion. Later on, prototype design through field-programmable gate array (FPGA) is developed for a (256 × 256), 8-bit gray scale image using (32 × 32) image block and pipeline architecture. For a cover image of size (256 × 256), the proposed architecture requires 8,971 slices, 8,246 slice flip-flops, 9,706 numbers of four-input LUTs and 2 FIFO 16/RAMB for watermark embedding purpose. Proposed architecture consumes a power of 636[Formula: see text]mW and offers a data rate of 1.0493[Formula: see text]Mbps at an operating frequency as high as 95.3[Formula: see text]MHz.
APA, Harvard, Vancouver, ISO, and other styles
6

Alazawee, Warqaa Shaher, Zobeda Hatif Naji, and Weaam Talaat Ali. "Analyzing and detecting hemorrhagic and ischemic strokebased on bit plane slicing and edge detection algorithms." Indonesian Journal of Electrical Engineering and Computer Science 25, no. 2 (2022): 1003. http://dx.doi.org/10.11591/ijeecs.v25.i2.pp1003-1010.

Full text
Abstract:
Nowadays, in the medical world, analyzing and diagnosing acute brain stroke and its location is a difficult process. In many hospitals, however, striking symptoms with the use of computed tomography (CT) imaging for patients is an important step in screening and diagnosis. Furthermore, computer-assisted accurate detection of diseased brain regions Because of the several sorts of strokes, their uneven form, and their great intensity and size, aided design is extremely challenging. Using the bit plan slice technique and the canny detector, we created and suggested a novel approach. Our algorithm produces excellent outcomes. The results demonstrate that our proposed algorithm is an accurate and reliable technique. This study also indicates that this system can detect two different types of strokes: hemorrhagic and ischemic strokes. The results of a comparison study of our suggested technique and other methods such as negative and logarithmic transformation methods are also included in this article.
APA, Harvard, Vancouver, ISO, and other styles
7

Wibisono, Steffie Hugh, and Djunaidy Santoso. "Perancangan Program Aplikasi Kriptografi Menggunakan Algoritma Magenta dengan Panjang Kunci 128 Bit." ComTech: Computer, Mathematics and Engineering Applications 1, no. 1 (2010): 216. http://dx.doi.org/10.21512/comtech.v1i1.2240.

Full text
Abstract:
Along with the development of computer technology, the growing crimes against the computer. Crimes against the computer makes people increasingly competing to make the algorithms-algorithms that can maintain the confidentiality of data. Algorithms algorithm Magenta is one of the many algorithms that exist today. Magenta algorithms have been developed since 1990 by using a simple and transparent technique that can be implemented in hardware and software. First time algorithms are analyzed using the butterfly structure - the structure of the butterfly which was then replaced by a Fast Hadamard Transform (FHT) shuffle structure which has the advantage of providing some structure in each level. In 1994 there was a slight change in the use of hardware that was not processed according to plan so that now the algorithm used by Deutsche Telekom Magenta for secure management of sensitive data with 128-bit key length. These algorithms break the 128-bit key length into 16 blocks with each block containing the 8-bit and one other advantage of this algorithm is the recursive part is calculated repeatedly at each iteration.
APA, Harvard, Vancouver, ISO, and other styles
8

Abdulkadhim Hameedi, Balsam, Muna Majeed Laftah, and Anwar Abbas Hattab. "Data Hiding in 3D-Medical Image." International Journal of Online and Biomedical Engineering (iJOE) 18, no. 03 (2022): 72–88. http://dx.doi.org/10.3991/ijoe.v18i03.28007.

Full text
Abstract:
Information hiding strategies have recently gained popularity in a variety of fields. Digital audio, video, and images are increasingly being labelled with distinct but undetectable marks that may contain a hidden copyright notice or serial number, or even directly help to prevent unauthorized duplication. This approach is extended to medical images by hiding secret information in them using the structure of a different file format. The hidden information may be related to the patient. In this paper, a method for hiding secret information in DICOM images is proposed based on Discrete Wavelet Transform (DWT). Firstly. segmented all slices of a 3D-image into a specific block size and collecting the host image depend on a generated key, secondly selected the block number and slice number, thirdly, the low-high band used for embedding after adding the generated number, fourthly, used the Hessenberg transform on the blocks that portioned the band (low-high) in a specific size. The secret information (image or text) is a binary value. It was embedded by setting the positive value in the diagonal to odd values if the embedded is one and setting it to even if the secret bit is zero. Several tests were applied, such as applying mean square error, peak signal to noise ratio PSNR, and structural similarity index measure SSIM. Some analyses such as adding noise, scaling, and rotation analysis are applied to test the efficiency. The results of the tests showed the strength of the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
9

Shaik, Rahimunnisha, and Sudhavani Ghanta. "Low Power FPGA Implementation of Multi-View Video Coding with Hybrid Compression and Decompression Algorithm." International Journal of Engineering and Advanced Technology (IJEAT) 9, no. 3 (2020): 2395–403. https://doi.org/10.35940/ijeat.C5495.029320.

Full text
Abstract:
The video is one of the most useful and most appealing medium to represent some information. More usage of digital multi-media via communications media, wireless communications, intranet, internet and cellular mobile leads to the uncontrollable growth of data in media. The video compression technique is used in this research work to improve the processing speed of the entire system. In this work, Low Cost - Multi Video Coding - Hybrid Compression and Decompression (LC-MVC-HCD) method is used to reduce computation complexity. The combinational of Discrete Wavelet Transform (DWT) and Discrete Cosine Transform (DCT) algorithms are denoted as hybrid algorithm. Based on this hybrid algorithm, the compression process is performing which improves the video coding efficiency of MVC. The LC-MVC-HCD methodwas implemented in the Matlab, Xilinx and Cadence tool. In Application Specific Integrated Circuit (ASIC) implementation, the area, power, and delay minimized by using the cadence encounter tool with 180nm and 45nm technology. In Field Programmable Gate Array (FPGA) implementation, the number of Lookup Tables (LUTs), slice, and flip-flop are minimized based on two different kinds of Virtex devices such as Virtex -6 and Virtex-7. In Matlab, Peak Signal to Noise Ratio (PSNR), computational time and bit error rate were analyzed for the LC-MVC-HCD method. The experimental outcome showed that the proposed methodology has improved performance ASIC and FPGA up to 2-3% compared to existing methods like Direct mode decision MVC and LC-MVC-DWT.
APA, Harvard, Vancouver, ISO, and other styles
10

Chen, Yuxin, Jie Cheng, Xiaodong Li, Xue Bai, and Zhixi Nie. "Research on Tracking Technique Based on BPSK-CSK Signals." Electronics 13, no. 8 (2024): 1517. http://dx.doi.org/10.3390/electronics13081517.

Full text
Abstract:
The code-shift keying (CSK) modulation method can achieve higher information transmission rates without changing the spread spectrum signal bandwidth. In order to optimise the spread spectrum modulation and demodulation of GNSS signals, in addition to the signal structure, binary phase-shift keying (BPSK) and CSK signals using time-division multiplexing are proposed. A tracking method based on the BPSK-CSK signals is also proposed, which generates the P-branch local codes by fast Fourier transform to obtain the code-slice spacings for the E-branch and the L-branch local codes. Then, the tracked BPSK signals and tracked CSK signals are compared and analysed. Finally, the bit error rate (BER) and tracking error of each method are compared and analysed by comparing with the tracking of conventional BPSK signals and tracking of CSK signals, in order to verify the convergence process of the I-branch integral value. The BPSK-CSK signal tracking method proposed in this paper combines the high information transmission rate of CSK-modulated signals and the low BER of BPSK signals, and the results provide a solid foundation for high-precision GNSS services.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Conference papers on the topic "Bit plan slice transform"

1

Liu, HengShu, Liping Zhang, and LianQing Huang. "Low-complexity hyperspectral image compression algorithm based on bit plan transform." In Third International Symposium on Multispectral Image Processing and Pattern Recognition, edited by Hanqing Lu and Tianxu Zhang. SPIE, 2003. http://dx.doi.org/10.1117/12.538775.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yim, Soonkyu, and Hae Chang Gea. "Development of an Image-Based CAD Using Wavelet Transform." In ASME 2000 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2000. http://dx.doi.org/10.1115/detc2000/dac-14262.

Full text
Abstract:
Abstract Traditionally, designers describe features of objects from various geometric modeling tools. However, a geometry-based system requires complex mathematical formulations and data structures that make it very cumbersome to manipulate. Furthermore, Layered Manufacturing (LM) has become a prominent manufacturing technology in recent years. To support LM under geometry based CAD systems, users have to slice the model into layers. It is obvious that geometric characteristics of the geometry-based CAD models are destroyed during these conversions, at the same time, additional efforts and costs will be accumulated. To bridge the gap between CAD and LM, an image-based data format instead of a geometry based data format is proposed to serve as the foundation of CAD systems in this paper. A wavelet transform is used to reduce the file size and produce multi-resolution image map. To further increase the computational efficiency of the algorithm, we developed the Reduced Haar Wavelet transform and a bit-remainder index.
APA, Harvard, Vancouver, ISO, and other styles
3

Fainman, Y., H. Rajbenbach, and Sing H. Lee. "Applications of photorefractive crystals as basic computational modules for digital optical processing." In OSA Annual Meeting. Optica Publishing Group, 1986. http://dx.doi.org/10.1364/oam.1986.mm4.

Full text
Abstract:
Any digital optical processing (DOP) system requires basic computational modules such as logic, memory, and shifting. Logic modules which utilize photorefractive crystals have been demonstrated recently.1 In this paper we report experimental evaluations of the potential of photorefractive crystals for image shifting and memory. An image shifting module can be constructed by employing a photorefractive crystal in a four-wave mixing configuration with plane waves 1 and 4 as the writing beams and the Fourier transform of the image u(x, y) to be shifted as reading beam 2. The direction of output beam 3 is then controlled by the direction of plane wave 4, which is in turn determined by the location of a pixel (xSLM, ySLM) on a microcomputer-controlled spatial light modulator. A memory module can be constructed using a photorefractive crystal which behaves as a thick holographic medium. Thus it is possible to store many binary bit planes either by encoding the reference beam differently or by rotating the photorefractive crystal to different angular positions. Experimental evaluations indicate that photorefractive crystals can perform the tasks of various computational modules for DOP. They have the capacity of handling images of 106 pixels and are reasonably priced. However their speed is dependent on the intensities of the optical beams and is generally quite slow at present. We plan to construct a DOP to study system and algorithm issues in anticipation that faster materials will be available in the near future (e.g., organic materials2).
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!