International Conference on Information Technology: Coding and Computing 

About: International Conference on Information Technology: Coding and Computing is an academic conference. The conference publishes majorly in the area(s): Data compression & Digital watermarking. Over the lifetime, 1016 publications have been published by the conference receiving 16769 citations.

A survey on data compression in wireless sensor networks

Abstract: Wireless sensor networks (WSNs) are resource constraint: limited power supply, bandwidth for communication, processing speed, and memory space. One possible way of achieve maximum utilization of those resource is applying data compression on sensor data. Usually, processing data consumes much less power than transmitting data in wireless medium, so it is effective to apply data compression before transmitting data for reducing total power consumption by a sensor node. However, existing compression algorithms are not applicable for sensor nodes because of their limited resource. Therefore, some of compression algorithms, which have been specifically designed for WSNs, are presented in this paper: coding by ordering, pipelined in-network compression, low-complexity video compression, and distributed compression.

Robust hash functions for digital watermarking

Abstract: Digital watermarks have been proposed for authentication of both video data and still images and for integrity verification of visual multimedia In such applications, the watermark has to depend on a secret key and on the original image It is important that the dependence on the key be sensitive, while the dependence on the image be continuous (robust) Both requirements can be satisfied using special image digest functions that return the same bit-string for a whole class of images derived from an original image using common processing operations It is further required that two completely different images produce completely different bit-strings We discuss methods how such robust hash functions can be built We also show how the hash bits has another application, the robust image digest can be used as a search index for an efficient image database search

A classified and comparative study of edge detection algorithms

Abstract: Since edge detection is in the forefront of image processing for object detection, it is crucial to have a good understanding of edge detection algorithms. This paper introduces a new classification of most important and commonly used edge detection algorithms, namely ISEF, Canny, Marr-Hildreth, Sobel, Kirsch, Lapla1 and Lapla2. Five categories are included in our classification, and then advantages and disadvantages of some available algorithms within this category are discussed. A representative group containing the above seven algorithms are the implemented in C++ and compared subjectively, using 30 images out of 100 images. Two sets of images resulting from the application of those algorithms are then presented. It is shown that under noisy conditions, ISEF, Canny, Marr-Hildreth, Kirsch, Sobel, Lapla2, Lapla1 exhibit better performance, respectively.

Watermarking applications and their properties

Abstract: We describe a number of applications of digital watermarking and we examine the common properties of robustness, tamper resistance, fidelity, computational cost and false positive rate. We observe that these properties vary greatly depending on the application. Consequently, we conclude that evaluation of a watermarking algorithm is difficult without first indicating the context in which it is to be applied.

Threshold and identity-based key management and authentication for wireless ad hoc networks

Abstract: As various applications of wireless ad hoc network have been proposed, security has become one of the big research challenges and is receiving increasing attention. In this paper, we propose a distributed key management and authentication approach by deploying the recently developed concepts of identity-based cryptography and threshold secret sharing. Without any assumption of prefixed trust relationship between nodes, the ad hoc network works in a self-organizing way to provide the key generation and key management service, which effectively solves the problem of single point of failure in the traditional public key infrastructure (PKI)-supported system. The identity-based cryptography mechanism is applied here not only to provide end-to-end authenticity and confidentiality, but also to save network bandwidth and computational power of wireless nodes.