arXiv subjects

Fei Liu

Publications and source records attributed to Fei Liu.

At least 199 records · Page 11Linked to original sources

arXiv2023

ORRN: An ODE-based Recursive Registration Network for Deformable Respiratory Motion Estimation with Lung 4DCT Images

Deformable Image Registration (DIR) plays a significant role in quantifying deformation in medical data. Recent Deep Learning methods have shown promising accuracy and speedup for registering a pair of medical images. However, in 4D (3D + time) medical data, organ motion, such as respiratory motion and heart beating, can not be effectively modeled by pair-wise methods as they were optimized for image pairs but did not consider the organ motion patterns necessary when considering 4D data. This paper presents ORRN, an Ordinary Differential Equations (ODE)-based recursive image registration network. Our network learns to estimate time-varying voxel velocities for an ODE that models deformation in 4D image data. It adopts a recursive registration strategy to progressively estimate a deformation field through ODE integration of voxel velocities. We evaluate the proposed method on two publicly available lung 4DCT datasets, DIRLab and CREATIS, for two tasks: 1) registering all images to the extreme inhale image for 3D+t deformation tracking and 2) registering extreme exhale to inhale phase images. Our method outperforms other learning-based methods in both tasks, producing the smallest Target Registration Error of 1.24mm and 1.26mm, respectively. Additionally, it produces less than 0.001\% unrealistic image folding, and the computation speed is less than 1 second for each CT volume. ORRN demonstrates promising registration accuracy, deformation plausibility, and computation efficiency on group-wise and pair-wise registration tasks. It has significant implications in enabling fast and accurate respiratory motion estimation for treatment planning in radiation therapy or robot motion planning in thoracic needle insertion.

eess.IV↗

arXiv2023

State estimation for one-dimensional agro-hydrological processes with model mismatch

The importance of accurate soil moisture data for the development of modern closed-loop irrigation systems cannot be overstated. Due to the diversity of soil, it is difficult to obtain an accurate model for agro-hydrological system. In this study, soil moisture estimation in 1D agro-hydrological systems with model mismatch is the focus. To address the problem of model mismatch, a nonlinear state-space model derived from the Richards equation is utilized, along with additive unknown inputs. The determination of the number of sensors required is achieved through sensitivity analysis and the orthogonalization projection method. To estimate states and unknown inputs in real-time, a recursive expectation maximization (EM) algorithm derived from the conventional EM algorithm is employed. During the E-step, the extended Kalman filter (EKF) is used to compute states and covariance in the recursive Q-function, while in the M-step, unknown inputs are updated by locally maximizing the recursive Q-function. The estimation performance is evaluated using comprehensive simulations. Through this method, accurate soil moisture estimation can be obtained, even in the presence of model mismatch.

stat.AP↗

arXiv2023

Matrix Factorization Based Blind Bayesian Receiver for Grant-Free Random Access in mmWave MIMO mMTC

Grant-free random access is promising for massive connectivity with sporadic transmissions in massive machine type communications (mMTC), where the hand-shaking between the access point (AP) and users is skipped, leading to high access efficiency. In grant-free random access, the AP needs to identify the active users and perform channel estimation and signal detection. Conventionally, pilot signals are required for the AP to achieve user activity detection and channel estimation before active user signal detection, which may still result in substantial overhead and latency. In this paper, to further reduce the overhead and latency, we explore the problem of grant-free random access without the use of pilot signals in a millimeter wave (mmWave) multiple input and multiple output (MIMO) system, where the AP performs blind joint user activity detection, channel estimation and signal detection (UACESD). We show that the blind joint UACESD can be formulated as a constrained composite matrix factorization problem, which can be solved by exploiting the structures of the channel matrix and signal matrix. Leveraging our recently developed unitary approximate message passing based matrix factorization (UAMP-MF) algorithm, we design a message passing based Bayesian algorithm to solve the blind joint UACESD problem. Extensive simulation results demonstrate the effectiveness of the blind grant-free random access scheme.

cs.IT↗

arXiv2023

Series-Parallel Mechanical Circuit Synthesis of a Positive-Real Third-Order Admittance Using at Most Six Passive Elements for Inerter-Based Control

This paper investigates the circuit synthesis problem for a certain positive-real bicubic (third-order) admittance with a simple pole at the origin (s = 0) to be realizable as a one-port series-parallel damper-spring-inerter circuit consisting of at most six elements, where the results can be directly applied to the design and physical realization of inerter-based control systems. Necessary and sufficient conditions for such a specific bicubic admittance to be realizable by a one-port passive series-parallel mechanical circuit containing at most six elements are derived, and a group of mechanical circuit configurations covering the whole set of realizability conditions are presented together with element value expressions. The conditions and element value expressions are related to the admittance coefficients and the roots of certain algebraic equations. The circuit synthesis results of this paper are illustrated by several numerical examples including the control system design of a train suspension system. Any realization circuit in this paper contains much fewer passive elements than the ten-element realization circuit by the well-known Bott-Duffin circuit synthesis approach. The investigations of this paper can contribute to the theory of circuit synthesis and many other related fields.

math.OC↗

arXiv2023

Heuristics for Vehicle Routing Problem: A Survey and Recent Advances

Vehicle routing is a well-known optimization research topic with significant practical importance. Among different approaches to solving vehicle routing, heuristics can produce a satisfactory solution at a reasonable computational cost. Consequently, much effort has been made in the past decades to develop vehicle routing heuristics. In this article, we systematically survey the existing vehicle routing heuristics, particularly on works carried out in recent years. A classification of vehicle routing heuristics is presented, followed by a review of their methodologies, recent developments, and applications. Moreover, we present a general framework of state-of-the-art methods and provide insights into their success. Finally, three emerging research topics with notable works and future directions are discussed.

cs.AI↗

arXiv2023

Suture Thread Spline Reconstruction from Endoscopic Images for Robotic Surgery with Reliability-driven Keypoint Detection

Automating the process of manipulating and delivering sutures during robotic surgery is a prominent problem at the frontier of surgical robotics, as automating this task can significantly reduce surgeons' fatigue during tele-operated surgery and allow them to spend more time addressing higher-level clinical decision making. Accomplishing autonomous suturing and suture manipulation in the real world requires accurate suture thread localization and reconstruction, the process of creating a 3D shape representation of suture thread from 2D stereo camera surgical image pairs. This is a very challenging problem due to how limited pixel information is available for the threads, as well as their sensitivity to lighting and specular reflection. We present a suture thread reconstruction work that uses reliable keypoints and a Minimum Variation Spline (MVS) smoothing optimization to construct a 3D centerline from a segmented surgical image pair. This method is comparable to previous suture thread reconstruction works, with the possible benefit of increased accuracy of grasping point estimation. Our code and datasets will be available at: https://github.com/ucsdarclab/thread-reconstruction.

cs.RO↗

arXiv2023

Image-based Pose Estimation and Shape Reconstruction for Robot Manipulators and Soft, Continuum Robots via Differentiable Rendering

State estimation from measured data is crucial for robotic applications as autonomous systems rely on sensors to capture the motion and localize in the 3D world. Among sensors that are designed for measuring a robot's pose, or for soft robots, their shape, vision sensors are favorable because they are information-rich, easy to set up, and cost-effective. With recent advancements in computer vision, deep learning-based methods no longer require markers for identifying feature points on the robot. However, learning-based methods are data-hungry and hence not suitable for soft and prototyping robots, as building such bench-marking datasets is usually infeasible. In this work, we achieve image-based robot pose estimation and shape reconstruction from camera images. Our method requires no precise robot meshes, but rather utilizes a differentiable renderer and primitive shapes. It hence can be applied to robots for which CAD models might not be available or are crude. Our parameter estimation pipeline is fully differentiable. The robot shape and pose are estimated iteratively by back-propagating the image loss to update the parameters. We demonstrate that our method of using geometrical shape primitives can achieve high accuracy in shape reconstruction for a soft continuum robot and pose estimation for a robot manipulator.

cs.RO↗

arXiv2023

The study of eleven contact binaries with mass ratios less than 0.1

Multi-band photometric observations of eleven totally eclipsing contact binaries were carried out. Applying the Wilson-Devinney program, photometric solutions were obtained. There are two W-subtype systems, which are CRTS J133031.1+161202 and CRTS J154254.0+324652, and the rest systems are A-subtype systems. CRTS J154254.0+324652 has the highest fill-out factor with 94.3$\%$, and the lowest object is CRTS J155009.2+493639 with only 18.9$\%$. The mass ratios of the eleven systems are all less than 0.1, which means that they are extremely low mass ratio binary systems. We performed period variation investigation and found that the orbital periods of three systems decrease slowly, which may be caused by the angular momentum loss, and of six systems increase slowly, which indicates that the materials may transfer from the secondary component to the primary component. LAMOST low$-$resolution spectra of four objects were analyzed, and using the spectral subtraction technique, H$α$ emission line was detected, which means that the four objects exhibit chromospheric activity. In order to understand their evolutionary status, the mass-luminosity and mass-radius diagrams were plotted. The two diagrams indicate that the primary component is in the main sequence evolution stage, and the secondary component is above TAMS, indicating that they are over-luminous. To determine whether the eleven systems are in stable state, the ratio of spin angular momentum to orbital angular momentum ($J_{s}/J_{o}$) and the instability parameters were calculated, and we argued that CRTS J234634.7+222824 is on the verge of a merger.

astro-ph.SR↗

arXiv2022

Vision-Based Environmental Perception for Autonomous Driving

Visual perception plays an important role in autonomous driving. One of the primary tasks is object detection and identification. Since the vision sensor is rich in color and texture information, it can quickly and accurately identify various road information. The commonly used technique is based on extracting and calculating various features of the image. The recent development of deep learning-based method has better reliability and processing speed and has a greater advantage in recognizing complex elements. For depth estimation, vision sensor is also used for ranging due to their small size and low cost. Monocular camera uses image data from a single viewpoint as input to estimate object depth. In contrast, stereo vision is based on parallax and matching feature points of different views, and the application of deep learning also further improves the accuracy. In addition, Simultaneous Location and Mapping (SLAM) can establish a model of the road environment, thus helping the vehicle perceive the surrounding environment and complete the tasks. In this paper, we introduce and compare various methods of object detection and identification, then explain the development of depth estimation and compare various methods based on monocular, stereo, and RDBG sensors, next review and compare various methods of SLAM, and finally summarize the current problems and present the future development trends of vision technologies.

cs.CV↗

arXiv2022

Vision-based localization methods under GPS-denied conditions

This paper reviews vision-based localization methods in GPS-denied environments and classifies the mainstream methods into Relative Vision Localization (RVL) and Absolute Vision Localization (AVL). For RVL, we discuss the broad application of optical flow in feature extraction-based Visual Odometry (VO) solutions and introduce advanced optical flow estimation methods. For AVL, we review recent advances in Visual Simultaneous Localization and Mapping (VSLAM) techniques, from optimization-based methods to Extended Kalman Filter (EKF) based methods. We also introduce the application of offline map registration and lane vision detection schemes to achieve Absolute Visual Localization. This paper compares the performance and applications of mainstream methods for visual localization and provides suggestions for future studies.

cs.CV↗

arXiv2022

Semi-Markov processes in open quantum systems: Connections and applications in counting statistics

Using the age-structure formalism, we definitely establish connections between semi-Markov processes and the dynamics of open quantum systems that satisfy the Markov quantum master equations. A generalized Feynman-Kac formula of the semi-Markov processes is also proposed. In addition to inheriting all statistical properties possessed by the piecewise deterministic processes of wavefunctions, the semi-Markov processes show their unique advantages in quantum counting statistics. Compared with the conventional method of the tilted quantum master equation, they can be applied to more general counting quantities. In particular, the terms involved in the method have precise probability meanings. We use a driven two-level quantum system to exemplify these results.

cond-mat.stat-mech↗

arXiv2022

Toward Unifying Text Segmentation and Long Document Summarization

Text segmentation is important for signaling a document's structure. Without segmenting a long document into topically coherent sections, it is difficult for readers to comprehend the text, let alone find important information. The problem is only exacerbated by a lack of segmentation in transcripts of audio/video recordings. In this paper, we explore the role that section segmentation plays in extractive summarization of written and spoken documents. Our approach learns robust sentence representations by performing summarization and segmentation simultaneously, which is further enhanced by an optimization-based regularizer to promote selection of diverse summary sentences. We conduct experiments on multiple datasets ranging from scientific articles to spoken transcripts to evaluate the model's performance. Our findings suggest that the model can not only achieve state-of-the-art performance on publicly available benchmarks, but demonstrate better cross-genre transferability when equipped with text segmentation. We perform a series of analyses to quantify the impact of section segmentation on summarizing written and spoken documents of substantial length and complexity.

cs.CL↗

arXiv2022

DAGKT: Difficulty and Attempts Boosted Graph-based Knowledge Tracing

In the field of intelligent education, knowledge tracing (KT) has attracted increasing attention, which estimates and traces students' mastery of knowledge concepts to provide high-quality education. In KT, there are natural graph structures among questions and knowledge concepts so some studies explored the application of graph neural networks (GNNs) to improve the performance of the KT models which have not used graph structure. However, most of them ignored both the questions' difficulties and students' attempts at questions. Actually, questions with the same knowledge concepts have different difficulties, and students' different attempts also represent different knowledge mastery. In this paper, we propose a difficulty and attempts boosted graph-based KT (DAGKT), using rich information from students' records. Moreover, a novel method is designed to establish the question similarity relationship inspired by the F1 score. Extensive experiments on three real-world datasets demonstrate the effectiveness of the proposed DAGKT.

cs.CY↗

arXiv2022

Photometric and spectroscopic studies of the long period low mass ratio deep contact binary KN Per

The photometric analysis and spectroscopic study of the long period low mass ratio deep contact binary KN Per were executed. The light curves of BV(RI)$_c$-band were from the Ningbo Bureau of Education and Xinjiang Observatory Telescope (NEXT) at the Xingming Observatory. Through the analysis of Wilson-Devinney (W-D) program, KN Per was found as an A-type low mass ratio deep contact binary (q=0.236, f=53.4\%). A cool spot applied on the primary component was introduced to explain the unequal maxima of the light curve. Based on the O-C analysis, we found that the rate of the increasing orbital period is $\dot{P}$ = 5.12 $\pm$ (0.30) $\times$ 10$^{-7}$ d/yr, meaning the mass transfer from the secondary component to the primary one. By analyzing the spectroscopic data, we detected chromospheric activity emission line indicators, which is corresponding to the light-curve analysis. 71 long period (P $>$ 0.5 days) contact binaries including our target were collected. The evolutionary states of all collected stars were investigated by the illustrations of mass-radius, mass-luminosity, and log M$_{T}$ - log J$_{o}$. The relations of some physical parameters were also determined. With the instability parameters of KN Per, we determined that it is a stable contact binary system at present.

astro-ph.SR↗

arXiv2022

APGKT: Exploiting Associative Path on Skills Graph for Knowledge Tracing

Knowledge tracing (KT) is a fundamental task in educational data mining that mainly focuses on students' dynamic cognitive states of skills. The question-answering process of students can be regarded as a thinking process that considers the following two problems. One problem is which skills are needed to answer the question, and the other is how to use these skills in order. If a student wants to answer a question correctly, the student should not only master the set of skills involved in the question but also think and obtain the associative path on the skills graph. The nodes in the associative path refer to the skills needed and the path shows the order of using them. The associative path is referred to as the skill mode. Thus, obtaining the skill modes is the key to answering questions successfully. However, most existing KT models only focus on a set of skills, without considering the skill modes. We propose a KT model, called APGKT, that exploits skill modes. Specifically, we extract the subgraph topology of the skills involved in the question and combine the difficulty level of the skills to obtain the skill modes via encoding; then, through multi-layer recurrent neural networks, we obtain a student's higher-order cognitive states of skills, which is used to predict the student's future answering performance. Experiments on five benchmark datasets validate the effectiveness of the proposed model.

cs.CY↗

arXiv2022

Reducing Model Jitter: Stable Re-training of Semantic Parsers in Production Environments

Retraining modern deep learning systems can lead to variations in model performance even when trained using the same data and hyper-parameters by simply using different random seeds. We call this phenomenon model jitter. This issue is often exacerbated in production settings, where models are retrained on noisy data. In this work we tackle the problem of stable retraining with a focus on conversational semantic parsers. We first quantify the model jitter problem by introducing the model agreement metric and showing the variation with dataset noise and model sizes. We then demonstrate the effectiveness of various jitter reduction techniques such as ensembling and distillation. Lastly, we discuss practical trade-offs between such techniques and show that co-distillation provides a sweet spot in terms of jitter reduction for semantic parsing systems with only a modest increase in resource usage.

cs.CL↗

arXiv2022

Point Spread Function Estimation of Defocus

This Point spread function (PSF) plays a crucial role in many computational imaging applications, such as shape from focus/defocus, depth estimation, and fluorescence microscopy. However, the mathematical model of the defocus process is still unclear. In this work, we develop an alternative method to estimate the precise mathematical model of the point spread function to describe the defocus process. We first derive the mathematical algorithm for the PSF which is used to generate the simulated focused images for different focus depth. Then we compute the loss function of the similarity between the simulated focused images and real focused images where we design a novel and efficient metric based on the defocus histogram to evaluate the difference between the focused images. After we solve the minimum value of the loss function, it means we find the optimal parameters for the PSF. We also construct a hardware system consisting of a focusing system and a structured light system to acquire the all-in-focus image, the focused image with corresponding focus depth, and the depth map in the same view. The three types of images, as a dataset, are used to obtain the precise PSF. Our experiments on standard planes and actual objects show that the proposed algorithm can accurately describe the defocus process. The accuracy of our algorithm is further proved by evaluating the difference among the actual focused images, the focused image generated by our algorithm, the focused image generated by others. The results show that the loss of our algorithm is 40% less than others on average.

cs.CV↗

arXiv2022

Spin-selective tunneling from nanowires of the candidate topological Kondo insulator SmB6

Incorporating relativistic physics into quantum tunneling can lead to exotic behavior such as perfect transmission via Klein tunneling. Here, we probe the tunneling properties of spin-momentum locked relativistic fermions by designing and implementing a tunneling geometry that utilizes nanowires of the topological Kondo insulator candidate, SmB6. The nanowires are attached to the end of scanning tunneling microscope tips, and used to image the bicollinear stripe spin-order in the antiferromagnet Fe1.03Te with a Neel temperature of ~50 K. The antiferromagnetic stripes become invisible above 10 K concomitant with the suppression of the topological surface states. We further demonstrate that the direction of spin-polarization is tied to the tunneling direction. Our technique establishes SmB6 nanowires as ideal conduits for spin-polarized currents.

cond-mat.str-el↗