The growing abundance of electronic control units and peripheral devices loaded and connected to smart connected cars has resulted in a constant stream of cyber-attacks at various levels and dimensions. The CAN-FD bus...
详细信息
The growing abundance of electronic control units and peripheral devices loaded and connected to smart connected cars has resulted in a constant stream of cyber-attacks at various levels and dimensions. The CAN-FD bus plays a crucial role in smart connected cars. Currently, the majority of research efforts remain centered around the traditional CAN bus, with fewer studies addressing intrusion detection for the CAN-FD bus in smart connected vehicles. CAN-FD boasts a notable improvement in transmission speed, capable of reaching up to 8 Mbps compared to the 1 Mbps of the standard CAN bus. Utilizing intrusion detection systems designed for the CAN bus in high-speed CAN-FD applications could potentially hinder normal transmission and detection efficiency. Hence, we focus on the attack and intrusion detection of CAN-FD bus ID nodes to prevent unauthorized access and potential malicious attacks. We propose an ID intrusion detection system based on an improved Generative Adversarial Network (GAN) model, which consists of two parts: a data pre-processing module and a detection module. To apply the GAN model to the vehicle bus, we perform pre-processing of the bus data. We introduce the concept of dual discriminator to improve the detection rate and enable the handling of unknown attacks. With the output of dual discriminator, we can determine whether there are any anomalies in the detection data. First, we use a data pre-processing module to convert the ID segments of the automobile CAN-FD into binaryimage encoding to form ID images. Subsequently, these ID images are fed into an ID image feature extractor in the detection module to extract various auxiliary features. The discriminator receives these auxiliary features and calculates the probability of whether the received image is a normal ID image or not to determine the authenticity of the ID image. The experimental results show that the proposed intrusion detection system is able to detect a message within 0.15 ms, whic
In this article, the researcher develops an imagecoding technique which is based on the wolf-sheep predation model. In the design, images are converted to virtual worlds of sheep, routes and wolves. Wolves in this mo...
详细信息
ISBN:
(纸本)9783319937014;9783319937007
In this article, the researcher develops an imagecoding technique which is based on the wolf-sheep predation model. In the design, images are converted to virtual worlds of sheep, routes and wolves. Wolves in this model wander around searching for sheep while the algorithm tracks their movement. A wolf has seven movements which capture all the directions of the wolf. In addition, the researcher introduces one extra move of the wolf the purpose of which is to provide a shorter string of movements and to enhance the compression ratio. The first coordinates and the movements of the wolf are tracked and recorded. Then, arithmetic coding is applied on the string of movements to further compress it. The algorithm was applied on a set of images and the results were compared with other algorithms in the research community. The experimental results reveal that the size of the compressed string of wolf movements offer a higher reduction in space and the compression ratio is higher than those of many existing compression algorithms including G3, G4, JBIG1, JBIG2 and the recent agent-based model of ant colonies.
This paper presents a fast and effective method for generating chain-encoded representations of arbitrary contours of connected regions in a binaryimage. Furthermore, an optional method is presented allowing the addi...
详细信息
ISBN:
(纸本)9781479904020;9781479904037
This paper presents a fast and effective method for generating chain-encoded representations of arbitrary contours of connected regions in a binaryimage. Furthermore, an optional method is presented allowing the additional concurrent extraction of the topological hierarchy tree within the image. Both parts of the algorithm are executed by means of a single raster scan with a 2x3 neighborhood convolution window. This not only allows the reduction of the pixel buffer to a single image line, it furthermore enables fast neighborhood evaluation by means of a moderately sized look-up-table with 64 entries, to be directly addressed by the six pixel in window focus. With these main characteristics, the algorithm is well suited for efficient parallel processing implementations in streaming applications.
In this paper, we present a hybrid 2-3-3 bits based encoding scheme for gray scale images. In this scheme, the gray scale image is converted to its equivalent 8-binary maps. We employ our lossless block coding techniq...
详细信息
ISBN:
(纸本)9780780397538
In this paper, we present a hybrid 2-3-3 bits based encoding scheme for gray scale images. In this scheme, the gray scale image is converted to its equivalent 8-binary maps. We employ our lossless block coding technique along with a two dimensional information preserving skip-line routine on the two most significant binary maps. Then, we apply our lossy block coding technique along with a lossy skip-line routine to the next three binary maps. Finally, the three least significant binary maps are set to zero. We tested this scheme on a large set of images of different sizes and applications. The simulation results show that the proposed scheme outperformed the standard JPEG compression in most of the cases while maintained high SNR values.
The Q-convexity is a kind of convexity in the discrete plane. This notion has practically the same properties as the usual convexity: an intersection of two Q-convex sets is Q-convex, and the salient points can be def...
详细信息
The Q-convexity is a kind of convexity in the discrete plane. This notion has practically the same properties as the usual convexity: an intersection of two Q-convex sets is Q-convex, and the salient points can be defined like the extremal points. Moreover a Q-convex set is characterized by its salient point. The salient points can be generalized to any finite subset of Z(2).
This paper describes a motion compensation method for arbitrarily shaped moving visual objects. To utilise both the inter-frame correlation and the texture-shape correlation, we use macroblock-based motion compensatio...
详细信息
This paper describes a motion compensation method for arbitrarily shaped moving visual objects. To utilise both the inter-frame correlation and the texture-shape correlation, we use macroblock-based motion compensation for binary shape coding as well as texture coding. To efficiently achieve motion compensation for a moving binary shape, we introduce extra motion vectors for the shape coding in addition to the texture motion vectors, where the shape motion vectors are coded by referring to the texture motion vectors. The proposed method can successfully save more than 50% of the number of bits in comparison with the intra-only method. The effectiveness of the proposed method has been established through MPEG4 standardisation activity, and the proposed motion-compensation framework has been adopted by the MPEG-4 visual coding standard (ISO 14496-2). (C) 2000 Elsevier Science B.V. All rights reserved.
In this work, a subband domain textual image compression method is developed. The document image is first decomposed into subimages using binary subband decompositions. Next, the character locations in the subbands an...
详细信息
In this work, a subband domain textual image compression method is developed. The document image is first decomposed into subimages using binary subband decompositions. Next, the character locations in the subbands and the symbol library consisting of the character images are encoded, The method is suitable for keyword search in the compressed data. It is observed that very high compression ratios are obtained with this method. Simulation studies are presented.
III this thesis, imagecoding methods for two basic image types are developed under a digitized library framework. The two image types are gray tone or color images, and liinary textual images, which are the digitized...
详细信息
III this thesis, imagecoding methods for two basic image types are developed under a digitized library framework. The two image types are gray tone or color images, and liinary textual images, which are the digitized image ver sions of text documents. The grciy tone images are encoded using an adaptive subband decomposition followed by zerotree quantizers. The adaptive sub- l)and decomposition filter bank adaptively updates the filter bank coefficients in which the values of one of the subbands is predicted from the other sub- band. It is observed that the adaptive subband decomposition performs better than a regulcir subband decomposition with a fixed filter bank in terms of compression. For the binary textual images, a compression algorithm using binary subband decomposition followed by a textual image compression (TIC) method that exploits the redundancy in repeating characters is developed. The liinary subband decomposition yields binary sub-images, and the TIC method is applied to the low band sub-image. Obtaining binary sub-images improves compression results as well as pattern matching time of the TKJ method. Sim ulation results for l)oth adaptive subband decomposition and multiresolution TIC methods indicate improvements over the methods described in the litera ture.
This paper presents a recursive morphological operation which can be advantageously substituted to classical erosion with an application for imagecoding. A structuring element is translated over binaryimage followin...
详细信息
This paper presents a recursive morphological operation which can be advantageously substituted to classical erosion with an application for imagecoding. A structuring element is translated over binaryimage following four scanning modes. The result of the operation, as for classical erosion, corresponds to the centers of the structuring elements which are included in the image objects, but our operation authorizes only a minimal overlap between the translated structuring elements. This minimal overlap needs to take into account previous erosions, so the operation is recursive. It results in a subset of the erosion, containing fewer points than the erosion, but gives a good approximation to image objects. In a second step, operation is extended with a second recursivity level corresponding to structuring element size variation. This new double-recursive morphological algorithm describes an image object, from coarser structures to finer details, by the loci and sizes of the translated structuring elements which are included in the object. This algorithm provides a minimal redundancy shape representation. To evaluate this algorithm in the context of binary image coding, we propose two different techniques for encoding representative points issued from our shape decomposition algorithm. Comparative experimental results with two classical methods (Modified Huffman RLC and TUH code) and also a morphological method (discrete skeleton), expressed in terms of compression ratio, show the good performances of our approach.
A new algorithm for multiscale description of binary digital regions is given. A region is represented by a growing sequence of subsets approximating it;each approximation is obtained from the previous one by addition...
详细信息
A new algorithm for multiscale description of binary digital regions is given. A region is represented by a growing sequence of subsets approximating it;each approximation is obtained from the previous one by addition of the opening by a structuring element chosen in a finite family. The structuring elements vary in size and shape, and are chosen at each step according to two criteria: largest structuring element size and greatest increment in the size of the approximation. The algorithm satisfies meaningful algebraic properties and converges to a final result in a bounded number of steps. It also allows an economical representation of shape in terms of structuring elements, and so it can be applied in binary image coding.
暂无评论