BMP File Research Articles

Design of New LED Curtain Wall Controller and Its Effect in Architectural Decoration

In recent years, LED with high brightness or ultra-high brightness has appeared. Because of its low production cost, it has been widely used. Compared with other display media, LED has the advantages of rich display content, wide dynamic range, vivid picture, no pollution, long life, etc., so it is used in building curtain wall facade decoration. This research designs LED curtain wall control system, the use of SD600 chip dimming control of LED, the use of absorbing current mode LED drive, further design of single SD600 chip application circuit, multi-SD600 chip application circuit. LED curtain wall display text need to design the corresponding graphic processing hardware, the hardware is composed of ARM microprocessor LPC2210 and its related peripheral circuits. The core chip of the LPC2210 processor chip needs 1.8 V working voltage, and the I/O interface voltage is 3.3 V, so it is necessary to design the corresponding power circuit; The system clock is adjusted through the internal PLL circuit to make the system run faster and design its crystal oscillator circuit; The power monitoring chip CAT1025JI-30 is adopted to build reset circuit, 20-pin interface type JTAG interface circuit; It is considered that the UARTO interface can’t be directly connected with the RS232 interface of PC, the MAX3232 chip is introduced for level conversion, and the serial interface circuit based on LPC2210 is designed. In the experiment, the new technology is used for outdoor lighting LED curtain wall construction, and the development tool uses the ADS1.2 provided by ARM company. The μC/OS-II embedded operating system is introduced to control the graphic processing hardware resources, reading the file from the SD card, and writing the text file and BMP file into the three-dimensional array, the corresponding text and pattern effect are displayed in the LED curtain wall.

A MapReduce Based Approach for Secure Batch Satellite Image Encryption

The overarching goal of this research was to examine the state of satellite imagery security in relation to its deteriorating form due to rising demand. The most common approaches to safeguarding satellite images during transmission across transmission networks, which are not protected by standard encryption, are the focus of this investigation. Since satellite imagery can be encrypted both in transit and while stored on a computer’s hard drive, we put the suggested Image Encryption System to the test by applying it to a collection of satellite photos. Concurrently encrypting data and running MapReduce jobs is key to the study methodology employed. This will be carried out in the Hadoop ecosystem, where an innovative method of analysing random numbers for use in Image encryption will be put to the test. The encryption was processed using MapReduce in the Hadoop ecosystem. Images were saved as BMP files with added security metadata. The evaluation of experiments was based on four (4) indicators. It was found that the processing time for batch encryption calculations grew in proportion to the amount of computations. All cluster, map, and reduction processes were put to the test using encrypted images, exposing load balancing difficulties and inefficiencies. Histogram analysis, the basis of an image encryption technique, provides evidence that the encrypted pixel values are consistent. Therefore, compared to other methods, such as a histogram or information entropy, this one is superior. Because of how it was crafted, it can withstand even the most sophisticated attacks without being compromised.

Image Segmentation Based on Color Dissimilarity

This study aims to develop a segmentation technique that can be used to identify objects in an image. The concept used is to imitate the human concept of recognizing an object based on its color difference. A color is considered different if it has different R, G or B values. Humans can only distinguish two colors clearly if they both have a DeltaE value of at least 8. The difference in DeltaE values is obtained from differences in the values of R, G or B, either alone or in pairs. The application of this concept to the segmentation technique has shown good results. This technique is able to give the same results and is good for images with JPG, PNG and BMP file types. The results of this segmentation will be very suitable for the process of identifying objects in an image.

Implementation of hybrid cryptosystem using Rabin-p algorithm and One Time Pad to secure images

Cryptography is a study of mathematical techniques to secure messages by encoding the messages so it cannot be read by a third party. There are two types of algorithms in cryptography, symmetric algorithm and asymmetric algorithm. Asymmetric algorithms, such as Rabin-p cryptosystem, are known to be secure if the key sizes are long enough. However, asymmetric algorithms are ineffective to encrypt large data since the calculations consume CPU time and the resulting ciphertext is multiple times bigger than the original data. In this research, we combine Rabin-p cryptosystem and One Time Pad (OTP) in a hybrid scheme to solve this problem. The OTP is used to encrypt the data (images) and Rabin-p algorithm is used to encrypt the OTP key. In this research, we demonstrate how to secure a *.bmp file with this hybrid scheme.

Processing in Image Interpolation and Motion Detection

This article discusses processing in Image Interpolation and Motion Detection. Image or image has become a common thing and has become part of everyday people's life. In a particular interest, image is used as a tool to express various kinds of feelings which for some people are difficult to express through words. Such as explaining a reason, interpretation, illustration, communication, memory, education, evaluation, entertainment, and others. Then the concept of image and its processing is associated with changing and improving the image. Image is a representation, similarity, or imitation of an object or object, for example your photo represents the entity of yourself on camera. X-ray photographs of the chest represent the inside of a person's body, the data in a BMP file represents what it represents.

A Hybrid Cryptosystem Using Vigenère Cipher and Rabin-p Algorithm in Securing BMP Files

Vigenère cipher is a classical cryptography algorithm and similar to other classical algorithms, it produces smaller but less secure ciphertexts than a public key cryptography algorithm. Meanwhile, Rabin-p is a public key cryptography algorithm with a stronger encryption than Vigenère cipher. Nevertheless, as a public key algorithm, Rabin-p is inefficient to encrypt vast amounts of messages such as BMP image files, since the size of the cipherimages will increase manyfold and this would lead to a problem in storing and sending the cipherimages. To overcome these problems, in this study, we combined the Vigenère cipher and the Rabin-p algorithm in a hybrid cryptosystem scheme. In the experiment, the Vigenère cipher was used to encrypt the BMP files and the Rabin-p algorithm was used to encrypt the Vigenère keys. The result showed that the size of the cipherimages did not increase and the decryption procedure could recover the original BMP files while maintaining their integrity.

Improving Steganographic capacity using distributed steganography over BMP

Our research area tackles the improvement of private data security using our proposed Steganographic method called DSoBMP-I (Distributed Steganography over BMP faze I) to improve the issues of low capacity, high detectability and distortion. The methodology consists of a new distributed steganographic approach to minimise the main weaknesses of today’s methods, including Discrete Cosine Transform, where the capacity, detectability and distortion needs an upgrade to accommodate securer steganography for our data protection. The proposed prototype approach that evolved after a few experiments using our distributed steganographic method, where secrete data is secure into a set of BMP files (as it is proven more reliable), originates from a raw file that is not necessarily a BMP at the start. After applying a layer of encryption for extra security using two different methods such as RC4 & RSA, comparing the two encryption techniques for its agility and extra security to address the issue of low capacity and better security using the DSoBMP-I method, all deriving from the supplied image. The overall achievement was improved capacity that doubles as the set of BMP images increases, less distortion and detectability as secrete data stays among different files.

FEATURES OF HIDING INFORMATION IN IMAGES WITH USING THE LEAST SIGNIFICANT BIT

In the article has considered the peculiarities of steganographic algorithms implemenation for hiding information in inmoveable images. Authors has described different embedding algorithms which use the method of least significant bit. In particular, the use of digital filtering allows you to better select the necessary pixels for embedding, and the use of a pseudorandom sequence generator allows you to more effectively hide secret information, complicating the search for secret information to the attacker.From the existing color palettes to represent inmoveable images have been selected the most common RGB pal-ette, which contains red, green, and blue intensities to produce image pixels. Colors that are less sensitive to the human eye are used to form the filled steganographic containers to provide additional visual stability.Also, in the paper authors have investigated the features of hiding digital text information in a inmoveable image as a BMP file and have realized an algorithm that for images of different size allows you to hide a text file of the necessary size. In particular, the number of bytes of the secret message is written to the original container to retrieve the required number of characters during searching. In addition, it takes into account the peculiarities of forming a BMP file that contains additional alignment bytes of the string.In general, the algorithm allows you to select a container file of the appropriate size to hide the secret information, as well as the colors of the palette in which the information will be embedded. The extracting of secret information occurs until the number of bytes of the hidden message is reached. This value has recorded at the beginning of the hiding text. You can use encryption or compression algorithms to complication searching of clear text by attacker. Only users those who are aware of the algorithms used and perhaps the keys will be able to read the hidden information correctly.

Enseñanza de acústica física con simulaciones en k-wave

Se presenta el uso del toolbox k-wave para apoyar la enseñanza de acústica. Este toolbox permite de modo simple y eficiente la simulación de propagación de ondas en el dominio del tiempo. Es ampliamente utilizado para simular el comportamiento de ondas ultrasónicas en medios biológicos. Mediante el agregado de un limitado número de instrucciones es posible simular la propagación de campos acústicos en dos dimensiones con diversas condiciones de contorno, basadas en una imagen de referencia (archivo BMP) en el cual puntos de diferentes colores representan elementos específicos de la simulación. Esto permite experimentar con diferentes condiciones utilizando el toolbox k-wave con mínimos conocimientos de MATLAB/Octave. Cualquier alteración en la imagen mediante operaciones simples de corte, pegado, desplazamiento o rotación produce nuevas condiciones de simulación.

Application of fluorescent markers for homogeneity assessment of grain mixtures based on maize content

Abstract The paper presents test results for the assessment of the tracer content in a three-component (green peas, sorghum, maize) feed mixture that is based on the fluorescent method. The homogeneity of mixtures was determined on the basis of the maize content (as the key component), which was treated with fluorescent substance: tinopal, rhodamine B, uranine and eosin. The key components were wet-treated with fluorescent substances with different concentrations. Feed components were mixed in a vertical funnel-flow mixer. 10 samples were collected from each mixed batch. Samples were placed in a chamber equipped with UV light and, then, an image recorded as BMP file was generated. The image was analysed by means of the software programme Patan. On the basis of the analyses conducted, data on the maize content marked with a fluorescent marker were obtained. Additionally, the content of the key component was determined in a conventional manner – using an analytical scale. Results indicate the possibility of using this method for homogeneity assessment of the three-component grain mixture. From these tests, fluorescent substances that can be applied in the case of maize as a key component, together with their minimum concentrations, were identified: tinopal 0.3%, rhodamine B 0.001%.

A new two-step adaptive direct slicing approach for bio-scaffolds in tissue engineering

PurposeThis paper aims to propose the new two-step adaptive direct slicing method for building bio-scaffold with digital micro-mirror device (DMD)-based MPμSLA systems.Design/methodology/approachIn this paper, the authors proposed a new approach to directly slice a scaffold’s CAD model (i.e the three-dimensional model built by computer-aided design platforms) and save the slices’ data as BMP (bitmap, i.e. the data format used in DMD) files instead of other types of two-dimensional patterns as an intermediary. The proposed two-step strategy in this paper, i.e. a CAD model’s exterior surface and internal architecture were sliced, respectively, at first, and then assembled together to obtain one intact slice. The assembly process is much easier and convenient based on the slice data in BMP format. To achieve the adaptive slicing for both the exterior part and internal part, two new indices, the exterior surface-dominated index and internal architecture-dominated index, are, respectively, utilized as the error estimation indices. The proposed approach in this paper is developed on SolidWorks platform, but it can also be implemented on other platforms.FindingsThe authors found that the approach is not only more accurate but also more efficient by avoiding the repeated running of those inefficient rasterization programs. The approach is able to save computer resource and time, and enhance the robustness of slicing program, as well as is appropriate for the scaffolds’ model with internal pore architecture and external free-form surface.Practical implicationsBio-scaffolds in tissue engineering require precise control over material distribution, such as the porosity, connectivity, internal pore architecture and external free-form surface. The proposed two-step adaptive direct slicing approach is a good balance of slicing efficiency and accuracy and can be useful for slicing bio-scaffolds’ models.Originality/valueThis paper gives supports to build bio-scaffold with DMD-based MPμSLA systems.

Reassembling fragmented BMP files based on padding bytes

Reassembling fragmented image files plays a crucial role in seizing digital evidence from scattered digital image files. The existing algorithms are mainly graph based, which cast the reassembly problem as a K-vertex disjoint path problem in a directed complete graph, which is an NP-complete problem. Based on the padding bytes in BMP files, we present a method to exclude most impossible paths, which can improve the accuracy and decrease the time complexity of the existing graph-based methods. According to the alignment rule of BMP format, padding bytes must be appended to the end of each row to bring up the length of the row to a multiple of 4 bytes. Hence the fragment, being a vertex of the path which correctly reassembles a file, has a property; its byte values at padding positions must be the padding values. Only the fragments with such property can be candidate fragments for the vertex. On the test dataset which is constructed based on 330 image files, taking eight classical methods as examples, we show that the proposed method produces an accuracy improvement ranging from 32% to 55%, and reduces the run time to a scope from 1/6 to 1/237.

Image Retrival Pada Obyek Lingga Yoni Di Situs Peninggalan Sejarah Trowulan Mojokerto

This study contains about Image Retrieval system image on Lingga Yoni at historical sites Trowulan. In the area Trowulan is a legacy of work Majapahit era where the majority of people it is a Hindu, so many relics found in the form of Linga Yoni which serves as the worship of Lord Shiva. Data retrieval image Yoni Linga Linga Yoni as many as 50 images using a digital camera, and the image size Lingga Yoni 200 x 300 pixels in BMP file format. Stages Image Retrieval system on the study include segmentation stages: (1) Smoothing using the method Pas Low Filter to soften the image of the noise; (2) the extraction step texture by using Region Growing by altering the RGB color image is converted into to facilitate the HSL color groups; (3) Region Region Merging Growing did for the incorporation of color image corresponding to the object Linga Yoni; (4) to get to extraction stage form was originally looking for edge detection using Canny edge; (5) the image is converted into binary form to the morphology using opening and closing. At Stages Image Retrieval 50 Linga Yoni image texture extraction step performed using the 4 corners of each feature value GLCM with Different Inverse Moment IDM to revise the results of Image Retrieval using methods Precision and Recall.

ANALISIS PERBANDINGAN ALGORITMA LZW DAN HUFFMAN PADA KOMPRESI FILE GAMBAR BMP DAN PNG

File compression is one of important aspect in the development of information technology. The demands of providing information in a short time with large number and size of files makes compression techniques very important. There are a lot of algorithms that have been developed for the compression of files, including: LZW algorithm and Huffman Algorithm. This study discusses the comparative analysis between the two algorithms are against compressed image file format BMP and PNG. Analysis of this study aims to provide knowledge about what is the best algorithm between both of the algorithm to compress the image file format BMP and PNG. This analysis is comparing the ratio and the estimated time of each algorithm for image file format BMP and PNG. The author uses the Java programming language to implement both LZW and Huffman algorithm, and then analyze the process and results of compression on the file format BMP and PNG. After testing and analysis of experiments the compression process, it is concluded that the compression process BMP and PNG file format, Huffman algorithm can compress files faster than LZW algorithm, but the LZW algorithm can produce better compression ratio than Huffman algorithm.

Data Hiding Algorithm using Variable Block Size in Cover Image File

Data hiding inside any standard or non standard cover file is now a common area of interest across the globe. Nath et al already developed several methods for hiding any secret message inside any standard or non standard cover file. In the present work the authors have introduced a new method of hiding any kind of small secret message such as text, image, audio file inside any cover file which is mainly .bmp file. The authors divide the entire cover file into number of blocks and then inserted the bits of the secret file after a series of shift operations on them in the RGB components of pixels of cover image file. After inserting any secret message inside a cover file it was found that there is no significant change in the stego file. The shifting operation on the bits of the secret file in addition to the random generation of blocks, and processing them in an order, where a definite number of bits of the secret file to embed are reserved for each block will make the entire process fully secured. The size of the cover image should be at least 10-20 times larger than the secret message file so that the entire process should be almost unbreakable. General Terms Block,embed,dembed

A Study on CIF-to-BMP Format Transformation Algorithm

In the prediction and improvement of integrated circuit yield, it needs to convert CIF file to BMP file in order to calculate the critical area accurately and optimize the subsequent layout, at the same time, the image format of layout is the foundation of random defects hot spot detection. Firstly, the structures of CIF file and BMP file are studied, and various commands of CIF are deeply analyzed. Secondly, we design the algorithm that is based on the primitives are converted into BMP according to the representation of four basic primitives (rectangle, polygon, circularity, line with width) in CIF layout. Finally, we realize the algorithm of the whole CIF files is converted into BMP files. It is simple, conversion accuracy is high, more importantly, laid the foundation for the improvement of integrated circuit yield, and use C++ language to realize the CIF files conversion software based on the algorithm.

A Basic Study on the Conversion of Sound into Color Image using both Pitch and Energy

This study describes a proposed method of converting an input sound signal into a color image by emulating human synesthetic skills which make it possible to associate an sound source with a specific color image. As a first step of sound-to-image conversion, features such as fundamental frequency(F0) and energy are extracted from an input sound source. Then, a musical scale and an octave can be calculated from F0 signals, so that scale, energy and octave can be converted into three elements of HSI model such hue, saturation and intensity, respectively. Finally, a color image with the BMP file format is created as an output of the process of the HSI-to-RGB conversion. We built a basic system on the basis of the proposed method using a standard C-programming. The simulation results revealed that output color images with the BMP file format created from input sound sources have diverse hues corresponding to the change of the F0 signals, where the hue elements have different intensities depending on octaves with the minimum frequency of 20Hz. Furthermore, output images also have various levels of chroma(or saturation) which is directly converted from the energy.

442 ULTRASONOGRAPHIC TESTICULAR ECHOTEXTURE IN NELORE BULLS

The objective of this research was to determine the minimum area representative of the testicular parenchyma echotexture in Nelore bulls, and to evaluate the presence of echotexture homogeneity between the right and left testicles and between different regions of testicle. Twenty-nine Nelore bulls raised under extensive management and free of reproductive disorders were used. The average body weight was 352.8 ± 51.0 kg and age ranged between 18 and 24 months. Echotexture was assessed using a portable ultrasonography device equipped with a 7.5-MHz linear transducer. All measurement was done by a single, experienced operator, and scanner settings that affect image attributes (i.e. proximal, distal, and total gains; focus area; brightness and contrast) were standardized to predetermined values. In the examinations, a layer of gel was applied to the transducer scanning area, which was positioned in the testicular longitudinal plane, proceeding with enough pressure to capture an image. The frozen images were obtained with minimal artifacts (refraction, dispersion, and attenuation of ultrasound waves) taking care to avoid the mediastinum testis and tunica albuginea, and recorded as .bmp files in a USB pen drive connected to the ultrasound device. Echotexture was defined in terms of mean pixel value quantified using values from 0 (black) to 255 (white) through the ImageJ 1.41 software. After the selection of a specific area of testicular parenchyma, the average tonality of the gray pixels in the selected region was calculated by the software and expressed in 256 gray-scales. Squares selections of 400 (20 × 20), 1600 (40 × 40), 3600 (60 × 60), and 6400 (80 × 80) pixels were assessed from images of the extremitas capitata, middle, and extremitas caudata regions of both testicles to determine the minimum sampling area of an image needed to represent the echotexture of testicular parenchyma. The normal distribution verification (Lilliefors test) of the variable mean pixel value was tested in each area, followed by variance analysis. The averages were compared through Tukey’s test with 5% significance. There was no significant difference between the different pixel areas assessed (P > 0.05), indicating that all were samples representative of testicular echotexture. Furthermore, the extremitas capitata, middle, and extremitas caudata regions showed no significant difference in echotexture (P > 0.05) regardless of the area analyzed, and there was no significant difference between the right and left testicles (P > 0.05) in any of the assessed areas. In conclusion, this research shows that testicular echotexture assessments can be made in Nelore bulls through selections of 400, 1600, 3600, or 6400 pixels, and that images can be captured from any region of any testicle. Fundect - Fundação deApoio ao Desenvolvimento do Ensino, CiÊncia e Tecnologia do Estado de Mato Grosso do Sul.

FACE RECOGNITION BY RING ROTATION INVARIANT TRANSFORM AND MANAGING IMAGE ROTATION AND SHIFTING PROBLEMS

Generally, for face recognition, image shift and rotation problems must be addressed. The "ring rotation invariant transform" technique is used to transfer geometrical features of face image to other more salient ones; by which one can identify whether a sample or unknown image is the identical image. It also can solve image rotation problem. To deal with the image-shifting problem, this study uses one pixel inside a sample image to compare with the corresponding pixels in the unknown image to locate the closest matching point. In this study, three different kinds of extracted ring signals are generated, which are (1) ring-radius-31, (2) ring-radius-22, and (3) ring-radius-13. These signals are used to generate the rotation invariant magnitudes and several magnitudes are combined as one entity and, subsequently, saved inside one specific corresponding pixel in the BMP file. By this approach, one pixel will possess more geometrical-features of the face images; one entity in sample image is compared with entities inside the corresponding radius-6-cake area of the unknown image to locate the closest matching point.

Focus on test and measurement

Focus on test and measurement