Jianhua Yang

Dr. Jianhua Yang

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 February 2013 in IEEE Transactions on Biomedical Engineering
Verified
Journal Article
Closed access
PSPo-Chyi Su
Po-Chyi Su
Jianhua YangJianhua Yang
Jianhua Yang
KLKongkuo Lu
Kongkuo Lu
NYNam Chol Yu
Nam Chol Yu
Kelvin WongKelvin Wong
Kelvin Wong
ZXZhong Xue
Zhong Xue
CT-fluoroscopy (CTF) is an efficient imaging technique for guiding percutaneous lung intervention such as biopsy and ablation. In CTF-guided procedures, four to ten axial images are captured in a very short time period during breath holding to provide near real-time feedback of patients' anatomy so that physicians can adjust the needle as it is advanced toward a target lesion. Although popularly used in clinics, this procedure requires frequent scans to guide the needle, which may cause increased procedure time, complication rates, and radiation exposure to both clinicians and patients. In addition, CTF only generates a limited number of 2-D axial images and does not provide sufficient 3-D anatomical information. Therefore, how to provide volumetric anatomical information using CTF while reducing intraoperative scan is an important and challenging problem. In this paper, we propose a fast CT-CTF deformable registration algorithm that warps the inhale preprocedural CT onto the intraprocedural CTF for guidance in 3-D. In the algorithm, the deformation in the transverse plane is modeled using 2-D B-Spline, and the deformation along z-direction is regularized by smoothness constraint. A respiratory motion compensation framework is also incorporated for accurate registration. A parallel implementation strategy is adopted to accomplish the registration in several seconds. With electromagnetic tracking, the needle position can be superimposed onto the deformed inhale CT image, thereby providing 3-D image guidance during breath holding. Experiments were conducted using both simulated CTF images with known deformation and real CTF images captured during lung cancer biopsy studies. The experiments demonstrated satisfactory registration results of our proposed fast CT-CTF registration algorithm.

1 January 2021 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
Lixin WangLixin Wang
Lixin Wang
Jianhua YangJianhua Yang
Jianhua Yang
XXXiaohua Xu
Xiaohua Xu
PWPeng‐Jun Wan
Peng‐Jun Wan
Intruders on the Internet usually launch network attacks through compromised hosts, called stepping stones, in order to reduce the chance of being detected. With stepping‐stone intrusions, an attacker uses tools such as SSH to log in several compromised hosts remotely and create an interactive connection chain and then sends attacking packets to a target system. An effective method to detect such an intrusion is to estimate the length of a connection chain. In this paper, we develop an efficient algorithm to detect stepping‐stone intrusion by mining network traffic using the k‐means clustering. Existing approaches for connection‐chain‐based stepping‐stone intrusion detection either are not effective or require a large number of TCP packets to be captured and processed and, thus, are not efficient. Our proposed detection algorithm can accurately determine the length of a connection chain without requiring a large number of TCP packets being captured and processed, so it is more efficient. Our proposed detection algorithm is also easier to implement than all existing approaches for stepping‐stone intrusion detection. The effectiveness, correctness, and efficiency of our proposed detection algorithm are verified through well‐designed network experiments.

1 October 2018 in Internet of Things
Verified
Journal Article
Closed access
Jianhua YangJianhua Yang
Jianhua Yang
Lixin WangLixin Wang
Lixin Wang
ALAndrew Lesh
Andrew Lesh
BLBrian Lockerbie
Brian Lockerbie

10 November 2021 in Sensors
Verified
Journal Article
Open access
PDF file
Jianhua YangJianhua Yang
Jianhua Yang
Lixin WangLixin Wang
Lixin Wang
A long interactive TCP connection chain has been widely used by attackers to launch their attacks and thus avoid detection. The longer a connection chain, the higher the probability the chain is exploited by attackers. Round-trip Time (RTT) can represent the length of a connection chain. In order to obtain the RTTs from the sniffed Send and Echo packets in a connection chain, matching the Sends and Echoes is required. In this paper, we first model a network traffic as the collection of RTTs and present the rationale of using the RTTs of a connection chain to represent the length of the chain. Second, we propose applying MMD data mining algorithm to match TCP Send and Echo packets collected from a connection. We found that the MMD data mining packet-matching algorithm outperforms all the existing packet-matching algorithms in terms of packet-matching rate including sequence number-based algorithm, Yang’s approach, Step-function, Packet-matching conservative algorithm and packet-matching greedy algorithm. The experimental results from our local area networks showed that the packet-matching accuracy of the MMD algorithm is 100%. The average packet-matching rate of the MMD algorithm obtained from the experiments conducted under the Internet context can reach around 94%. The MMD data mining packet-matching algorithm can fix the issue of low packet-matching rate faced by all the existing packet-matching algorithms including the state-of-the-art algorithm. It is applicable to network-based stepping-stone intrusion detection.


12 September 2023 in Electronics
Verified
Journal Article
Open access
PDF file
Lixin WangLixin Wang
Lixin Wang
Jianhua YangJianhua Yang
Jianhua Yang
JKJae Kim
Jae Kim
PWPeng-Jun Wan
Peng-Jun Wan
Today’s intruders usually send attacking commands to a target system through several stepping-stone hosts, for the purpose of decreasing the probability of being caught. Using stepping-stone intrusion (SSI), the intruder’s identity is very difficult to discover as it is concealed by a long interactive connection chain of hosts. An effective approach for SSI detection (SSID) is to determine how many connections are contained in a connection chain. This type of method is called network-based SSID. Most existing network-based SSID only worked for network traffic without intruders’ session manipulation. These known SSID algorithms are either weak to resist intruders’ chaff-perturbation manipulation or have very limited capability in resisting attacker’s session manipulation. This paper develops a novel network-based SSID algorithm resistant to intruders’ chaff-perturbation by using packet crossover. The SSID approach proposed in this paper is simple and easy to implement as the number of packet crossovers can be easily computed. Our proposed algorithm is verified by rigorous technical proofs as well as well-designed network experiments. Our experimental results show that the proposed SSID algorithm works effectively and perfectly in resisting intruders’ chaff-perturbation up to a chaff rate of 50%.