scholarly journals 3D modified wavelet block tree coding for hyperspectral images

2019 ◽  
Vol 15 (2) ◽  
pp. 1001 ◽  
Author(s):  
Shrish Bajpai ◽  
Harsh Vikram Singh ◽  
Naimur Rahman Kidwai
Keyword(s):  
Hyperspectral Image ◽  
State Of The Art ◽  
Compression Scheme ◽  
Coding Efficiency ◽  
Dyadic Wavelet ◽  
Dyadic Wavelet Transform ◽  
The Difference ◽  
Hyperspectral Image Compression ◽  
Block Tree ◽  
Image Cube

<p><span>A novel wavelet-based efficient hyperspectral image compression scheme for low memory sensors has been proposed. The proposed scheme uses the 3D dyadic wavelet transform to exploit intersubband and intrasubband correlation among the wavelet coefficients. By doing the reconstruction of the transform image cube, taking the difference between the frames, it increases the coding efficiency, reduces the memory requirement and complexity of the hyperspectral compression schemes in comparison with other state-of-the-art compression schemes.</span></p>

Lossy hyperspectral image compression with state-of-the-art video encoder

2011 ◽  
Author(s):  
Lucana Santos ◽  
Sebastian López ◽  
Gustavo M. Callicó ◽  
Jose F. López ◽  
Roberto Sarmiento
Keyword(s):  
Image Compression ◽  
Hyperspectral Image ◽  
State Of The Art ◽  
Video Encoder ◽  
Hyperspectral Image Compression

Estimation of Heart Rate Variability Fluctuations by Wavelet Transform

2011 ◽  
Vol 57 (3) ◽  
pp. 395-400 ◽  
Author(s):  
Anton Popov ◽  
Yevgeniy Karplyuk ◽  
Volodymyr Fesechko
Keyword(s):  
Heart Rate ◽  
Heart Rate Variability ◽  
Wavelet Transform ◽  
Experimental Results ◽  
Dyadic Wavelet ◽  
Heart Rate Fluctuations ◽  
Slow Heart Rate ◽  
Dyadic Wavelet Transform

Estimation of Heart Rate Variability Fluctuations by Wavelet TransformTechnique for separate estimation of fast and slow fluctuations in the heart rate signal is developed. The orthogonal dyadic wavelet transform is used to separate the slow heart rate changes in approximation part of decomposition and fast changes in detail parts. Experimental results using the recordings from persons practicing Chi meditation demonstrated the applicability of estimation heart rate fluctuations with the proposed approach.

scholarly journals Smoke recognition network based on dynamic characteristics

2020 ◽  
Vol 17 (3) ◽  
pp. 172988142092566
Author(s):  
Dahan Wang ◽  
Sheng Luo ◽  
Li Zhao ◽  
Xiaoming Pan ◽  
Muchou Wang ◽  
...  
Keyword(s):  
Dynamic Characteristics ◽  
State Of The Art ◽  
The State ◽  
Detection Accuracy ◽  
Static Characteristics ◽  
Good Tool ◽  
Early Signal ◽  
Fuzzy Objects ◽  
The Difference ◽  
Smoke Recognition

Fire is a fierce disaster, and smoke is the early signal of fire. Since such features as chrominance, texture, and shape of smoke are very special, a lot of methods based on these features have been developed. But these static characteristics vary widely, so there are some exceptions leading to low detection accuracy. On the other side, the motion of smoke is much more discriminating than the aforementioned features, so a time-domain neural network is proposed to extract its dynamic characteristics. This smoke recognition network has these advantages:(1) extract the spatiotemporal with the 3D filters which work on dynamic and static characteristics synchronously; (2) high accuracy, 87.31% samples being classified rightly, which is the state of the art even in a chaotic environments, and the fuzzy objects for other methods, such as haze, fog, and climbing cars, are distinguished distinctly; (3) high sensitiveness, smoke being detected averagely at the 23rd frame, which is also the state of the art, which is meaningful to alarm early fire as soon as possible; and (4) it is not been based on any hypothesis, which guarantee the method compatible. Finally, a new metric, the difference between the first frame in which smoke is detected and the first frame in which smoke happens, is proposed to compare the algorithms sensitivity in videos. The experiments confirm that the dynamic characteristics are more discriminating than the aforementioned static characteristics, and smoke recognition network is a good tool to extract compound feature.

Critical Technical Issues in High Voltage SiC Power Devices

2008 ◽  
Vol 600-603 ◽  
pp. 895-900 ◽  
Author(s):  
Anant K. Agarwal ◽  
Albert A. Burk ◽  
Robert Callanan ◽  
Craig Capell ◽  
Mrinal K. Das ◽  
...  
Keyword(s):  
Threshold Voltage ◽  
Carrier Mobility ◽  
Negative Charge ◽  
State Of The Art ◽  
Power Devices ◽  
Power Mosfets ◽  
Large Numbers ◽  
Technical Issues ◽  
The Difference ◽  
Difficult Issue

In this paper, we review the state of the art of SiC switches and the technical issues which remain. Specifically, we will review the progress and remaining challenges associated with SiC power MOSFETs and BJTs. The most difficult issue when fabricating MOSFETs has been an excessive variation in threshold voltage from batch to batch. This difficulty arises due to the fact that the threshold voltage is determined by the difference between two large numbers, namely, a large fixed oxide charge and a large negative charge in the interface traps. There may also be some significant charge captured in the bulk traps in SiC and SiO2. The effect of recombination-induced stacking faults (SFs) on majority carrier mobility has been confirmed with 10 kV Merged PN Schottky (MPS) diodes and MOSFETs. The same SFs have been found to be responsible for degradation of BJTs.

scholarly journals A social trust and preference segmentation-based matrix factorization recommendation algorithm

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Wei Peng ◽  
Baogui Xin
Keyword(s):  
Matrix Factorization ◽  
Social Trust ◽  
State Of The Art ◽  
User Preference ◽  
Social Recommendation ◽  
Recommendation Algorithm ◽  
Commercial Activities ◽  
Trust Relationships ◽  
Recommendation Algorithms ◽  
The Difference

AbstractA recommendation can inspire potential demands of users and make e-commerce platforms more intelligent and is essential for e-commerce enterprises’ sustainable development. The traditional social recommendation algorithm ignores the following fact: the preferences of users with trust relationships are not necessarily similar, and the consideration of user preference similarity should be limited to specific areas. To solve these problems mentioned above, we propose a social trust and preference segmentation-based matrix factorization (SPMF) recommendation algorithm. Experimental results based on the Ciao and Epinions datasets show that the accuracy of the SPMF algorithm is significantly superior to that of some state-of-the-art recommendation algorithms. The SPMF algorithm is a better recommendation algorithm based on distinguishing the difference of trust relations and preference domain, which can support commercial activities such as product marketing.

scholarly journals RBP: a website fingerprinting obfuscation method against intelligent fingerprinting attacks

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Tao Luo ◽  
LiangMin Wang ◽  
ShangNan Yin ◽  
Hao Shentu ◽  
Hui Zhao
Keyword(s):  
Data Security ◽  
Arrival Time ◽  
State Of The Art ◽  
Web Security ◽  
Security And Privacy ◽  
Low Delay ◽  
Defense Technology ◽  
The Difference ◽  
Bandwidth Overhead ◽  
Traffic Analysis Attack

AbstractEdge computing has developed rapidly in recent years due to its advantages of low bandwidth overhead and low delay, but it also brings challenges in data security and privacy. Website fingerprinting (WF) is a passive traffic analysis attack that threatens website privacy which poses a great threat to user’s privacy and web security. It collects network packets generated while a user accesses website, and then uses a series of techniques to discover patterns of network packets to infer the type of website user accesses. Many anonymous networks such as Tor can meet the need of hide identity from users in network activities, but they are also threatened by WF attacks. In this paper, we propose a website fingerprinting obfuscation method against intelligent fingerprinting attacks, called Random Bidirectional Padding (RBP). It is a novel website fingerprinting defense technology based on time sampling and random bidirectional packets padding, which can covert the real packets distribution to destroy the Inter-Arrival Time (IAT) features in the traffic sequence and increase the difference between the datasets with random bidirectional virtual packets padding. We evaluate the defense against state-of-the-art website fingerprinting attacks in real scenarios, and show its effectiveness.

Sign in / Sign up

Export Citation Format

Share Document