• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.95-100
• /
• 2006

I design an Embedded File System in Linux Operating System by applying modified LZSS compressed algorithm. This suggested Compressed File System which is modified file system of the Linux O.S saves the storage space. The compressed file system supports efficient use of storage space. The suggesting file system solves the small space of embedded system. The suggesting file system of this paper gives effect of the large storage space without extending the storage space.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.551-555
• /
• 2008

In these days, compressed file is useful in internet environment and has many advantages. So a lot of data hiding algorithms works on JPEG compressed file. Of course they know basic rules of transformation and quantization and they utilize those rules to implement their programming. But most of them evaluate the affection of data hiding after data modification. We propose how to predict the affection of data modification in course of data hiding process. Through some kind of experiments, several valuable facts are revealed which used in data hiding in compressed domain such as JPEG. These facts will improve existing data hiding algorithms (F3, F4 and F5 which including Matrix Encoding)[1],[5],[6].

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.299-302
• /
• 2010

Recently, the malicious code is not easily detectable in the vaccine for the virus, malicious code as a compressed file by modulation pattern is the tendency to delay. Among the many antivirus engines on the market a compressed file that can be modulated by malicious code, and test whether the pattern will need to know. We cover a multi-compressed files, malicious code modulated secreted by examining patterns of test engine is being detected is through a computer simulation. Analysis of secreted activities of malicious code and infect the host file tampering with the system driver files and registry, it gets registered is analyzed. this study will contribute hidden malicious code inspection and enhance vaccine efficacy in reducing the damage caused by malicious code.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.2
• /
• pp.90-103
• /
• 2006

There are many file systems in various operating systems. Those are usually designed for server environments, where the common cases are usually 'multiple active users', 'great many small files' And they assume a big main memory to be used as buffer cache. So the existing file systems are not suitable for resource hungry embedded systems that process multimedia data streams. In this study, we designed and implemented a new file system which efficiently stores and retrieves multimedia data steams. The proposed file system has a very simple disk layout, which guarantees a quick disk initialization and file system recovery. And we introduced a new indexing-scheme, called the time-based indexing scheme, with the file system. With the indexing scheme, the file system maintains the relation between time and the location for all the multimedia streams. The scheme is useful in searching and playing the compressed multimedia streams by locating exact frame position with given time, resulting in reduction of CPU processing and power consumption. The proposed file system and its APIs utilizing the time-based indexing schemes were implemented firstly on a Linux environment, though it is operating system independent. In the performance evaluation on a real DVR system, which measured the execution time of multi-threaded reading and writing, we found the proposed file system is maximum 38.7% faster than EXT2 file system.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.1
• /
• pp.23-28
• /
• 2012

The performance improvement of the secondary storage is very slow compared to the main memory and processor. The data is loaded from secondary storage to memory for the execution of an application. At this time, there is a bottleneck. In this paper, we propose an Executable Compression Method to speed up the initial loading time of application. and we examined the performance. So we implemented the two applications. The one is a compressor for Execution Binary File. and The other is a decoder of Executable Compressed application file on the Embedded System. Using the test binary files, we performed the speed test in the six files. At the result, one result showed that the performance was decreased. but others had a increased performance. the average increasing rate was almost 29% at the initial loading time. The level of compression had different characteristics of the file. And the performance level was dependent on the file compressed size and uncompress time. so the optimized compression algorithm will be needed to apply the execution binary file.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.458-471
• /
• 2006

Digital watermarking of multimedia data is a very active research area that has enjoyed a considerable amount of attention in recent years. In this paper, we propose an algorithm for embedding/detecting a fragile watermark in MPEG-4 compressed video domain (Simple and Advance Simple Profiles). The watermark bits are put directly into Huffman VLC-codespace of quantized DCT domain. The advantage of watermark embedding into the compressed domain is the significant savings for a real-time implementation as it does not require a full decoding operation. The watermark embedding does not change the video file size. The algorithm demonstrates high watermarking capacity, thereby providing reliable foolproof authentication. The results of experimental testing demonstrate that watermark embedding preserves the video quality. Watermark detection is performed without using the original video.

• Journal of the Korean Graphic Arts Communication Society
• /
• v.18 no.2
• /
• pp.55-68
• /
• 2000

Joint photographic experts group (JPEG) is a standard still-image compression technique, established by the international organization for standardization (ISO) and international telecommunication standardization sector (ITUT). The standard is intended to be utilized in the various kinds of color still imaging systems as a standard color image coding format. Because JPEG is a lossy compression, the decompressed image pixel values are not the same as the value before compression. Various distortions of JPEG compression and JPEG recompression has been reported in various papers. The Image compressed by JPEG is often recompressed by same type compression method in JPEG. In general, JPEG is a lossy compression and the quality of compressed image is predicted that is varied in according to recompression Q-factor. In this paper, four difference color samples(photo image, gradient image, gradient image, vector drawing image, text image) were compressed in according to various Q-factor, and then the compressed images were recompressed according to various Q-factor once again. As the result, this paper evaluate the variation of image quality and file size in JPEG recompression and recommed the optimum recompression factor.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.600-602
• /
• 1998

RFC 959 정의한 FTP 의 세가진 전송모드, Stream, Block, Compressed전송 모드 중 현재 주로 사용되고 있는 전송 모드는 Stream 전송모드인데. 이 Stream전송모드에서 서버 또는 네트웍에 치명？인 오류 발생하였을 경우 이를 체크 할 수 없고 서버에 재접속하였을 겨우 처음부터 재전송 하영햐 하는 문제점이 발생한다. 이를 개선한 Block, Compressed전송 모드의 경우, 데이터 스트림에 정보 헤더를 추가하여야 함으로써 오버 헤드를 발생한다. 본 논문에서는 클라이언트 FTP상에서 전송 상태를 체크하게 함으로서 전송 중단시 중단된 시점부터 나머지 데이터를 보냄으로써 FTP의 스트림 전송 모드의 문제점을 개선하는 방법을 제시한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.6
• /
• pp.678-682
• /
• 2010

Compressed filesystem is frequently used in the embedded system to increase cost efficiency. One of the drawbacks of compressed filesystem is low read performance. Moreover, read-ahead mechanism that improves the read throughput of storage device has negative effect on the read performance of compressed filesystem, increasing read latency. Main reason is that compressed filesystem has too big read-ahead miss penalty due to decompression overhead. To solve this problem, this paper proposes new read technique considering kernel read-ahead mechanism for compressed filesystem. Proposed technique improves read throughput of device by bulk read from device and reduces decompression overhead of compressed filesystem by selective decompression. We implement proposed technique by modifying CramFS and evaluate our implementation in the Linux kernel 2.6.21. Performance evaluation results show that proposed technique reduces the average major page fault handling latency by 28%.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.5
• /
• pp.869-879
• /
• 2022

Through this study, we discovered that among three types of compressed data blocks generated through the Deflate algorithm, No-Payload Non-Compressed Block type (NPNCB) which has no literal data can be randomly generated and inserted between normal compressed blocks. In the header of the non-compressed block, there is a data area that exists only for byte alignment, and we called this area as DBA (Disposed Bit Area), where an attacker can hide various malicious codes and data. Finally we found the vulnerability that hides malicious codes or arbitrary data through inserting NPNCBs with infected DBA between normal compressed blocks according to a pre-designed attack scenario. Experiments show that even though contaminated NPNCB blocks were inserted between normal compressed blocks, commercial programs decoded normally contaminated zip file without any warning, and malicious code could be executed by the malicious decoder.