• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권1호
• /
• pp.404-421
• /
• 2020

A reversible data hiding scheme in JPEG compressed bitstreams is proposed, which could avoid decoding failure and file expansion by means of removing of bitstreams corresponding to high frequency coefficients and embedding of secret data in file header as comment part. We decode original JPEG images to quantified 8×8 DCT blocks, and search for a high frequency as an optimal termination point, beyond which the coefficients are set to zero. These blocks are separated into two parts so that termination point in the latter part is slightly smaller to make the whole blocks available in substitution. Then spare space is reserved to insert secret data after comment marker so that data extraction is independent of recovery in receiver. Marked images can be displayed normally such that it is difficult to distinguish deviation by human eyes. Termination point is adaptive for variation in secret size. A secret size below 500 bits produces a negligible distortion and a PSNR of approximately 50 dB, while PSNR is also mostly larger than 30 dB for a secret size up to 25000 bits. The experimental results show that the proposed technique exhibits significant advantages in computational complexity and preservation of file size for small hiding capacity, compared to previous methods.

• 한국콘텐츠학회논문지
• /
• 제5권6호
• /
• pp.65-73
• /
• 2005

인터넷의 급속한 보급과 대용량 멀티미디어 서비스에 대한 요구가 나날이 증가하고 있다. 기존의 무선랜은 도달거리가 짧아서 가입자가 기지국(Base Station)에서 멀어지면 서비스 품질이 저하되고, 무선인터넷은 사용비용이 높다. 최근에 세계 최초로 국내에서 개발한 휴대 인터넷 시스템인 와이브로(WiBro: Wireless Broadband Internet) 시스템은 휴대폰과 무선 랜의 중간 영역에 위치한 이동초고속인터넷서비스이다. 본 논문에서는 와이브로 시스템의 근간을 이루는 IEEE 802.16 BWA을 기반으로 멀티미디어 서비스를 제공하기 위해서 서비스별 트래픽 모델과 특성을 분석하고, 다양한 트래픽 혼합 비율에 따라 시뮬레이션을 수행하였으며, 이를 토대로 최종적으로는 WiBro 시스템에서 셀 당 수용 가능한 최대 가입자 수를 산출하였다.

• Journal of information and communication convergence engineering
• /
• 제8권4호
• /
• pp.437-442
• /
• 2010

Ubiquitous mobile computing is becoming easier and more attractive in this ambient technological Internet world. However, some portable devices such as Personal Digital Assistant (PDAs) and smart phones are still encountering inherent constraints of limited storages and computing resources. To alleviate this problem, we develop a cost-effective protocol, iATA to transfer ATA commands and data over TCP/IP network between mobile appliances and stationary servers. It provides mobile users a virtual storage platform which is physically resided at remote home or office. As communications are made through insecure Internet connections, security risks of adopting this service become a concern. There are many reported cases in the history where attackers masquerade as legitimate users, illegally access to network-based applications or systems by breaking through the poor authentication gates. In this paper, we propose a mutual authentication and secure session termination scheme as the first and last defense steps to combat identity thief and fraud threat in particular for iATA services. Random validation factors, large prime numbers, current timestamps, one-way hash functions and one-time session key are deployed accordingly in the scheme. Moreover, we employ the concept of hard factorization problem (HFP) in the termination phase to against fraud termination requests. Theoretical security analysis discussed in later section indicates the scheme supports mutual authentication and is robust against several attacks such as verifiers' impersonation, replay attack, denial-of-services (DoS) attack and so on.

• 대한가정학회지
• /
• 제41권8호
• /
• pp.19-31
• /
• 2003

This study was intended to present the plan for preventing and solving the seriousness of the consumer problem perceived in the e-commerce. For this purpose, 723 questionnaires were distributed to university As a result of analysis, the following findings were obtained: 1) It was found that e-commerce users had higher knowledge of the degree of internet un, the ability to use information on the internet, the disposition of computerization, and e-commerce related consumer than e-commerce non-users. 2) It was found that e-commerce non-users had the higher level of perceived seriousness of the consumer problem than e-commerce users. Especially, it was found that e-commerce non-users had the high level of perceived seriousness of the consumer problem related to the problem of exchange, termination and after-sale nice and the leakage of exchange, termination and after-sale service and the leakage of private information e-commerce user. 3) It was found that university consumers' perceived seriousness of the consumer problem in e-commerce over the internet showed a significant difference in the ability to use information on the internet between e-commerce users and non-users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1333-1343
• /
• 2016

Spectrum sharing in centrally controlled cognitive radio (CR) networks has been widely studied, however, research on channel access for distributively controlled individual cognitive users has not been fully characterized. This paper conducts an analysis of random channel access of cognitive users controlled in a distributed manner in a CR network. Based on the proposed estimation method, each cognitive user can estimate the current channel condition by using its own Markov-chain model and can compute its own blocking probability, collision probability, and forced termination probability. Using the proposed scheme, CR with distributed control (CR-DC), CR devices can make self-controlled decisions based on the status estimations to adaptively control its system parameters to communicate better.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.3997-4015
• /
• 2014

Radio frequency identification (RFID) is an emerging wireless communication technology which allows objects to be identified automatically. The tag anti-collision is a significant issue for fast identifying tags due to the shared wireless channel between tags and the reader during communication. The EPCglobal Class-1 Generation-2 which uses Q algorithm for the anti-collision is widely used in many applications such as consumer electronic device and supply chain. However, the increasing application of EPCglobal Class-1 Generation-2 which requires the dynamic environment makes the efficiency decrease critically. Furthermore, its frame length (size) determination and frame termination lead to the suboptimal efficiency. A new anti-collision algorithm is proposed to deal with the two problems for large-scale RFID systems. The algorithm has higher performance than the Q algorithm in the dynamic environment. Some simulations are given to illustrate the performance.

• 한국인터넷방송통신학회논문지
• /
• 제10권1호
• /
• pp.145-150
• /
• 2010

본 논문은 무선인지시스템이 갖는 얼랑 용량을 분석하였다. 무선 인지 사용자들의 신규 호 및 스펙트럼 핸드오프를 요청하는 호들에 대해 버퍼를 사용하는 무선 자원 관리 기법을 고려하였으며, 성능 분석을 위해 마르코프(Markov) 모델을 사용하였다. 이를 기반으로 무선 인지 시스템에서 기사용자 및 무선 인지 사용자가 겪는 호 차단(call blocking) 확률, 강제 호 종료(forced call termination) 확률, 호 서비스 비완료(non-completion) 확률 등을 유도하였다. 시뮬레이션을 통해 버퍼의 크기가 증가함에 따라, 인지 무선 시스템에서 수용될 수 있는 얼랑 용량 또한 증가함을 보였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권4호
• /
• pp.1987-2001
• /
• 2017

Low-density parity-check (LDPC) codes have attracted a great attention because of their excellent error correction capability with reasonably low decoding complexity. Among decoding algorithms for LDPC codes, the min-sum (MS) algorithm and its modified versions have been widely adopted due to their high efficiency in hardware implementation. In this paper, a self-adaptive MS algorithm using the difference of the first two minima is proposed for faster decoding speed and lower power consumption. Finding the first two minima is an important operation when MS-based LDPC decoders are implemented in hardware, and the found minima are often compressed using the difference of the two values to reduce interconnection complexity and memory usage. It is found that, when these difference values are bounded, decoding is not successfully terminated. Thus, the proposed method dynamically decides whether the termination-checking step will be carried out based on the difference in the two found minima. The simulation results show that the decoding speed is improved by 7%, and the power consumption is reduced by 16.34% by skipping unnecessary steps in the unsuccessful iteration without any loss in error correction performance. In addition, the synthesis results show that the hardware overhead for the proposed method is negligible.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1195-1211
• /
• 2016

The emerging video coding standard High Efficiency Video Coding (HEVC) has shown almost 40% bit-rate reduction over the state-of-the-art Advanced Video Coding (AVC) standard but at about 40% computational complexity overhead. The main reason for HEVC computational complexity is the inter prediction that accounts for 60%-70% of the whole encoding time. In this paper, we propose several fast coding unit (CU) encoding schemes based on the Merge mode and motion estimation information to reduce the computational complexity caused by the HEVC inter prediction. Firstly, an early Merge mode decision method based on motion estimation (EMD) is proposed for each CU size. Then, a Merge mode based early termination method (MET) is developed to determine the CU size at an early stage. To provide a better balance between computational complexity and coding efficiency, several fast CU encoding schemes are surveyed according to the rate-distortion-complexity characteristics of EMD and MET methods as a function of CU sizes. These fast CU encoding schemes can be seamlessly incorporated in the existing control structures of the HEVC encoder without limiting its potential parallelization and hardware acceleration. Experimental results demonstrate that the proposed schemes achieve 19%-46% computational complexity reduction over the HEVC test model reference software, HM 16.4, at a cost of 0.2%-2.4% bit-rate increases under the random access coding configuration. The respective values under the low-delay B coding configuration are 17%-43% and 0.1%-1.2%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권7호
• /
• pp.3018-3038
• /
• 2020

In the stereoscopic or multiview display, the depth video illustrates visual distances between objects and camera. To promote the computational efficiency of depth video encoder, we exploit the intra prediction of depth videos under Versatile Video Coding (VVC) and observe a diverse distribution of intra prediction modes with different coding unit sizes. We propose a hybrid scheme to further boost fast depth video coding. In the first stage, we adaptively predict the HADamard (HAD) costs of intra prediction modes and initialize a candidate list according to the HAD costs. Then, the candidate list is further improved by considering the probability distribution of candidate modes with different CU sizes. Finally, early termination of CU splitting is performed at each CU depth level based on the Bayesian theorem. Our proposed method is incorporated into VVC intra prediction for fast coding of depth videos. Experiments with 7 standard sequences and 4 Quantization parameters (Qps) validate the efficiency of our method.