5 research outputs found

    The new fuzzy analytical hierarchy process with interval type-2 trapezoidal fuzzy sets and its application

    Get PDF
    The degree of type-1 fuzzy sets membership function cannot express the linguistic variable of a complex problem. The type-2 fuzzy sets as a problem solver such that more fuzziness for constructing membership functions can be handled. Recently, many multi-criteria decision making (MCDM) methods have been expanded using type-2 fuzzy sets. Analytical Hierarchy Process (AHP) is one of the well-known MCDM that can take into account multiple and conflicting criteria at the same time. Our goal is to develop an interval type-2 trapezoidal fuzzy AHP through the new proposed ranking i.e. the modified total integral value. Based on the illustrative examples for trapezoidal type-2 fuzzy sets, the new proposed ranking has a well-performance in ranking. Furthermore, we apply the new trapezoidal type-2 fuzzy AHP to a supplier selection problem. Based on the results of the application, the new fuzzy AHP has the same ranking results as the existing fuzzy AHP

    Bitplanes Block Based Lossy Image Compression

    Get PDF
    Abstract: In a former paper [21], an exact image compression based on bit-planes blocking was proposed. The proposed algorithm uses two bit codes for block representation. The outcome of the encoding process is two streams: Main Bit Stream, MBS and Residual Bit Stream, RBS. The algorithm core is searching for the greatest block of Unicode to encode in main stream and if not found until size of two by two then it will be kept as is in residual stream. In this paper, a lossy version of that algorithm is presented. The change in the base algorithm is in the definition of the unary-code-block is eased to be above certain percent. The percent is varied from plane to another as their contribution to image power varies. The testing of the proposed algorithm shows comparable results. Image degradations seems restorable even for high compression ratios

    Quantum Cryptography Experiment using Optical Devices

    Get PDF
    The study of quantum cryptography is one of the great interest. A straightforward and reliable quantum experiment is provided in this paper. A half wave plate in linearly polarized light makes up a simplified polarization rotator. The polarization rotates twice as much as the half wave plate's fast axis' angle with the polarization plane when the half wave plate is rotated. Here, an experiment of message sharing is conducted to demonstrate quantum communication between parties. The unitary transformation is performed step by stepusing half-wave plates represented by the Mueller matrix. A simulation created using Python programming has been used to test the proposed protocol's implementation. Python was chosen because it can mathematically imitate the quantum state of superposition

    Consolidating Literature for Images Compression and Its Techniques

    Get PDF
    With the proliferation of readily available image content, image compression has become a topic of considerable importance. As, rapidly increase of digital imaging demand, storage capability aspect should be considered. Therefore, image compression refers to reducing the size of image for minimizing storage without harming the image quality. Thus, an appropriate technique is needed for image compression for saving capacity as well as not losing valuable information. This paper consolidates literature whose characteristics have focused on image compression, thresholding algorithms, quantization algorithms. Later, related research on these areas are presented

    Gray-Level-Embedded Lossless Image Compression

    No full text
    A level-embedded lossless compression method for continuous-tone still images is presented. Level (bit-plane) scalability is achieved by separating the image into two layers before compression and excellent compression performance is obtained by exploiting both spatial and inter-level correlations. A comparison of the proposed scheme with a number of scalable and non-scalable lossless image compression algorithms is performed to benchmark its performance. The results indicate that the level-embedded compression incurs only a small penalty in compression e#ciency over non scalable lossless compression, while o#ering the significant benefit of levelscalability. Key words: level-scalability, CALIC, lossless compression, near-lossless compression Preprint submitted to Elsevier Science 29 January 2003 PACS:
    corecore