Patch Priority based Region Filling
Region filling is the way to fill in the missing region based on the information available from remaining part of the image. The occluded area must be rejuvenated in a visibly persuasive style is the main goal. This paper proposes a methodology for automating patch priority based region filling proc...
Gespeichert in:
| Veröffentlicht in: | International journal of computer applications 2015-01, Vol.124 (12), p.6-10 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 10 |
|---|---|
| container_issue | 12 |
| container_start_page | 6 |
| container_title | International journal of computer applications |
| container_volume | 124 |
| creator | Khan, Darakhshan R Patankar, Archana B |
| description | Region filling is the way to fill in the missing region based on the information available from remaining part of the image. The occluded area must be rejuvenated in a visibly persuasive style is the main goal. This paper proposes a methodology for automating patch priority based region filling process. First, patch sizes are decided based on smallest texture of the image. Region filling algorithms fills in the missing region to create numerous region filled image. Finally, single region filled image is created by amalgamating images. This arrangement will have an edge over the other region filling algorithms such as patch size will be based on the input image which barbarizes the process of region filling and to deal with sensitivity in region filling, algorithm different parameter settings are used. |
| doi_str_mv | 10.5120/ijca2015905680 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1753536749</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1753536749</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1400-799ebe444e7925b30927acf3ca5ac8d4e3027ba46a99e7559a8e347d9f75d9cf3</originalsourceid><addsrcrecordid>eNpd0E1LAzEQBuAgCpbaq-eFXrxszddskqMUa4WCRfQcstlszbLd1KR76L83Ug_qHGbm8DAML0K3BC-AUHzvO2soJqAwVBJfoAlWAkoppbj8tV-jWUodzsUUrRSfoPnWHO1HsY0-RH88FbVJrile3c6HoVj5vvfD7gZdtaZPbvYzp-h99fi2XJebl6fn5cOmtIRjXAqlXO04504oCjXDigpjW2YNGCsb7himoja8MhkKAGWkY1w0qhXQqAyn6O589xDD5-jSUe99sq7vzeDCmDQRwIBVgqtM5_9oF8Y45O-yIpxB7iSrxVnZGFKKrtWH6PcmnjTB-js2_Tc29gXgX111</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1714351711</pqid></control><display><type>article</type><title>Patch Priority based Region Filling</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Khan, Darakhshan R ; Patankar, Archana B</creator><creatorcontrib>Khan, Darakhshan R ; Patankar, Archana B</creatorcontrib><description>Region filling is the way to fill in the missing region based on the information available from remaining part of the image. The occluded area must be rejuvenated in a visibly persuasive style is the main goal. This paper proposes a methodology for automating patch priority based region filling process. First, patch sizes are decided based on smallest texture of the image. Region filling algorithms fills in the missing region to create numerous region filled image. Finally, single region filled image is created by amalgamating images. This arrangement will have an edge over the other region filling algorithms such as patch size will be based on the input image which barbarizes the process of region filling and to deal with sensitivity in region filling, algorithm different parameter settings are used.</description><identifier>ISSN: 0975-8887</identifier><identifier>EISSN: 0975-8887</identifier><identifier>DOI: 10.5120/ijca2015905680</identifier><language>eng</language><publisher>New York: Foundation of Computer Science</publisher><subject>Algorithms ; Amalgamation ; Methodology ; Priorities ; Surface layer ; Texture</subject><ispartof>International journal of computer applications, 2015-01, Vol.124 (12), p.6-10</ispartof><rights>Copyright Foundation of Computer Science 2015</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Khan, Darakhshan R</creatorcontrib><creatorcontrib>Patankar, Archana B</creatorcontrib><title>Patch Priority based Region Filling</title><title>International journal of computer applications</title><description>Region filling is the way to fill in the missing region based on the information available from remaining part of the image. The occluded area must be rejuvenated in a visibly persuasive style is the main goal. This paper proposes a methodology for automating patch priority based region filling process. First, patch sizes are decided based on smallest texture of the image. Region filling algorithms fills in the missing region to create numerous region filled image. Finally, single region filled image is created by amalgamating images. This arrangement will have an edge over the other region filling algorithms such as patch size will be based on the input image which barbarizes the process of region filling and to deal with sensitivity in region filling, algorithm different parameter settings are used.</description><subject>Algorithms</subject><subject>Amalgamation</subject><subject>Methodology</subject><subject>Priorities</subject><subject>Surface layer</subject><subject>Texture</subject><issn>0975-8887</issn><issn>0975-8887</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNpd0E1LAzEQBuAgCpbaq-eFXrxszddskqMUa4WCRfQcstlszbLd1KR76L83Ug_qHGbm8DAML0K3BC-AUHzvO2soJqAwVBJfoAlWAkoppbj8tV-jWUodzsUUrRSfoPnWHO1HsY0-RH88FbVJrile3c6HoVj5vvfD7gZdtaZPbvYzp-h99fi2XJebl6fn5cOmtIRjXAqlXO04504oCjXDigpjW2YNGCsb7himoja8MhkKAGWkY1w0qhXQqAyn6O589xDD5-jSUe99sq7vzeDCmDQRwIBVgqtM5_9oF8Y45O-yIpxB7iSrxVnZGFKKrtWH6PcmnjTB-js2_Tc29gXgX111</recordid><startdate>20150101</startdate><enddate>20150101</enddate><creator>Khan, Darakhshan R</creator><creator>Patankar, Archana B</creator><general>Foundation of Computer Science</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20150101</creationdate><title>Patch Priority based Region Filling</title><author>Khan, Darakhshan R ; Patankar, Archana B</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1400-799ebe444e7925b30927acf3ca5ac8d4e3027ba46a99e7559a8e347d9f75d9cf3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Amalgamation</topic><topic>Methodology</topic><topic>Priorities</topic><topic>Surface layer</topic><topic>Texture</topic><toplevel>online_resources</toplevel><creatorcontrib>Khan, Darakhshan R</creatorcontrib><creatorcontrib>Patankar, Archana B</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of computer applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Khan, Darakhshan R</au><au>Patankar, Archana B</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Patch Priority based Region Filling</atitle><jtitle>International journal of computer applications</jtitle><date>2015-01-01</date><risdate>2015</risdate><volume>124</volume><issue>12</issue><spage>6</spage><epage>10</epage><pages>6-10</pages><issn>0975-8887</issn><eissn>0975-8887</eissn><abstract>Region filling is the way to fill in the missing region based on the information available from remaining part of the image. The occluded area must be rejuvenated in a visibly persuasive style is the main goal. This paper proposes a methodology for automating patch priority based region filling process. First, patch sizes are decided based on smallest texture of the image. Region filling algorithms fills in the missing region to create numerous region filled image. Finally, single region filled image is created by amalgamating images. This arrangement will have an edge over the other region filling algorithms such as patch size will be based on the input image which barbarizes the process of region filling and to deal with sensitivity in region filling, algorithm different parameter settings are used.</abstract><cop>New York</cop><pub>Foundation of Computer Science</pub><doi>10.5120/ijca2015905680</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0975-8887 |
| ispartof | International journal of computer applications, 2015-01, Vol.124 (12), p.6-10 |
| issn | 0975-8887 0975-8887 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1753536749 |
| source | EZB-FREE-00999 freely available EZB journals |
| subjects | Algorithms Amalgamation Methodology Priorities Surface layer Texture |
| title | Patch Priority based Region Filling |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T09%3A12%3A57IST&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=Patch%20Priority%20based%20Region%20Filling&rft.jtitle=International%20journal%20of%20computer%20applications&rft.au=Khan,%20Darakhshan%20R&rft.date=2015-01-01&rft.volume=124&rft.issue=12&rft.spage=6&rft.epage=10&rft.pages=6-10&rft.issn=0975-8887&rft.eissn=0975-8887&rft_id=info:doi/10.5120/ijca2015905680&rft_dat=%3Cproquest_cross%3E1753536749%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=1714351711&rft_id=info:pmid/&rfr_iscdi=true |