Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Chun-Wei Yu

dblp:170/4550 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless networking · 75% Internet of things and sensor networks · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking › medium access control
MAC protocol
0.212015
Optimal and Maximized Configurable Power Saving Protocols for Corona-Based Wireless Sensor Networks · IEEE Trans. Mob. Comput. 2015
Wireless networking
medium access control
0.212015
Optimal and Maximized Configurable Power Saving Protocols for Corona-Based Wireless Sensor Networks · IEEE Trans. Mob. Comput. 2015
Wireless networking › wireless network protocols
power saving protocols
0.212015
Optimal and Maximized Configurable Power Saving Protocols for Corona-Based Wireless Sensor Networks · IEEE Trans. Mob. Comput. 2015
Internet of things and sensor networks
wireless sensor network
0.212015
Optimal and Maximized Configurable Power Saving Protocols for Corona-Based Wireless Sensor Networks · IEEE Trans. Mob. Comput. 2015

Methods — techniques the papers use, named apart from their topics

simulation · 0.2generalized chinese remainder theorem · 0.2analytical modeling · 0.2
YearPublicationVenuePosition
2016 Novel Chroma Subsampling Strategy Based on Mathematical Optimization for Compressing Mosaic Videos With Arbitrary RGB Color Filter Arrays in H.264/AVC and HEVC
abstract
To save manufacturing cost, most color digital video cameras employ a single-sensor technology with a red-green- blue (RGB) color filter array (CFA) to capture real-world scenes. Due to only one primary color measured at each pixel location, the captured videos are usually referred to as the mosaic videos. For the purposes of economical storage and transmission, it is very important to achieve a good tradeoff between the quality and bitrate when compressing mosaic videos with different RGB-CFA structures. In this paper, based on mathematical optimization technique, a novel chroma subsampling strategy is presented for compressing mosaic videos with arbitrary RGB-CFA structures in H.264/AVC and High Efficiency Video Coding (HEVC). For each 2 × 2 YUV block to be subsampled with 4:2:0 format, the proposed strategy determines the proper sampled U and V components by minimizing, prior to compression, the quality distortion between the original colocated mosaic block and the mosaic block conversed from the current subsampled YUV block. Through the mathematical optimization formulated in the proposed strategy, the significance of the sampled U and V components for reconstructing R, G, and B pixels can be simultaneously taken into consideration. The experimental results demonstrate that the proposed chroma subsampling strategy has the best quality and bitrate tradeoff at a similar execution time requirement for compressing mosaic videos with arbitrary RGB-CFA structures in H.264/AVC and HEVC compared with the state-of-the-art ones by Chen et al. and Yang et al. as well as the three commonly used ones.
Chien-Hsiung Lin, Kuo-Liang Chung, Chun-Wei Yu
IEEE Trans. Circuits Syst. Video Technol.3
2015 Optimal and Maximized Configurable Power Saving Protocols for Corona-Based Wireless Sensor Networks
abstract
Wireless sensor networks (WSNs) are one of the most important ingredients in the Internet of Things. Thus it is vital to design a good power saving protocol, which operates at the medium access control (MAC) layer, for a WSN since sensors are generally battery-powered. On the other hand, organizing a WSN into coronas centered at the sink is a simple effective technique to achieve low-overhead routing where every sensor needs neither to broadcast beacons nor to maintain routing/neighbor tables. Hence in this paper, we propose an optimal and maximized configurable power saving protocol, named Green-MAC, for a corona-based WSN, which has the following attractive features. (i) By using the generalized Chinese remainder theorem, Green-MAC guarantees that any two sensors in the neighboring coronas can simultaneously wake up in bounded time regardless of their schedule offset as well as their respective cycle lengths. (ii) Given the cycle length, the ATF-ratio (i.e. the fraction of awake time frames in a cycle) of each sensor reaches the theoretical minimum. (iii) Under the minimum ATF-ratio constraints, the number of configurable ATF-ratios of each sensor reaches the theoretical maximum. (iv) An ATF-ratio configuration scheme is proposed for Green-MAC such that the power consumption of a WSN can be minimized while the worst event-to-sink delay requirement can be fulfilled with high probability. Both theoretical analysis and simulation results demonstrate that Green-MAC greatly outperforms existing power saving protocols for corona-based WSNs, including Q-MAC and Queen-MAC, in terms of ATF-ratio, configurability, network lifetime, delay violation ratio, and event-to-sink throughput.
Yu-Hsiang Lin, Zi-Tsan Chou, Chun-Wei Yu, Rong-Hong Jan
IEEE Trans. Mob. Comput.3