A Feature-Based Fragile Watermarking of Color Image for Secure E-Government Restoration

this research developed a method using fragile watermarking technique for color images to achieve secure e-government tamper detection with recovery capability. Before performing the watermark insertion process, the RGB image is converted first into YCbCr image. The watermark component is selected from the image feature that approximates the original image, in which the chrominance value features as a watermark component. For a better detection process, 3-tuple watermark, check bits, parity bits, and recovery bits are selected. The average block in each 2 x 2 pixels is selected as 8 restoration bits of each component, the embedding process work on the pixels by modifying the pixels value of three Least Significant Bit (LSB) . The secret key for secure tamper detection and recovery, transmitted along with the watermarked image, and the algorithm mixture is used to extract information at the receiving end. The results show remarkably effective to restore tampered image

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words