Open Access. Powered by Scholars. Published by Universities.®

Signal Processing Commons

Open Access. Powered by Scholars. Published by Universities.®

Electrical & Computer Engineering Faculty Research

Discipline
Keyword
Publication Year

Articles 1 - 17 of 17

Full-Text Articles in Signal Processing

Understanding Vehicular Traffic Behavior From Video: A Survey Of Unsupervised Approaches, Brendan Tran Morris, Mohan Manubhai Trivedi Oct 2013

Understanding Vehicular Traffic Behavior From Video: A Survey Of Unsupervised Approaches, Brendan Tran Morris, Mohan Manubhai Trivedi

Electrical & Computer Engineering Faculty Research

Recent emerging trends for automatic behavior analysis and understanding from infrastructure video are reviewed. Research has shifted from high-resolution estimation of vehicle state and instead, pushed machine learning approaches to extract meaningful patterns in aggregates in an unsupervised fashion. These patterns represent priors on observable motion, which can be utilized to describe a scene, answer behavior questions such as where is a vehicle going, how many vehicles are performing the same action, and to detect an abnormal event. The review focuses on two main methods for scene description, trajectory clustering and topic modeling. Example applications that utilize the behavioral modeling …


Tunable Fano Resonances Based On Two-Beam Interference In Microring Resonator, Ting Hu, Ping Yu, Chen Qui, Huiye Qui, Fan Wang, Mei Yang, Xiaoqing Jiang, Hui Yu, Jianyi Yang Jan 2013

Tunable Fano Resonances Based On Two-Beam Interference In Microring Resonator, Ting Hu, Ping Yu, Chen Qui, Huiye Qui, Fan Wang, Mei Yang, Xiaoqing Jiang, Hui Yu, Jianyi Yang

Electrical & Computer Engineering Faculty Research

In this paper, a resonant system is demonstrated on silicon-on-insulator wafer to achieve tunable Fano resonances. In this system, the Fano resonance originates from the interference of two beams resonant in the microring resonator. The shapes of the Fano resonances are tunable through controlling the phase difference of the two beams. Both large slope and high extinctionratio (ER) are obtained when the phase difference is 0.5π or 1.5π. Experimental results show that Fano resonances with steep slope and ER over 20 dB are achieved in the whole free spectral range by controlling the microheaters to meet the phase condition.


Estimation Of Performance Indices For The Planning Of Sustainable Transportation Systems, Alexander Paz, Pankaj Maheshwari Jan 2013

Estimation Of Performance Indices For The Planning Of Sustainable Transportation Systems, Alexander Paz, Pankaj Maheshwari

Electrical & Computer Engineering Faculty Research

In the context of sustainable transportation systems, previous studies have either focused only on the transportation systemor have not used a methodology that enables the treatment of incomplete, vague, and qualitative information associated with the available data. This study proposes a system of systems (SOS) and a fuzzy logic modeling approach. The SOS includes the Transportation, Activity, and Environment systems. The fuzzy logic modeling approach enables the treatment of the vagueness associated with some of the relevant data. Performance Indices (PIs) are computed for each system using a number of performance measures. The PIs illustrate the aggregated performance of each …


Framework For Simulation Of Heterogeneous Mpsoc For Design Space Exploration, Bisrat Tafesse, Venkatesan Muthukumar Jan 2013

Framework For Simulation Of Heterogeneous Mpsoc For Design Space Exploration, Bisrat Tafesse, Venkatesan Muthukumar

Electrical & Computer Engineering Faculty Research

Due to the ever-growing requirements in high performance data computation, multiprocessor systems have been proposed to solve the bottlenecks in uniprocessor systems. Developing efficient multiprocessor systems requires effective exploration of design choices like application scheduling, mapping, and architecture design. Also, fault tolerance in multiprocessors needs to be addressed. With the advent of nanometer-process technology for chip manufacturing, realization of multiprocessors on SoC (MpSoC) is an active field of research. Developing efficient low power, fault-tolerant task scheduling, and mapping techniques for MpSoCs require optimized algorithms that consider the various scenarios inherent in multiprocessor environments. Therefore there exists a need to develop …


Real-Time On-Board Object Tracking For Cooperative Flight Control, Ajay Kumar Mandava, Emma Regentova, Henry Selvaraj Jan 2010

Real-Time On-Board Object Tracking For Cooperative Flight Control, Ajay Kumar Mandava, Emma Regentova, Henry Selvaraj

Electrical & Computer Engineering Faculty Research

One of possible cooperative Situations for flights could be a scenario when the decision on a new path is taken by A Certain fleet member, who is called the leader. The update on the new path is Transmitted to the fleet members via communication That can be noisy. An optical sensor can be used as a back-up for re-estimating the path parameters based on visual information. For A Certain topology, the issue can be solved by continuous tracking of the leader of the fleet in the video sequence and re-adjusting parameters of the flight, accordingly. To solve such a problem …


A Graph-Based Approach To Symbolic Functional Decomposition Of Finite State Machines, Piotr Szotkowski, Mariusz Rawski, Henry Selvaraj Jun 2009

A Graph-Based Approach To Symbolic Functional Decomposition Of Finite State Machines, Piotr Szotkowski, Mariusz Rawski, Henry Selvaraj

Electrical & Computer Engineering Faculty Research

This paper discusses the symbolic functional decomposition method for implementing finite state machines in field-programmable gate array devices. This method is a viable alternative to the presently widespread two-step approaches to the problem, which consist of separate encoding and mapping stages; the proposed method does not have a separate decomposition step instead, the state's final encoding is introduced gradually on every decomposition iteration. Along with general description of the functional symbolic decomposition method's steps, the paper discusses various algorithms implementing the method and presents an example realisation of the most interesting algorithm. In the end, the paper compares the results …


Free Regions Of Sensor Nodes, Laxmi P. Gewali, Navin Rongatana, Henry Selvaraj, Jan B. Pedersen Jan 2009

Free Regions Of Sensor Nodes, Laxmi P. Gewali, Navin Rongatana, Henry Selvaraj, Jan B. Pedersen

Electrical & Computer Engineering Faculty Research

We introduce the notion of free region of a node in a sensor network. Intuitively, a free region of a node is the connected set of points R in its neighborhood such that the connectivity of the network remains the same when the node is moved to any point in R. We characterize several properties of free regions and develop an efficient algorithm for computing them. We capture free region in terms of related notions called in-free region and out-free region. We present an O(n2) algorithm for constructing the free region of a node, where n is the number of …


A Finite Queue Model Analysis Of Pmrc-Based Wireless Sensor Networks, Qiaoqin Li, Mei Yang, Hongyan Wang, Yingtao Jiang, Jiazhi Zeng Jul 2008

A Finite Queue Model Analysis Of Pmrc-Based Wireless Sensor Networks, Qiaoqin Li, Mei Yang, Hongyan Wang, Yingtao Jiang, Jiazhi Zeng

Electrical & Computer Engineering Faculty Research

In our previous work, a highly scalable and fault- tolerant network architecture, the Progressive Multi-hop Rotational Clustered (PMRC) structure, is proposed for constructing large-scale wireless sensor networks. Further, the overlapped scheme is proposed to solve the bottleneck problem in PMRC-based sensor networks. As buffer space is often scarce in sensor nodes, in this paper, we focus on studying the queuing performance of cluster heads in PMRC-based sensor networks. We develop a finite queuing model to analyze the queuing performance of cluster heads for both non-overlapped and overlapped PMRC-based sensor network. The average queue length and average queue delay of cluster …


Significance Of Logic Synthesis In Fpga-Based Design Of Image And Signal Processing Systems, Mariusz Rawski, Henry Selvaraj, Bogdan J. Falkowski, Tadeusz Luba Jun 2008

Significance Of Logic Synthesis In Fpga-Based Design Of Image And Signal Processing Systems, Mariusz Rawski, Henry Selvaraj, Bogdan J. Falkowski, Tadeusz Luba

Electrical & Computer Engineering Faculty Research

This chapter, taking FIR filters as an example, presents the discussion on efficiency of different implementation methodologies of DSP algorithms targeting modern FPGA architectures. Nowadays, programmable technology provides the possibility to implement digital systems with the use of specialized embedded DSP blocks. However, this technology gives the designer the possibility to increase efficiency of designed systems by exploitation of parallelisms of implemented algorithms. Moreover, it is possible to apply special techniques, such as distributed arithmetic (DA). Since in this approach, general-purpose multipliers are replaced by combinational LUT blocks, it is possible to construct digital filters of very high performance. Additionally, …


Least Squares Support Vector Machine Based Classification Of Abnormalities In Brain Mr Images, S. Thamarai Selvi, D. Selvathi, R. Ramkumar, Henry Selvaraj Mar 2006

Least Squares Support Vector Machine Based Classification Of Abnormalities In Brain Mr Images, S. Thamarai Selvi, D. Selvathi, R. Ramkumar, Henry Selvaraj

Electrical & Computer Engineering Faculty Research

The manual interpretation of MRI slices based on visual examination by radiologist/physician may lead to missing diagnosis when a large number of MRIs are analyzed. To avoid the human error, an automated intelligent classification system is proposed. This research paper proposes an intelligent classification technique to the problem of classifying four types of brain abnormalities viz. Metastases, Meningiomas, Gliomas, and Astrocytomas. The abnormalities are classified based on Two/Three/ Four class classification using statistical and textural features. In this work, classification techniques based on Least Squares Support Vector Machine (LS-SVM) using textural features computed from the MR images of patient are …


Variable Structure Control Of Unsteady Nonlinear Aeroelastic System, With Partial State Information, Sushma Gujjula, Sahjendra N. Singh Aug 2005

Variable Structure Control Of Unsteady Nonlinear Aeroelastic System, With Partial State Information, Sushma Gujjula, Sahjendra N. Singh

Electrical & Computer Engineering Faculty Research

This paper treats the question of control of a two-degree-of-freedom unsteady aeroelastic system with partial state information in the presence of uncertainties. The chosen model describes the plunge and pitch motion of a wing and a single trailing-edge control surface is utilized for the purpose of control. Based on the Lyapunov approach, a variable structure control law is derived. For the control law derivation, the system is treated as the interconnection of two subsystems in which the subsystem associated with the unsteady aerodynamics is input-to-state stable. The stability property of this subsystem is exploited to generate a dominating signal for …


A Fast And Simple Algorithm For Computing M Shortest Paths In Stage Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar Sep 2004

A Fast And Simple Algorithm For Computing M Shortest Paths In Stage Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar

Electrical & Computer Engineering Faculty Research

We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.


A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar Jan 2004

A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar

Electrical & Computer Engineering Faculty Research

We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.


Implementation Of Large Neural Networks Using Decomposition, Henry Selvaraj, H. Niewiadomski, P. Buciak, M. Pleban, Piotr Sapiecha, Tadeusz Luba, Venkatesan Muthukumar Jun 2002

Implementation Of Large Neural Networks Using Decomposition, Henry Selvaraj, H. Niewiadomski, P. Buciak, M. Pleban, Piotr Sapiecha, Tadeusz Luba, Venkatesan Muthukumar

Electrical & Computer Engineering Faculty Research

The article presents methods of dealing with huge data in the domain of neural networks. The decomposition of neural networks is introduced and its efficiency is proved by the authors’ experiments. The examinations of the effectiveness of argument reduction in the above filed, are presented. Authors indicate, that decomposition is capable of reducing the size and the complexity of the learned data, and thus it makes the learning process faster or, while dealing with large data, possible. According to the authors experiments, in some cases, argument reduction, makes the learning process harder.


A Self-Consistent Numerical Method For Simulation Of Quantum Transport In High Electron Mobility Transistor; Part 1: The Boltzmann-Poisson-Schrodinger Solver, Rahim Khoie Jan 1996

A Self-Consistent Numerical Method For Simulation Of Quantum Transport In High Electron Mobility Transistor; Part 1: The Boltzmann-Poisson-Schrodinger Solver, Rahim Khoie

Electrical & Computer Engineering Faculty Research

A self-consistent Boltzmann-Poisson-Schrödinger solver for High Electron Mobility Transistor is presented. The quantization of electrons in the quantum well normal to the heterojunction is taken into account by solving the two higher moments of Boltzmann equation along with the Schrödinger and Poisson equations, self-consistently. The Boltzmann transport equation in the form of a current continuity equation and an energy balance equation are solved to obtain the transient and steady-state transport behavior. The numerical instability problems associated with the simulator are presented, and the criteria for smooth convergence of the solutions are discussed. The current-voltage characteristics, transconductance, gate capacitance, and unity-gain …


A Self-Consistent Numerical Method For Simulation Of Quantum Transport In High Electron Mobility Transistor; Part Ii: The Full Quantum Transport, Rahim Khoie Jan 1996

A Self-Consistent Numerical Method For Simulation Of Quantum Transport In High Electron Mobility Transistor; Part Ii: The Full Quantum Transport, Rahim Khoie

Electrical & Computer Engineering Faculty Research

In Part I of this paper we reported a self-consistent Boltzmann-Schrodinger-Poisson simulator for HEMT in which only electrons in the first subband were assumed to be quantized with their motion restricted to 2 dimensions. In that model, the electrons in the second and higher subbands were treated as bulk system behaving as a 3 dimensional electron gas. In Part II of this paper, we extend our simulator to a self-consistent full-quantum model in which the electrons in the second subband are also treated as quantized 2 dimensional gas. In this model, we consider the electrons in the lowest two subbands …


A General Approach To Boolean Function Decomposition And Its Application In Fpgabased Synthesis, Tadeusz Luba, Henry Selvaraj Jan 1995

A General Approach To Boolean Function Decomposition And Its Application In Fpgabased Synthesis, Tadeusz Luba, Henry Selvaraj

Electrical & Computer Engineering Faculty Research

An effective logic synthesis procedure based on parallel and serial decomposition of a Boolean function is presented in this paper. The decomposition, carried out as the very first step of the .synthesis process, is based on an original representation of the function by a set of r-partitions over the set of minterms. Two different decomposition strategies, namely serial and parallel, are exploited by striking a balance between the two ideas. The presented procedure can be applied to completely or incompletely specified, single- or multiple-output functions and is suitable for different types of FPGAs including XILINX, ACTEL and ALGOTRONIX devices. The …