Mi Lu

Mi Lu
Texas A&M University | TAMU · Department of Electrical and Computer Engineering

About

134
Publications
7,189
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
1,134
Citations
Citations since 2017
19 Research Items
292 Citations
20172018201920202021202220230102030405060
20172018201920202021202220230102030405060
20172018201920202021202220230102030405060
20172018201920202021202220230102030405060

Publications

Publications (134)
Preprint
Full-text available
Depth prediction plays a key role in understanding a 3D scene. Several techniques have been developed throughout the years, among which Convolutional Neural Network has recently achieved state-of-the-art performance on estimating depth from a single image. However, traditional CNNs suffer from the lower resolution and information loss caused by the...
Preprint
Full-text available
Haze removal is an extremely challenging task, and object detection in the hazy environment has recently gained much attention due to the popularity of autonomous driving and traffic surveillance. In this work, the authors propose a multiple linear regression haze removal model based on a widely adopted dehazing algorithm named Dark Channel Prior....
Article
Recurrent neural networks (RNNs) have been proven to be efficient in processing sequential data. However, the traditional RNNs have suffered from the gradient diminishing problem until the advent of Long Short-Term Memory (LSTM). However, LSTM is weak in capturing long-time dependency in sequential data due to the inadequacy of memory capacity in L...
Preprint
Full-text available
Dark Channel Prior (DCP) is a widely recognized traditional dehazing algorithm. However, it may fail in bright region and the brightness of the restored image is darker than hazy image. In this paper, we propose an effective method to optimize DCP. We build a multiple linear regression haze-removal model based on DCP atmospheric scattering model an...
Article
Full-text available
Intuitionistic fuzzy preference relations can take membership degrees, non-membership degrees, and hesitancy degrees into account during decision making. It has good practicability and flexibility in dealing with fuzzy and uncertain information. As for analytic network process, it is performed by thinking over the interaction and feedback relations...
Preprint
Full-text available
CAPTCHA(Completely Automated Public Turing test to Tell Computers and Humans Apart) can be used to protect data from auto bots. Countless kinds of CAPTCHAs are thus designed, while we most frequently utilize text-based scheme because of most convenience and user-friendly way \cite{bursztein2011text}. Currently, various types of CAPTCHAs need corres...
Article
Full-text available
Unlike previous unknown nouns tagging task (Curran, 2005) (Ciaramita and Johnson, 2003), this is the first attempt to focus on out-of- vocabulary(OOV) lexical evaluation tasks that does not require any prior knowledge. The OOV words are words that only appear in test samples. The goal of tasks is to pro- vide solutions for OOV lexical classificatio...
Article
Full-text available
Short text is considerably different from traditional long text documents due to its shortness and conciseness, which somehow hinders the applications of conventional machine learning and data mining algorithms in short text classification. According to traditional artificial intelligence methods, we divide short text classification into three step...
Article
Full-text available
In this paper we introduce the algorithm and the fixed point hardware to calculate the normalized singular value decomposition of a non-symmetric matrices using Givens fast (approximate) rotations. This algorithm only uses the basic combinational logic modules such as adders, multiplexers, encoders, Barrel shifters (B-shifters), and comparators and...
Article
Research of switching operation transient electromagnetic field in substations is fundamental to the protection of mine monitoring systems against electromagnetic interference. Three models, which are the equivalent circuit of switching on/off inductive load, transient radiation of short dipole, and transmission line of long cable, are built for nu...
Article
Full-text available
Several applications have been proposed for mobile wireless sensor networks. Some of these applications require the transfer of a large amount of data in a short period of time. This is challenging, since mobility can lead to a deterioration in the quality of an established link. Frequent link disconnection may in turn require a mobile node to repe...
Conference Paper
Full-text available
The challenges in satellite communication (SatCom) include but not limited to the customary complications of telecommunication such as channel condition, signal to noise ratio (SNR), etc. SatCom system is also prone to transient and permanent radiations hazards. Hence, in spite of the harsh environmental factors (weather phenomena, solar events, et...
Data
Full-text available
Manufacturing and operation of wireless systems require a practical solution for achieving low-power and high-performance when using advance communication apparatus such as that using multiple-input and multiple-output (MIMO). Often algorithm solutions achieve very high performance but over only in a narrow range of operating parameters. This paper...
Article
Full-text available
Manufacturing and operation of wireless systems require a practical solution for achieving low-power and high-performance when using advance communication apparatus such as that using multiple-input and multiple-output (MIMO). Often algorithm solutions achieve very high performance but over only in a narrow range of operating parameters. This paper...
Article
We introduce a new across-peer rate allocation algorithm with successive refinement to improve the video transmission performance in P2P networks, based on the combination of multiple description coding and network coding. Successive refinement is implemented through layered multiple description codes. The algorithm is developed to maximize the exp...
Conference Paper
In optical systems, the energies are very low if the photo source is divided through polarization beam splitters. Most of the energies are submerged in the noise and the useful signal is even weaker than the noise. Therefore we must detect the weak useful signal from the strong noise in order to better understand the radiant features of weak signal...
Article
To meet the changes of internal and external environment, Enterprise Resources Planning (ERP) system needs to have a good flexibility. Flexibility is an indispensable request and is also a way that must be taken during the establishment process of ERP. Flexibility measurement is an important item for the implementation of ERP flexibility. According...
Article
Full-text available
The weak signal, which is usually submerged in strong noise, is very difficult to detecte for its amplitude and frequency. The dynamic properties of VanderPol-Duffing are studied in this paper. Such system can go into the chaos under certain parameters. In chaotic state the disturbance of weak periodic signals can make the system dynamic behavior c...
Article
We are concerned with the theorem proving in annotated logics. By using annotated polynomials to express knowledge, we develop an inference rule superposition. A proof procedure is thus presented, and an improvement named M- strategy is mainly described. This proof procedure uses single overlaps instead of multiple overlaps, and above all, both the...
Article
Project evaluation and selection is a complex multi-attribute decision-making problem. With the information uncertainty and inaccuracy considered, a new model for project evaluation and selection is proposed, which combines the fuzzy analytic hierarchy process (AHP) and technique for order performance by similarity to ideal solution (TOPSIS). The h...
Article
Full-text available
Dynamic alliance formations have increased dramatically over the past decade for its adaptation to environmental change and market competition. However, many fail, while an even greater proportion perform poorly. The risk analy-sis of dynamic alliance will help enterprises to choose a coalition partner and make a reasonable benefit allocation plan....
Article
In this paper, we describe a novel 3-D face recognition scheme for 3-D face recognition that can automatically identify faces from range images, and is insensitive to holes, facial expression, and hair. In our scheme, a number of carefully selected range images constitute a set of example faces, and another range image is chosen as a ldquogeneric f...
Conference Paper
In this paper, a novel scheme is introduced for human facial feature extraction. Unlike previous methods that fit a 3D morphable model to 2D intensity images, our scheme utilizes 3D range images to extract features without requiring manually-defined initial landmark points. A linear transformation is used to achieve the mapping between the 3D model...
Article
Finite difference (FD) methods are the most prevalent numerical modeling algorithms for simulating linear wave propagation phenomena in geophysics, electromagnetics, and aero- or marine-acoustics applications. Unfortunately, evaluating time evolution for waves in large-scale 2D or 3D domains is computationally demanding and data-intensive. As such,...
Chapter
Parallel processing systems with cache or local memory in the memory hierarchies have become very common. These systems have large-size cache or local memory in each processor and usually employ copy-back protocol for the cache coherence. In such systems, a problem called cache or local memory thrashing may arise in executions of parallel programs,...
Conference Paper
Full-text available
Finite difference (FD) methods are the most prevalent numerical modelling algorithms for evaluating initial or boundary value problems in scientific and engineering applications. Unfortunately, simulating time evolutions for transient physical phenomenon is computationally demanding and data-intensive. This paper introduces an efficient implementat...
Conference Paper
Full-text available
Time domain or frequency domain Finite Difference (FD) methods are one of the most popular numerical modelling techniques in the solution of scientific and engineering problems. However, these simulations are still time-consuming and cannot be used routinely except in institutes that can afford the high cost of running and maintaining supercomputer...
Conference Paper
Full-text available
Floating-point summation is one of the most important operations in scientific/numerical computing applications and also a basic subroutine (SUM) in BLAS (Basic Linear Algebra Subprograms) library. However, standard floating-point arithmetic based summation algorithms may not always result in accurate solutions because of possible catastrophic canc...
Article
The dead end problem in greedy forwarding is an important issue of location based routing in sensor networks. It occurs when a message falls into a local minimum using greedy forwarding. Current solutions to this problem are insufficient in either eliminating traffic/path memorization or finding satisfactory short paths. In this paper, we propose a...
Article
We investigate the network communication behavior of a three-dimensional (3D) multicomputer system using optical interconnection in which faulty nodes are left in place, a concept called "fail-in-place." We call this the percolation problem in which various amounts of missing nodes fixed in position in the network may have a dramatic effect on the...
Article
The designs of application specific integrated circuits and/or multiprocessor systems are usually required in order to improve the performance of multidimensional applications such as digital-image processing and computer vision. Wavelet-based algorithms have been found promising among these applications due to the features of hierarchical signal a...
Article
Although the notion of the parallelism in multidimensional applications has existed for a long time, it is so far unknown what the bound (if any) of inter-iteration parallelism in multirate multidimensional digital signal processing (DSP) algorithms is, and whether the maximum inter-iteration parallelism can be achieved for arbitrary multirate data...
Chapter
Wallace Trees Unsigned Array Multiplier Two's Complement Array Multiplier Modular Structure of Large Multiplier
Chapter
Multiplication and Addition in Logarithmic Systems Addition and Subtraction in Logarithmic Systems Realizing the Approximation
Chapter
Single-Bit Adders Negation Subtraction Through Addition Overflow Ripple Carry Adders
Chapter
Subtract-and-Shift Approach Binary Restoring Division Binary Non-Restoring Division High-Radix Division SRT Division Convergence Division Division by Divisor Reciprocation
Chapter
Restoring Cellular Array Divider Non-Restoring Cellular Array Divider Carry-Lookahead Cellular Array Divider
Chapter
Conditional-Sum Addition Carry-Completion Sensing Addition Carry-Lookahead Addition (CLA) Carry-Save Adders (CSA) Bit-Partitioned Multiple Addition
Conference Paper
With the rapid development of Mobile Ad-hoc Network (MANET) technology, anonymity has received increased attention in this area. Design of anonymous communication systems in MANETs needs to take the characteristics of wireless communication into account. A malicious node who issues passive attacks such as eavesdrops could be more effective in MANET...
Conference Paper
Finite Difference Time Domain (FDTD) method is the most commonly used numerical algorithm for simulating linear wave propagation phenomena in geophysics, electromagnetics, and aero- or marine- acoustics applications. Unfortunately, evaluating time- evolution for millions to trillions of discrete spatial points is computational intensive, especially...
Conference Paper
The dead-end problem is an importance issue of location-based routing in sensor networks, which occurs when a message falls into a local minimum using greedy forwarding. Current methods for this problem are insufficient either in eliminating traffic/path memorization or finding satisfied short paths. In this paper, we propose a novel algorithm, nam...
Conference Paper
Modern CDMA systems are required to provide differentiated services to support heterogeneous traffic while existing rate allocation schemes are designed for homogeneous users. We propose different utility functions to adapt to distinct user QoS requirements. Our goal is to maximize the system-wide aggregated utilities. A suboptimal solution of this...
Conference Paper
We consider a distributed CDMA system in which mobiles are able to control their transmission rate and power based on their radio conditions. Each mobile is assumed to be myopic, that is, its solitary goal is to maximize the payoff, which is the difference between the effective throughput and the price that the system charges for the received power...
Conference Paper
In this paper, an ad hoc network anonymous data forwarding method and an associated routing protocol to prevent traffic analysis is presented. This method assumes trusted closed group nodes and every node can play the role of onion relay for the anonymous data forwarding. The route discovery operation of the protocol adopts the load balancing conce...
Article
It has been evidenced that DNA computing can solve those problems which are currently intractable on the even fastest electronic computers. The algorithm design for DNA computing, however, is not straightforward: A strong background in both DNA molecule and computer engineering are required to develop efficient DNA computing algorithms. All of thes...
Article
It has been evidenced that DNA computing can solve those problems which are currently intractable on even the fastest electronic computers. The algorithm design for DNA computing, however, is not straightforward. Both a significant knowledge of the DNA molecule and a strong background in computer engineering are required to develop efficient DNA co...
Article
Full-text available
Many topology-dependent transmission scheduling algorithms have been proposed to minimize the time-division multiple-access frame length in multihop packet radio networks (MPRNs), in which changes of the topology inevitably require recomputation of the schedules. The need for constant adaptation of schedules-to-mobile topology entails significant p...
Article
An ad hoc network is a self-organized and distributed entity, consisting of n mobile stations (MSs) without the coordination of any centralized access point. Initialization is one of the fundamental tasks to set up an ad hoc network, which involves assigning each of the n MSs a distinct ID number from 1 to n, distributedly. In Nakano et al. (2000),...
Article
An ad hoc network is a self-organized and distributed entity consisting of a number of mobile stations (MS) without the coordination of any centralized access point. Clustering is one of the fundamental problems in ad hoc networks. In this context, we describe a distributed clustering algorithm for multihop ad hoc networks. We first propose a rando...
Article
Ever since Adleman [1] solved the Hamilton Path problem using a combinatorial molecular method, many other hard computational problems have been investigated with the proposed DNA computer [3] [25] [9] [12] [19] [22] [24] [27] [29] [30]. However, these computation methods all work toward one destination through a couple of steps based on the initia...
Article
Bandwidth-guaranteed QoS service in ad hoc networks is a challenging task due to several factors such as the absence of the central control, the dynamic network topology, the hidden terminal problem and the multihop routing property. An end-to-end bandwidth allocation algorithm was proposed in [Lin and Liu, 15] to support the QoS service in ad hoc...
Article
Full-text available
Network performance for a single-hop WDM network deteriorates due to packet collisions that occur in both source and destination nodes. These collisions can also occur in both the control and data channels as in the case where reservation techniques a re adopted. In order to reduce these collisions and maximize bandwidth utilization, we present in...
Article
Segment A of the genome of infectious bursal disease virus(IBDV) encodes structure protein VP2 and VP3 and protease VP4. In this study a polyprotein gene of IBDV was inserted into a Bombyx mori baculovirus transfer vector pAcHLT--C and contransfected into BmN cells with linear genome DNA of virus Bm-BacPAK6. Dot hybridization suggested that the seg...
Conference Paper
An ad-hoc network is a collection of wireless mobile nodes without the required intervention of any centralized Access Point. With the existence of the hidden terminals and the absence of the central control, the resource allocation is always a very challenging problem in such networks. In this paper, a distributed resource allocation scheme is des...
Conference Paper
An ad hoc network is a self-organized and distributed entity, consisting of a number of mobile stations (MSs) without the coordination of any centralized access point. In this context, we discuss how to minimize the average transmission power in CDMA (Code Division Multiple Access) ad hoc networks for real-time service and data service utilizing th...
Conference Paper
The problem of broadcast channel access in single-hop and multihop ad hoc networks is considered. Two novel randomized and distributed channel access algorithms are developed and analyzed for single-hop and multihop networks, respectively. These algorithms are designed based on maximizing the worst-case channel efficiency, by optimizing some key pa...
Conference Paper
Full-text available
We present a design of a scalable interconnection network that possesses a hierarchical structure. We also present the network topology, features, and performance analysis. The proposed network is well suited to optical implementation and will be used in massively parallel systems. This network is called a SCalable OPtical Interconnection Network (...
Conference Paper
In this paper we propose an efficient distributed routing and wavelength allocation method for a Single-hop WDM (Wavelength Division Multiplexing) all-Optical Interconnection Network for Scalable Multiprocessor systems. By wavelength allocation, we mean the assignment of unique wavelength(s) to the access nodes. The WDM techniques enable extraction...
Conference Paper
In this paper, we systematically present the high-level architectural synthesis for general wavelet-based algorithms via a model of I/O data space and the nonlinear transformations of the I/O data space. The parallel architectures synthesized in this paper are based on the computation model of distributed memory and distributed control. Several arc...
Article
this paper are new approaches for Boolean and arithmetic operations using DNA method which is based on the insertion and deletion of DNA molecules first mentioned by Beaver [2]. This Beaver's method will be described in Section 2, along with the fundamental issues on its application. The reason for putting it in a separate section is that his metho...
Article
Full-text available
I In the past few years, a lot of work has been done on simulating Boolean Circuits [3] [13] [18] [19] [21]. Most of them start from the inputs and go through all the gates in order to generate the output. Then, a detection method will be utilized for checking the final answer. This paper proposes a new method for simulating Boolean circuits based...
Conference Paper
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP problems. Most of them are in the solution bases and need some error correction or tolerance technique in order to get good and correct results [3] [7] [9] [11] [21] [22]....
Conference Paper
Full-text available
Ever since Adleman (1) solved the Hamilton Path problem using a combinatorial molecular method, many other hard computa- tional problems have been investigated with the proposed DNA computer (3) (25) (9) (12) (19) (22) (24) (27) (29) (30). However, these computa- tion methods all work toward one destination through a couple of steps based on the in...
Conference Paper
The wavelet zerotree coding systems, including Embedded Zerotree Wavelet (EZW)[1] and its variants Set Partitioning In Hierarchical Trees(SPIHT)[2] and Space Frequency Quantization (SFQ)[3][4], have three common procedures: 1) 2-D Discrete Wavelet Transform (DWT)[5], 2) zerotree building and symbol generation from the wavelet coefficients (illustra...
Article
Corrosion occurs frequently at the interior or exterior of steel casing pipes used in underground gas storage or oil fields. It causes not only production loss but also environmental pollution. Hence, corrosion monitoring and early detection of corrosion pits and wall thinning on casing pipes are considerably important to the gas and petroleum indu...
Article
Full-text available
Corrosion monitoring and early detection of pits and wall thinning for casing pipes are considerably important to gas and petroleum industries since the frequently occurring corrosion at the internal or external parts of those steel casing pipes used in underground gas storage or oil fields causes production and environmental protection problems. I...
Conference Paper
A new multi-channel, CDMA (code division multiple access) (or FDMA (frequency division multiple access)) and TDMA (time division multiple access) combined, contention free MAC (medium access control), termed the sequenced neighbor double reservation (SNDR), is presented for mobile ad hoc networks. The SNDR uses the receiver-based data transmission...
Conference Paper
With the development of wireless communication technology a wide range of services such as voice, video, and data communication should be provided to users. To support integrated services, efficient medium access control (MAC) methods should be developed. In this paper a new MAC, reservation-scheme and contention-scheme combined, termed the Sequenc...
Article
The data compression based on dictionary techniques works by replacing phrases in the input string with indexes into some dictionary. The dictionary can be static or dynamic. In static dictionary compression, the dictionary contains a predetermined fixed set of entries. In dynamic dictionary compression, the dictionary changes its entries during co...
Article
As a basic operation, polynomial product modulo (z N + 1) with real-valued coefficients plays an important part in digital signal/image processing. We present here a new algorithm for calculating this product implemented by the real-valued W transform. Applying the existing W transform algorithm as a subroutine, our new algorithm needs only N(log 2...
Article
As a basic operation, polynomial product modulo (z N + 1) with real-valued coefficients plays an important part in digital signal/image processing. We present here a new algorithm for calculating this product implemented by the real-valued W transform. Applying the existing W transform algorithm as a subroutine, our new algorithm needs only N(log 2...
Conference Paper
The performance evaluation for a fault-tolerant interconnection network referred to as the Palindrome Interconnection Network(PIN) using analytical model is presented. We propose a simplified routing algorithm which includes drop and hold models as its conflict resolution strategies. Under this simplified routing algorithm, we obtained the lower bo...
Article
A parallel algorithm for Householder Transformation is given in this paper. Based on the parallelizing of Householder Transformation, we propose the algorithms for solving ill-conditioned matrix inversion, ill-conditioned linear system and ill-conditioned least squares. The proposed methods have acceptable execution time and the number of employed...
Conference Paper
Full-text available
A new interconnection network composed of 3×3 switching elements is proposed. This new network is called Palindrome interconnection network (PIN) with hardware complexity identical to its counterparts. Compared with its counterparts, the proposed network is fault-tolerant, as totally disjoint paths exist in the network between any source/destinatio...
Conference Paper
We present a new coding method for lossless gray-scale image compression. The method is based on modifications of LZ77-based compression and estimation of prediction errors of pixels. The method gives compression comparable to JPEG lossless mode and its speed is about twice that of JPEG lossless mode with arithmetic coding
Article
The central part of dictionary type data compression is the process of parsing the input string into phrases that are to be replaced with the corresponding dictionary indexes. In this article, we study the longest fragment first (LFF) parsing strategy for static dictionary compression. We present an on-line algorithm for LFF parsing that requires l...
Article
A block parallel partitioning method for evaluating general linearmth order recurrence equations is presented and applied to solve the eigenvalues of symmetric tridiagonal matrices. The algorithm is based on partitioning, in a way that ensures load balance during computation. This method is applicable to both shared memory and distributed memory MI...
Article
Loop transformations, such as loop interchange, reversal and skewing, have been unified under linear matrix transformations. A legal transformation matrix is usually generated based upon distance vectors or direction vectors. Unfortunately, for some nested loops, distance vectors may not be computable and direction vectors, on the other hand, may n...
Article
In this paper, we propose a new method for the identification of discrete-time linear multivariable systems. This method comprises three recursive computation schemes including two parameter estimate schemes for both state equation and observation equation, respectively, and the state estimate scheme via Kalman filtering. We call this method the re...
Conference Paper
Full-text available
Steel casing pipes used in underground gas storage or in oil fields are subjected to corrosion. Corrosion frequently causes some pitting or wall thinning to the internal or external of casing pipes. More serious corrosion would form holes on the casing pipes and induce serious operational problems. Hence, corrosion monitoring and early detection of...
Conference Paper
Studies parallel algorithms for two static dictionary compression strategies. One is the optimal dictionary compression with dictionaries that have the prefix property, for which our algorithm requires O(L+log n) time and O(n) processors, where L is the maximum allowable length of the dictionary entries, while previous results run in O(L+log n) tim...
Conference Paper
Traditional approach for generating loop transformation matrix, which is based upon the computation of distance vectors or direction vectors, does not work for those nested loops whose distance vectors are uncomputable and direction vectors contain no useful information. In this paper, we present a new technique for generating transformation matrix...
Conference Paper
Full-text available
Corrosion monitoring and early detection of pits and wall thinning is important to the gas and petroleum industry. A new noncontact AC electromagnetic induction system has been developed for monitoring and detecting corrosion in multistring casing configuration. The system includes a sonde which has a transmitter coil and three receiver coils, with...
Conference Paper
Full-text available
The fault detection and diagnosis of oil field pipes are very important to the petroleum companies, as if known, the fault of steel products can be detected based on the eddy current technique. The depth of a defect on an oil field pipe will determine the change in amplitude and phase of the detected signal. However, this signal is also affected by...
Conference Paper
We explore modifications of the LZ77 type dictionary compression algorithm so that it can compress gray-scale images efficiently. We consider the following modifications to the LZ77 compression: (1) Limiting the positions to start the pattern match in the search window to four neighboring pixels of the first pixel in the lookahead buffer. (2) Using...
Article
This contribution is focused on self-routing permutation networks capable of routing all n! permutations of its n inputs to its n outputs without internal conflict. First, a self-routing permutation network named BNB SRPN is described. The network realizes the self-routing capability on the structure of the generalized baseline network, a modified...
Article
A subsequence of a given string is any string obtained by deleting none or some symbols from the given string. A longest common subsequence (LCS) of two strings is a common subsequence of both that is as long as any other common subsequences. The problem is to find the LCS of two given strings. The bound on the complexity of this problem under the...

Network