A new fast motion estimation algorithm based on the loop–epipolar constraint for multiview video coding

There lie geometric constraints between neighboring frames in multiview video sequences. The geometric constraints are valuable for reducing spatial and temporal redundancy in multiview video coding (MVC). In this paper, we propose a new fast motion estimation algorithm based on the loop–epipolar constraint which combines loop and epipolar constraints. A practical search technique is designed according to the characteristics of the loop–epipolar constraint. Experimental results show that the proposed algorithm is efficient for sequences under different multiview camera setups.     

Design and analysis of an algorithm for fair service in error‐prone wireless channels

In order to support diverse communication‐intensive real‐time and non‐real‐time data flows over a scarce, varying and shared wireless channel with location‐dependent and bursty errors, we define a service model that has the following characteristics: short‐term fairness among flows which perceive a clean channel, long‐term fairness for flows with bounded channel error, worst‐case delay bounds for packets, short‐term throughput bounds for flows with clean channels and long‐term throughput bounds for all flows with bounded channel error, expanded schedulable region, and support for both delay sensitive and error sensitive data flows. We present the wireless fair service algorithm, and show through both analysis and simulation that it achieves the requirements of the service model in typical wireless network environments. The key aspects of the algorithm are the following: (a) an enhanced fair queueing based service scheme that supports decoupling of delay and bandwidth, (b) graceful service compensation for lagging flows and graceful service degradation for leading flows, (c) support for real‐time delay sensitive flows as well as non‐real‐time error sensitive flows, and (d) an implementation within the framework of the simple and robust CSMA/CA wireless medium access protocol. This revised version was published online in July 2006 with corrections to the Cover Date.     

Accurate calculation and Matlab based fast realization of merit function’s Hesse matrix for the design of multilayer optical coating

To improve the current status of home multilayer optical coating design with low speed and poor efficiency when a large layer number occurs, the accurate calculation and fast realization of merit function＇s gradient and Hesse matrix is pointed out. Based on the matrix method to calculate the spectral properties of multilayer optical coating, an analytic model is established theoretically. And the corresponding accurate and fast computation is successfully achieved by programming with Matlab. Theoretical and simulated results indicate that this model is mathematically strict and accurate, and its maximal precision can reach floating-point operations in the computer, with short time and fast speed. Thus it is very suitable to improve the optimal search speed and efficiency of local optimization methods based on the derivatives of merit fimction. It has outstanding performance in multilayer optical coating design with a large layer number.     

A linear 60 GHz 65 nm-CMOS power amplifier realization and characterization for OFDM signal

A millimeter-wave Power Amplifier (PA) based on a 65nm CMOS technology from STMicroelectronics has been designed. The targeted feature is the unlicensed band around 60 GHz suitable for wireless personal area network application (WPAN). To optimize the linearity, the PA is designed under class A biasing to have an output compression point (OCP₁) close to its saturated Power (P _sat). S-parameters and large signal measurement results are demonstrated and compared with electromagnetic simulations. The PA offers a P _sat of 8.3 dBm, an OCP₁ of 6 dBm and a gain of 6.7 dB. The die area is 0.29 mm² with pads. Considering those results, one-tone simulations are not sufficient to characterize the linearity performances of the PA in its real conditions of use. Consequently, two-tone simulations are firstly performed. After, linearity figures of merit (FoM) are discussed applying an orthogonal frequency-division multiplexing (OFDM) modulated signal. The PA offers an adjacent channel power ratio (ACPR) of 15 dB and an error vector magnitude (EVM) of 20% at PA compression operating mode.     

A performance analysis of HICCUPS—a steganographic system for WLAN

The paper presents an analysis of performance features of the HICCUPS (HIdden Communication system for CorrUPted networkS) including the efficiency and the cost of the system in WLANs (Wireless Local Area Networks). The analysis relies on the original CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) 802.11 Markov chain-based model and proves that the HICCUPS is the efficient steganographic method with the reasonable cost.     

A fast data recording system for a rotating interferometer†

A fast data recording system has boon designed Tor a special type of radio-wave direction-finder called a rotating interferometer. Its operation is verified and compared with that of the original pen and papnr chart recording system. IU application in the ionospheric studies is ducussod.     

A multi‐attribute shot segmentation algorithm for video programs

This paper describes a new algorithm for detecting cuts, thereby segmenting a video into shots. Our Webbased video library contains a large volume of news and documentary material; most of the transitions between shots in that type of programming are cuts, rather than dissolves or other complex transitions. We have developed an accurate multiattribute algorithm for detecting cuts in video programs. The algorithm uses a motion metric to identify a set of cuts, then uses luminance histograms to eliminate false cuts. Our experimental results show that this algorithm is more accurate than previous motionbased transition detection algorithms.     

A new channel, power and rate assignment algorithm for?multi-radio wireless mesh networks

Endowing mesh routers with multiple radios is a recent solution to improve the performance of wireless mesh networks. The consequent problem to assign channels to radios has been recently investigated and its relation to the routing problem has been revealed. The joint channel assignment and routing problem has been shown to be NP-complete and hence mainly heuristics have been proposed. However, such heuristics consider wireless links just like wired links, whereas disregarding their peculiar features. In this paper, we consider the impact of tuning the transmission power and rate of the wireless links on the efficiency of the channel assignment. Then, we present a channel, power and rate assignment heuristic and compare its performance to previously proposed algorithms.     

A center‐controlled dynamic rerouting scheme for fast and reliable handover in mobile ATM networks

This paper proposes a scheme for fast and reliable handover that uses dynamic rerouting controlled by a call setup control station (CCS) operating in mobile asynchronous transfer mode (ATM) networks. The CCS selects appropriate rerouted path and crossover switch (COS), and remotely controls the new path's setup. This omits crossover switch discovery process, and makes fast handover possible. The CCS can select the appropriate rerouted path because it directly and with little delay collects information about the state of links such as traffic loads, quality-of-service (QoS) parameters, and disconnection or restoration of links advertised from every ATM switch in its domain. This reduces blocking and congestion, and makes reliable handover possible. The CCS accepts a handover request message for either backward or forward handover, and can remotely control the new path's setup in the same manner for either handover. The scheme provides forward handover when the radio propagation conditions deteriorate unpredictably. This paper also shows sequences of call origination, connection pre-establishment, and route-change in our proposed scheme, and illustrates operation of the CCS and the ATM switches. This revised version was published online in June 2006 with corrections to the Cover Date.     

A task‐oriented priority queue for telephone switch design: with modified FCFS and forking

When developing a telephone switch, it is useful to know how long it will take to process the various tasks associated with call processing. The model developed in this paper gives expected sojourn times for those tasks. It is a priority queueing model with a modified firstcome firstserved (FCFS) service discipline, which mimics the treatment of tasks in actual system software. The model is an M/G/1 queueing model with preemption (preemptive resume). It consists of multiple queues, one for each distinct priority, where each task has been preassigned a constant priority. Within each priority queue, the tasks are further grouped by type. An arriving task will join the back of the group of tasks of its type, regardless of where this group is positioned in the queue. Upon completion of a task, several tasks of different types can enter the priority queues. This is referred to as forking. Call processing involves many ordered sets of tasks (jobs or classes), some of which will contain forks. The model produces results that compare favorably with those obtained by simulation.     

A localized algorithm for bi-connectivity of connected mobile robots

Teams of multiple mobile robots may communicate with each-other using a wireless ad-hoc network. Fault-tolerance in communication can be achieved by making the communication network bi-connected. We present the first localized protocol for constructing a fault-tolerant bi-connected robotic network topology from a connected network, in such a way that the total movement of robots is minimized. The proposed distributed algorithm uses p-hop neighbor information to identify critical head robots that can direct two neighbors to move toward each other and bi-connect their neighborhood. Simulation results show that the total distance of movement of robots decreases significantly (e.g. about 2.5 times for networks with density 10) with our localized algorithm when compared to the existing globalized one. Proposed localized algorithm does not guarantee bi-connectivity, may partition the network, and may even stop at connected but not bi-connected stage. However, our algorithm achieved 100% success on all networks with average degrees ≥10, and over 70% success on sparse networks with average degrees ≥5.     

A note on “A fast high-resolution method for bearing estimation in shallow ocean”

In the referenced paper [by Jin, Huang, Zhang, and Hou, Multidimensional Systems and Signal Processing, 20(4): 397–406, 2009], a rank-reduction based direction finding algorithm called Rayleigh MUSIC (R-MUSIC) is proposed to deal with the multimode nature of the acoustic propagation in the shallow ocean. However, when a linear array is utilized, R-MUSIC degrades severely for sources located in the vicinity of the array broadside. In this note, a measure is given to overcome this drawback.     

Functional tests of a 0.6 μm CMOS MLP analog neural network for fast on-board signal processing

The feedforward multi-layer perceptron (MLP) type neural network (NN) presented in this paper has been developed for on-board applications of high-speed signal processing. It is fully analog in order to avoid analog–digital conversions and to limit chip size and power consumption. It is constituted by a single input, ten neurons in the hidden layer and a single output. The MLP-NN has been implemented in a 84 pins (0.6 μm CMOS ASIC) and has a power consumption of 600 mW. The NN layout size is 1.8 mm × 0.7 mm. This paper reminds the design and the simulations of each implemented cell and details the different experimental tests achieved.     

Simplified procedure for decoding nonsystematic reed-solomon codes over gf(2m) using euclid?s algorithm and the fast fourier transform

Gao?s algorithm similar to Shiozaki?s algorithm for decoding nonsystematic Reed-Solomon (RS) codes which is a subclass of the redundant residue polynomial codes is considered here. This algorithm computes the message polynomial directly without explicitly finding the error-locator polynomial and errorevaluator polynomial. In this letter, a simplified decoding algorithm to correct both errors and erasures is used in conjunction with Gao?s algorithm for efficiently decoding RS codes. In addition, we show that the extended Gao algorithm similar to the Shiozaki-Truong-Cheung-Reed algorithm significantly reduces the decoding complexity.     

A Method for Head—shoulder Segmentation and Human Facial Feature Positioning

ＡＭｅｔｈｏｄｆｏｒＨｅａｄｓｈｏｕｌｄｅｒＳｅｇｍｅｎｔａｔｉｏｎａｎｄＨｕｍａｎＦａｃｉａｌＦｅａｔｕｒｅＰｏｓｉｔｉｏｎｉｎｇＨｕＴｉａｎｊｉａｎＣａｉＤｅｊｕｎＤｅｐａｒｔｍｅｎｔｏｆＥｌｅｃｔｒｉｃａｌａｎｄＩｎｆｏｒｍａｔｉｏｎＥｎｇｉ...     

Γ (Gamma): A SaaS-enabled fast and accurate analog design System

With ever increasing demand for lower power consumption, lower cost, and higher performance, designing analog circuits to meet design specifications has become an increasing challenging task, Analog circuit designers must, on one hand, have intimate knowledge about the underlining silicon process technology׳s capability to achieve the desired specifications. They must, on the other hand, understand the impact of tweaking circuits to satisfy a given specification on all circuit performance parameters. Analog designers have traditionally learned to tackle design problems with numerous circuit simulations using accurate circuit simulators such as SPICE, and have increasingly relied on trial-and-error approaches to reach a converging point. However, the increased complexity with each generation of silicon technology and high dimensionality of searching for solutions, even for some simple analog circuits, have made the trial-and-error approach extremely inefficient, causing long design cycles and often missed deadlines. Novel rapid and accurate circuit evaluation methods that are tightly integrated with circuit search and optimization methods are needed to aid design productivity.Furthermore, the current design environment with fully distributed licensing and supporting structures is cumbersome at best to allow efficient and up-to-date support for design engineers. With increasing support and licensing costs, fewer and fewer design centers can afford it. Cloud-based software as a service (SaaS) model provides new opportunities for CAD applications. It enables immediate software delivery and update to customers at very low cost. SaaS tools benefit from fast feedback and sharing channels between users and developers and run on hardware resources tailored and provided for them by the software vendor. On the downside, web-based tools are expected to perform in a very short turn-around schedule and be always responsive.This paper presents a list of innovations that come together to a new class of analog design tools: 1). Lookup table-based approach (LUT) to model complex transistor behavior provides both the necessary accuracy and speed essential for repeated circuit evaluations. 2). The proposed system architecture tight integrate the novel LUT approach with novel system level functions to allow further significantly better accuracy/speed tradeoff and faster design convergence with designer׳s intent. 3). Incorporating use inputs at key junctures of the design process allows the tool to better capture designer׳s intent and improve design convergence. 4). The combination of high accuracy and faster evaluation time make it possible to incorporate SaaS features, such as short solution space navigation steps and crowdsourcing, into the tool. This allows sharing of server-side resources between many users. Instead of fully automating a signoff circuit optimization process, the proposed tool provides effective aid to analog circuit designers with a dash-board control of many important circuit parameters with several orders faster in computation time than SPICE simulations.     

Electron Beam Probing—A Solution for MCM Test and Failure Analysis

Electron beam probing is applied for test and analysis of miniaturisedMCM structures. Wiring structures are tested for shorts and opens while fullyassembled MCMs are analysed in order to identify process or design problems[1, 2]. An electron beam short/open tester for laminated substrates has beendeveloped and installed. It allows the test of substrates up to a size of300 × 300 mm² with a spot size ofbelow 30 m without mechanical movement. The system is automated for routineapplication in the fabrication line. Electron beam probe stations are common tools for design verification and debugging ofintegrated circuits. This type of system was adapted to MCMrequirements. The travel range was extended to 80 × 100 mm² to allow for waveform measurements anddiagnostics.