Multi-path based embedding scheme at perfect maze (Record no. 17259)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | a |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20220805152054.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 220805b xxu||||| |||| 00| 0 eng d |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | AIKTC-KRRC |
| Transcribing agency | AIKTC-KRRC |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| 9 (RLIN) | 17467 |
| Author | Roy, Sujit |
| 245 ## - TITLE STATEMENT | |
| Title | Multi-path based embedding scheme at perfect maze |
| 250 ## - EDITION STATEMENT | |
| Volume, Issue number | Vol.7 (01), Jan-Feb. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | New Delhi |
| Name of publisher, distributor, etc. | Associated Management Consultants |
| Year | 2022 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Pagination | 25-35p. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | Abstract Steganography is a process of hiding data in a media, e.g., image, audio, video, etc. There are lots of areas where steganography can be used. Many researchers are devoting their valuable efforts to hide messages before sending them to a destination through maze-based steganography. However, maze-based steganography has the drawback of reducing embedding capacity. Another problem of maze application at embedding is the imperfection of its solution paths. Imperfect paths are not used for embedding by the maze. That is why while selecting multiple paths, the process of Niwayama et al. in 2010 prunes many paths considering their overlapping or crossing affairs with other ones. In this paper, a solution to those stated problems of Niwayama et al. is outlined and successful results found are demonstrated here too. First, an imperfect maze is tried to be changed virtually to a perfect maze. Then solution paths from start to end are generated. While generating solution paths, the longest path among them is considered to cross or join a point along their pathways. Therefore, one path among those imperfect paths is considered embedded at and extraction was not employed by any earlier proposal, so far we know. Contribution to the stated research area will increase the embedding capacity. For measuring the longest path, the tie is broken by comparing x coordinates and then, if required, y coordinates. The illustrated result in the result analysis section details the justification of our claim. Keywords Steganography. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| 9 (RLIN) | 4622 |
| Topical term or geographic name entry element | Computer Engineering |
| 700 ## - ADDED ENTRY--PERSONAL NAME | |
| 9 (RLIN) | 17468 |
| Co-Author | Das, Subrata Kumar |
| 700 ## - ADDED ENTRY--PERSONAL NAME | |
| 9 (RLIN) | 17469 |
| Co-Author | A.H.M. Kamal |
| 773 0# - HOST ITEM ENTRY | |
| International Standard Serial Number | 2456-4133 |
| Place, publisher, and date of publication | New Delhi Associated Management Consultants |
| Title | Indian Journal of Computer Science |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | |
| Koha item type | Articles Abstract Database |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | Permanent Location | Current Location | Shelving location | Date acquired | Barcode | Date last seen | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Circulation | School of Engineering & Technology | School of Engineering & Technology | Archieval Section | 2022-08-05 | 2022-1280 | 2022-08-05 | 2022-08-05 | Articles Abstract Database |