View-based location and tracking of body parts for visual interaction

合集下载

全球定位系统英文作文

全球定位系统英文作文

全球定位系统英文作文Global Positioning System, or GPS, is a satellite-based navigation system that allows users to determine their precise location and time. It was originally developed by the United States government for military use, but now itis widely used by civilians for various purposes such as navigation, mapping, and tracking.GPS works by using a network of at least 24 satellites orbiting the Earth. These satellites continuously transmit signals that can be picked up by GPS receivers on the ground. By calculating the time it takes for the signals to travel from the satellites to the receiver, the GPS receiver can determine the distance to each satellite and use this information to triangulate its own position.One of the key features of GPS is its accuracy. With the use of multiple satellites, GPS can provide a very precise location, often within a few meters. This level of accuracy has made GPS an essential tool for activities suchas aviation, surveying, and outdoor recreation.In addition to providing location information, GPS also offers a precise timing reference. This timing information is crucial for many applications, including telecommunications, financial transactions, and scientific research.GPS has become an integral part of modern life, with applications ranging from personal navigation devices and smartphones to vehicle tracking systems and precision agriculture. Its widespread use has revolutionized the way we navigate and interact with the world around us.Despite its many benefits, GPS is not without its limitations. Its signals can be blocked or degraded by tall buildings, dense foliage, or atmospheric conditions, which can affect its accuracy. In addition, GPS signals can be vulnerable to intentional interference or jamming, posing a potential security risk.In conclusion, GPS has had a profound impact on ourdaily lives, enabling us to navigate with unprecedented accuracy and precision. Its widespread use and diverse applications make it an indispensable tool in the modern world. However, it is important to be aware of its limitations and potential vulnerabilities as we continue to rely on GPS for navigation and timing.。

WAVE PTX 广播PTT系统用户指南说明书

WAVE PTX 广播PTT系统用户指南说明书

SINGLE APP. TWO MODES.Select one of two client modes: PTT Radio to emulate the experience of a conventional two-way radio, or Standard mode, which offers device-based management of contacts and talkgroups.Key Features• Group and Private PTT calls • Real-time presence• Do not disturb• Priority talkgroup scan • Background calling • Voice message fallback• Text messaging• Video, photo and file sharing • Location, mapping, and tracking • GeofencingTURN YOUR SMARTPHONE INTO A MULTI-CHANNELCOMMUNICATION DEVICE WITH THE WAVE PTX MOBILE APPPTT Radio StandardADD STREAMING VIDEO TO WAVE PTX MOBILE OR DISPATCH APPLICATIONS TO INCREASE COMMUNICATION CLARITY AND IMPROVE SITUATIONAL AWARENESS.• Continuously stream live video to other users, dispatchers or talkgroups • Simultaneously stream video and initiate/receive PTT calls • Request streaming video from other users (dispatchers only)WAVE PTX Streaming Video increases clarity and improves situational awareness, resulting in faster, more accurate communication in the moments that matter.THE WAVE PTX SAFEGUARD PACKAGE ADDS THE ADVANCEDEMERGENCY CALLING, REMOTE MONITORING AND THE LARGE TALKGROUPS NEEDED TO ENHANCE WORKER SAFETY AND IMPROVE COMMUNICATION EFFICIENCY.The optional SafeGuard Package provides WAVE PTX users with an extensive array of critical communications features to keep workers connected, informed and safe.SEE EVENTS AND ACTIVITIES AS THEY HAPPENENHANCE SAFETY AND IMPROVE EFFICIENCY• Emergency Calling & Alerting, which allows users to initiate an emergency call with the highest priority and preemption• Remote Monitoring, which makes it possible for supervisors or dispatchers to monitor the health of a user’s device, including battery level, signal strength and location• Large Talkgroups, which supports talkgroups with up to 3,000 membersKey FeaturesSTREAMLINE WORKFLOWS AND IMPROVE TEAM PRODUCTIVITYGet the communication tools you need to effectively manage and rapidly respond to incidents, events, customer requests and other situations that need immediate attention.Key Features•M onitor multiple talkgroups • Group & individual calls • Broadcast call• Supervisory override• Logging and recording • Message threads•T ext, video, photo, and file sharing • Location & mapping• Geofencing• In-map communicationWAVE PTX WIRELESS SERVICECOMBINED WITH TLK SERIES TWO-WAY RADIOSGET THE BENEFITS OF WAVE PTX APP WITH A RUGGED TWO-WAY RADIO ON A NATIONWIDE NETWORK.*You can be up and running in less than 24 hours and thanks to 4G network speeds, connections are faster and more reliable.TLK 100 PORTABLE OR TLK 150 MOBILE TWO-WAY RADIO RAPID, RELIABLE DEPLOYMENT. USE NATIONWIDE.TLK 100 and TLK 150 two-way radios provide businesses with instant push-to-talk team communications over a nationwide LTE cellular network. Maximize coverage, connections, and productivity without expanding infrastructure.Key Features• Over-the-Air device management • Powerful and slim design • Wi-Fi connectivity • Location tracking• Portable battery lasts full shift • Loud and clear audio • Private and group push-to-talk • Real-time presenceSpecificationsNetwork: 4G LTE **Powered by: WAVE PTX Channel capacity: Multi-ChannelGPS:GPS/AGPS WiFi:802.11 a/b/g/n IP rating:IP54 MIL-STD 810GFor a complete list of compatible accessories please visit /TLKSERIES*Coverage will vary. See user guide for details. **Coverage limited to USA only.MAXIMIZE EVENT RESPONSE WITH WAVE PTX AND ORCHESTRATE INTEGRATIONGET THE RIGHT INFORMATION TO THE RIGHT PEOPLE FASTER WITH ORCHESTRATE, OUR CLOUD-BASED TOOL THAT AUTOMATICALLY NOTIFIES WAVE PTX USERS WHEN AN EVENT REQUIRES ATTENTION.With the integration of WAVE PTX into Orchestrate, users can automatically receive notifications on iOS or Android smartphones, independent of location or network, when an abnormal or critical security situation occurs. WAVE PTX and Orchestrate integration streamlines your workflows, improves team productivity and increases communication efficiency. The result is less downtime and fewer breaches because it is easier and faster for teams to detect, analyze, and respond to operational events.WAVE PTX INTEGRATION WITH COMMANDCENTRAL AWARE ENTERPRISE ADD DATA INTEGRATION TO VOICE INTEROPERABILITY TO ENHANCE OPERATIONAL AWARENESS.With CommanCentral Aware Enterprise, you can access location, presence and other data for both MOTORBO and WAVE PTX devices. From one map display, you can track location and status of all personnel, regardless of location, network, or device. You can also set the reporting cadence and getalerts to emergencies. The net result is improved visibility into field operations and accelerated time to “x” – awareness, decision and response.•••Sign-up for a free WAVE PTX trial and see how connecting people and devices with PTT communications makes sense for your business and your bottom line. To get started, visit: /waveptxna Motorola Solutions Inc., 500 West Monroe St, Chicago, IL 60661 U.S.A. Subscription plans vary based on your choice of user applications and devices and MOTOTRBO radio interconnection. See current pricing at or contact your local authorized WAVE PTX dealer.WAVE PTX SUBSCRIPTION PLANSGET STARTED TODAYDOWNLOAD NOWThe WAVE PTX app is available for iOS and Android devices:。

ups面试的英文试卷

ups面试的英文试卷

ups面试的英文试卷一、听力部分(30分)1. 听一段关于UPS公司历史的短文(播放一遍),然后回答以下问题(每题5分)How long has UPS been in business?What was UPS's first service?Name one major milestone in UPS's development.What is UPS's current business focus?How does UPS contribute to the global economy?答案与解析:例如,如果短文中提到UPS has been in business for over 100 years.那么答案就是“Over 100 years.”。

解析:直接从短文中获取信息。

如果提到UPS's first service was delivering parcels by foot or bicycle.答案就是“Delivering parcels by foot or bicycle.”解析:根据听到的内容作答。

如果说A major milestone was the introduction of air delivery service.答案就是“The introduction of air delivery service.”解析:按照短文内容回答。

如果说Currently, UPS focuses on logistics and supply chain management.答案就是“Logistics and supply chain management.”解析:从听力内容得出。

如果提到UPS contributes to the global economy by facilitating international trade.答案就是“By facilitating international trade.”解析:依据听到的信息回答。

A drift-tolerant model for data management in ocean sensor networks

A drift-tolerant model for data management in ocean sensor networks

A Drift-Tolerant Model for Data Management in OceanSensor NetworksSilvia Nittel∗SIE and NCGIA,University of Maine,USAnittel@Niki Trigoni Computing Laboratory,University of Oxford,UKniki.trigoni@Konstantinos FerentinosAgricultural Univ.of Athens,Athens,Greecekpf3@ Francois Neville School of Marine Science,University of Maine,USAfneville@Arda Nural SIE and NCGIAUniversity of Maine,USAarda@Neal PettigrewSchool of Marine Science,University of Maine,USAnealp@ABSTRACTTraditional means of observing the ocean,like fixed moor-ing stations and radar systems,are difficult and expensive to deploy and provide coarse-grained and data measurements of currents and waves.In this paper,we explore the use of inexpensive wireless drifters as an alternative flexible infras-tructure for fine-grained ocean monitoring.Surface drifters are designed specifically to move passively with the flow of water on the ocean surface and they are able to acquire sensor readings and GPS-generated positions at regular in-tervals.We view the fleet of drifters as a wireless ad-hoc sensor network with two types of nodes:i)a few pow-erful drifters with satellite connectivity,acting as mobile base-stations,and ii)a large number of low-power drifters with short-range acoustic or radio ing real datasets from the Gulf of Maine (US)and the Liverpool Bay (UK),we study connectivity and uniformity properties of the ad-hoc mobile sensor network.We investigate the ef-fect of deployment strategy,weather conditions as well as seasonal changes on the ability of drifters to relay readings to the end-users,and to provide sufficient sensing coverage of the monitored area.Our empirical study provides useful insights on how to design distributed routing and in-network processing algorithms tailored for ocean-monitoring sensor networks.Categories and Subject DescriptorsH.4[Information Systems Applications ]:MiscellaneousGeneral TermsDesign∗This research was funded under NSF CAREER award No.0448183.Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.To copy otherwise,to republish,to post on servers or to redistribute to lists,requires prior specific permission and/or a fee.MobiDE’07, June 10, 2007, Beijing, China.Copyright 2007ACM 978-1-59593-765-0/07/0006...$5.00.KeywordsAd-hoc sensor networks,mobility,drifters,oceanography,geosensor networks1.INTRODUCTIONEstablishing a fine-grained model of local ocean currents is important since currents carry nutrients and other sub-stances,which affect ecosystems in coastal regions.For example,researchers are interested in establishing current models for the Gulf of Maine (US)since they distribute a specific type of algae to shellfish offthe coast of Maine during the warm summer months;the shellfish consuming the algae turn toxic for humans (’red tide’phenomenon)[1].Today,major ocean currents are established using coastal radar;however,the information is spatially and temporally too coarse.We investigate the alternative deployment of a fleet of inexpensive ocean drifters which are passively pro-pelled by the current and report their GPS-based location and trajectories to the end user.Today,large-scale sensing platforms such as stationary moorings,research vessels,costal radar (CODAR)or large gliders are state of the art in ocean monitoring.In the fu-ture,they will be combined with new technology develop-ments such as small-scale,inexpensive drifters and/or au-tonomous underwater vehicles (AUVs)such as gliders.A drifter is a small computing platform the size of a basket-ball which floats on the ocean surface,usually equipped with a long underwater peddle which moves the sensor as the ocean current moves (instead of the wind).Sensor boards can be attached to detect phenomena such as oil spills or marine microorganisms [2].In contrast to drifters,AUVs are self-propelled and determine their movement direction and travel speed in an autonomous way.Both types of plat-forms contain a battery supply,a GPS device,and wireless communication.Wireless communication media for shallow areas use acoustic signals with a communication distance of 5-10Miles (shallow water areas are regions of the ocean that do not exceed depths of 100m).Today,drifters are often deployed in a singular fashion,and use satellite communication to upload data to a cen-tralized computer.In this paper,we explore the use of a fleet of inexpensive wireless drifters as an alternative flexible infrastructure for fine-grained ocean monitoring.We view the fleet of drifters as a wireless ad-hoc sensor network withtwo types of nodes:i)a few powerful drifters with satellite connectivity,acting as mobile base-stations,and ii)a large number of low-power drifters with short-range acoustic or radio connectivity.Our objective is twofold:using afleet of small-scale sensor nodes that communicate with each other using lower-energy acoustic signals instead of a satellite up-link saves large amounts of energy.Additionally,thefleet provides more detailed information by covering an ocean re-gion in high density.The passive movement of drifters can be used to derive actual ocean current data on a detailed scale.Deploying afleet of mobile ad-hoc sensor nodes on the ocean surface to track and monitor ocean currents in a fine-grained,near real-time scale is a novel research problem, both from the perspective of computer science and oceanog-raphy.In this paper,we explore communication connectivity and sensing uniformity of afleet of a mobile ad-hoc sensor net-work using real datasets from the Gulf of Maine(US)and the Liverpool Bay(UK).The challenge is to design,build and deploy drifter platforms that despite involuntary,pas-sive movement over long time periods(up to3months) preserve energy power,long-term network connectivity,and sensing ing simulation and real datasets,we investigate the effect of deployment strategy,weather condi-tions,and seasonal current changes on the ability of drifters to relay readings to the end-users,and to provide sufficient sensing coverage of the monitored area.Our empirical study provides useful insights on how to design distributed rout-ing and in-network processing algorithms tailored for ocean-monitoring sensor networks.The remainder of the paper is organized as following:Sec-tion2provides relevant technical background on the current state of the art of ocean sensor networks,drifter platforms and wireless communication technology for water environ-ments.Section3explores the research questions and the approach of this paper in more detail.Section4contains our experimental results and we conclude with Section5.2.BACKGROUNDIn this section,we review the current state of the art in ocean observation research.The research can be roughly di-vided into deep sea exploration using submarines and ocean bottom sensor platforms and robots connected by optical fiber cable(e.g.NEPTUNE[3]).Another large research area is in near-coastal observations usingfixed large,sensor-equipped buoys like the moorings in the Gulf of Maine or Liverpool Bay,and extend the environments with coastal radar,gliders,and research vessels.Our interest in ocean surface drifters is with regard to near-coastal deployments in order to investigate these currents in greater detail. 2.1Ocean driftersToday,several projects and platforms for shallow water drifters exist.Thefirst deployments of drifters were in the Gulf of Mexico and the Southwestern Caribbean Sea de-signed to explore the Gulf Stream in more detail.In1998, so-called YOTO Drifters were deployed to collect informa-tion about this North Atlantic currentflow in more detail. Today,the international ARGO project[2]is one of the largest deployments of drifters in the world oceans.ARGO is an international program that began in2000,and by2007 the deployment of3000profiling drifters will be about100% complete.The purpose of ARGO is to examine the global currents,circulation and air-sea interaction,with the goalof improving climate models and predictions.Partners in the National Ocean Partnership Program(NOPP)/ARGO program include the University of Washington,the Scripps Institution of Oceanography in San Diego,the Woods Hole Oceanographic Institution,and others.The Argo Drifter(also called”Davis Drifter”)was de-signed to be a surface level(1meter below surface)La-grangian drifter which can report position via the Argos satellite-based data collection system.Location determina-tion by GPS is also available.The unit consists of a central sealed tube which contains the electronics and power pack with a nominal operating life of9months.Argo augments existing upper-ocean observing networks,and extends their coverage in space and time,their depth range and accuracy, and enhances them through the addition of velocity mea-surements.The global array of3,000floats is distributed roughly every3degrees(300km).Since1993,the Minerals Management Service(MMS)has deployed over800satellite-tracked Davis drifters to measure the surface ocean currents in areas of active or prospective oil and gas leasing,primarily in the coastal waters in the Gulf of Mexico[4].Currently,drifters are deployed in a singular fashion,and each drifter reports data via expensive satellite uplink in-stead of to other drifters or data mules(such as gliders, buoys or ships).The topic offleets of surface level drifters using inexpensive acoustic,radio or optical communicationis today a interesting research topic.Networks of mobile wireless sensor nodes,however,are currently being investigated in shallow and deep sea applica-tions such as the NEPTUNE project.For example,the Star-bug Aquaflecks and Amour AUV,developed by MIT,are an underwater sensor network platform based on Fleck motes developed jointly by the Australian Commonwealth Scien-tific and Research Organization(CSIRO)and MIT CSAIL [5].The4in long Aquaflecks are combined with a mobile Amour AUV which acts as a data mule to retrieve data from the different sensor nodes.The Amour AUV uses2typesof communication medium,i.e.an acoustic modem for long range communication and optical modem for short range. The WHOI acoustic modem has a data rate of220bits/s over5000m,while the Aquacomm acoustic modem has a throughput of480bit/s with range of over200m consuming 4.5mJ/bit.2.2Wireless communication networks for oceanenvironmentsTypically,underwater sensor nodes are connected to a net-work’s surface station which connects to the Internet back-bone through satellite communication or an RF link.The sensor nodes located in shallow or surface waters use diverse wireless communication technologies such as radio,acoustic, optical or electromagnetic signals.The different technolo-gies vary with regard to communication range of the sender, data rate per second(data propagation speed),energy con-sumption and robustness with regard to noise or interference (such as Doppler effects)[6].Radio signals are used in shallow water sensor networks, however,the travel speed of radio signals through conductive sea water is very low,i.e.about at a frequency of30-300Hz. Experiments performed at the University of Souther Cali-fornia using Berkeley Mica2Motes have reported to have atransmission range of120cm in underwater at a433MHz radio transmitter[7].Optical waves do not suffer from such high attenuation but are affected by scattering.Also,trans-mission of optical signals requires high precision in pointing the narrow laser beams,which is less practical in water. Basic underwater acoustic networks(UWA)are the most commonly used communication media for water-based sen-sor networks[8,9].Acoustic communication is formed by establishing two-way acoustic links between various sensor nodes.UWA channels,however,differ from radio channels in many respects.The available bandwidth of the UWA channel is limited,and depends on both range and fre-quency;the propagation speed in the UWA channel isfive orders of magnitude lower than that of the radio channel. UWA networks can be distinguished into very long range, long,medium,short and very short communication range. As a rule,the shorter the communication range,the higher the bit rate.Typical ranges of acoustic modems vary be-tween10km to90km in water.Furthermore,acoustic net-works can be classified as horizontal or vertical,according to the direction of the sound wave.There are also differences in propagation characteristics depending on direction.Fur-thermore,acoustic signals are subject to multipath effects [10],large Doppler shifts and spreads,and other nonlinear effects.Acoustic operation is affected by sound speed.Overall, the bit rate in water is aboutfive orders of magnitude lower than in-air transmission.Sound speed is slower in fresh wa-ter than in sea water.In all types of water,sound veloc-ity is affected by density(or the mass per unit of volume), which in turn is affected by temperature,dissolved molecules (usually salinity),and pressure.Today,the desired informa-tion transmission rate in the network is100bit/s from each node.The available(acoustic)frequency band is8-15kHz. Uncertainty about propagation delays is typical of acoustic rmation is transmitted in packets of 256bits,and nodes transmit at most5packets/h.Typical deployment of nodes can be as drifters or mounted on the ocean bottom,and separated by distances of up to10km [11].2.3Data management for ocean sensor net-worksDrifters are deployed to continuously collect data.At min-imum,the end user is interested in the trajectory of the drifter itself since it contains relevant information about the ocean dynamics in the area covered.Furthermore,drifter platforms can be equipped with diverse sensors to sample the water.Today,salinity and temperature sensors are the most commonly used sensors.Drifter platforms can also carry accelerometers to measure wave speed or water ac-celeration for tsunami detection.Biological sensors detect marine microorganisms such as algae species and distribu-tion.Currently,drifters sense,store,and aggregate data locally until it is uploaded once a day via satellite connection to a centralized computer.Today,point sampling is common;re-gion sampling via several collocated drifters during the same time period is rare.Typically,local data logger applications are run that contain limited processing and computing intel-ligence.Data collection isfile-based,and reported in batch mode.3.PROBLEM DEFINITION3.1Research StatementConsider a set of n drifters D={d1,...,d n}deployed in the ocean to monitor a coastal area of interest.Let (t i,x i,y i)be the time and location of initial deployment of drifter d i.Drifters are designed to be passively propelled by local currents,are location-aware(using GPS),and are equipped with a variety of sensor devices to monitor differ-ent properties of the ocean surface.All drifters have local wireless communication capabilities that allow them to ex-change messages with other drifters within range R1.A subset of the drifters(B⊆D)also has satellite connectivity, which allows them to propagate sensor data to oceanogra-phers and other interested users around the globe.We refer to these special-purpose drifters as mobile base-stations,or simply base-stations.We thus view the set of drifters as a hierarchical mobile ad hoc network,wherein simple drifters forward their readings hop-by-hop to one of the mobile base-stations.In order to predict drifter movement,we use a dataset CUR of coarse-grained radar measurements of current speed and current direction.Radar measurements are taken at regular intervals(e.g.every1hour)at various junction points of a grid spanning the area of interest(e.g.one pair of (speed,direction)measurements per4km×4km grid cell). Current speed and direction conditions at all other loca-tions are estimated using spline two-dimensional interpola-tion.Based on these current speed and direction measure-ments,we evaluate drifter locations over time,and we use the resulting trajectories as input to our simulations.In a real setting,drifter trajectories would be derived directly via GPS.In this paper,we focus on empirically quantifying two aspects of drifter behavior:communication connectivity and sensing coverage.Communication connectivity:We use two metrics of communication connectivity:i)one-hop connectivity of a drifter,which is the percentage of drifters within communi-cation range of that drifter,and ii)multi-hop connectivity of the network,which is the percentage of drifters that can reach at least one of the base-stations on a multi-hop path. One-hop connectivity provides useful insight into whether drifters travel in clusters,or whether they disperse quickly out of each other’s range soon after they are deployed in the ocean.Multi-hop connectivity is useful for quantifying the ability of drifters to relay their readings hop-by-hop to one of the base-stations,and eventually to the end-users. Sensing coverage:We use two metrics of sensing coverage: i)sensing density,which is the number of connected drifters with multi-hop connectivity within the area of interest and ii)sensing uniformity,which denotes whether drifters are uniformly dispersed in the area of interest or congested in a small part of it.To quantify sensing uniformity,we adopt the definition of MRD(Mean Relative Deviation)proposed by Ferentinos and Tsiligiridis[12]:1In reality,the communication range is not a perfect circle, and the delivery ratio depends not only on the distance,but on a variety of environmental conditions.We leave the study of realistic communication models in ocean environments for future work.0.1 0.2 0.3 0.4 0.5 0.6 0.7 0 50 100 150 200 250 300 350 400o n e -h o p c o n n e c t i v i t y5-min time-step1st drifter 2nd drifter 3rd drifter0.10.2 0.3 0.4 0.5 0.6 0.7 0 50 100 150 200 250 300 350 4005-min time-step4th drifter 5th drifter 6th drifter0.10.2 0.3 0.4 0.5 0.6 0.7 0 50 100 150 200 250 300 350 4005-min time-step7th drifter 8th drifter0.10.2 0.3 0.4 0.5 0.6 0.7 0 50 100 150 200 250 300 350 4005-min time-step9th drifter 10th drifterFigure 1:One-hop connectivity:Percentage of drifters within communication range (1mile)of each drifter (Liverpool Bay)MRD =P Ni =1|ρS i −ρS |NρSwhere N is the number of equally-sized overlapping sub-areas that the entire area of interest is divided into.Sub-areas are defined by four factors:two that define their size (length and width)and two that define their overlapping ra-tio (in the two dimensions).In the formula above,ρS i is the spatial density of connected drifters within sub-area i and ρS is the spatial density of connected drifters in the entire area of interest.Thus,MRD is defined as the relative mea-sure of the deviation of the spatial density of drifters in each sub-area to the spatial density of drifters in the entire area of interest.Perfect uniformity (MRD=0)is achieved when each sub-area has the same spatial density as that of the entire area of interest,while higher MRD values correspond to lower uniformity levels of drifters.Given the set of drifters D deployed at specific times and locations,the subset of base-stations B and a real dataset of current information CUR that determines drifter trajec-tories,we would like to address the following questions:•How is the one-hop connectivity of a drifter affected by the communication range,deployment location and deployment period?•How is the multi-hop network connectivity affected by the number of base-stations,deployment location and deployment period?•How is sensing density affected by the deployment lo-cation and deployment period?•How is sensing uniformity affected by the deployment location and deployment period?3.2Application BackgroundMarine microorganism such as phytoplankton are exceed-ingly small (2-3μm),and are distributed at varying den-sity in the ocean water.The 2005bloom of Alexandrium fundyense at the New England coast was the most widespread outbreak of ’red tide’since a hurricane in 1972spread the toxic algae throughout southern New England;the phe-nomenon received its name for the rust color that intense concentrations of algae sometimes paint ocean water.The type of red tide algae in New England contaminates shell-fish,and can make people who eat the shellfish sick.In most years,Alexandrium fundyense grows to toxic lev-els in Penobscot Bay and Casco Bay in Maine and in Canadas Bay of Fundy.The more intense blooms can lead to the shut down of clam,oyster,and mussel beds to avoid paralytic shellfish poisoning of humans.The potent neurotoxin from Alexandrium accumulates in the meat of filter-feeding bi-valves.While it does not harm them,it can cause paralysis and respiratory problems in humans and other animals that eat the shellfish.In 2005,concentrations of toxic algae reached levels 40times the norm,and the plants spread southward to regions of Cape Cod Bay,Massachusetts Bay,Nantucket Sound,and Buzzards Bay that are usually not affected by this species.Shellfish beds in Massachusetts,Maine,and New Hamp-shire,as well as 15,000square miles of federal waters,were closed for more than a month at the peak of the seafood harvesting season.Since the distribution of the algae is mainly influenced by ocean currents,our objective is to find out more in-formation about ocean surface current dynamics by using current-propelled drifters.The floating drifters can have sensors attached,which measure algae occurrence.Overall,this information and ocean drifter network can be used as a monitoring,and early warning for red tide dangers.4.SYSTEM EV ALUATION 4.1Experimental setupIn order to empirically address the questions posed in Sec-tion 3,we considered two realistic scenarios of deploying drifters in Liverpool Bay (UK)and the Gulf of Maine (USA).We used real datasets of surface current measurements mon-itored in the two coastal areas,to infer how drifters would move under the influence of these currents.Liverpool Bay dataset:This data has been provided by the Proudman Oceanographic Laboratory Coastal Observa-tory Project,and it was measured by a 12-16MHz WERA HF radar system,which has been deployed to observe sea surface currents and waves in Liverpool Bay.In our sim-ulations,we use current direction and current speed data measured hourly at the junction points of a 8×11grid.The size of each grid cell is 4km ×4km ,and thus the size of the monitored area is 28km ×40km .Current speed and direc-tion conditions at locations inside the grid (other than the grid junctions)are estimated using two-dimensional spline interpolation.Drifter locations are estimated every 5min-0.2 0.4 0.6 0.8 1a v g o n e -h o p c o n n e c t i v i t y5-min time-stepFigure 2:Effect of communication range on average one-hop connectivity (Liverpool Bay)utes.We simulate the deployment of 10drifters from a single point,one drifter at a time at 1-hour intervals.Our simu-lations typically last for 1.5days,which corresponds to 4325-min time-steps.The default communication range is set to 1mile and the default initial deployment location to 10km east and 4km north from the bottom left point of the grid.Gulf of Maine dataset:This data was provided by the University of Maine’s Physical Oceanography Group,cover-ing four months (March,June,September and December)of 2005.It was measured by a 4.3-5.4MHz SeaSonde HF radar system,which is deployed to observe sea surface currents in the Gulf of Maine.In our simulations,we use current direc-tion and current speed data measured hourly at the center of cells in a 36x24grid.The size of each grid cell is 16km x 16km.Current speed and direction conditions at locations throughout the grid (other than at cell centers)are esti-mated using two-dimensional Gaussian interpolation.We simulate the deployment of 10or more drifters from a single point,one drifter at a time at 1-hour intervals.Our simu-lations generally last for 30days,which corresponds to 7201-hr time-steps.The default communication range is set to 1mile and the default initial deployment location to:Lat.43.5◦N,Long.−67◦W.4.2One-hop connectivityA drifter evaluates its one-hop connectivity by dividing the number of drifters within its communication range by the total number of drifters excluding itself (neighbors /9).Figure 1shows the one-hop connectivity of each one of the 10drifters as time elapses,assuming a communication range of 1mile.Since drifters are deployed every hour and time-steps last 5minutes,the 1st drifter is deployed at time-step 0,the 2nd at time-step 12,and the 10th at time-step 108.From time-step 108to 432,observe that most drifters have 2to 3immediate neighbors,with the exception of the 7th drifter,which has zero connectivity most of the time.For the particular 1.5-day deployment period,Figure 1shows no consistent change in one-hop connectivity for all drifters as time passes,hence no clear trends of drifter dispersion or clustering.Effect of communication range:To further investigate this,we measure average one-hop connectivity of the 10drifters,and examine the impact of communication range on connectivity.Figure 2confirms what the average one-hop connectivity does not deteriorate with time,except when0 0.10.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 150100 150 200 250a v g o n e -h o p c o n n e c t i v i t y1-hr time-stepcomm. range 0.5 miles comm. range 1 mile comm. range 2 miles comm. range 4 milesFigure 3:Effect of communication range on average one-hop connectivity (Gulf of Maine)0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6a v g o n e -h o p c o n n e c t i v i t y5-min time-stepFigure 4:Effect of deployment location on average one-hop connectivity (Liverpool Bay)the communication range is relatively low (R=0.5mile).In addition,one-hop connectivity does not increase quadrati-cally with the communication range as one would expect if drifters were uniformly distributed in the coastal area.In fact,increasing the communication range from 2to 4miles has only a small impact on the size of drifter neighborhoods.One-hop connectivity results in the Gulf of Maine (Figure 3)are also largely similar,as one might expect.In nearly all cases,however,one does observe a sharp decrease in con-nectivity begin within the first 48hours.Effect of deployment location:The previous two simu-lations concerned the same initial deployment location and deployment period.In order to draw more general con-clusions about drifter behavior,we proceeded to evaluate the spatial and temporal variations of one-hop connectivity.Figure 4shows one-hop connectivity values at different ini-tial deployment locations;these values are averaged over all drifters during a particular deployment period.First,ob-serve that the deployment location plays an important role in predicting the sizes of drifter neighborhoods.For exam-ple,if drifters are deployed at [23km,4km ]they are likely to quickly cluster together and form a fully connected graph,whereas if they are deployed at [20km,12km ]they have at most 1to 2neighbor drifters on average.Designers of ocean sensor networks should take this variability into account in order to select a deployment location that will yield suffi-cient connectivity for their purposes.0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6a v g o n e -h o p c o n n e c t i v i t y5-min time-step Figure 5:Effect of deployment period on average one-hop connectivity (Liverpool Bay)0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 020406080100120140a v g o n e -h o p c o n n e c t i v i t ytime steps (1 hr)March June September DecemberFigure 6:Effect of deployment period on average one-hop connectivity (Gulf of Maine,comm.range =1mile)Effect of deployment period:Surface currents,and thus drifter movements,are influenced by weather conditions,and thus vary across different time periods.Figure 5mea-sures one-hop connectivity at different 1.5-day deployment periods,averaged over 10drifters deployed from a particular location.Depending on the deployment period,a drifter is shown to have from 2to 9drifters within a 1-mile range.In certain deployment periods (e.g.on days [1−2.5]),the av-erage drifter connectivity remains relatively stable,whereas in others (e.g.on days [3−4.5]),it increases with time.In most periods,we observe signs of drifter clustering,rather than drifter dispersion.Temporal variability is also seen in the Maine simulations (Figure 6),where drifters deployed in the winter maintain their clusters longer than those de-ployed in the summer,indicative of the comparatively slower ocean current velocities occurring in the Gulf of Maine at that time of year.In future work,it would be interesting to associate one-hop connectivity values with weather con-ditions (e.g.wind and temperature)in order to be able to schedule drifter deployment in suitable time periods.Effect of cluster deployment:We simulated deploying all drifters at the same time at a single point in the Gulf of Maine to test its effect on connectivity as compared to interval-based deployment.Figure 7shows that single-hop connectivity declines precipitously in the first fifty hours,as we have come to expect,and all connectivity is lost within0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1100200300400 500 600 700 800o n e -h o p c o n n e c t i v i t ytime steps (1 hr)10-drifter cluster 25-drifter cluster 50-drifter cluster 100-drifter clusterFigure 7:Effect of number of drifters deployed hourly at the same location (Gulf of Maine)0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 050100150200 250 300 350 400m u l t i -h o p c o n n e c t i v i t y p e r b a s e -s t a t i o n5-min time-stepbase-station 1 (1st drifter)base-station 2 (4th drifter)base-station 3 (7th drifter)Figure 8:Multi-hop connectivity per base-station drifter (Liverpool Bay)the first few days.However if the drifters are deployed in larger groups (e.g.50-100)then some connectivity can still be observed up to a month later.4.3Multi-hop connectivityThe experiments on one-hop connectivity showed that drifters rarely form a fully-connected network.In order to send their sensor readings to the end-users they must ei-ther be base-station drifters with satellite connectivity,or relay their readings hop-by-hop to one of the base-station drifters.Out of the 10drifters,we consider that up to 3drifters (1st,4th and 7th)act as base-stations.Figure 8shows the percentage of drifters attached directly (through one hop)or indirectly (through multiple hops)to each one of the three base-stations.All drifters are deployed from the same default location [10km,4km ]during days [1−2.5]and the default communication range is 1mile.Between time-steps 110and 250,the three base-stations form three disjoint clusters;after time-step 250,the two clusters led by base-stations 1and 3,merge into one cluster with multi-hop connectivity oscillating between 30%and 60%.Effect of number of base-stations:The question that arises is how many base-stations we need to ensure multi-hop connectivity close to 100%.By summing up multi-hop connectivities for all base-stations in Figure 8,we observe that the first base-station alone is able to keep up to 50%of the drifters connected.The second base-station increased。

视觉定位 英语

视觉定位 英语

视觉定位英语Vision-Based LocalizationVision-based localization is a fundamental problem in the field of computer vision and robotics, with numerous practical applications, such as autonomous driving, augmented reality, and indoor navigation. The ability to accurately determine the position and orientation of a camera or a robot within a known environment is crucial for these applications, as it enables precise interaction with the surrounding world.One of the key challenges in vision-based localization is dealing with the inherent uncertainty and variability present in real-world environments. Factors such as changes in lighting conditions, occlusions, and dynamic objects can significantly affect the accuracy and reliability of the localization process. To address these challenges, researchers have developed various techniques and algorithms that leverage the power of computer vision and machine learning.One common approach to vision-based localization is the use of feature-based methods. These techniques rely on the identificationand matching of salient visual features, such as corners, edges, or distinctive texture patterns, between the current camera image and a pre-existing map or database of the environment. By matching these features, the system can estimate the position and orientation of the camera relative to the known environment. This approach has been widely used in various applications, including simultaneous localization and mapping (SLAM) systems, where the robot or camera simultaneously builds a map of the environment and localizes itself within that map.Another approach to vision-based localization is the use of direct methods, which operate directly on the pixel values of the camera image, without the need for explicit feature extraction. These methods often employ optimization techniques to align the current camera image with a reference image or a predicted image based on a known 3D model of the environment. Direct methods can be more robust to changes in lighting and texture patterns, as they do not rely on the stability of specific visual features.In recent years, the rise of deep learning has revolutionized the field of vision-based localization. Convolutional neural networks (CNNs) have shown remarkable success in tasks such as image classification, object detection, and semantic segmentation, which can be leveraged for localization. Deep learning-based methods can learn end-to-end mapping functions that directly relate camera images tothe corresponding pose information, without the need for explicit feature extraction or matching. These techniques have demonstrated impressive performance, particularly in challenging environments with significant perceptual aliasing or dynamic changes.One of the key advantages of vision-based localization is its versatility. Unlike other localization methods that rely on dedicated hardware, such as GPS or radio-based systems, vision-based techniques can leverage the ubiquity of cameras in modern devices, from smartphones to autonomous robots. This allows for the deployment of localization solutions in a wide range of environments, including indoor spaces, where other localization approaches may be less effective.However, vision-based localization also faces several challenges that need to be addressed. For example, the accuracy and reliability of the system can be affected by the quality and resolution of the camera, as well as the complexity and dynamics of the environment. Additionally, the computational requirements of the localization algorithms can be significant, particularly when dealing with high-resolution images or complex 3D models.To address these challenges, researchers are actively exploring various techniques to improve the performance and efficiency of vision-based localization systems. This includes the development ofmore robust and adaptive algorithms, the use of multiple sensors (e.g., combining vision with inertial measurement units), and the optimization of computational resources through techniques like hardware acceleration or distributed processing.As the field of computer vision and robotics continues to evolve, the importance of accurate and reliable vision-based localization will only grow. With the increasing demands for autonomous systems, augmented reality applications, and the need for seamless indoor and outdoor navigation, the development of advanced vision-based localization techniques will play a crucial role in shaping the future of these technologies.。

定位用英语怎么说

定位用英语怎么说

定位用英语怎么说定位,指确定或指出的地方;确定场所或界限给这个地产的界限定位。

正确的定位十分重要,那么你知道定位用英语怎么说吗?下面店铺为大家带来定位的英语说法,欢迎大家参考学习。

location英 [ləuˈkeiʃən] 美 [loˈkeʃən]position英 [pəˈziʃən] 美 [pəˈzɪʃən]产品定位 product positioning定位圈 locating ring无线电定位 radio positioning定位服务 Location Service雷达定位 radar location从对象信息定位对象分配的行To locate object allocation line from the object information FourSquare是手机定位数据领域的领导者。

Foursquare is the leader in mobile location data.从这一点出发,将自己定位成一位问题解决者。

From that point, position yourself as problem solver.磁性定位棒及定位尖顶定位自由。

Magnetic bars and tips fix the position freely.讨论了算法的容错性,通过对重定位量加以限制,避免了严重错位引起的重定位阶跃失真。

A gray threshold is set to avoid the influence of the noise in crosscorrelation.基因定位指的是疾病的基因定位在人类基因图谱。

Gene mapping refers to the localization of disease genes on the human gene map.专门设计制做了磁块测量平台架,包括铜制标准定位基座及定位磁针。

A special designed measurement stand and a locating magnetic pin are made.通过求图像最大灰度值方法完成太阳定位,简化了定位算法;It predigests the tracking arithmetic by finding the most grey value.他回答说他正在用销钉定位器给墙壁装定位销。

Adaptive Embedded Roadmaps For Sensor Networks

Adaptive Embedded Roadmaps For Sensor Networks Gazihan Alankus,Nuzhet Atay,Chenyang Lu,O.Burchan BayazitWashington University in St.Louis{gazihan,atay,lu,bayazit}@Abstract—In this paper,we propose a new approach to wire-less sensor network assisted navigation while avoiding moving dangers.Our approach relies on an embedded roadmap in the sensor network that always contains safe paths.The roadmap is adaptive,i.e.,it adapts its topology to changing dangers. Mobile robots in the environment use the roadmap to reach their destinations.We evaluated the performance of embedded roadmap both in simulations using realistic conditions and with real hardware.Our results show that the proposed navigation algorithm is better suited for sensor networks than traditional navigationfield based algorithms.Our observations suggest that there are two drawbacks of traditional navigationfield based algorithms,(i)increased power consumption,(ii)mes-sage congestion that can prevent important danger avoidance messages to be received by the robots.In contrast,our approach significantly reduces the number of messages on the network (up to160times in some scenarios)while increasing the navigation performance.I.I NTRODUCTIONTraditionally,mobile robots rely on on-board sensors to collect environmental information.However,as the technical challenges of wireless sensor networks are being solved,a new interest is raised to employ them in the robot nav-igation task.It has been shown that the assistance of a sensor network could significantly improve the navigation task when there are dynamically moving dangers to avoid in the environment[1].However,any navigation algorithm utilizing sensor networks must consider the limited resources provided by the network,mainly low bandwidth,small bat-tery and limited processing power.This requires intelligent approaches that can utilize the hardware efficiently.In this paper,we propose Adaptive Embedded Roadmaps (AER)as a new approach to sensor network assisted navi-gation.The problem is to navigate safely in a dangerfield, i.e.,to reach a goal from a starting point while avoiding dynamic danger regions.This requires routes to be updated continuously to avoid the dangers.Our solution is to embed a roadmap inside the sensor network that will maintain a collection of possible paths.This roadmap is built in the sensor network using a distributed fashion similar to the probabilistic roadmap method(PRM)[2].First,some motes probabilistically become roadmap nodes,i.e.,mile-stone motes.Through message passing,these motes connect themselves to the nearby milestone motes.The optimal mes-sage route between two milestones becomes an edge of the roadmap.When a goal is specified,the embedded roadmap creates a spanning tree from all milestone motes to the goal in a distributed fashion,which is in turn followed by one or more robots.Since the environment is dynamic,the network is adaptive.For example,if a mote on an edge is in danger, the edge is disconnected and an alternative edge is built. Similarly,if a milestone mote is in danger,the roadmap node it hosts is migrated to a nearby non-milestone mote and the connections are rebuilt.We also address the physical obstacle problem by using a lazy approach[3].While following the embedded roadmap,if a robot discovers a physical obstacle, the robot informs the milestone motes that have the edge over the obstacle.Those motes then disconnect themselves and the robot is directed to an alternative path. Remember that wireless sensor network assistance to robot navigation can be classified into two groups:(i)on-board processing,(ii)in-network processing.In thefirst approach,the sensor network transfers the spatio-temporal information to the robot and the robot makes navigation decisions.The number of messages are proportional to the number of sensor motes involved in data collection,which can be too large.Certain techniques are suggested to target interesting locations[1],but they ultimately have to deal with a certain vicinity of the robot.The second approach to sensor network assisted navigation aims tofind the path in the sensor network using the limited computing power of sensor motes in a distributed fashion[4],[5].The straightforward technique is to build a navigationfield over the sensor motes to reach the goal.While this approach is sufficient in the presence of static danger regions(i.e.,dangers that are not spreading),thefield needs continuous update in the presence of moving dangers.This may cause high network congestion, as shown in[6].Our approach has several advantages over the traditional approaches.It targets the embedded network similar to target based strategy of on-board processing,yet it is not restricted to the local regions.It uses the global spatio-temporal information similar to in-network processing,but it does not constantly update a global navigationfield.The routes include only a subset of the motes and are updated only when safety of the embedded roadmap changes.This way, the reduced message traffic increases both sensor life and improves navigation safety by avoiding network congestion. Additionally,since only the motes that are part of the roadmap need to be active,the other motes can sleep to reduce power consumption.With the help of the robots that use the sensor network,our approach can also address obsta-cles that are invisible to the sensors,an important point that the traditional in-network algorithms fail to consider.Finally, the embedded roadmap could be utilized to coordinate the movements of the multiple robots.We have experimented with several scenarios including multiple robots,multiple goals,dynamic obstacles,static obstacles,hardware failures etc.Our simulations show that under realistic conditions our algorithm performed far better than traditional in-network processing algorithms.We have also showed that it is feasible to implement our algorithmon real hardware.Our results demonstrate that(1)an embedded adaptive roadmap can be used to represent spatio-temporal informa-tion of an environment,(2)such a roadmap can safely guide a mobile robot towards its destination at a small fraction of communication cost compared to basic sensor network assisted navigation algorithms.In the next section,we give a summary of related work. We present a formal definition of the problem in Section III. We briefly describe our system in Section IV.Section V discusses how to build,maintain and utilize an adaptive roadmap on sensor networks.We present our experimental results in Section VI and Section VII concludes our paper.II.R ELATED W ORKThe most commonly used algorithms for sensor network assisted navigation use a global navigationfield over the sen-sors.In[4],the goal generates an attractive potentialfield that pulls the robot towards the goal,while an obstacle generates a repulsive potentialfield that pushes the robot away from the obstacle.The method in[7]locally iterates to compute utilities that guide the robot to the goal.This approach is further used in[8],[9]and[10]for robot coverage and exploration of space and for multi-robot task allocation.In[11],a similar method is analyzed.The approach presented in[12]proposes navigation of mobile sensor nodes by forming initial paths with a globalflooding.Since initial path stays constant,this approach cannot handle dynamic obstacles.The approach used in[13]assumes that a path already exists in the network,and uses controlledflooding to guide the robot to the start of the path.Another global navigationfield approach is suggested in[5]for sensorless communication platforms using GNATs.In that approach,the passing mobile robots communicated the attraction information to GNATs which in return updated the navigationfield.Generally,the navigationfield based algorithms can be very costly in large networks with dynamic obstacles since any update on thefield requires a globalflooding.In order to reduce the communication cost,the targeted querying protocols were suggested[1],[6].In these approaches,the sensors send the spatio-temporal information to the robot and robot makes the navigation decisions.Generally,navigationfield based techniques increase the power consumption and require large bandwidths.Both of which are decisive factors in sensor network performance. The targeted querying algorithms do not suffer from these constraints but they usually target nearby locations,i.e., only collect information from robots’vicinity which may affect navigation performance.In our work,we address the shortcomings of both approaches.Through embedded roadmap,we have a targeted navigationfield that can safely move the robots to their destinations in the presence of dynamic obstacles.Recently,Buragphain et al.proposed navigation algo-rithms based on the skeleton graph of a sensor network[14]. Similar to a roadmap,a skeleton graph is a sparse subset of the original network,which helps reduce the communication overhead for navigation.However,a distinguishing feature of our algorithm is that it dynamically maintains and adapts the roadmap in response to the movement of dangerfields to order to enhance the robustness of navigation approach in dy-namic environments.In contrast the algorithms presented in [14]did not present algorithms for maintaining the skeleton graphs when the dangerfield moves.Furthermore,we have implemented and demonstrated our algorithm on a physical sensor network testbed,while their algorithms are evaluated through simulations.III.P ROBLEM F ORMULATIONThe navigation problem that we address in this paper is tofind safe paths for mobile robots through a sensorfield. We define a safe path as a path that is clear of dynamic obstacles,i.e.,obstacles whose location or shape changes with time(e.g.car,fire).In this paper,we considerfire as the representative exam-ple for a dynamic obstacle.Thus,the temperature of the region traversed by a robot is a function of time and is affected by the location and movement offire.In this case, the problem can be restated as that offinding safe paths for mobile robots,from start to goal,without the robots getting burned.The temperature values of a region is discretized to different danger levels using a number of thresholds∆i.The danger levelδbetween∆i and∆i+1is considered to be i. The number and value of thresholds are application specific design choices.In this paper we used four thresholds as follows.δ=0(cool)(if T,i.e.,temperature of the region,is less than∆cool),δ=1(normal)(if∆cool<T≤∆normal),δ=2(warm)(if∆normal<T≤∆warm),δ=3(hot) (if∆warm<T≤∆hot),δ=4(burn)(if∆warm<T≤∆burn)andδ=∞above∆burn,where the sensor hardware no longer functions.This discretization is useful since it avoids messages generated by slight changes in temperature.A sensor or robot is assumed to get burned if the tem-perature at its location is higher than the threshold∆burn.A safe path is now redefined as one where the maximum temperature along the path taken by the robot remains below the threshold∆hot,while the robot is on the path.Cooler paths are thus considered safer than hotter paths.The goodness of path I P that passes through motes(i.e., wireless sensor nodes)m i∈1..n is defined by following function:goodness(I P)=c1( i∈2..n|m i−m i−1|)+c2max i∈1..nδi(1) In other words,the goodness of path is the sum of the normalized path length and scaled maximum danger level on the path.By changing the variables c1and c2,the path can be weighted for the length or safety.We make the following assumptions in the paper:(i) Motes are location aware.(ii)The robot communicates with the sensor network through an on-board gateway device. (iii)Motes have a limited sensing range R S.(iv)Wireless communication between motes takes place in afixed-radius cookie-cutter radio model with message congestion.The sensing range R S is defined by the continuous behav-ior of danger.It is chosen such that if the temperature sensed by a node is below the threshold∆i,then the temperature at any point within the sensing range is below∆i+1.Therefore, paths with sensed temperature above∆hot may have points above∆burn,which explains our choice of safe paths being below∆hot.Note that,if the motes do not have location sensors (e.g.,GPS or crickets[15]),they mayfind their locations based on network connectivity or radio signal strength using existing localization algorithms[16],[17].Alternatively,our navigation algorithm can be modified to use Adaptive Delta Percent[7]that utilizes sensor signal strength,in which case we would not need location awareness for the motes. Even though we consider the specific scenario where the dynamic obstacle isfire,our solution can be generalized to other types of dynamic environments where safety is defined by changing sensory values(e.g.,chemical spills,hazardous gas and air pollution).Fig.1.System overview.IV.S YSTEM O VERVIEWIn order to assist the robot navigation,the sensor network must have some abstract mechanisms.For example,there must be some mechanisms for node generation and node connection to build an embedded roadmap.After it is built, the sensor network also needs a maintenance mechanism to keep the embedded roadmap up-to-date.Finally,when a robot asks for a path,the sensor network needs tofind an optimal route to the goal through Goal Potential mechanism. Figure1summarizes the interaction within the network and with the robots.After node generation,connection builds the roadmap.Maintenance may revoke connection to disconnect some edges that are in danger,orfind alternative edges. When the robot arrives,itfinds a path to the embedded roadmap through connection mechanism.Goal Potential mechanism is responsible forfinding the best path to the goal.The embedded roadmap then directs the robot towards the goal.While following the path,if the robot discovers an obstacle that is invisible to sensor network’s sensors,it informs the embedded roadmap and an alternative route is found.V.S ENSOR N ETWORK A SSISTED N AVIGATION After the initial deployment of the sensor network,the embedded roadmap is built in a distributed fashion.Node generation is handled by turning some motes to milestone motes(i.e.,motes that contain a roadmap node).The connec-tion phase is a local planning operation where the milestones broadcast connection request to their vicinity.This request is further propagated by receiving motes.The propagation continues until requests from two milestones intersect.In which case,the mote at the intersection sends connection messages to both originators.Among several possible con-nections between two milestones,the best path(according to Eqn.1)is selected as the edge.Once the roadmap is built,a robot can utilize it to navigate.Since the robot is not aware of the topology of the roadmap,the sensor network mustfind the best path.For this purpose,we use an NF2-like[18]wavefront expansion on the roadmap.First,through geographic routing[19],the robot asks the mote closest to its goal(i.e.,goal mote)to connect itself to the roadmap.Once the goal mote is connected to the embedded roadmap,it originates a potential wave on the roadmap where the potential value represents the goodness of the path.When the wave reaches a milestone mote,the milestone sets the best direction towards the goal.At the same time,the robot requests a connection to the roadmap. After receiving several responses from the nearby milestone motes,then the robot selects the best route and follows it. When the robot reaches a milestone mote,the mote directs it towards the next mote in the path.This process is repeated until the robot reaches its goal.Our embedded roadmap is adaptive and changes based on the spatio-temporal information.The topology and the edge weights are altered if the danger spreads towards the roadmap,hence the roadmap always contains safe paths.If the robot on its path recognizes an obstacle unknown to the sensors,it informs the embedded roadmap to remove edges on theobstacle.(a)(b)(c)(d)(e)(f)Fig. 2.Building embedded roadmap.(a)Milestones motes, (A,B,C),start neighbor discovery.(b)N EIGHBOR-D ISCOVER is propagated by the receiving motes.(c)Neighbors are found and propagated back to the milestones.(d)According to the goodness metric,the best routes to the neighbors become the edges.(e)Goal connects to the roadmap and the best routes through a navigation field on the roadmap are set.(f)An edge on danger disconnects then re-connects and a roadmap node migrates(dashed lines are previous edges,shaded areas are danger regions).A.Building Embedded RoadmapThe building process of embedded roadmap is similar to traditional PRMs[2].The roadmap nodes are now the milestone motes selected according to some criteria,e.g., probabilistically or based on mote capabilities.Once the milestone motes are selected then they are connected through message passing.In this process,an edge between two milestone represents the best sequence(according Eq.1)of motes to reach one milestone from the other.Node Generation.Each mote decides to host a roadmap node with a probability p.If they host a roadmap node, then they become milestone motes.Please note that it is also possible to utilize alternative decision criteria such as mote capabilities or sensor inputs.Node Connection.Thefirst step in node connection is to discover the closest milestone motes that are possibly out of each other’s communication range.This is done by sending N EIGHBOR-D ISCOVER messages to one-hop neigh-bors(Figure2(a)).A N EIGHBOR-D ISCOVER message has fourfields,[m s,I M o,l r,δr]i.e.,the one-hop neighbor that sent this message,the originator(the discovering milestone), the length of the route to originator,and the maximum danger level on the route.Since a mote m receives the N EIGHBOR-D ISCOVER only from its one-hop neighbors,and it knows their positions,the goodness of the route to I M o is goodness=c1(|m−m s|+l r)+c2max(δr,δm),whereδm is the danger level of mote m.Each mote on the network has a Vicinity table which contains the list of the milestone motes from which that mote received N EIGHBOR-D ISCOVER messages.The table also stores the goodness of the route and one-hop neighbor that sent the message.Upon receiving a new N EIGHBOR-D ISCOVER message,a mote checks its Vicinity table to see if the new route is better than any existing route to I M o(if there is one).If the old route was better,the message is discarded and nothing further is done.Otherwise,Vicinity table is updated according to N EIGHBOR-D ISCOVER message to represent a better route.Next,the mote checks the Vicinity table to see if other N EIGHBOR-D ISCOVER messages were received from dif-ferent milestone motes.If no message was received,then N EIGHBOR-D ISCOVER is propagated further after updat-ing thefields(Figure2(b)).If the mote has received a N EIGHBOR-D ISCOVER message from another mote I M n, both I M o and I M n needs to be informed about their neighborhood.This is achieved by sending N EIGHBOR-F OUND messages to both.This message hasfivefields, [m s,I M o,I M n,l n,δn],i.e.,sender of the message,the des-tination milestone(originator of discovery),the neighbor milestone,the length of route to the neighbor and maximum danger level on route the neighbor.Since the mote needs to inform both neighbors,it sends two N EIGHBOR-F OUND messages,one for each site.l n andδn of the messages are found from Vicinity table and the messages are sent to the one-hop neighbors stored in Vicinity(the best route).Upon receiving a N EIGHBOR-F OUND message,each mote checks its Vicinity table to see if there was a better route from I M n. If not,it adds the neighbor to its Vicinity table,updates m s, l n andδn and propagates the N EIGHBOR-F OUND message to the one-hop neighbor on the best route towards the originator. This process is repeated until N EIGHBOR-F OUND message is received by I M o(Figure2(c)).This milestone mote checks its Vicinity table to see if it knows a better route to neighbor I M n.If not it adds this route to the Vicinity table.Otherwise, N EIGHBOR-F OUND message is discarded.Once the neighboring milestones are discovered,each milestone mote creates an edge between itself and the lower-id neighbor milestones by sending C REATE-E DGE message in their directions.The direction is selected from Vicinity table entry.Each intermediate mote receiving this message recognizes itself as an edge-mote and propagates the message to the next mote in the direction of the destination milestone mote.Once C REATE-E DGE message is received by the destination milestone mote,an acknowledgment is sent back to the originator.At the end of this process,all milestone motes know their milestone neighbors on the roadmap and the weight(goodness)of the edge between them.Similarly, all of the edge motes are aware that they are part of the embedded roadmap.Figure2(d)shows an example of an embedded roadmap after the connections and Algorithms1 and2summarize these processes.Algorithm1Node Connection:Milestone Mote1:Broadcast N EIGHBOR-D ISCOVER message2:while not time-out do3:if N EIGHBOR-F OUND message is received then4:check Vicinity table for neighbor5:if Path to neighboring milestone is better than current route then6:Add neighboring milestone,direction to it and path goodness to Vicinity 7:end if8:end if9:end whileAlgorithm2Node Connection:Non-Milestone Mote1:while waiting for messages do2:if N EIGHBOR-D ISCOVER received then3:Compute goodness of route to originator4:if Previous route to originator in Vicinity is better then5:Go back to mesg.waiting state6:end if7:if Another milestone mote in Vicinity then8:Unicast N EIGHBOR-F OUND messages in direction of milestones9:Goto back to mesg.waiting state10:end if11:Update N EIGHBOR-D ISCOVER message and propagate to neighbors12:end if13:if N EIGHBOR-F OUND received then14:Compute goodness of route to neighbor15:if Previous route to neighbor in Vicinity is better then16:Go back to mesg.waiting state17:end if18:Update N EIGHBOR-F OUND message and unicast to neighbor in route to originator19:end if20:if E DGE-C REATE received then21:set state to Edge-Mote22:Update E DGE-C REATE message and unicast to neighbor in route to destina-tion milestone23:end if24:end whileB.Goal PotentialGoal motes represent the robot destinations.The decision to become a goal mote can be initiated by environmental factors or by a robot.In order to utilize the robustness provided by embedded roadmap functions,the goal mote becomes a milestone mote if it is not already one.If the goal is on an edge mote,the edge is broken.After the goal mote becomes a milestone,it connects to the nearby milestone motes.The connection is done through the same mechanisms used in roadmap connection phase(i.e.,Algorithms1and 2).The next step is generating the navigationfield on the roadmap,using a G OAL message originating from the goal mote.A G OAL message has fourfields[m s,G o,l g,δg],i.e., the sender of the message,goal id,length of the path to the goal and maximum danger level on the way to the goal. Once initialized by the goal mote,this message is forwarded to all motes on the roadmap,aggregating the information about best paths to the goal.Every mote m on the roadmapAlgorithm3Goal Dissemination:All Roadmap Motes1:if G OAL message is received then2:check Goals table for this goal3:if Incoming message is better than the one in the table then4:G=aggregated goal message with values for the path including this mote 5:Set the entry in the Goals table according to G6:Send G to other neighboring edge motes7:end if8:end ifAlgorithm4Maintenance:Milestone and Edge Motes1:δt=current temperature level2:for Each edge neighbor do3:ifδt=δhot then4:break the edge,send B REAK-E DGE5:if This is a milestone mote then6:Call milestone migration7:end if8:else9:δl=last temperature level sent to this neighbor10:ifδt=δl then11:send U PDATE-E DGE withδt12:end if13:end if14:end forAlgorithm5Milestone Migration1:Ask the one-hop neighbors for their temperature readings2:Wait until they answer or timeout ends3:Target=one-hop neighbor with the best temperature4:Send M IGRATE-M ILESTONE message to Target5:Cancel being milestone for this nodemaintains a Goal-Potentials table that has one entry per goal that keeps goodness of the path and its one-hop neighbor. The contents of the record is propagated to other nodes on changes,similar to N EIGHBOR-D ISCOVER aggregation,i.e., the outgoing G OAL message would contain the updated path length as l g+|m−m s|,the danger level as max(δg,δm)etc. This way,a distributed minimum spanning tree is maintained on the roadmap for each goal mote.Algorithm3summarizes the goal dissemination and Figure2(e)shows an example. Note that if multiple robots try to reach the same goal,the goal potential of that goal needs to be computed only once.C.Roadmap MaintenanceRoadmap Edge Maintenance.In order to direct the robots to the safe paths,the embedded roadmap always needs to be aware of goodness of the routes to the goal.To provide an up-to-date information of goodness,an edge mote on the roadmap sends U PDATE-T EMPERATURE messages to its edge neighbors whenever its danger level changes(i.e.,there is a significant change in the temperature).This message is propagated to the milestones at each end of the edge.Upon receiving this message a milestone updates its Vicinity and Goal-Potentials tables accordingly.If the new temperature is greater than∆hot,the edge is broken.After an edge is broken,the milestone mote with the higher id tries to reconnect the edge after t reconnect seconds.If a change in the edge(either goodness or topology)affects the best route,the milestone mote initiates the aggregation of G OAL messages to its neighbors to maintain the best paths to the goal.Algorithm4summarizes this process.Roadmap Node estone motes are the most important motes in this algorithm.The roadmap may become highly disconnected if they die or sense∆hot.Therefore it is important for the milestone motes to stay alive and be in low temperature areas.In time,milestone motes may inevitably get infire.This leads to broken edges and a possibly disconnected roadmap.To overcome this problem, we introduce maintenance of milestone motes by milestone migration.The purpose of milestone migration is to make milestone motes transfer the roadmap node to one of their neighboring motes.When the milestone mote senses∆hot,it asks its one-hop neighbors for their temperature readings to see which neighbor is the safest.Then,it sends a M IGRATE message to the safest neighbor including the current state of the milestone mote.It also sends B REAK-G OAL messages to its neighboring milestone motes to break the edges and connect to the new milestone mote.The edge connections to the new milestone mote are done similar to basic edge creation. Pseudo code for migration can be seen in Algorithm 5. Figure2(f)shows an example maintenance scenario. Robustness and Node Failure.If a mote on the roadmap dies before it informs other motes,the roadmap may become disconnected.In order to avoid such cases,a heart beat message could be sent over the roadmap motes to check their health.Instead of continuously checking the health of all the motes in the roadmap(which is a costly operation), we check the motes only when the robot is about to move on their edges.When a robot arrives to a milestone mote, the milestone sends a S ENTINEL message towards the goal. This message is propagated until it reaches the milestone at the other end of the edge.If any edge mote propagating this message to its one-hop neighbor could not get an acknowledgment,it becomes a milestone mote,breaks the edge and connects to the milestone motes in the vicinity. Goal-Potentials are updated accordingly.As an additional precaution,while following the roadmap,if a robot could not get an reply from the next mote on the path,the robot informs the last mote.The last mote then behaves as if S ENTINEL message failed,and updates the connections.D.NavigationReaching Roadmap.In order tofind the roadmap,the robot makes a local query to the sensor network with a F IND-R OADMAP message.The motes that receive this query forward it along the entries in their Vicinity table.A local query tree is formed as a result.When this tree hits a mote in the roadmap,a R OADMAP-F OUND message is sent to the robot along with the distance and temperature information of the path.The robot selects the best one among these messages and starts following it until it reaches the roadmap. Following Roadmap.Once the robot is on the roadmap,it sends F OLLOW-Q UERY messages and gets the goal informa-tion from its one hop neighbors using R OADMAP-F OLLOW messages.This is repeated until the robot reaches the goal. If the roadmap edge that the robot was following is broken, the robot sends a F IND-R OADMAP message to the network and tries to reach the roadmap again.If the robot discovers a static obstacle,an O BSTACLE-H IT message is sent to the current edge,which in turn breaks the edge and disables its recreation.If the robot senses a temperature level of∆hot, it returns back to the last mote on its path and informs the mote.The mote then breaks the edge and the robot is directed to an alternative path.VI.E XPERIMENTSIn our experiments we would like to answer following questions:(i)how successful an embedded roadmap is in。

铁路货运值班员工作流程

铁路货运值班员工作流程1.货运值班员在班前需查阅最新的运输商定的货运计划。

The freight duty officer needs to check the latestfreight plan set by the carrier before the shift.2.值班员需熟悉货物装卸操作规程和安全操作流程。

The duty officer needs to be familiar with the procedures for loading and unloading goods and the safety operation process.3.值班员需核实货物装载情况是否与运输单据一致。

The duty officer needs to verify whether the loading of goods is consistent with the transportation documents.4.值班员需协助调度员安排车辆和工人进行货物装卸操作。

The duty officer needs to assist the dispatcher in arranging vehicles and workers for the loading and unloading of goods.5.值班员需留意装卸作业现场的安全情况,及时采取应急措施。

The duty officer needs to pay attention to the safety situation of the loading and unloading site and take emergency measures in a timely manner.6.值班员需定期向上级汇报货运进展情况。

The duty officer needs to regularly report the progress of freight transportation to the superior.7.值班员需协调处理货物运输途中的异常情况。

资产管理制度英文

资产管理制度英文IntroductionAsset management is a crucial component of any organization's operations, as it plays a key role in ensuring the effective and efficient use of resources. An asset management system helps an organization to track, monitor, and optimize its assets, which can include physical assets such as equipment and machinery, as well as financial assets like investments and cash. By implementing a robust asset management system, organizations can improve their operational efficiency, reduce costs, and enhance decision-making capabilities.Purpose of Asset Management SystemThe primary purpose of an asset management system is to help organizations manage their assets effectively to achieve their strategic objectives. This includes:1. Tracking and Monitoring: An asset management system enables organizations to track and monitor the status, condition, and location of their assets in real-time. This information is crucial for making informed decisions about asset utilization, maintenance schedules, and replacement plans.2. Maintenance and Repair: By tracking asset performance and maintenance history, organizations can optimize maintenance schedules, reduce downtime, and extend the lifespan of their assets. This can help minimize repair costs and enhance operational efficiency.3. Compliance and Regulatory Requirements: An asset management system can help organizations ensure compliance with relevant regulations and standards, by providing accurate and up-to-date information about their assets. This can help organizations avoid penalties and legal issues.4. Financial Management: Asset management systems can provide organizations with insights into the financial performance of their assets, including depreciation, valuations, and profitability. This can help organizations make informed investment decisions and optimize asset utilization.Components of Asset Management SystemAn effective asset management system typically includes the following components:1. Asset Inventory: A comprehensive inventory of all assets owned by the organization, including physical assets, financial assets, and intangible assets such as intellectual property.2. Asset Tracking: Real-time tracking of asset location, status, and condition, using technologies such as RFID, barcoding, and GPS. This information is crucial for optimizing asset utilization and maintenance.3. Maintenance Management: Planning and scheduling of asset maintenance activities, including preventive maintenance, predictive maintenance, and corrective maintenance. This can help organizations reduce downtime, enhance asset performance, and extend asset lifespan.4. Depreciation and Valuation: Calculation of asset depreciation and valuation, based on factors such as asset lifespan, market value, and usage. This information is crucial for financial reporting and investment decisions.5. Compliance Management: Monitoring and ensuring compliance with relevant regulations, standards, and best practices, to avoid penalties and legal issues. This may include environmental regulations, safety standards, and industry-specific requirements.6. Reporting and Analytics: Generating reports and analytics on asset performance, utilization, costs, and ROI, to help organizations make informed decisions and optimize asset management strategies.Benefits of Asset Management SystemImplementing an asset management system can provide organizations with numerous benefits, including:1. Improved Operational Efficiency: By optimizing asset utilization, maintenance, and lifecycle management, organizations can enhance operational efficiency and reduce costs.2. Enhanced Decision-Making: Access to real-time data and insights about asset performance, maintenance, and financial metrics can help organizations make informed decisions and strategic plans.3. Reduced Downtime: By implementing preventive and predictive maintenance strategies, organizations can minimize unplanned downtime and extend asset lifespan.4. Cost Savings: By optimizing asset utilization, maintenance, and lifecycle management, organizations can reduce costs related to repair, replacement, and downtime.5. Regulatory Compliance: An asset management system can help organizations ensure compliance with relevant regulations, standards, and best practices, to avoid penalties and legal issues.ConclusionAn effective asset management system is crucial for helping organizations manage their assets effectively, achieve their strategic objectives, and enhance operational efficiency. By tracking, monitoring, and optimizing assets, organizations can reduce costs, improve decision-making capabilities, and ensure compliance with relevant regulations. Implementing a robust asset management system can provide organizations with numerous benefits, including improved operational efficiency, enhanced decision-making, reduceddowntime, cost savings, and regulatory compliance. Organizations that prioritize asset management are likely to achieve greater success and sustainability in the long run.。

土地征收补偿英语作文

土地征收补偿英语作文Title: Compensation for Land Requisition。

In contemporary society, the issue of land requisition and compensation has become increasingly significant as urbanization and infrastructural development projects continue to expand. This essay aims to delve into the intricacies of land requisition compensation, exploring its importance, challenges, and potential solutions.Firstly, it is crucial to acknowledge the importance of land requisition in facilitating economic development, urban expansion, and infrastructure construction. However, this process often disrupts the lives and livelihoods of those whose land is being acquired. Therefore, fair andjust compensation is imperative to mitigate the adverse impacts on affected individuals and communities.Fair compensation should encompass various factors, including the market value of the land, the potential lossof income or livelihood, relocation costs, and compensation for any damages incurred. Additionally, compensation should consider the long-term implications on the affected individuals, ensuring their financial stability and social well-being.One of the primary challenges in land requisition compensation is determining the fair market value of the land. This requires comprehensive assessments considering factors such as location, land quality, potential for development, and prevailing market prices. However, discrepancies often arise due to differing perceptions of value between landowners and government authorities, leading to disputes and grievances.Furthermore, the process of compensation distribution can be marred by inefficiencies, corruption, and bureaucratic hurdles. In many cases, affected individuals face delays in receiving compensation or are inadequately compensated due to administrative inefficiencies or malpractices. Such shortcomings undermine the credibility of the compensation process and exacerbate the grievancesof affected parties.To address these challenges, several measures can be implemented to ensure transparency, accountability, and fairness in land requisition compensation. Firstly, there needs to be greater transparency in the valuation process, with clear guidelines and mechanisms for dispute resolution. Utilizing independent third-party assessors can helpmitigate conflicts of interest and ensure impartiality in valuation.Moreover, streamlined administrative procedures and the use of technology can enhance the efficiency and transparency of compensation distribution. Digitalplatforms can be employed to facilitate the documentation, verification, and tracking of compensation payments, reducing opportunities for corruption and bureaucratic delays.Additionally, stakeholder participation andconsultation are essential to ensure that the compensation process is inclusive and addresses the needs and concernsof affected individuals and communities. By involving stakeholders in decision-making and negotiation processes, greater consensus and trust can be fostered, leading to more equitable outcomes.In conclusion, land requisition compensation is a complex and multifaceted issue that requires careful consideration and proactive measures to ensure fairness and justice for affected individuals and communities. By implementing transparent valuation mechanisms, improving administrative efficiency, and fostering stakeholder participation, we can enhance the credibility and effectiveness of the compensation process, ultimately contributing to sustainable development and social harmony.。

  1. 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
  2. 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
  3. 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。

View-based Location and Tracking of Body Parts for Visual Interaction Antonio Micilotta Richard BowdenCentre for Vision, Speech and Signal Processing, University of Surrey AbstractThe purpose of this research is to provide a coarse estimate of body pose. Our main interest is not in 3D biometric accuracy, but rather a sufficient discriminatory representation for visual interaction. The algorithm employs a general approximation to body shape, applied within a condensation [1] framework, while making use of an integral image to maintain near real-time performance.Furthermore, we seek to locate the head and hands in a hierarchical manner. Hand position is disambiguated using a prior on body configurations. This prior is further used to estimate the location of other key body components using statistical methods. We demonstrate the system tracking within a complex, cluttered environment.1. IntroductionThe final objective of this work is to create a visual human-computer interaction tool using an un-calibrated monocular camera system in a cluttered environment. Current progress locates and tracks key body parts of the upper torso in a hierarchical manner. Thereafter, pose and movement of these components will be used for gesture recognition purposes for visual interaction.2. MethodologyFollowing initial background segmentation, a torso shaped mask is applied to the image using a particle filter [2]. Knowledge of the position and scale of the torso is used to locate the position of the head, after which a statistical skin model can be determined on the fly. With the assumption that skin tone of the face and hands is similar, the same skin model is used to locate the hands. Using a pre-learned prior on likely body configurations, the left and right hand are disambiguated. As elbow positions are not easily distinguishable from other body parts, this prior is also used to predict likely positions of the elbows. These estimates are then used to aid the location of the elbows in the video sequence.2.1. Background SegmentationChroma-keying offers a simple solution to background segmentation in uncluttered, uniform backgrounds. Adaptive background segmentation algorithms prove to be essential in cluttered scenes where multiple individuals are to be isolated.2.2. Location of TorsoWith the user segmented from the background, detection and tracking of body parts can commence. A mask in the shape of a human torso (see Figure 1) has been designed based on the ratio of Da Vinci’s Virtuvian Man. Under a CONDENSATION framework, the best fit mask offers key body measurements such as height and arm length that play a crucial role in the tracking of the head and hands.Owing to the complete removal of the background, an integral image can also be used to maintain near real-time performance. Processing speed is greatly improved because the number of queries to be processed per frame is reduced by a factor of approximately 2500. A trade-off for this enhancement is that rotation of the torso cannot be determined.2.3. Tracking of Head and HandsThe information obtained in isolating the upper torso is then used to locate the position of the head and hands in a hierarchical manner. A skin model is built from the facial region using robust statistics, and is then used for further location and tracking of both the face and hands. Rotation of the head and hands is also taken into account as it may play a useful role in the development of gestures for human computer interaction.2.4. Disambiguating handsA prior of body configurations has been formed from a training set of actors with hand-labelled body part positions. Once tracking of the hands commences, this prior can be used to disambiguate the left hand from the right in the event that the hands cross over each other. The Mahalanobis metric is used to compare the body configurations of the incoming and prior data. Awkward poses, whereby arms are crossed over, yield a large Mahalanobis distance, thereby indicating that the pose is unnatural.Figure 1: Tracking of Key Body Parts Figure 2: Predicting Elbow Positions2.5. Estimation of Elbow PositionsThe inclusion of the elbows in a hierarchical manner may help to disambiguate the hands in situations where they occlude each other. Image cues for the detection of elbows are not apparent, and predictive methods need to be employed in order to offer a starting point with which to search the image space. Inverse kinematics proves cumbersome in a 2D application and multiple solutions are offered as the arm length ‘changes’ due to perspective. An exemplar approach that makes use of the prior, as mentioned in Section 2.4, proves to offer a relatively accurate starting point for each elbow. The hypotheses will however be limited to poses contained within the training set, and thus a full repertoire of training gestures would prove too costly for a real-time application. Statistical methods have therefore been investigated, whereby a statistical representation of the entire dataset can be pre-computed offline. With the aid of Principal Component Analysis, unknown elbow positions are inferred from the partial dataset obtained from the video data. The black markers of Figure 2 illustrate the locations of body parts that are tracked in the video sequence. The white markers represent the predicted positions of the elbows, as obtained via statistical analysis. Although not entirely accurate, these estimates do reduce the search space greatly.3. References[1] A. Blake and M. Isard. Active Contours. Springer Verlag, 1998.[2] J. Deutscher, A. Blake and I.Reid. Articulated Body Motion Capture by Annealed Particle Filtering. In Proceedings of Computer Vision and Pattern Recognition, volume 2, pages 2126-2133, Columbia, USA , 2000.。

相关文档
最新文档