{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Z65OM52BC6CONBNCN3JG4RPG3Y","short_pith_number":"pith:Z65OM52B","schema_version":"1.0","canonical_sha256":"cfbae677411784e685a26ed26e45e6de3e80bba5f3096fda1c40526e7ecb68f5","source":{"kind":"arxiv","id":"1306.5390","version":2},"attestation_state":"computed","paper":{"title":"P-HGRMS: A Parallel Hypergraph Based Root Mean Square Algorithm for Image Denoising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DC","authors_text":"B. Rajesh Kanna, Saurabh Jha, Tejaswi Agarwal","submitted_at":"2013-06-23T09:36:08Z","abstract_excerpt":"This paper presents a parallel Salt and Pepper (SP) noise removal algorithm in a grey level digital image based on the Hypergraph Based Root Mean Square (HGRMS) approach. HGRMS is generic algorithm for identifying noisy pixels in any digital image using a two level hierarchical serial approach. However, for SP noise removal, we reduce this algorithm to a parallel model by introducing a cardinality matrix and an iteration factor, k, which helps us reduce the dependencies in the existing approach. We also observe that the performance of the serial implementation is better on smaller images, but "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1306.5390","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-06-23T09:36:08Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"712a84175f8ed08134cb97e4b08bd4afc7931c8049f2e5fbd10e3fe6b2bb7e7e","abstract_canon_sha256":"f9606587da41e1311cfda25ec765d684ba176233d82d99283b5b626ee0cdb929"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:19:34.480915Z","signature_b64":"GaVrBQ6G0md5LXcoBt60TvKSwx2WbjOxU2UZqeKrT+ghR/K77pxNfxPnIPvLvmeg/q4gX42BzDIJwoAK3q3GAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfbae677411784e685a26ed26e45e6de3e80bba5f3096fda1c40526e7ecb68f5","last_reissued_at":"2026-05-18T03:19:34.480552Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:19:34.480552Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"P-HGRMS: A Parallel Hypergraph Based Root Mean Square Algorithm for Image Denoising","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DC","authors_text":"B. Rajesh Kanna, Saurabh Jha, Tejaswi Agarwal","submitted_at":"2013-06-23T09:36:08Z","abstract_excerpt":"This paper presents a parallel Salt and Pepper (SP) noise removal algorithm in a grey level digital image based on the Hypergraph Based Root Mean Square (HGRMS) approach. HGRMS is generic algorithm for identifying noisy pixels in any digital image using a two level hierarchical serial approach. However, for SP noise removal, we reduce this algorithm to a parallel model by introducing a cardinality matrix and an iteration factor, k, which helps us reduce the dependencies in the existing approach. We also observe that the performance of the serial implementation is better on smaller images, but "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5390","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.5390","created_at":"2026-05-18T03:19:34.480607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5390v2","created_at":"2026-05-18T03:19:34.480607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5390","created_at":"2026-05-18T03:19:34.480607+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z65OM52BC6CO","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z65OM52BC6CONBNC","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z65OM52B","created_at":"2026-05-18T12:28:09.283467+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z65OM52BC6CONBNCN3JG4RPG3Y","json":"https://pith.science/pith/Z65OM52BC6CONBNCN3JG4RPG3Y.json","graph_json":"https://pith.science/api/pith-number/Z65OM52BC6CONBNCN3JG4RPG3Y/graph.json","events_json":"https://pith.science/api/pith-number/Z65OM52BC6CONBNCN3JG4RPG3Y/events.json","paper":"https://pith.science/paper/Z65OM52B"},"agent_actions":{"view_html":"https://pith.science/pith/Z65OM52BC6CONBNCN3JG4RPG3Y","download_json":"https://pith.science/pith/Z65OM52BC6CONBNCN3JG4RPG3Y.json","view_paper":"https://pith.science/paper/Z65OM52B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5390&json=true","fetch_graph":"https://pith.science/api/pith-number/Z65OM52BC6CONBNCN3JG4RPG3Y/graph.json","fetch_events":"https://pith.science/api/pith-number/Z65OM52BC6CONBNCN3JG4RPG3Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z65OM52BC6CONBNCN3JG4RPG3Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z65OM52BC6CONBNCN3JG4RPG3Y/action/storage_attestation","attest_author":"https://pith.science/pith/Z65OM52BC6CONBNCN3JG4RPG3Y/action/author_attestation","sign_citation":"https://pith.science/pith/Z65OM52BC6CONBNCN3JG4RPG3Y/action/citation_signature","submit_replication":"https://pith.science/pith/Z65OM52BC6CONBNCN3JG4RPG3Y/action/replication_record"}},"created_at":"2026-05-18T03:19:34.480607+00:00","updated_at":"2026-05-18T03:19:34.480607+00:00"}