Listless set partitioning embedded block (LSK) and set partitioning embedded block (SPECK) are known for their low complexity and simple implementation. However, the drawback is that these block‐based algorithms encode each insignificant subband by a zero. This generates many zeros at earlier passes because the number of significant coefficients at higher bitplanes is likely to be very few in a transformed image. An improved LSK (ILSK) algorithm that codes a single zero to several insignificant subbands is proposed. This reduces the length of the output bit string, encoding/decoding time and dynamic memory requirement at early passes. Furthermore, ILSK algorithm is coupled with discrete Tchebichef transform (DTT). This gives rise to a novel coder named as hierarchical listless DTT (HLDTT). The proposed HLDTT has desirable attributes like full embeddedness for progressive transmission, precise rate control for constant bit rate traffic and low complexity for low power applications. The performance of HLDTT is assessed using peak‐signal‐to‐noise‐ratio (PSNR) and structural‐similarity‐index‐metric (SSIM). Extensive simulation conducted on various standard test images shows that HLDTT exhibits significant improvement in PSNR values from lower to medium bit rates. At the same time, HLDTT shows improvement in SSIM values on all bit rates.

A smart helmet is a type of protective headgear used by the rider which makes bike driving safer than before. The main purpose of this helmet is to provide safety for the rider. This can be implemented by using advanced features like alcohol detection, accident identification, location tracking, use as a hands free device, fall detection. This makes it not only a smart helmet but also a feature of a smart bike. It is compulsory to wear the helmet, without which the ignition switch cannot turn ON. An RF Module can be used as wireless link for communication between transmitter and receiver. If the rider is drunk the ignition gets automatically locked, and sends a message to the registered number with his current location. In case of an accident it will send a message through GSM along with location with the help of GPS module. The distinctive utility of project is fall detection; if the rider falls down from the bike it sends a message.

This paper presents a DCT-based (DCT: discrete cosine transform) listless set partitioning in hierarchical trees (SPIHT) digital watermarking technique that is robust against several common attacks such as cropping, filtering, sharpening, noise, inversion, contrast manipulation, and compression. The proposed technique is made further robust by the incorporation of the Chinese remainder theorem (CRT) encryption technique. Our scheme is compared with the recently proposed CRT-based DCT technique, CRT-based spatial domain watermarking, and DCT-based inter block correlation techniques. Extensive simulation experiments show better robustness in common image manipulations and, at the same time, the proposed technique successfully makes the watermark perceptually invisible. A better Tamper Assessment Function (TAF) value of 2–15% and a better Normalized Correlation (NC) is achieved compared to some of the above techniques. In particular, the proposed technique shows better robustness on compression attacks at moderate to higher compression ratios. It is possible to maintain the imperceptibility and low TAF for various values by doubling the capacity of the watermark.

This paper presents a listless variant of a modified three-dimensional (3D)-block coding algorithm suitable for medical image compression. A higher degree of correlation is achieved by using a 3D hybrid transform. The 3D hybrid transform is performed by a wavelet transform in the spatial dimension and a Karhunen–Loueve transform in the spectral dimension. The 3D transformed coefficients are arranged in a one-dimensional (1D) fashion, as in the hierarchical nature of the wavelet-coefficient distribution strategy. A novel listless block coding algorithm is applied to the mapped 1D coefficients which encode in an ordered-bit-plane fashion. The algorithm originates from the most significant bit plane and terminates at the least significant bit plane to generate an embedded bit stream, as in 3D-SPIHT. The proposed algorithm is called 3D hierarchical listless block (3D-HLCK), which exhibits better compression performance than that exhibited by 3D-SPIHT. Further, it is highly competitive with some of the state-of-the-art 3D wavelet coders for a wide range of bit rates for magnetic resonance, digital imaging and communication in medicine and angiogram images. 3D-HLCK provides rate and resolution scalability similar to those provided by 3D-SPIHT and 3D-SPECK. In addition, a significant memory reduction is achieved owing to the listless nature of 3D-HLCK.