• Journal of Internet of Things and Convergence
• /
• v.10 no.2
• /
• pp.51-60
• /
• 2024

Aiming at the problem of low contrast and difficult to recognize video images in low-light environment, we propose an adaptive contrast compensation enhancement algorithm based on human visual perception. First of all, the video image characteristic factors in low-light environment are extracted: AL (average luminance), ABWF (average bandwidth factor), and the mathematical model of human visual CRC(contrast resolution compensation) is established according to the difference of the original image's grayscale/chromaticity level, and the proportion of the three primary colors of the true color is compensated by the integral, respectively. Then, when the degree of compensation is lower than the bright vision precisely distinguishable difference, the compensation threshold is set to linearly compensate the bright vision to the full bandwidth. Finally, the automatic optimization model of the compensation ratio coefficient is established by combining the subjective image quality evaluation and the image characteristic factor. The experimental test results show that the video image adaptive enhancement algorithm has good enhancement effect, good real-time performance, can effectively mine the dark vision information, and can be widely used in different scenes.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.209-215
• /
• 2010

In an asymmetrical speed channel environment like asymmetric digital subscriber line, the up-link bandwidth is normally smaller than the down-link bandwidth, which will lead to extremely low utilization of down-link bandwidth when current P2P video transmission is applied. To overcome this, a new fast P2P video transmission method applied in an asymmetrical speed channel environment is proposed in this paper. On the basis of the many-to-one concept, the proposed method uses a new multipeer aggregation technique to enhance the utilization of down-link bandwidth. In addition, an adaptive peer assignment algorithm is also introduced in order to minimize the overall transmission time. Experimental results show that by using our proposed method, the utilization of down-link bandwidth is significantly improved, and the overall transmission time is greatly reduced.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.5
• /
• pp.1-15
• /
• 1993

In DQDB networks, the bandwidth can be increased considerably be using the EN(Erasure Node) algorithms and DR(Destination Release) algorithms. However, the important issue in implementing them is using method of extra capacity fairly. To improve it, this paper proposes AEN(Adaptive Erasure Node) algorithm which erasure function is activated by network traffic load. Its functional architecture consists of SESM, RCSM, LMSM in addition to the basic DQDB state machines (DQSM, RQM). The SESM and RCSM state machines are placed in front of the DQSM and RQM state machines in order for the node to take advantage of the newly cleared slots. This paper also presents some simulation results showing the effect of AEN algorithm on access delay, throughput and segment erasing ratio in the single and multiple priority networks. The results show that the AEN algorithm offer the better performance characteristics than existing algorithms under overload conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.4
• /
• pp.1182-1199
• /
• 2023

Fractional repetition (FR) codes can achieve exact uncoded repair for multiple failed nodes, with lower computational complexity and bandwidth overhead, and effectively improve repair performance in distributed storage systems (DSS). The actual distributed storage system is dynamic, that is, the parameters such as node storage overhead and number of storage nodes will change randomly and dynamically. Considering that traditional FR codes cannot be flexibly applied to dynamic distributed storage systems, a new construction scheme of adaptive-and-resolvable FR codes based on hypergraph coloring is proposed in this paper. Specifically, the linear uniform regular hypergraph can be constructed based on the heuristic algorithm of hypergraph coloring proposed in this paper. Then edges and vertices in hypergraph correspond to nodes and coded packets of FR codes respectively, further, FR codes is constructed. According to hypergraph coloring, the FR codes can achieve rapid repair for multiple failed nodes. Further, FR codes based on hypergraph coloring can be generalized to heterogeneous distributed storage systems. Compared with Reed-Solomon (RS) codes, simple regenerating codes (SRC) and locally repairable codes (LRC), adaptive-and-resolvable FR codes have significant advantages over repair locality, repair bandwidth overhead, computational complexity and time overhead during repairing failed nodes.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.1222-1227
• /
• 2005

In this paper, an efficient scheme of the adaptive notch filter is presented for rejecting the narrow bandwidth interferences(NBI) in GPS receiver. Designed is the lattice IIR double notch filter for more efficient suppression of the NBI with less computational complexity. The algorithm is of recursive prediction error form and uses a special constrained model of IIR with a minimal number of parameters. This paper chooses seven different jamming scenarios including one without jamming for evaluating the proposed filter algorithm. The simulation results to the jamming scenarios show that the proposed algorithm adjusts the double notch filter effectively for the given JSR, and provides better SNR than the conventional algorithms. Finally, it is shown that the advantages of the proposed filter algorithm can range as high as JSR 79dB in time domain processing. Also, the ADNF(adaptive double notch filter) guarantees that more than SNR 10dB of GPS receiver can be always maintained. In conclusion, there is enough evidence to believe that the proposed algorithm will perform quite well for removing interference signals.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.22 no.7
• /
• pp.37-42
• /
• 2008

In this paper, a real-time multiview video coding system using fast disparity estimation is proposed. In the multiview encoder, adaptive disparity-motion estimation (DME) for an effective 3-dimensional (3D) processing are proposed. That is, by adaptively predicting the mutual correlation between stereo images in the key-frame using the proposed algorithm, the bandwidth of stereo input images can be compressed to the level of a conventional 2D image and a predicted image also can be effectively reconstructed using a reference image and adaptive disparity vectors. Also, in multiview decoder, intermediate view reconstruction (IVR) using adaptive disparity search algorithm (DSA) for real-time multiview video processing is proposed. The proposed IVR can reduce a processing time of disparity estimation by selecting adaptively disparity search range. Accordingly, the proposed multiview video coding system is able to increase the efficiency of the coding rate and improve the resolution.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.119-122
• /
• 1991

In this paper, a new adaptive IIR notch filter employing all pass filter is proposed. Proposed all pass filter is composed of all pole and all zero sections, each of which utilizes modulation lattice filter [11]. And, adaption algorithm for proposed notch filter is also derived. In addition, the error surface for proposed IIR adaptive notch filter is analyzed. Computer simulation results reveal that the proposed adaptation algorithm works well for low SNR(signal to noise ratio) single and multiple sinusoids. And it is shown that for estimation time varying frequency, the parameter which is related to notch bandwidth is important than any other parameters.

• Journal of KSNVE
• /
• v.2 no.2
• /
• pp.107-116
• /
• 1992

An adaptive signal processing technique is implemented for the active noise cancellation of the plane acoustic wave propagating in a duct. To avoid the instability caused by the acoustic feedback from the control speaker to the detect microphone, an off-line modeling of the acoustic feedback plant is done using the FIR filter. Auxiliary path required for the filtered-x LMS algorithm is modeled as well. Before going into the experiments, a simulation is carried out under the same conditions with experiments. The simulation shows that the longer the length of the adaptive filter is, the better the results are achieved. Experiments have been carried out at lower audio frequency range (50 - 400Hz), and the results are in good agreements with those of simulation study. As a results of this adaptive noise control, around 50dB is reduced for a pure tone noise, and for a bandlimited noise with the bandwidth of 316Hz, a maximum of 30dB noise reduction is attained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1733-1751
• /
• 2015

The IEEE 802.15.4 standard not only provides a maximum of seven guaranteed time slots (GTSs) for allocation within a superframe to support time-critical traffic, but also achieves ultralow complexity, cost, and power in low-rate and short-distance wireless personal area networks (WPANs). Real-time wireless body area sensor networks (WBASNs), as a special purpose WPAN, can perfectly use the IEEE 802. 15. 4 standard for its wireless connection. In this paper, we propose an adaptive GTS allocation scheme for real-time WBASN data transmissions with different priorities in consideration of low latency, fairness, and bandwidth utilization. The proposed GTS allocation scheme combines a weight-based priority assignment algorithm with an innovative starvation avoidance scheme. Simulation results show that the proposed method significantly outperforms the existing GTS implementation for the traditional IEEE 802.15.4 in terms of average delay, contention free period bandwidth utilization, and fairness.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.783-788
• /
• 2002

Adaptive Cyclic Packet Dropping algorithm (ACPD), and Non-adaptive Cyclic Packet Dropping algorithm (NCPD) are applying stricter drop precedence than that of RIO algorithm. Especially, the ACPD algorithm drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the ACPD algorithm makes up for the drawback of RIO algorithm and minimizes the wastes of the bandwidth being capable of predicting in the NCPD algorithm. And we executed a simulation and analyzed the throughput and packet drop rate based on Sending Priority changing dynamically depending on network traffic. In this algorithm, applying strict drop precedence policy, we get better performance on priority levels. The results show that the proposed algorithms may provide more efficient and stricter drop precedence policy as compared to RIO independent of traffic load. The ACPD algorithm can provide better performance on priority levels and keep stricter drop policy than RIO and the NCPD algorithm.