{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XH7ETBW2Z3ZRNYI6LCEXGW62BA","short_pith_number":"pith:XH7ETBW2","schema_version":"1.0","canonical_sha256":"b9fe4986dacef316e11e5889735bda08398ab6de224ea9c8d84a7900aad48189","source":{"kind":"arxiv","id":"1905.03710","version":1},"attestation_state":"computed","paper":{"title":"Bilinear discriminant feature line analysis for image feature extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jeng-Shyang Pan, Jun-Bao Li, Lijun Yan, Linlin Tang, Xiaorui Zhu","submitted_at":"2019-05-03T04:54:43Z","abstract_excerpt":"A novel bilinear discriminant feature line analysis (BDFLA) is proposed for image feature extraction. The nearest feature line (NFL) is a powerful classifier. Some NFL-based subspace algorithms were introduced recently. In most of the classical NFL-based subspace learning approaches, the input samples are vectors. For image classification tasks, the image samples should be transformed to vectors first. This process induces a high computational complexity and may also lead to loss of the geometric feature of samples. The proposed BDFLA is a matrix-based algorithm. It aims to minimise the within"},"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":"1905.03710","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-03T04:54:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e3c2ac0ae1faf467de133631baad5841c4cea248e0a1b62138e9801318bbffab","abstract_canon_sha256":"3b93e2ef540f2a4596a19953eed57ba39ae220fc3f79548cd7b924fd901acab1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:36.899887Z","signature_b64":"JnPxC5Jtu3UdTnDqAeyYYNVmEN9PEFzRHKwpD+nK8vRXQmNjuy1kic7e0LtsKkXSk3raC2xDzyc7MXYYpasICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9fe4986dacef316e11e5889735bda08398ab6de224ea9c8d84a7900aad48189","last_reissued_at":"2026-05-17T23:46:36.899136Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:36.899136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bilinear discriminant feature line analysis for image feature extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Jeng-Shyang Pan, Jun-Bao Li, Lijun Yan, Linlin Tang, Xiaorui Zhu","submitted_at":"2019-05-03T04:54:43Z","abstract_excerpt":"A novel bilinear discriminant feature line analysis (BDFLA) is proposed for image feature extraction. The nearest feature line (NFL) is a powerful classifier. Some NFL-based subspace algorithms were introduced recently. In most of the classical NFL-based subspace learning approaches, the input samples are vectors. For image classification tasks, the image samples should be transformed to vectors first. This process induces a high computational complexity and may also lead to loss of the geometric feature of samples. The proposed BDFLA is a matrix-based algorithm. It aims to minimise the within"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03710","kind":"arxiv","version":1},"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":"1905.03710","created_at":"2026-05-17T23:46:36.899265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03710v1","created_at":"2026-05-17T23:46:36.899265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03710","created_at":"2026-05-17T23:46:36.899265+00:00"},{"alias_kind":"pith_short_12","alias_value":"XH7ETBW2Z3ZR","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XH7ETBW2Z3ZRNYI6","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XH7ETBW2","created_at":"2026-05-18T12:33:33.725879+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/XH7ETBW2Z3ZRNYI6LCEXGW62BA","json":"https://pith.science/pith/XH7ETBW2Z3ZRNYI6LCEXGW62BA.json","graph_json":"https://pith.science/api/pith-number/XH7ETBW2Z3ZRNYI6LCEXGW62BA/graph.json","events_json":"https://pith.science/api/pith-number/XH7ETBW2Z3ZRNYI6LCEXGW62BA/events.json","paper":"https://pith.science/paper/XH7ETBW2"},"agent_actions":{"view_html":"https://pith.science/pith/XH7ETBW2Z3ZRNYI6LCEXGW62BA","download_json":"https://pith.science/pith/XH7ETBW2Z3ZRNYI6LCEXGW62BA.json","view_paper":"https://pith.science/paper/XH7ETBW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03710&json=true","fetch_graph":"https://pith.science/api/pith-number/XH7ETBW2Z3ZRNYI6LCEXGW62BA/graph.json","fetch_events":"https://pith.science/api/pith-number/XH7ETBW2Z3ZRNYI6LCEXGW62BA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XH7ETBW2Z3ZRNYI6LCEXGW62BA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XH7ETBW2Z3ZRNYI6LCEXGW62BA/action/storage_attestation","attest_author":"https://pith.science/pith/XH7ETBW2Z3ZRNYI6LCEXGW62BA/action/author_attestation","sign_citation":"https://pith.science/pith/XH7ETBW2Z3ZRNYI6LCEXGW62BA/action/citation_signature","submit_replication":"https://pith.science/pith/XH7ETBW2Z3ZRNYI6LCEXGW62BA/action/replication_record"}},"created_at":"2026-05-17T23:46:36.899265+00:00","updated_at":"2026-05-17T23:46:36.899265+00:00"}