Wireless multimedia sensor network video object detection method using dynamic clustering algorithm
Most of the traditional tracking algorithms use the Kalman filter to predict the tracking process. Although the tracking accuracy is relatively high, the calculation is large and the time complexity is high. Based on this research, this paper proposes a dynamic clustering target tracking algorithm f...
Gespeichert in:
Veröffentlicht in: | Multimedia tools and applications 2020-06, Vol.79 (23-24), p.16927-16940 |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 16940 |
---|---|
container_issue | 23-24 |
container_start_page | 16927 |
container_title | Multimedia tools and applications |
container_volume | 79 |
creator | Shao, Yilin |
description | Most of the traditional tracking algorithms use the Kalman filter to predict the tracking process. Although the tracking accuracy is relatively high, the calculation is large and the time complexity is high. Based on this research, this paper proposes a dynamic clustering target tracking algorithm for motion trends. The algorithm forms a dynamic cluster in the network, and the cluster head dynamically schedules the nodes to achieve collaborative tracking of the targets. The tracking strategy is mainly divided into two stages: First, the cluster head establishes a “neighbor node set” within its communication range, and selects the neighbor node in the “neighbor node set” according to the distance between the node and the target to construct the “intra-cluster member set” to perform the target on the target. Tracking; as the target moves continuously, the cluster head updates the members in the cluster at regular intervals, removes the nodes that have lost the target monitoring from the cluster, and adds the new nodes to the cluster; secondly, elects a new cluster head; if current When the cluster head is no longer suitable to continue to serve as the cluster head, the current cluster head selects the node in the “intra-cluster member set” as the new cluster head of the next work cycle; according to the moving direction of the target, selects the node with the best moving tendency of the target For the new cluster head, this allows the new cluster head to have a longer duty cycle and avoid frequent replacement of the cluster head; the new cluster head continues to set up the dynamic cluster to track the target until the target moves out of the monitoring area. The simulation results show that the proposed algorithm is more efficient than the traditional target tracking method. |
doi_str_mv | 10.1007/s11042-019-7474-y |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2191697237</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2191697237</sourcerecordid><originalsourceid>FETCH-LOGICAL-c316t-23b3ba3e7e4dea2356bb9e8168af6dcca09352465b4fefe1bfdfbca2905645e73</originalsourceid><addsrcrecordid>eNp1kE1LxDAQhoMouK7-AG8Bz9V8tMn2KItfIHhRPIZ8THezts2apMr-e1sqePI0w_C-78w8CF1Sck0JkTeJUlKygtC6kKUsi8MRWtBK8kJKRo_Hnq9IIStCT9FZSjtCqKhYuUD23UdoISXcDW32HTivcYI-hYh7yN8hfuAv7yDgYHZgM3aQx-JDjzvI2-DwkHy_we7Q685bbNshZYjTSLebEH3edufopNFtgovfukRv93ev68fi-eXhaX37XFhORS4YN9xoDhJKB5rxShhTw4qKlW6Es1aTmo83i8qUDTRATeMaYzWrSSXKCiRfoqs5dx_D5wApq10YYj-uVIzWVNSS8UlFZ5WNIaUIjdpH3-l4UJSoiaWaWaqRpZpYqsPoYbMn7afXIP4l_2_6AevkerE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2191697237</pqid></control><display><type>article</type><title>Wireless multimedia sensor network video object detection method using dynamic clustering algorithm</title><source>SpringerNature Journals</source><creator>Shao, Yilin</creator><creatorcontrib>Shao, Yilin</creatorcontrib><description>Most of the traditional tracking algorithms use the Kalman filter to predict the tracking process. Although the tracking accuracy is relatively high, the calculation is large and the time complexity is high. Based on this research, this paper proposes a dynamic clustering target tracking algorithm for motion trends. The algorithm forms a dynamic cluster in the network, and the cluster head dynamically schedules the nodes to achieve collaborative tracking of the targets. The tracking strategy is mainly divided into two stages: First, the cluster head establishes a “neighbor node set” within its communication range, and selects the neighbor node in the “neighbor node set” according to the distance between the node and the target to construct the “intra-cluster member set” to perform the target on the target. Tracking; as the target moves continuously, the cluster head updates the members in the cluster at regular intervals, removes the nodes that have lost the target monitoring from the cluster, and adds the new nodes to the cluster; secondly, elects a new cluster head; if current When the cluster head is no longer suitable to continue to serve as the cluster head, the current cluster head selects the node in the “intra-cluster member set” as the new cluster head of the next work cycle; according to the moving direction of the target, selects the node with the best moving tendency of the target For the new cluster head, this allows the new cluster head to have a longer duty cycle and avoid frequent replacement of the cluster head; the new cluster head continues to set up the dynamic cluster to track the target until the target moves out of the monitoring area. The simulation results show that the proposed algorithm is more efficient than the traditional target tracking method.</description><identifier>ISSN: 1380-7501</identifier><identifier>EISSN: 1573-7721</identifier><identifier>DOI: 10.1007/s11042-019-7474-y</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Clustering ; Computer Communication Networks ; Computer Science ; Computer simulation ; Data Structures and Information Theory ; Kalman filters ; Monitoring ; Multimedia ; Multimedia Information Systems ; Nodes ; Object recognition ; Schedules ; Special Purpose and Application-Based Systems ; Tracking ; Wireless sensor networks</subject><ispartof>Multimedia tools and applications, 2020-06, Vol.79 (23-24), p.16927-16940</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2019</rights><rights>Springer Science+Business Media, LLC, part of Springer Nature 2019.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c316t-23b3ba3e7e4dea2356bb9e8168af6dcca09352465b4fefe1bfdfbca2905645e73</citedby><cites>FETCH-LOGICAL-c316t-23b3ba3e7e4dea2356bb9e8168af6dcca09352465b4fefe1bfdfbca2905645e73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11042-019-7474-y$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11042-019-7474-y$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>315,781,785,27926,27927,41490,42559,51321</link.rule.ids></links><search><creatorcontrib>Shao, Yilin</creatorcontrib><title>Wireless multimedia sensor network video object detection method using dynamic clustering algorithm</title><title>Multimedia tools and applications</title><addtitle>Multimed Tools Appl</addtitle><description>Most of the traditional tracking algorithms use the Kalman filter to predict the tracking process. Although the tracking accuracy is relatively high, the calculation is large and the time complexity is high. Based on this research, this paper proposes a dynamic clustering target tracking algorithm for motion trends. The algorithm forms a dynamic cluster in the network, and the cluster head dynamically schedules the nodes to achieve collaborative tracking of the targets. The tracking strategy is mainly divided into two stages: First, the cluster head establishes a “neighbor node set” within its communication range, and selects the neighbor node in the “neighbor node set” according to the distance between the node and the target to construct the “intra-cluster member set” to perform the target on the target. Tracking; as the target moves continuously, the cluster head updates the members in the cluster at regular intervals, removes the nodes that have lost the target monitoring from the cluster, and adds the new nodes to the cluster; secondly, elects a new cluster head; if current When the cluster head is no longer suitable to continue to serve as the cluster head, the current cluster head selects the node in the “intra-cluster member set” as the new cluster head of the next work cycle; according to the moving direction of the target, selects the node with the best moving tendency of the target For the new cluster head, this allows the new cluster head to have a longer duty cycle and avoid frequent replacement of the cluster head; the new cluster head continues to set up the dynamic cluster to track the target until the target moves out of the monitoring area. The simulation results show that the proposed algorithm is more efficient than the traditional target tracking method.</description><subject>Algorithms</subject><subject>Clustering</subject><subject>Computer Communication Networks</subject><subject>Computer Science</subject><subject>Computer simulation</subject><subject>Data Structures and Information Theory</subject><subject>Kalman filters</subject><subject>Monitoring</subject><subject>Multimedia</subject><subject>Multimedia Information Systems</subject><subject>Nodes</subject><subject>Object recognition</subject><subject>Schedules</subject><subject>Special Purpose and Application-Based Systems</subject><subject>Tracking</subject><subject>Wireless sensor networks</subject><issn>1380-7501</issn><issn>1573-7721</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNp1kE1LxDAQhoMouK7-AG8Bz9V8tMn2KItfIHhRPIZ8THezts2apMr-e1sqePI0w_C-78w8CF1Sck0JkTeJUlKygtC6kKUsi8MRWtBK8kJKRo_Hnq9IIStCT9FZSjtCqKhYuUD23UdoISXcDW32HTivcYI-hYh7yN8hfuAv7yDgYHZgM3aQx-JDjzvI2-DwkHy_we7Q685bbNshZYjTSLebEH3edufopNFtgovfukRv93ev68fi-eXhaX37XFhORS4YN9xoDhJKB5rxShhTw4qKlW6Es1aTmo83i8qUDTRATeMaYzWrSSXKCiRfoqs5dx_D5wApq10YYj-uVIzWVNSS8UlFZ5WNIaUIjdpH3-l4UJSoiaWaWaqRpZpYqsPoYbMn7afXIP4l_2_6AevkerE</recordid><startdate>20200601</startdate><enddate>20200601</enddate><creator>Shao, Yilin</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20200601</creationdate><title>Wireless multimedia sensor network video object detection method using dynamic clustering algorithm</title><author>Shao, Yilin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c316t-23b3ba3e7e4dea2356bb9e8168af6dcca09352465b4fefe1bfdfbca2905645e73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Clustering</topic><topic>Computer Communication Networks</topic><topic>Computer Science</topic><topic>Computer simulation</topic><topic>Data Structures and Information Theory</topic><topic>Kalman filters</topic><topic>Monitoring</topic><topic>Multimedia</topic><topic>Multimedia Information Systems</topic><topic>Nodes</topic><topic>Object recognition</topic><topic>Schedules</topic><topic>Special Purpose and Application-Based Systems</topic><topic>Tracking</topic><topic>Wireless sensor networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Shao, Yilin</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Research Library</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Multimedia tools and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Shao, Yilin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Wireless multimedia sensor network video object detection method using dynamic clustering algorithm</atitle><jtitle>Multimedia tools and applications</jtitle><stitle>Multimed Tools Appl</stitle><date>2020-06-01</date><risdate>2020</risdate><volume>79</volume><issue>23-24</issue><spage>16927</spage><epage>16940</epage><pages>16927-16940</pages><issn>1380-7501</issn><eissn>1573-7721</eissn><abstract>Most of the traditional tracking algorithms use the Kalman filter to predict the tracking process. Although the tracking accuracy is relatively high, the calculation is large and the time complexity is high. Based on this research, this paper proposes a dynamic clustering target tracking algorithm for motion trends. The algorithm forms a dynamic cluster in the network, and the cluster head dynamically schedules the nodes to achieve collaborative tracking of the targets. The tracking strategy is mainly divided into two stages: First, the cluster head establishes a “neighbor node set” within its communication range, and selects the neighbor node in the “neighbor node set” according to the distance between the node and the target to construct the “intra-cluster member set” to perform the target on the target. Tracking; as the target moves continuously, the cluster head updates the members in the cluster at regular intervals, removes the nodes that have lost the target monitoring from the cluster, and adds the new nodes to the cluster; secondly, elects a new cluster head; if current When the cluster head is no longer suitable to continue to serve as the cluster head, the current cluster head selects the node in the “intra-cluster member set” as the new cluster head of the next work cycle; according to the moving direction of the target, selects the node with the best moving tendency of the target For the new cluster head, this allows the new cluster head to have a longer duty cycle and avoid frequent replacement of the cluster head; the new cluster head continues to set up the dynamic cluster to track the target until the target moves out of the monitoring area. The simulation results show that the proposed algorithm is more efficient than the traditional target tracking method.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11042-019-7474-y</doi><tpages>14</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1380-7501 |
ispartof | Multimedia tools and applications, 2020-06, Vol.79 (23-24), p.16927-16940 |
issn | 1380-7501 1573-7721 |
language | eng |
recordid | cdi_proquest_journals_2191697237 |
source | SpringerNature Journals |
subjects | Algorithms Clustering Computer Communication Networks Computer Science Computer simulation Data Structures and Information Theory Kalman filters Monitoring Multimedia Multimedia Information Systems Nodes Object recognition Schedules Special Purpose and Application-Based Systems Tracking Wireless sensor networks |
title | Wireless multimedia sensor network video object detection method using dynamic clustering algorithm |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-18T04%3A01%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Wireless%20multimedia%20sensor%20network%20video%20object%20detection%20method%20using%20dynamic%20clustering%20algorithm&rft.jtitle=Multimedia%20tools%20and%20applications&rft.au=Shao,%20Yilin&rft.date=2020-06-01&rft.volume=79&rft.issue=23-24&rft.spage=16927&rft.epage=16940&rft.pages=16927-16940&rft.issn=1380-7501&rft.eissn=1573-7721&rft_id=info:doi/10.1007/s11042-019-7474-y&rft_dat=%3Cproquest_cross%3E2191697237%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2191697237&rft_id=info:pmid/&rfr_iscdi=true |